Operating System Model Questions and Answers

The Free download links of Operating System Model Questions and Answers Papers enclosed below. Candidates who are going to start their preparation for the Operating System Model papers can use these links. Download the Operating System Model Papers PDF along with the Answers. Operating System Model Papers are updated here.

A vast number of applicants are browsing on the Internet for the Operating System Model Question Papers & Syllabus. For those candidates, here we are providing the links for Operating System Model Papers. Improve your knowledge by referring the Operating System Model Question papers.

Model Questions and Answers on Computer Networking

1. Boundary registers
(a) are used for temporary program variable storage.
(b) are only necessary with fixed partitions.
(c) track the beginning and ending of programs.
(d) track page boundaries.

2. Over laying
(a) requires use of a loader
(b) allows larger programs, but requires more effort
(c) is most used on large computers
(d) is transparent to the user

3. The root segment
(a) is the bottom most partition in the system.
(b) is where operating system is loaded.
(c) is the part of an overlay that is always in memory.
(d) is the part of the overlay that is replaced.

4. Swapping
(a) works best the many small partitions.
(b) allows many program to use memory simultaneously.
(c) does not work with overlay.
(d) allows each program in turn to use the memory.

5. The memory allocation scheme subject to “external” fragmentation is
(a) multiple contiguous fixed partitions
(b) swapping
(c) pure demand paging
(d) segmentation

6. Dynamic Address Translation
(a) is part of the operating system paging algorithm
(b) is useless when swapping is used
(c) is the hardware necessary to implement paging
(d) storage pages at a specific location on disk

7. The map table
(a) should be as large as possible.
(b) should be completely in the fastest hardware possible.
(c) is not necessary in the latest operating system.
(d) allows pages to be located when referenced.

8. The map fault
(a) occurs when a program accesses a page of memory.
(b) is an error in the specific page.
(c) is an access to a page belonging to another program.
(d) is a reference to a page belonging to another program.

9. Demand paging
(a) fetches a page only when needed.
(b) fetches pages that are likely to be demanded.
(c) pages out pages when that page frame is needed.
(d) pages out pages in large groups.

10. The LRU algorithm
(a) pages out pages that have not been used recently.
(b) pages out pages that have been used recently.
(c) pages out pages that have been least used recently.
(d) pages on the first page in a given area.

11. The reference bit
(a) is set when the page is paged out
(b) is reset when the page is accessed by a program
(c) is set when the page is accessed by a program
(d) is never reset

12. Thrashing
(a) always occurs on large computers.
(b) is a natural consequence of virtual memory systems.
(c) can always be avoided by swapping.
(d) can be caused by poor paging algorithms.

13. The working set
(a) contains all pages referenced.
(b) contains all the pages that should be kept in memory.
(c) is that group of pages being used by all programs.
(d) is always resident in memory.

14. Page stealing
(a) is a sign of an efficient system
(b) is taking larger disk spaces for pages paged out
(c) is taking page frames from other working sets
(d) should be the tuning goal.

15. Virtual system swapping
(a) allocates all the memory to one program
(b) pages working set pages in and out as a group
(c) is never as efficient as normal paging
(d) is used only on systems that are thrashing

16. An operating system uses a least recently used (LRU) page replacement algorithm for managing memory. Consider the following page reference string where each reference is made in one unit of time.
1, 8, 1, 7, 8, 2, 7, 2, 1, 8, 3, 8, 2, 1, 3, 1, 7, 1, 3, 7
Which of the following number of page faults that are generated for this particular LRU case assuming that the process has been allocated four page frames?
(a) 2
(b) 5
(c) 6
(d) 4

17. The term “aging” refers to
(a) booting up the priority of a process in multi-level of queue without feedback.
(b) gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blacking.
(c) keeping track of the following a page has been in memory for the purpose of LRU replacement.
(d) (d) letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.

18. With a segmentation, if there are 64 segments, and the maximum segment size is 512 words, the length of the logical address in bits is
(a) 12
(b) 15
(c) 14
(d) 16

19. The reference bit is used for the purpose of
(a) implementing MRU algorithm.
(b) Implementing LRU page replacement algorithm.
(c) checking of the page table entry is in cache memory.
(d) checking to see if parameters are passed to a procedure by value or by address.

20. The principle of “locality of reference” justify the use of
(a) DMA
(b) cache memory
(c) polling
(d) virtual memory

21. The “working set” theory of programming behaviour of processes running within an operating system involves
(a) assigning I/O resource to produces
(b) disk scheduling mechanism
(c) assigning the CPU to processes
(d) the collection of pages a process accesses

22. A high paging rate
(a) may cause high I/O rate
(b) is a symptom of too much processor activity
(c) keeps the system running well
(d) always creates a slow system

23. The total to prepare a disk mechanism for a block of data to be read from it is
(a) Seek time
(b) Latency
(c) Latency pulse seek time
(d) Transmission time

24. Which of the following Illustrates Associative memory?
(a) The address of the data is supplied by the user.
(b) Same as the tracks associated with disk memory.
(c) These is no need of an address; the information (data) is used as an address.
(d) Data is accessed serially.

25. A disk scheduling algorithm in an operating system causes the disk arm to sweek back and forth across the disk surface servicing all request in its path. This is a
(a) First come first served
(b) Scan
(c) Shortest seek time first
(d) Eschenback scheme

26. What is the initial value of the semaphore to allow only one of the many processes to enterior section?
(a) 0
(b) 2
(c) 1
(d) 2

27. To avoid the race condition the number of processors that may be simultaneously inside their critical section is
(a) 0
(b) 2
(c) 1
(d) 3

28. Producer consumer problem can be solved using
(a) Semaphores
(b) Monitors
(c) event counters.
(d) all of the above

29. In order to allow only one process to enter its critical section, binary semaphore are inialized to
(a) 0
(b) 2
(c) 1
(d) 3

30. The strategy of allowing processes that are logically runnable to be temporarily suspended is called
(a) primitive scheduling
(b) non-primitive scheduling
(c) shortest job first
(d) first come-first served.

31. Moving process from main memory to disk is called
(a) Scheduling
(b) Swapping
(c) Caching
(d) Spooling

32. Block caches or buffer caches are used
(a) to improve disk performance
(b) to increase the capacity of the main memory
(c) to handle interrupts
(d) to speed up main memory read operation.

33. Which of the following is a block device
(a) Mouse
(b) Terminal
(c) Printer
(d) Disk

34. Which of the following operating system uses write through catches?
(a) UNIX
(b) DOS
(c) ULTRIX
(d) XENIX

35. The principal of locality of reference justifies the use of
(a) virtual memory
(b) main memory
(c) interrupts
(d) cache memory

36. In which of the following storage placement strategies a program is placed in the largest available hole the main memory?
(a) best-fit
(b) worst-fit
(c) first fit
(d) buddy

37. In which of the following strategies a program is located in the smallest available hole in the main memory?
(a) best fit
(b) first-fit
(c) worst-fit
(d) buddy

38. If the number of bits in a virtual address of a program is 12 and the page size is 0.5 K bytes. The number of pages in the virtual address space is
(a) 4
(b) 64
(c) 32
(d) 128

39. Non modifiable procedures are called
(a) serially usable procedures
(b) reentant procedures
(c) concurrent procedures
(d) topdown procedures

40. In which of the following page replacement policies, Bolady’s anomaly occurs?
(a) FIFO
(b) LFU
(c) LRU
(d) NRU

41. What is the name given to the process of initializing a microcomputer with its operating system?
(a) Cold booting
(b) Booting
(c) Boot recording
(d) Warm booting

42. What is the name of the operating system which was originally designed by scientist and engineering for use by scientists and engineers ?
(a) XENIX
(b) OS/2
(c) UNIX
(d) MS DOS

43. Which are the most important features of Microsoft windows program?
(a) Windows
(b) Icons
(c) Pull-down menus
(d) All of the above

44. What is the name given to the organized collection of software that controls the overall operation of a computer?
(a) Working system
(b) Operating system
(c) Peripheral system
(d) Controlling system

45. What is the name given to the values that are automatically provided by software to reduce keystrokes and improve a computer user’s productivity?
(a) Defined values
(b) Default values
(c) Fixed values
(d) Special values

46. The powerful text editor called PC-write can be used by anybody by paying a small fee. Such programs are called
(a) Software
(b) Firmware
(c) Share ware
(d) Mind ware

47. What is the name of the operating system that reads and reacts in terms of actual time
(a) Quick response system
(b) Batch system
(c) Time sharing system
(d) Real time system

48. What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
(a) Partitioning
(b) Windowing
(c) Multitasking
(d) Paging

49. When did IBM release the first version of its disk operating system DOS?
(a) 1981
(b) 1982
(c) 1983
(d) 1984

50. IBM released its first PC in 1981 can you name the operating system which was most popular at that time?
(a) MS DOS
(b) Steve Jobs
(c) Yuri Manin
(d) Stephen Wolfram