Operating Systems Questions:

1. Explain the concept of Reentrancy. 2. Explain Belady's Anomaly 3. What is a binary semaphore? What is its use? 4. What is thrashing? 5. List the Coffman's conditions that lead to a deadlock. 6. What are short-, long- and medium-term scheduling? 7. What are turnaround time and response time? 8. What are the typical elements of a process image? 9. What is the Translation Lookaside Buffer (TLB)? 10.What is the resident set and working set of a process? 11.When is a system in safe state? 12.What is cycle stealing? 13.What is meant by arm-stickiness? 14.What are the stipulations of C2 level security? 15.What is busy waiting? 16.Explain the popular multiprocessor thread-scheduling strategies 17.When does the condition 'rendezvous' arise? 18.What is a trap and trapdoor? 19.What are local and global page replacements? 20.Define latency, transfer and seek time with respect to disk I/O 21.What is the Open Brand? 22.What is time-stamping? 23.How are the wait/signal operations for monitor different from those for semaphores? 24.In the context of memory management, what are placement and replacement algorithms? 25.In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking? 26.What are demand- and pre-paging? 27.Paging a memory management function, while multiprogramming a processor management function, are the two interdependent? 28.What is page cannibalizing? 29.What has triggered the need for multitasking in PCs? 30.What are the four layers that Windows NT have in order to achieve independence? 31.What is SMP? 32.What are the key object oriented concepts used by Windows NT?

T&P, SASTRA-SRC

33.Is Windows NT a full blown object oriented operating system? Give reasons. 34.What is a drawback of MVT? 35.What is process spawning? 36.How many jobs can be run concurrently on MVT? 37.List out some reasons for process termination. 38.What are the reasons for process suspension? 39.What is process migration? 40.What is mutant? 41.What is an idle thread? 42.What is FtDisk? 43.What are the possible threads a thread can have? 44.What are rings in Windows NT? 45.What is Executive in Windows NT? 46.What are the sub-components of I/O manager in Windows NT? 47.What are DDks? Name an operating system that includes this feature. 48.What level of security does Windows NT meets? 49.What are the basic functions of an operating system? 50.Why paging is used? 51.While running DOS on a PC, which command would be used to duplicate the entire diskette? 52.What resources are used when a thread created? How do they differ from those when a process is created? 53.What is virtual memory? 54.What is Throughput, Turnaround time, waiting time and Response time? 55.What is the state of the processor, when a process is waiting for some event to occur? 56.What is the important aspect of a real-time system or Mission Critical Systems? 57.What is the difference between Hard and Soft real-time systems? 58.What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem? 59.What is multi tasking, multi programming, multi threading? - Multi programming? 60.What is hard disk and what is its purpose? 61.What is fragmentation? Different types of fragmentation? 62.What is DRAM? In which form does it store data? 63.What is Dispatcher?
2 T&P, SASTRA-SRC

64.What is CPU Scheduler? 65.What is Context Switch? 66.What is cache memory? 67.What is a Safe State and what is its use in deadlock avoidance? 68.What is a Real-Time System? 69. 70.State and explain about what an operating system is? 71.Explain about what a signal is? 72.What design and management issues are raised by the existence of concurrency? 73.What are the contexts in which concurrency may occur? 74.What is a data register and address register? 75.What are server operating systems? 76.Describe system calls for file management? 77.Describe about MULTICS? 78.Describe about threads? 79.Describe the mechanism of upcall? 80.Give an example of page replacement in the areas of computer design? 81.Describe about preemptive scheduling algorithm? 82.Give a case situation where a scheduling is needed? 83.Describe about checkpointing? 84.Describe the two phases of two-phase locking? 85.Explain about deadlocks in operating systems? 86.Explain about the paging systems? 87.Whats OPERATING SYSTEM? 88.What are OPERATING SYSTEM TYPES 89.What is Multi-user 90.Define Multiprocessing 91.Define Multitasking 92.Define Multithreading 93.What are the basic functions of an operating system? 94.Why paging is used? 95.What resources are used when a thread created? How do they differ from those when a process is created? 96.What is virtual memory? 97.What is Throughput, Turnaround time, waiting time and Response time? 98.What is the state of the processor, when a process is waiting for some event to occur?
3 T&P, SASTRA-SRC

99.What is the important aspect of a real-time system or Mission Critical Systems? 100. Why is the Open Brand valuable? 101. What is OS 9? 102. What is OS-9000? 103. What is DAVID? 104. What machines run OS-9? 105. What software is available for OS-9? 106. Where can I get OS-9? 107. What development tools are available for OS-9? 108. Does OS-9 have TCP/IP support? 109. Does OS-9 properly handle Y2K (Year 2000)? 110. What communications software is available? 111. Is GCC available for OS-9? 112. What graphics interfaces are available? 113. Where can I obtain public domain software for OS-9? 114. What is the TOP package? 115. Are there alternative shells for OS-9? 116. Can one read/write MS-DOS format disks under OS-9? 117. Can one read/write OS-9 format disks on a PC? 118. Where can I get online information about OS-9? 119. What about UUCP and news? 120. Where do I get OS-9/68000 for the Commodore Amiga? 121. What is a Real Time system? 122. Does OS-9 support multiple threads within a program? 123. What is mutex? 124. What is the difference between a thread and a process? 125. What is Semaphore? 126. Define and Explain COM? 127. A process may be in anyone of the following states 128. What systems are registered UNIX systems? 129. What is the difference between the XPG4 and the UNIX brand? 130. What is the difference between Spec 1170 and the Single UNIX Specification? 131. Is the Single UNIX Specification available on the world wide web? 132. What is the status of the UNIX Brand transfer? 133. What types of product can bear the UNIX Brand? 134. What is the difference between UNIX 93 , UNIX 95, UNIX 98 and UNIX 03? 135. What is a "Unix-like" operating system?
4 T&P, SASTRA-SRC

136. What are the requirements for the UNIX 95, UNIX 98 and UNIX 03 brands? 137. Does The Open Group sell UNIX systems source code? 138. Does the sale of Novell's UNIX systems business to SCO mean that The Open Group is no longer involved? 139. Some vendors say that they already have a licence for the UNIX trade mark from Novell or USL, is this true? 140. If a vendor licenses source code from SCO, why do they need a TMLA from The Open Group? 141. Can software carry the brand without hardware? 142. What is the UNIX trade mark fee structure? 143. Why do we need XPG4 Base when we have the UNIX profile definition? 144. Can all my products use the UNIX trade mark? 145. What test suites do I need for UNIX system certification? 146. How will customers know UNIX Branded products from older UNIX systems? 147. What are the usage guidelines for the UNIX trade mark? 148. Does the UNIX brand replace the XPG4 Base brand? 149. Why is this the Open Brand so important? 150. How does the Common Desktop Environment( CDE ) relate to UNIX systems? 151. Will the UNIX Brand criteria allow Microsoft to brand NT or others to brand proprietary environments? 152. Some trade mark attributions still say Novell (or even AT&T or Bell Labs), which is correct? 153. What are the test suites associated with the Open Brand? 154. What about POSIX conformance? Many vendors claim it, are there tests? 155. What about the Internet? Is the Open Brand relevant to the Internet? 156. What about the Year 2000? 157. What is in Version 3 of the Single UNIX Specification? 158. ___runs on computer hardware and serve as platform for other softwares to run on a) Operating System b)Application Software c) System Software d) All 159. ___ is the layer of a computer system between the hardware and the user program
5 T&P, SASTRA-SRC

a) Operating environment b)Operating system c) System environment d)None 160. The primary purpose of an operating system is ____ a) To make the most efficient use of the computer hardware b) To allow people to use the computer c) To keep systems programmers employed d) To make computers easier to use 161. ____ transforms one interface into another interface a) Program b)Software c) Data d)None 162. _____ system is built directly on the hardware a) Environment b) System c) Operating d) None 163. Multiprogramming systems are a) Are easier to develop than single programming systems b) Execute each job faster c) Execute more jobs in the same time period d) Are used only one large mainframe computers. 164. _______ is the first program run on a computer when the computer boots up a) System software b) Operating system c) System operations d)None 165. ________ interface consists of things like program counter, registers, interrupts and terminals a) Hardware b) Software c) Data d) None 166. ______ shares characteristics with both hardware and software a) Operating system b) Software c) Data d) None 167. ____ is used in operating system to separate mechanism from policy a) Single level implementation b) Two level implementation c) Multi level implementation d) None 168. The operating system creates _____ from the physical computer a) Virtual space b) Virtual computers c) Virtual device d) None
6 T&P, SASTRA-SRC

169. Swapping a) Works best with may many small partitions b) Allows many programs to use memory simultaneously c) Allows each program in turn to use the memory d) Does not work with overlaying 170. Which of the following Operating systems does not implement multitasking truly a) Windows 98 b) Windows NT c) Windows XP d) MS DOS 171. When a computer is first turned on or restarted, a special type of absolute loader called ____ is executed a) Compile and Go loader b) Boot loader c) Bootstrap loader d) Relating loader 172. Poor response times are usually caused by a) Process busy b) High I/O rates c) High paging rates d) Any of the above 173. Which of the following program is not a utility? a) Debugger b) Editor c) Spooler d) All of the above 174. A co-processor a) Is relatively easy to support in software b) Causes all processors to function equally c) Works with any application d) Is quite common in modern computers 175. Which of the following Operating systems do you choose to implement a Client-Server network a) MS DOS b) Windows 95 c) Windows 98 d) Windows 2000 176. Page stealing a) Is a sign of an efficient system b) Is taking page frames from other working sets c) Should be the tuning goal d) Is taking larger disk spaces for pages paged out 177. The operating system manages a) Memory b) Processes c) Disks and I/O devices d) All
7 T&P, SASTRA-SRC

178. In a computer _____ is capable to store single binary bit. a) Capacitor b) Flip flop c) Register d) Inductor 179. A set of flip flops integrated together is called ____ a) Counter b) Adder c) Register d) None of the above 180. Which of the following are the best units of data on an external storage device ? a)Bits b) Bytes c) Hertz d) Clock cycles 181. Seperate Read/Write heads are required in which of these memory access schemes. a) Random Access b) Sequential Access c) Direct Access d) None of these 182. A register organized to allow to move left or right operations is called a ____ a) Counter b) Loader c) Adder d) Shift register 183. Which of the following are the cheapest memory devices in terms of Cost / Bit? a) Semiconductor Memories b) Magnetic Disks c) Magnetic Tapes d) Compact Disks 184. Which of the following have the fastest access time? a) Semiconductor Memories b) Magnetic Disks c) Magnetic Tapes d) Compact Disks 185. ____is a semi conductor memory. a) Dynamic b) Static c) Bubble d) Both a & b 186. Which of the following is a read only memory storage device. a) Floppy disk b) Hard disk c) CDROM d) None of these 187. DMA stands for ____ a) Direct Memory Access c)Direct Module Access b)Distinct Memory Access d)Direct Memory Allocation

T&P, SASTRA-SRC

188. Which of the following is not a database application? a) dBase b) Edit c) FoxPro d) Access 189. Which of the following is a database management tool developed by Microsoft? a) dBase b) Access c) Personal Oracle d) Sybase 190. HSAM stands for ____ a) Hierarchic Sequential Access Method b) Hierarchic Standard Access Method c) Hierarchic Sequential and Method d) Hierarchic Standard and Method 191. Threats to data security may be ____ threats to the database. a) Direct b) Indirect c) Both d) None of these 193. Which of the following is not a logical database structure? a) Chain b) Network c) Tree d) Relational 194. An organized collection of logically related data is known as a) Data b) Meta data c) Database d) Data versus Information 195. The processing of an application between a client and a ____ processor. a) Front end b) Back end c) Both d) None of these 196. The____ is not formal enough to be implemented directly in a programming language. a) Analysis model b) E R model c) Object oriented model d) Object oriented data mode 197. Size of a database are usually measured in terms of a) Terabytes b) Megabytes c) Data bytes d)Giga bytes 198. In databases, Locking level is also called as a) Gramulority b) S lock c) X lock d) Dead lock 199. Which of the following are the best units of data on an external storage device ? a) Bits b) Bytes c) Hertz d) Clock cycles
9 T&P, SASTRA-SRC

200. Seperate Read/Write heads are required in which of these memory access schemes. a) Random Access b) Sequential Access c) Direct Access d) None

10

T&P, SASTRA-SRC

ANSWERS: 1. It is a useful, memory-saving technique for multiprogrammed timesharing systems. A Reentrant Procedure is one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2 key aspects: The program code cannot modify itself, and the local data for each user process must be stored separately. Thus, the permanent part is the code, and the temporary part is the pointer back to the calling program and local variables used by that program. Each execution instance is called activation. It executes the code in the permanent part, but has its own copy of local variables/parameters. The temporary part associated with each activation is the activation record. Generally, the activation record is kept on the stack. Note: A reentrant procedure can be interrupted and called by an interrupting program, and still execute correctly on returning to the procedure. 2. Also called FIFO anomaly. Usually, on increasing the number of frames allocated to a process' virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns. 3. A binary semaphore is one, which takes only 0 and 1 as values. They are used to implement mutual exclusion and synchronize concurrent processes. 4. It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults. 5. Mutual Exclusion: Only one process may use a critical resource at a time. Hold & Wait: A process may be allocated some resources while waiting for others. No Pre-emption: No resource can be forcible removed from a process holding it. Circular Wait: A closed chain of processes exist such that each process holds at least one resource needed by another process in the chain. 6. Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process.
11 T&P, SASTRA-SRC

Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria. Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption. 7. Turnaround time is the interval between the submission of a job and its completion. Response time is the interval between submission of a request, and the first response to that request. 8. User data: Modifiable part of user space. May include program data, user stack area, and programs that may be modified. User program: The instructions to be executed System Stack: Each process has one or more LIFO stacks associated with it. Used to store parameters and calling addresses for procedure and system calls. Process control Block (PCB): Info needed by the OS to control processes. 9. In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses-- one to fetch appropriate page-table entry, and one to fetch the desired data. Using TLB in-between, this is reduced to just one physical memory access in cases of TLB-hit. 10. Resident set is that portion of the process image that is actually in realmemory at a particular instant. Working set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.) 11. The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock. 12. We encounter cycle stealing in the context of Direct Memory Access (DMA). Either the DMA controller can use the data bus when the CPU does
12 T&P, SASTRA-SRC

not need it, or it may force the CPU to temporarily suspend operation. The latter technique is called cycle stealing. Note that cycle stealing can be done only at specific break points in an instruction cycle. 13. If one or a few processes have a high access rate to data on one track of a storage disk, then they may monopolize the device by repeated requests to that track. This generally happens with most common device scheduling algorithms (LIFO, SSTF, C-SCAN, etc). High-density multisurface disks are more likely to be affected by this than low density ones. 14. C2 level security provides for: Discretionary Access Control Identification and Authentication Auditing Resource reuse 15. The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting. The CPU is not engaged in any real productive activity during this period, and the process does not progress toward completion. 16. Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis. Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy. Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool. Dynamic scheduling: The number of thread in a program can be altered during the course of execution. 17. In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered. 18. Trapdoor is a secret undocumented entry point into a program used to
13 T&P, SASTRA-SRC

grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition. 19. Local replacement means that an incoming page is brought in only to the relevant process' address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only. 20. Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time it takes for the beginning of the required sector to reach the head. Sum of seek time (if any) and latency is the access time. Time taken to actually transfer a span of data is transfer time. 21. The Open Brand is a mark awarded only when a vendor guarantees (in a legal contract) that any certified ("branded") product complies with the relevant specification(s) and commits to maintaining that compliance 22. It is a technique proposed by Lamport, used to order events in a distributed system without the use of clocks. This scheme is intended to order events consisting of the transmission of messages. Each system 'i' in the network maintains a counter Ci. Every time a system transmits a message, it increments its counter by 1 and attaches the time-stamp Ti to the message. When a message is received, the receiving system 'j' sets its counter Cj to 1 more than the maximum of its current value and the incoming time-stamp Ti. At each site, the ordering of messages is determined by the following rules: For messages x from site i and y from site j, x precedes y if one of the following conditions holds....(a) if Ti<Tj or (b) if Ti=Tj and i<j. 23. If a process in a monitor signal and no task is waiting on the condition variable, the signal is lost. So this allows easier program design. Whereas in semaphores, every operation affects the value of the semaphore, so the wait and signal operations should be perfectly balanced in the program. 24. Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped
14 T&P, SASTRA-SRC

out. 25. For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module. With run-time dynamic loading: Some of the linking is postponed until actual reference during execution. Then the correct module is loaded and linked. 26. With demand paging, a page is brought into memory only when a location on that page is actually referenced during execution. With prepaging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices. 27. Yes. 28. Page swapping or page replacements are called page cannibalizing. 29. Increased speed and memory capacity of microprocessors together with the support fir virtual memory and Growth of client server computing 30. Hardware abstraction layer Kernel Subsystems System Services. 31. To achieve maximum efficiency and reliability a mode of operation known as symmetric multiprocessing is used. In essence, with SMP any process or threads can be assigned to any processor. 32. Encapsulation Object class and instance 33. No Windows NT is not so, because its not implemented in object oriented language and the data structures reside within one executive component and are not represented as objects and it does not support object oriented capabilities .
15 T&P, SASTRA-SRC

34. It does not have the features like ability to support multiple processors virtual storage source level debugging 35. When the OS at the explicit request of another process creates a process, this action is called process spawning. 36. 15 jobs 37. Normal completion Time limit exceeded Memory unavailable Bounds violation Protection error Arithmetic error Time overrun I/O failure Invalid instruction Privileged instruction Data misuse Operator or OS intervention Parent termination. 38. swapping 1. interactive user request 2. timing 3. parent process request 39. It is the transfer of sufficient amount of the state of process from one machine to the target machine 40. `In Windows NT a mutant provides kernel mode or user mode mutual exclusion with the notion of ownership. 41. The special thread a dispatcher will execute when no ready thread is found. 42. It is a fault tolerance disk driver for Windows NT.
16 T&P, SASTRA-SRC

43. Ready Standby Running Waiting Transition Terminated. 44. Windows NT uses protection mechanism called rings provides by the process to implement separation between the user mode and kernel mode. 45. In Windows NT, executive refers to the operating system code that runs in kernel mode. 46. Network redirector/ Server Cache manager File systems Network driver Device driver 47. DDks are device driver kits, which are equivalent to SDKs for writing device drivers. Windows NT includes DDks. 48. C2 level security. 49. Operating system controls and coordinates the use of the hardware among the various applications programs for various uses. Operating system acts as resource allocator and manager. Since there are many possibly conflicting requests for resources the operating system must decide which requests are allocated resources to operating the computer system efficiently and fairly. Also operating system is control program which controls the user programs to prevent errors and improper use of the computer. It is especially concerned with the operation and control of I/O devices. 50. Paging is solution to external fragmentation problem which is to permit the logical address space of a process to be noncontiguous, thus allowing a process to be allocating physical memory wherever the latter is available. 51. diskcopy
17 T&P, SASTRA-SRC

52. When a thread is created the threads does not require any new resources to execute the thread shares the resources like memory of the process to which they belong to. The benefit of code sharing is that it allows an application to have several different threads of activity all within the same address space. Whereas if a new process creation is very heavyweight because it always requires new address space to be created and even if they share the memory then the inter process communication is expensive when compared to the communication between the threads. 53. Virtual memory is hardware technique where the system appears to have more memory that it actually does. This is done by time-sharing, the physical memory and storage parts of the memory one disk when they are not actively being used. 54. Throughput number of processes that complete their execution per time unit. Turnaround time amount of time to execute a particular process. Waiting time amount of time a process has been waiting in the ready queue. Response time amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment). 55. Waiting state 56. A real time operating system has well defined fixed time constraints. Process must be done within the defined constraints or the system will fail. An example is the operating system for a flight control computer or an advanced jet airplane. Often used as a control device in a dedicated application such as controlling scientific experiments, medical imaging systems, industrial control systems, and some display systems. Real-Time systems may be either hard or soft real-time. Hard real-time: Secondary storage limited or absent, data stored in short term memory, or read-only memory (ROM), Conflicts with time-sharing systems, not supported by general-purpose operating systems. Soft real-time: Limited utility in industrial control of robotics, Useful in applications (multimedia, virtual reality) requiring advanced operating-system features. 57. A hard real-time system guarantees that critical tasks complete on time. This goal requires that all delays in the system be bounded from the retrieval of the stored data to the time that it takes the operating system to finish any request made of it. A soft real time system where a critical realtime task gets priority over other tasks and retains that priority until it completes. As in hard real time systems kernel delays need to be bounded 58. Thrashing is caused by under allocation of the minimum number of pages required by a process, forcing it to continuously page fault. The system can detect thrashing by evaluating the level of CPU utilization as
18 T&P, SASTRA-SRC

compared to the level of multiprogramming. It can be eliminated by reducing the level of multiprogramming. 59. Multiprogramming is the technique of running several programs at a time using timesharing. It allows a computer to do several things at the same time. Multiprogramming creates logical parallelism. The concept of multiprogramming is that the operating system keeps several jobs in memory simultaneously. The operating system selects a job from the job pool and starts executing a job, when that job needs to wait for any i/o operations the CPU is switched to another job. So the main idea here is that the CPU is never idle. Multi tasking: Multitasking is the logical extension of multiprogramming .The concept of multitasking is quite similar to multiprogramming but difference is that the switching between jobs occurs so frequently that the users can interact with each program while it is running. This concept is also known as time-sharing systems. A time-shared operating system uses CPU scheduling and multiprogramming to provide each user with a small portion of time-shared system. Multi threading: An application typically is implemented as a separate process with several threads of control. In some situations a single application may be required to perform several similar tasks for example a web server accepts client requests for web pages, images, sound, and so forth. A busy web server may have several of clients concurrently accessing it. If the web server ran as a traditional single-threaded process, it would be able to service only one client at a time. The amount of time that a client might have to wait for its request to be serviced could be enormous. So it is efficient to have one process that contains multiple threads to serve the same purpose. This approach would multithread the web-server process, the server would create a separate thread that would listen for client requests when a request was made rather than creating another process it would create another thread to service the request. To get the advantages like responsiveness, Resource sharing economy and utilization of multiprocessor architectures multithreading concept can be used. 60. Hard disk is the secondary storage device, which holds the data in bulk, and it holds the data on the magnetic medium of the disk.Hard disks have a hard platter that holds the magnetic medium, the magnetic medium can be easily erased and rewritten, and a typical desktop machine will have a hard disk with a capacity of between 10 and 40 gigabytes. Data is stored onto the disk in the form of files. 61. Fragmentation occurs in a dynamic memory allocation system when many of the free blocks are too small to satisfy any request. External Fragmentation: External Fragmentation happens when a dynamic memory
19 T&P, SASTRA-SRC

allocation algorithm allocates some memory and a small piece is left over that cannot be effectively used. If too much external fragmentation occurs, the amount of usable memory is drastically reduced. Total memory space exists to satisfy a request, but it is not contiguous. Internal Fragmentation: Internal fragmentation is the space wasted inside of allocated memory blocks because of restriction on the allowed sizes of allocated blocks. Allocated memory may be slightly larger than requested memory; this size difference is memory internal to a partition, but not being used 62. DRAM is not the best, but its cheap, does the job, and is available almost everywhere you look. DRAM data resides in a cell made of a capacitor and a transistor. The capacitor tends to lose data unless its recharged every couple of milliseconds, and this recharging tends to slow down the performance of DRAM compared to speedier RAM types. 63. Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; this involves: Switching context, Switching to user mode, Jumping to the proper location in the user program to restart that program, dispatch latency time it takes for the dispatcher to stop one process and start another running. 64. Selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them. CPU scheduling decisions may take place when a process: 1.Switches from running to waiting state. 2.Switches from running to ready state. 3.Switches from waiting to ready. 4.Terminates. Scheduling under 1 and 4 is non-preemptive. All other scheduling is preemptive. 65. Switching the CPU to another process requires saving the state of the old process and loading the saved state for the new process. This task is known as a context switch. Context-switch time is pure overhead, because the system does no useful work while switching. Its speed varies from machine to machine, depending on the memory speed, the number of registers which must be copied, the existed of special instructions(such as a single instruction to load or store all registers). 66. Cache memory is random access memory (RAM) that a computer microprocessor can access more quickly than it can access regular RAM. As the microprocessor processes data, it looks first in the cache memory and if it finds the data there (from a previous reading of data), it does not have to do the more time-consuming reading of data from larger memory. 67. When a process requests an available resource, system must decide if immediate allocation leaves the system in a safe state. System is in safe state if there exists a safe sequence of all processes. Deadlock Avoidance: ensure that a system will never enter an unsafe state.
20 T&P, SASTRA-SRC

68. A real time process is a process that must respond to the events within a certain time period. A real time operating system is an operating system that can run real time processes successfully 70. Operating system is made up of basically two functions they are managing resources and extending the machine. Operating system gives a user interface through which he can perform various functions. It acts as a medium for communication between the machine and user. 71. A signal is a software mechanism that informs a process of the occurrence of asynchronous events. It does not employ priorities but it is more or less similar to a hardware interrupt. That is, all signals are treated equally. Signals that occur at the same time are presented to a process one at a time, with no particular ordering. 72. The operating system must be able to keep track of the various active processes.The operating system must allocate and de-allocate various resources for each active process.The operating system must protect the data and physical resources of each process against unintended interference by other processes. This involves techniques that relate to memory, files, and I/O devices.The results of a process must be independent of the speed at which the execution is carried out relative to the speed of other concurrent process. 73. Concurrency may arise in three different contexts. Multiple applications: -Processing time of the computer to be dynamically shared among a number of active jobs or applications Structured application: - With principles of modular design and structured programming some applications can be effectively implemented as a set of concurrent process. Operating system structure: -The same structuring advantages apply to the system programmer. 74. Data registers can be assigned to a variety of functions by the programmer. They can be used with any machine instruction that performs operations on data. Address registers contain main memory addresses of data and instructions or they contain a portion of the address that is used in the calculation of the complete addresses.

21

T&P, SASTRA-SRC

75. These run on servers, which are very large personal computers, work stations, or even mainframes. They serve multiple users at once over a network and allow the users to share hardware and software resources. Server O.S. provide various functions such as file and print service, or web service. Typical server operating systems are UNIX and Windows 2000. 76. To make changes a file must be opened. This call specifies the file name to be opened, either as an absolute path name or relative to the working directory, and a code of O_RDONLY, O_WRONLY or O_RDWR, meaning open for reading, writing or both. The file descriptor can then be used for reading or writing. 77. MULTICS is described as having a series of concentric rings, with the inner ones being more privileged than the outer ones. When a procedure in an outer ring wanted to call a procedure in an inner ring, it had to make the equivalent of a system call which is a TRAP instruction. MULTICS hardware made it possible to designate individual process as protected against reading, writing, or executing. 78. Different threads in a process are not quite as independent as different process. All threads share the same global variables as they have the same address space. One thread can read, write, or even completely wipe out another threads stack. 79. When the kernel knows that a thread has blocked, the kernel notifies the processes run time system, passing as parameters on the stack the number of the thread in question and a description of the event that occurred. The notification happens by having the kernel activate the run-time system at a known starting address, roughly analogous to a signal in UNIX. 80. Majority of the computers have more than one memory caches consisting of 32-byte or 64-byte blocks of memory. Whenever a cache is full then some part of the block should be chosen for removal. This problem is precisely the same page replacement except on a shorter time scale. 81. A preemptive scheduling algorithm picks a process and lets it run for a maximum of some fixed time. If it is still running at the end of the time interval, it is suspended and the scheduler picks another process to run. Doing preemptive scheduling requires having a clock interrupt occur at the end of the time interval to give control of the CPU back to the scheduler.

22

T&P, SASTRA-SRC

82. When an interrupt occurs, a scheduling decision may be made. If the interrupt came from an I/O device that has now completed its work, some process that was blocked waiting for the I/O may now be ready to run. It is up to the scheduler to decide if the newly ready process should run or not. 83. Checkpointing a process means that its state is written to a file so that it can be restarted later. The checkpoint contains not only the memory image, but also the resource state, that is, which resources are currently assigned to the process. To be most effective, new checkpoints should not overwrite old ones but should be written to new files. Whole sequences of checkpoint files are accumulated due to the process getting executed. 84. In the first phase, the process tries to lock all the records it needs, one at a time. If it succeeds, it begins the second phase, performing its updates and releasing the locks. No real work is done in the first phase. 85. Deadlock is a potential problem in any operating system. It occurs when a group of processes each have been granted exclusive access to some resources, and each one wants yet another resource that belongs to another process in the group. All of then are blocked and non will ever run again. 86. Paging systems can be modeled by abstracting the page reference string from the program and using the same reference string with different algorithms. These models can be used to make some predictions about paging behavior. Attention to issues such as determining the working set. 87. An Operating System, or OS, is a software program that enables the computer hardware to communicate and operate with the computer software. Without a computer Operating System, a computer would be useless. 88. As computers have progressed and developed so have the types of operating systems. Below is a basic list of the different types of operating systems and a few examples of Operating Systems that fall into each of the categories. Many computer Operating Systems will fall into more than one of the below categories. GUI - Short for Graphical User Interface, a GUI Operating System contains graphics and icons and is commonly navigated by using a computer mouse. See our GUI dictionary definition for a complete definition. Below are some examples of GUI Operating Systems.

23

T&P, SASTRA-SRC

System 7.x Windows 98 Windows CE 89. A multi-user Operating System allows for multiple users to use the same computer at the same time and/or different times. See our multi-user dictionary definition for a complete definition for a complete definition. Below are some examples of multi-user Operating Systems. Linux Unix Windows 2000 Windows XP Mac OS X 90. An Operating System capable of supporting and utilizing more than one computer processor. Below are some examples of multiprocessing Operating Systems. Linux Unix Windows 2000 Windows XP Mac OS X 91. An Operating system that is capable of allowing multiple software processes to run at the same time. Below are some examples of multitasking Operating Systems. Unix Windows 2000 Windows XP Mac OS X 92. Operating systems that allow different parts of a software program to run concurrently. Operating systems that would fall into this category are: Linux Unix Windows 2000

24

T&P, SASTRA-SRC

Windows XP Mac OS X 93. Operating system controls and coordinates the use of the hardware among the various applications programs for various uses. Operating system acts as resource allocator and manager. Since there are many possibly conflicting requests for resources the operating system must decide which requests are allocated resources to operating the computer system efficiently and fairly. Also operating system is control program which controls the user programs to prevent errors and improper use of the computer. It is especially concerned with the operation and control of I/O devices. 94. Paging is solution to external fragmentation problem which is to permit the logical address space of a process to be noncontiguous, thus allowing a process to be allocating physical memory wherever the latter is available.While running DOS on a PC, which command would be used to duplicate the entire diskette? diskcopy 95. When a thread is created the threads does not require any new resources to execute the thread shares the resources like memory of the process to which they belong to. The benefit of code sharing is that it allows an application to have several different threads of activity all within the same address space. Whereas if a new process creation is very heavyweight because it always requires new address space to be created and even if they share the memory then the inter process communication is expensive when compared to the communication between the threads. 96. Virtual memory is hardware technique where the system appears to have more memory that it actually does. This is done by time-sharing, the physical memory and storage parts of the memory one disk when they are not actively being used. 97. Throughput number of processes that complete their execution per time unit. Turnaround time amount of time to execute a particular process. Waiting time amount of time a process has been waiting in the ready queue. Response time amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment). 98. Waiting state
25 T&P, SASTRA-SRC

99. A real time operating system has well defined fixed time constraints. Process must be done within the defined constraints or the system will fail. 100. Why is the Open Brand valuable? The Open Brand is valuable because it provides buyers of computer systems with a guarantee of conformance to widely accepted open systems specifications. This in turn allows them to choose different vendors for different but functionally identical systems, thus avoiding 'lock-in'. The vendor warrants and represents that branded products will 1. Comply with the specification(s) 2. Continue to comply with the specification(s) 3. Any non-compliance will be rectified in a prescribed time

101. OS-9 is a real-time, multiuser, multitasking operating system developed by Microware Systems Corporation. It provides synchronization and mutual exclusion primitives in the form of signals, events, and semaphores. It also allows communication between processes in the form of named and unnamed pipes, as well as shared memory in the form of data modules. OS-9 is modular, allowing new devices to be added to the system simply by writing new device drivers, or if a similar device already exists, by simply creating a new device descriptor. All I/O devices can be treated as files, which unifies the I/O system. In addition, the kernel and all user programs are ROMable. Thus, OS-9 can run on any supported hardware platform from simple diskless embedded control systems to large multiuser minicomputers. Originally developed for the 6809 microprocessor, OS-9 was a joint effort between Microware and Motorola. The original version of OS-9 (OS-9 Level I) was capable of addressing 64 kilobytes of memory. OS-9 Level II took advantage of dynamic address translation hardware, and allowed a mapped address space of one megabyte on most systems, and up to two megabytes on others, most notably the Tandy Color Computer 3.

26

T&P, SASTRA-SRC

In the 1980's, Microware ported OS-9 to the 68000 family of microprocessors, creating OS-9/68000, which is used in a variety of industrial and commercial arenas, including Philips' CD-i and most recently, set-top boxes for interactive television. Microware is constantly added processor support to OS9000. Currently supported processors include 68xxx, PPC, X86, Intel SARM / IXP, MIPS, SPARC, Hitachi SH. 102.OS-9000 is a portable version of OS-9, written primarily in C. It is available for the Intel (386 and higher), PowerPC processors, ARM, StrongArm, SH, MIPS, and Sparc. Code is portable across OS-9000 platforms and between OS-9 at the source code level. Theoretically, OS-9000 can be ported to any modern computer architecture. Currenlty Microware refers to all ports of OS9000 as OS9. 103.DAVID is a configuration of OS-9/OS-9000 targeted towards the Interactive TV Set Top Box (STB) market. DAVID stands for Digital Audio Video Interactive Decoder. The unique characteristics of DAVID are that it will always include the following I/O subsystems:

SPF - Serial Protocol File Manager. Manages high speed, packet based, streaming networks. Uses protocol modules to add support for X.25, UDP/IP, Q.2931, etc. MPFM - Motion Picture File Manager. Manages the decompression and display of MPEG encoded audio and video. MAUI - Multimedia Application User Interface. Manages graphics overlay devices. MAUI replaces the RAVE product used in previous systems, do to problems with speed and real time responsiveness. SCF - Sequential Character File Manager. Handles infra red remote controls or tethered joysticks, gamepads, etc.

Like all OS-9 systems, DAVID may be expanded with any other file managers, but these are considered the base case set. DAVID is being shipped for 68xxx, Power PC and 80x86 processor families. Click here for more information on DAVID. 104.OS-9 runs on a multitude of machines, from set-top boxes to industrial control machines. OS-9/6809 runs on a variety of platforms, perhaps the most (in)famous being the Tandy Color Computer. Other systems include the SWTPC SCB27 T&P, SASTRA-SRC

69, the Gimix 6809, Smoke Signal Broadcasting's Chieftain 6809, FHL's TC-9, the Febe, and a host of others, most of which are SS-50 bus machines. Note that OS-9/6809 is no longer supported by Microware, but many user groups, BBSes, and a handful of FTP sites offer help and maintain software collections for OS-9/6809. 105.OS-9 software can be found either commercially or in the public domain/shareware/freeware. The most notable place to obtain free OS-9 software and code examples is through Real-Time Services Inc.'s free OS-9 ftp site at ftp://os9archive.rtsi.com. There is a considerable amount of "legacy" applications such as word processors, spread-sheets and utilities which are mostly not used anymore since OS-9's focus has changed almost exclusively to that of an embedded, real-time operating system. 106.Generally, a hardware vendor of a particular computer system will ship a version of OS-9 for their platform. In addition, several software vendors sell customized and enhanced OS-9 packages, and Microware sells single license copies for certain systems. 107.Microware sells HAWK, a host/target development system consisting of a GUI based debugger, profiler and Ultra C++ compiler. HAWK is available for Windows 9X/NT and supports user- and system-level debugging. Development is typically done with the OS-9 target connected to the host development machine via ethernet or SLIP. Hawk for Windows 9X/NT based platforms also comes with the Codewright programmer's editor. CodeWarrior, from MetroWerks, is another GUI based development environment for OS-9 development. Unlike Hawk, CodeWarrior is only available for Windows 9X/NT and does not support system-level debugging.

28

T&P, SASTRA-SRC

108.Yes. Microware sells LAN Communications Pak, which is a complete TCP/IP package based on the SPF file manager. LAN Comm Pak includes telnet and ftp client and server applications. Its performance is considerably better than that of Microware's older TCP/IP support package, ISP. LAN Comm Pak also provides a C BSD 4.2 compatible socket library, as well as SLIP and PPP client support. Additionally, there is a port of the Phil Karn ka9q internet software package, which supports a single-user interface to TCP/IP. It includes a telnet client, an FTP client and server, and SMTP. Source and executables may be found on ftp://os9archive.rtsi.com. 109.Yes, as of OS-9/68000 version 3.0.3. Previous versions of OS9/68000 do not handle the Y2K problem correclty. Specifically, some utilities cannot interpret Y2K properly, and some clock modules may also be at fault. Contact Microware for details on upgrading to OS9/68000 3.0.3. OS-9000 handles Y2K properly; therefore, upgrading is not necessary. 110.Several public domain programs are available from os9archive including terminal emulators and file transfer utilities. Sterm, a popular non-commercial package, can run on any terminal based OS9 system and supports XModem as well as Compuserve B+ protocol. In addition, many software vendors sell various equivalent packages. C-Kermit is available in source and executable form for OS-9. If you are looking for X/Y/ZModem and kermit protocols, an excellent implementation by Tim Kientzle can be found on ftp://os9archive.rtsi.com.

29

T&P, SASTRA-SRC

111.GCC and g++ are available for OS-9/68000, both in OS-9 executable form and cross-compiler form. Version 1.37 was ported to OS-9 by Atsushi Seyama and was then supported and updated to the version 1.39, 1.40, and 1.42.2 by Stephan Paschedag. Source and binaries are available on ftp://os9archive.rtsi.com . The 1.40 versions and up support 68040 optimizations. Version 2.x of GCC is a completely new port to OS-9 which allows better optimization. The first version that was released was version 2.4.5. The current edition includes a new I/O library which gives full compatibility with C++ programs (I/O streams). It also supports the different calling interfaces of Microware's compilers (K&R C V3.2 and Ultra C). Bear in mind that the newer editions (2.x) will require at least 4 MB of memory free in order to run. 112.There are several to choose from. Microware has MAUI, the graphical environment which is currently being used in DAVID set-top boxes. Microware also sells a port of X11R5 (client and server plus optional Motif). Eltec Electronik GmbH sells ports of X11R4, X11R5 and X11R6. Kei Thomsen has also done a port of X11R5 and X11R6. His port requires Microware sockets, GCC 2.x, OS9lib.l (unix compatibility routines), and a bourne shell for running imake. It requires a minimum of 4 MB physical memory, 8MB if you plan to run any applications. Several other companies have various graphics packages for OS-9. MGR, the window manager from Bellcore, is available for the WCP306 computer, and Reccoware Systems also has a port. Gespac produces G-Windows, a portable windowing package which has device windows and a very Motiflooking interface. For the MM/1, BlackHawk Enterprises sells K-Windows, a window manager similar to the Multi-Vue OS-9 window package for the Tandy Color Computer 3.

30

T&P, SASTRA-SRC

113.Public domain software for OS-9 can be found on the Internet, as well as on several bulletin boards dedicated to OS-9. The primary Internet resource for public domain software is os9archive.rtsi.com. This ftp site contains a large amount of OS-9/68000 and OS-9/6X09 software contributed by many individuals. Another ftp site in located in Europe is lucy.ifi.unibas.ch/ftp/osk. For Color Computer OS-9 users, there is the Princeton Listserver, which acts as a mailing server that will mail requested software. To begin using the Listserver, send electronic mail to [email protected], with the word HELP in your message. os9archive.rtsi.com contains mostly OS-9/68000 software, including the complete TOP package, many EFFO disks, GCC and G++, (and many other GNU products such as flex and bison), ka9q, k5jb, TeX, LaTeX, and quite a bit of 6809 software. 114.TOP is an acronym for "The OS-9 Project". It is a collection of OS-9/68000 software developed primarily in Germany and available on ftp://os9archive.rtsi.com. Much of it seems to be an attempt to make OS-9 a little more UNIX-like. Many standard UNIX utilities are provided, as well as a complete UUCP mail implementation, and a more secure password file and login program. Many traditional UNIX games are also provided. The total package consumes approximately 16 MB of disk space, though much of this is source code. 115.Yes, there are. Microware's MShell, an enhanced shell. In addition, there are several public domain shells available. The most notable of which is the Bourne shell, sh, available in the TOP package (OS-9/68000) in its original version. A newer version with may enhancements and bug fixes is available through EFFO. sh supports aliasing, command-line editing, history, environment variable replacement, shell scripting, the `command` operator (which uses the output of the command as arguments to the called program), and a startup file. For users feeling at home in a VAX/VMS surrounding, the zsh shell is commercially available from ELSOFT. 116.Yes, there are several public domain and commercially avaliable utilities to accomplish this task, for both OS-9/6809 and OSK. One of the more interesting is the MSFM file manager which appears in OS9 Insights, a book by Peter Dibble, available through Microware.
31 T&P, SASTRA-SRC

MSFM is an actual file manager, which allows you to mount an MSDOS floppy as part of the OS-9 file system. PCF, available from Microware, is an updated file manager which also reads and writes MS-DOS format disks. 117.Yes, there is a product called OS9MAX which is capable of managing OS-9 media such as diskettes, hard disks, pcmcia memory chip cards, PC cards, CD-ROMS and other OS-9 RBF style devices. OS9MAX lets you read, write amd format OS-9 disks on a PC. 118.There are several newsgroups and mailing lists on the internet which discuss OS-9 and its derivatives. On Usenet NetNews, the following groups cover OS-9, the first of which more so than the others:

comp.os.os9 comp.sys.m68k comp.sys.m6809 comp.realtime

CompuServe and Delphi both have OS-9 forums with a files section for downloads of some of the latest OS-9/68000 and OS-9/6809 shareware. Online conferences are regularly scheduled on Delphi's OS-9 forum on a variety of topics. GEnie also has OS-9 support with OSK files found in a section of the Atari ST RoundTable and CoCo OS-9 and MM/1 files found in the Tandy RoundTable. 119.Several ports of UUCP software are available for both OS-9/6809 and OS-9/68K. A port of C news and RN are available on os9archive.rtsi.com. TOP has ported Notes, which maintains Notesfiles. There is a program which will transfer between Notesfiles and netnews. The TOP package in its entirety may be found on os9archive. Rick Adams' UUCP port for OS-9/6809 is also available, and this has been updated to UUCPbb by Bob Billson, Boisy G. Pitre and others. UUCPbb is also available for OS-9/68000 and may be found on wuarchive and os9archive, as well as on Delphi and CompuServe. A nice companion mail reader for this package called Palm, which has Elm-like features, is also available.

32

T&P, SASTRA-SRC

UUCPbb features:
o o o o

a fairly complete implementation of UUCP mail and news processing with reader programs UUCP management utilities full C source code

Elm has also been ported to OSK, and is available on os9archive. The Elm package is a port of elm 2.4; it fits in the rmail/lmail/uucp environment that can be found in the TOP package. Elm features:
o o o

e-mail address data base with aliases very friendly user interface answering machine, etc.

120.Digby Tarvin from Australia, has a port of OS-9/68000 for the Amiga, which costs approximately $600 US. 121.A real-time system is any system whose correctness depends not only on the correctness of the applied algorithms, but also in the timing of the execution of those algorithms. Refer to the newsgroup comp.realtime for more information. 122.Posix Threads are supported for OS9 for all processors other than 68K 123. Mutex is a program object that allows multiple program threads to share the same resource, such as file access, but not simultaneously. When a program is started a mutex is created woth a unique name. After this stage, any thread that needs the resource must lock the mutex from other threads while it is using the resource. the mutex is set to unlock when the data is no longer needed or the routine is finished. 124. A process is a collection of virtual memory space, code, data, and system resources. A thread is code that is to be serially executed within a process. A processor executes threads, not processes, so each application has at least
33 T&P, SASTRA-SRC

one process, and a process always has at least one thread of execution, known as the primary thread. A process can have multiple threads in addition to the primary thread. Prior to the introduction of multiple threads of execution, applications were all designed to run on a single thread of execution. When a thread begins to execute, it continues until it is killed or until it is interrupted by a thread with higher priority (by a user action or the kernel thread scheduler). Each thread can run separate sections of code, or multiple threads can execute the same section of code. Threads executing the same block of code maintain separate stacks. Each thread in a process shares that process global variables and resources. 125. Locking Mechanism used inside resource mangers and resource dispensers. 126. COM is a specification (Standards). COM has two aspects a: COM specifications provide a definition for what object is b: COM provides services or blue prints for creation of object and communication between client and server. COM is loaded when the first object of the component is created. 127. 1.NEW 2.READY 3.WAIT 4.RUNNING 5.TERMINATE 128. The majority of commercial vendors have registered UNIX products. 129.XPG4 covers many things in addition to the operating system. In fact, UNIX and XPG4 Base are part of the core set of operating system related specifications, that are both in turn part of XPG4. 130. Spec 1170 was the working name for what has now become the Single UNIX Specification. The Single UNIX Specification is a comprehensive set
34 T&P, SASTRA-SRC

of operating system-related application programming interface specifications adopted by The Open Group as the single definition for UNIX systems. The specification has evolved and Version 3 of the Single UNIX Specification is the latest iteration, the core of which is also IEEE Std 1003.1-2001 and ISO/IEC Standard 9945:2002. 131. Yes, in keeping with The Open Group's policy to make all specifications freely accessible on the world wide web, the latest version of the Single UNIX Specification is available at http://www.UNIXsystems.org/online.html. 132.Novell announced the proposed transfer of the trade mark in October 1993. The transfer was finalised in Q2 '94. 133.Only those computer operating system that implement the services as specified in the Specification set(s) for UNIX 93 , UNIX 95, UNIX 98 or UNIX 03. 134. Differences are in the definition of what can be branded and the conformance requirements. UNIX 93 applies to systems which pre-date the Single UNIX Specification. UNIX 95 applies to systems which implement the Single UNIX Specification (published in 1994). UNIX 98 applies to systems which implement Version 2 of the Single UNIX Specification (published in 1997) UNIX 03 applies to systems which implement Version 3 of the Single UNIX Specification (published in 2002). 135.This term, which is an abuse of the UNIX trademark, and should not be used, is often used in association with products that share some properties in common with systems carrying the UNIX trademark. Users of such terms should consult the trademark usage guidelines, which give numerous examples of how to correctly use the trademark, and make the necessary corrections. 136. Conformance with the Single UNIX Specification for UNIX 95, the Single UNIX Specification Version 2 for UNIX 98, and the Single UNIX Specification Version 3 for UNIX 03. 137.No. The Open Group is responsible for the specification that defines a UNIX system and the registered trade mark UNIX. Many vendors sell products that are based on source code originally developed by AT&T , licensed from SCO, and before that Novell and USL.
35 T&P, SASTRA-SRC

138.No. When the Single UNIX Specification was adopted by The Open Group (at the time X/Open), the company became the custodian of the specification which can only be changed through the formal industry consensus process. The trade mark UNIX is licensed only by The Open Group. The Open Group holds the trademark and definition in trust for the industry. 139.Yes, some vendors do before the transfer occurred. However the terms and conditions of the X/Open licence are commercially beneficial and most have moved to the X/Open trade mark licence. 140.Licensing source does not entitle a vendor to use the UNIX trade mark. SCO holds the rights ONLY to the operating system source code (originally licensed by AT&T) and related intellectual property and DOES NOT OWN the UNIX trademark itself or the definition (the Single UNIX Specification) of what the UNIX system is. AT&T always required the vendor to have a TMLA as well as a source code licence. 141. Only complete environments can carry the brand. This ensures that all the necessary parts of the system are clearly identified to the buyer. However, many vendors brand their products as capable of running on a wide range of machines, such as Intel platforms, 486 or Pentium based PC compatibles, SPARC or PA-RISC. 142. The fee structure is based on the number of annual shipments of UNIX products. Fees range from $25,000 for up to 1,000 units per annum, to $110,000 for more than 30,000 units per annum. 143. Almost all of todays applications are written for systems that carry the XPG4 Base brand. XPG4 Base has been referenced in over $23 billion of procurement world-wide to date. The Single UNIX Specification offers users portability of existing UNIX systems software and applications to new platforms. XPG4 Base offers developers the functionality needed for new open systems products. Application program developers can guarantee the portability of their code on to a wide range of platforms - including computers with exotic hardware architectures - by constraining themselves to the XPG4 Base specification. The two will co-exist as long as the market finds a need for both. Currently, all leading vendors market products carrying the XPG4 Base brand.

36

T&P, SASTRA-SRC

144.UNIX Brand licensees may now for the first time call their products UNIX systems. In order to do this, each product has to be what is called a 'Registered Product' which means that the vendor has specifically commited that the product (or product family) conforms to the specification(s). 145. The test suites are organised as a series of modules to allow various modes of use. Testing checklists for UNIX 95, 98 and 03 are available at URL] 146.Branded products carry the Open Brand logo and a mandatory paragraph that declares which version of the specification the product complies with. This will be in the form "Product Name Version X.X is an X/Open UNIX 93 branded product" or "ABC operating system on Intel is branded X/Open UNIX 93, ABC operating system on XXRISC is branded X/Open UNIX 95". 147. Since the transfer of the trade mark, The Open Group has responsibility for protecting the mark, by ensuring that it is registered in major trading areas, and for overseeing its use. All existing licensees have been informed of the correct attribution of the mark and letters have been sent to journals in the open systems world notifying them. The effects of The Open Group's action takes some time to reflect in advertising, due to the lead time for production of such items. The Open Group will continue to pursue each misuse of the mark backed by legal action if needed. 148.No, in fact XPG4 Base, XPG4 Base 95 and XPG4 UNIX profile definitions will exist in parallel. XPG4 Base was defined in 1992 and will be withdrawn at some stage in the future, leaving the XPG4 Base 95 and XPG4 UNIX profile definitions. XPG4 Base 95 is a superset of XPG4 Base - the major difference is the requirement for a POSIX.2 compliant Commands & Utilities - and in turn UNIX is a superset of XPG4 Base 95. 149. Users are assured that the products they receive will deliver the benefits promised and will conform to the same portability specifications of the other branded products. The Open Brand is important on a number of levels. By entering into a license agreement to use the UNIX and other Open Brands, a supplier indicates his commitment to make his current and future products interoperable with others which have passed the same stringent conformance testing. Individuals involved in the procurement process will find their time

37

T&P, SASTRA-SRC

cut dramatically for standards evaluation and subsequent recommendations while increasing the level of systems quality. 150. CDE is not included as part of the Single UNIX Specification. However the initiative that developed CDE had as its goal the production of a single graphical user interface, and this is included in the UNIX 98 Workstation Product Standard, which extends UNIX 98 to include CDE. CDE is the open systems equivalent of Microsoft Windows in that it provides a graphical user interface to the underlying operating system that may well be a UNIX system. 151.The Open Brand is open to any supplier whose product meets the published criteria. Many products that have been traditionally regarded as proprietary already have the XPG4 Base brand. For those products, additional work may be required to comply with the additional specifications (networking, terminal interfaces, etc.) that comprise the definition of a UNIX system. 152..The correct attributions are either: "UNIX is a registered trademark in the United States and other countries, licensed exclusively though X/Open Company Ltd." or more recently "UNIX is a registered trademark of The Open Group" All existing Licensees have been instructed by Novell that they should now use the correct attribution. Any other attribution is incorrect. 153. There is a growing portfolio of test technology associated with the Open Brand. See the testing web pages for the latest information. 154. The Open Group test suites can also run in POSIX modes for customers who require to verify their POSIX conformance. With the introduction of test suites for the Single UNIX Specification, Version 2, The Open Group has the only complete test coverage for ISO 9945-1:1996 (POSIX 1003.11996) and ISO 9945-2:1993 (POSIX 1003.2-1992) available in the industry, including test suites for POSIX Realtime, and POSIX Threads. 155. The UNIX 98 Server and UNIX 03 Server Product Standards include the platform independent Internet Server product standard, including
38 T&P, SASTRA-SRC

mandatory Java TM runtime environment and internet and intranet services. These are defacto definitions of an open server platform for supporting todays internet based services. 156. Y2K handling for interfaces within the Single UNIX Specification for UNIX 98 is explicitly defined in Version 2 of that specification, published in February 1997. 157. Version 3 of the Single UNIX Specification is now complete. It aligns with ISO C99 and includes updates for the latest POSIX standards.
158. 159. 160. 161. 162. 163. 164. 165. 166. 167. 168. 169. 170. 171. 172. 173. 174. 175. 176. 177. 178. 179. 180. 181. A B A B C C B A A B B C D C A D B D B C B D D D

39

T&P, SASTRA-SRC

182. 183. 184. 185. 186. 187. 188. 189. 190. 191. 192. 193. 194. 195. 196. 197. 198. 199. 200.

A D C D B B A A A C C A D A B D A D D

40

T&P, SASTRA-SRC