GUPTA CLASSES

A Premier Institute for MCA/MBA Entrance

6, Utsav Complex, Shivaji Road Meerut
(O) 4003132 (M) 9837253111, 9837464507 Operating System Spcl Assignment
1) Round robin scheduling is essentially the preemptive 13) Which is not the state of the process ?
version of ________. 1 Blocked 2 Running 3 Ready 4 Privileged
1 FIFO 2 Shortest job first 3 Shortes remaining 14) The solution to Critical Section Problem is : Mutual
4 Longest time first Exclusion, Progress and Bounded Waiting.
2) A page fault occurs 1 The statement is false 2 The statement is true.
1 when the page is not in the memory 3 The statement is contradictory. 4 None of the above
2 when the page is in the memory 15) The problem of thrashing is effected scientifically by
3 when the process enters the blocked state ________.
4 when the process is in the ready state 1 Program structure 2 Program size
3) Which of the following will determine your choice of 3 Primary storage size 4 None of the above
systems software for your computer ? 16) The state of a process after it encounters an I/O
1 Is the applications software you want to use compatible instruction is __________.
with it ? 2 Is it expensive ? 1 Ready 2 Blocked/Waiting 3 Idle 4 Running
3 Is it compatible with your hardware ? 4 Both 1 and 3 17) The number of processes completed per unit time is
4) Let S and Q be two semaphores initialized to 1, where P0 known as __________.
and P1 processes the following statements wait(S);wait(Q); 1 Output 2 Throughput 3 Efficiency 4 Capacity
---; signal(S);signal(Q) and wait(Q); 18) _________ is the situation in which a process is waiting
wait(S);---;signal(Q);signal(S); respectively. The above on another process,which is also waiting on another
situation depicts a _________ . process ... which is waiting on the first process. None of the
1 Semaphore 2 Deadlock 3 Signal 4 Interrupt processes involved in this circular wait are making progress.
5) What is a shell ? 1 Deadlock 2 Starvation 3 Dormant 4 None of the above
1 It is a hardware component 2 It is a command interpreter 19) Which of the following file name extension suggests that
3 It is a part in compiler 4 It is a tool in CPU scheduling the file is Backup copy of another file ?
6) Routine is not loaded until it is called. All routines are 1 TXT 2 COM 3 BAS 4 BAK
kept on disk in a relocatable load format. The main program 20) Which technique was introduced because a single job
is loaded into memory & is executed. This type of loading is could not keep both the CPU and the I/O devices busy?
called _________ 1 Time-sharing 2 SPOOLing 3 Preemptive scheduling
1 Static loading 2 Dynamic loading 3 Dynamic linking 4 Multiprogramming
4 Overlays 21) A critical region
7) In the blocked state 1 is a piece of code which only one process executes at a
1 the processes waiting for I/O are found time 2 is a region prone to deadlock
2 the process which is running is found 3 is a piece of code which only a finite number of processes
3 the processes waiting for the processor are found execute 4 is found only in Windows NT operation system
4 none of the above 22) The mechanism that bring a page into memory only
8) What is the memory from 1K - 640K called ? when it is needed is called _____________
1 Extended Memory 2 Normal Memory 1 Segmentation 2 Fragmentation 3 Demand Paging
3 Low Memory 4 Conventional Memory 4 Page Replacement
9) Virtual memory is __________. 23) PCB =
1 An extremely large main memory 1 Program Control Block 2 Process Control Block
2 An extremely large secondary memory 3 Process Communication Block 4 None of the above
3 An illusion of extremely large main memory 24) FIFO scheduling is ________.
4 A type of memory used in super computers. 1 Preemptive Scheduling 2 Non Preemptive Scheduling
10) The process related to process control, file 3 Deadline Scheduling 4 Fair share scheduling
management, device management, information about 25) Switching the CPU to another Process requires to save
system and communication that is requested by any higher state of the old process and loading new process state is
level language can be performed by __________. called as __________.
1 Editors 2 Compilers 3 System Call 4 Caching 1 Process Blocking 2 Context Switch
11) If the Disk head is located initially at 32, find the 3 Time Sharing 4 None of the above
number of disk moves required with FCFS if the disk queue 26) Which directory implementation is used in most
of I/O blocks requests are 98,37,14,124,65,67. Operating System?
1 310 2 324 3 315 4 321 1 Single level directory structure
12) Multiprogramming systems ________. 2 Two level directory structure
1 Are easier to develop than single programming systems 3 Tree directory structure
2 Execute each job faster 4 Acyclic directory structure
3 Execute more jobs in the same time 27) The Bankers algorithm is used
4 Are used only on large main frame computers 1 to prevent deadlock in operating systems
 GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 4003132 (M) 9837253111, 9837464507 Operating System Spcl Assignment
2 to detect deadlock in operating systems
3 to rectify a deadlocked state 4 none of the above
28) A thread
1 is a lightweight process where the context switching is
low
2 is a lightweight process where the context swithching is
high
3 is used to speed up paging 4 none of the above
29) ______ is a high level abstraction over Semaphore.
1 Shared memory 2 Message passing 3 Monitor
4 Mutual exclusion
30) A tree sturctured file directory system
1 allows easy storage and retrieval of file names
2 is a much debated unecessary feature
3 is not essential when we have millions of files
4 none of the above
31. Translator for low level programming language were
termed as
(A) Assembler (B) Compiler (C) Linker (D) Loader
32. Analysis which determines the meaning of a statement
once its grammatical structure becomes known is termed as
(A) Semantic analysis (B) Syntax analysis
(C) Regular analysis (D) General analysis
33.Load address for the first word of the program is called
(A) Linker address origin (B) load address origin
(C) Phase library (D) absolute library
34. Symbolic names can be associated with
(A) Information (B) data or instruction
(C) operand (D) mnemonic operation
35. The translator which perform macro expansion is called a
(A) Macro processor (B) Macro pre-processor
(C) Micro pre-processor (D) assembler
36 Shell is the exclusive feature of
(A) UNIX (B) DOS (C) System software
(D) Application software
37. A program in execution is called
(A) Process (B) Instruction (C) Procedure (D) Function
38. Interval between the time of submission and completion of
the job is called
(A) Waiting time (B) Turnaround time
(C) Throughput (D) Response time
39. A scheduler which selects processes from secondary
storage device is called
(A) Short term scheduler. (B) Long term scheduler.
(C) Medium term scheduler (D) Process scheduler.
40. The scheduling in which CPU is allocated to the process
with least CPU-burst time is called
(A) Priority Scheduling (B) Shortest job first Scheduling
(C) Round Robin Scheduling
(D) Multilevel Queue Scheduling
41. The term page traffic describes
(A) number of pages in memory at a given instant.
(B) number of papers required to be brought in at a given
page request.
(C) the movement of pages in and out of memory.
(D) number of pages of executing programs loaded in
memory.
42. The turn-around time of a user job is the
(A) time since its submission to the time its results become
available.
(B) time duration for which the CPU is allotted to the job.
(C) total time taken to execute the job.
(D) time taken for the job to move from assembly phase to
completion phase.
43. Which of the following can be used as a criterion for
classification of data structures used in language processing.
(A) nature of a data structure
(B) purpose of a data structure
(C) lifetime of a data structure (D) all of the above.
44. Memory utilization factor shall be computed as follows
(A) memory in use/allocated memory.
(B) memory in use/total memory connected.
(C) memory allocated/free existing memory.
(D) memory committed/total memory available
45. Program preemption is
(A) forced de allocation of the CPU from a program which is
executing on the CPU.
(B) release of CPU by the program after completing its task.
(C) forced allotment of CPU by a program to itself.
(D) a program terminating itself due to detection of an error.
46. An assembler is
(A) programming language dependent.
(B) syntax dependant. (C) machine dependant.
(D) data dependant.
47.Which of the following is not a fundamental process state
(A) ready (B) terminated (C) executing (D) blocked
48. LRU page replacement policy is
(A) Last Replaced Unit. (B) Last Restored Unit.
(C) Least Recently Used. (D) Least Required Unit.
49. Which of the following is true?
(A) Block cipher technique is an encryption technique.
(B) Steam cipher technique is an encryption technique.
(C) Both (A) and (B). (D) Neither of (A) and (B).
50. Which of the following approaches do not require
knowledge of the system state?
(A) deadlock detection (B) deadlock prevention.
(C) deadlock avoidance. (D) none of the above.
51. Program generation activity aims at
(A) Automatic generation of program
(B) Organize execution of a program written in PL
(C) Skips generation of program
(D) Speedens generation of program
52. Which amongst the following is not an advantage of
Distributed systems?
(A) Reliability (B) Incremental growth
(C) Resource sharing (D) None of the above
53. An imperative statement
(A) Reserves areas of memory and associates names with
them
(B) Indicates an action to be performed during execution of
assembled program
(C) Indicates an action to be performed during optimization
(D) None of the above
 GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 4003132 (M) 9837253111, 9837464507 Operating System Spcl Assignment
54. Which of the following loader is executed when a system (C) where shared resources are accessed.
is first turned on or restarted (D) which must be enclosed by a pair of semaphore
(A) Boot loader (B) Compile and Go loader operations, P and V.
(C) Bootstrap loader (D) Relating loader 67. An operating system contains 3 user processes each
55. Poor response time is usually caused by requiring 2 units of resource R .The minimum number of units
(A) Process busy (B) High I/O rates of R such that no deadlocks will ever arise is
(C) High paging rates (D) Any of the above (A) 4. (B) 3. (C) 5. (D) 6.
56. Throughput of a system is 68. Locality of reference implies that the page reference being
(A) Number of programs processed by it per unit time made by a process
(B) Number of times the program is invoked by the system (A) will always be to the page used in the previous page
(C) Number of requests made to a program by the system reference.
(D) None of the above (B) is likely to be the one of the pages used in the last few
57. The blocking factor of a file is page references.
(A) The number of blocks accessible to a file (C) will always be to one of the pages existing in memory.
(B) The number of blocks allocated to a file (D)will always lead to a page fault.
(C) The number of logical records in one physical record 69.Which of these is not a part of Synthesis phase
(D) None of the above (A)Obtain machine code corresponding to the mnemonic from
58. Which of these is a component of a process precedence the Mnemonics table
sequence? (B) Obtain address of a memory operand from the symbol
(A) Process name (B) Sequence operator ; table (C) Perform LC processing
(C) Concurrency operator , (D) All of the above (D) Synthesize a machine instruction or the machine form of a
59. Which amongst the following is valid syntax of the Fork constant
and Join Primitive? 70.The syntax of the assembler directive EQU is
(A) Fork <label> (B) Fork <label>Join <var> (A) EQU <address space>
(C) For <var> (D) Fork <var> (B) <symbol>EQU<address space>
60. Nested Macro calls are expanded using the (C) <symbol>EQU (D) None of the above
(A) FIFO rule (First in first out) 71. The following features are needed to implement top down
(B) LIFO (Last in First out) parsing
(C) FILO rule (First in last out) (D) None of the above (A) Source string marker (B) Prediction making mechanism
61. A parser which is a variant of top-down parsing without (C) Matching and Backtracking mechanism
backtracking is (D) All of the above
(A) Recursive Descend. (B) Operator Precedence. 72. A macro definition consists of
(C) LL(1) parser. (D) LALR Parser. (A) A macro prototype statement
62. The expansion of nested macro calls follows (B) One or more model statements
(A) FIFO rule.(B) LIFO rule (C) LILO rule. (C) Macro pre-processor statements (D) All of the above
(D) priority rule. 73. The main reason to encrypt a file is to _________.
63.In a two-pass assembler, the task of the Pass II is to (A) Reduce its size (B) Secure it for transmission
(A) separate the symbol, mnemonic opcode and operand (C) Prepare it for backup
fields. (B) build the symbol table. (D) Include it in the start-up sequence
(C) construct intermediate code 74. Which of the following is not a key piece of information,
(D) synthesize the target program. stored in single page table
64. A linker program entry, assuming pure paging and virtual memory
(A) places the program in the memory for the purpose of (A) Frame number
execution. (B) A bit indicating whether the page is in physical memory or
(B) relocates the program to execute from the specific on the disk
memory area allocated to it. (C) A reference for the disk block that stores the page
(C) links the program with other programs needed for its (D) None of the above
execution. 75. A UNIX device driver is
(D) interfaces the program with the entities generating its (A) Structured into two halves called top half and bottom half
input data. (B) Three equal partitions
65. Which scheduling policy is most suitable for a time-shared (C) Unstructured (D)None of the above
operating system 76.The following is not a layer of IO management module
(A) Shortest-job First. (B) Elevator. (C) Round-Robin. (A) PIOCS (Physical Input Output Control System)
(D) First-Come-First-Serve. (B) LIOCS (Logical Input Output Control System)
66. A critical section is a program segment (C) FS (File System)
(A) which should run in a certain specified amount of time. (D) MCS (Management Control System)
(B) which avoids deadlocks.
 GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 4003132 (M) 9837253111, 9837464507 Operating System Spcl Assignment
77. Which amongst the following is not a valid page
replacement policy?
(A) LRU policy (Least Recently Used)
(B) FIFO policy (First in first out)
(C) RU policy (Recurrently used)
(D) Optimal page replacement policy
78. Consider a program with a linked origin of 5000. Let the
memory area allocated to it have the start address of 70000.
Which amongst the following will be the value
to be loaded in relocation register?
(A) 20000 (B) 50000 (C) 70000 (D) 90000
79. An assembly language is a
(A) low level programming language
(B) Middle level programming language
(C) High level programming language
(D) Internet based programming language
80. TII stands for
(A) Table of incomplete instructions
(B) table of information instructions
(C) translation of instructions information
(D) translation of information instruction
81.An analysis, which determines the syntactic structure of
the source statement, is called
(A) Sementic analysis (B) process analysis
(C) Syntax analysis (D) function analysis
82 Action implementing instructions meaning are a actually
carried out by
(A) Instruction fetch (B) Instruction decode
(C) instruction execution (D) Instruction program
83 The field that contains a segment index or an internal
index is called
(A) target datum (B) target offset
(C) segment field (D) fix dat
84. A program in execution is called
(A) process (B) function (C) CPU (D) Memory
85. Jobs which are admitted to the system for processing is
called
(A) long-term scheduling (B) short-term scheduling
(C) medium-term scheduling (D) queuing
86 A set of techniques that allow to execute a program which
is not entirely in memory is called
(A) demand paging (B) virtual memory
(C) auxiliary memory (D) secondary memory
87. SSTF stands for
(A) Shortest-Seek-time-first scheduling
(B) small small-time-first (C) simple-seek-time-first (D)
small-simple-time-first scheduling
88. Before proceeding with its execution, each process must
acquire all the resources it needs is called
(A) hold and wait (B) No pre-emption
(C) circular wait (D) starvation
89. Virtual memory is
(A) simple to implement
(B) used in all major commercial operating systems
(C) less efficient in utilization of memory
(D) useful when fast I/O devices are not available
90. Relocation bits used by relocating loader are specified by
(A) Relocating loader itself (B) Assembler or Translator
(C) Macro processor (D) Both (A) and (B)
91. Resolution of externally defined symbols is performed by
(A) Linker (B) Loader (C) Compiler (D) Editor
92. Relocatable programs
(A) cannot be used with fixed partitions
(B) can be loaded almost anywhere in memory
(C) do not need a linker
(D) can be loaded only at one specific location
93. Page stealing
(A) is a sign of efficient system
(B) is taking page frames other working sets
(C) should be the tuning goal
(D) is taking larger disk spaces for pages paged out
94. The total time to prepare a disk drive mechanism for a
block of data to be read from is its
(A) latency (B) latency plus transmission time
(C) latency plus seek time
(D) latency plus seek time plus transmission time
95. To avoid race condition, the maximum number of
processes that may simultaneously inside the critical section
is
(A) zero (B) one (C) two (D) more than two
96. The memory allocation scheme subject to external
fragmentation is
(A) segmentation (B) swapping
(C) pure demand paging (D) multiple fixed contiguous
partitions
97. Page fault frequency in an operating system is reduced
when the
(A) processes tend to the I/O-bound
(B) size of pages is reduced
(C) processes tend to be CPU-bound
(D) locality of reference is applicable to the process
98.In which of the following page replacement policies
Baladys anomaly occurs?
(A) FIFO (B) LRU (C) LFU (D) NRU
99. Which of the following are language processors?
(A) Assembler (B) Compiler (C) Interpreter
(D) All of the above
100.Virtual memory can be implemented with
(A) Segmentation (B) Paging (C) None (D) all of the above
101. Recognition of basic syntactic constructs through
reductions, this task is performed by
(A) Lexical analysis (B) Syntax analysis
(C) Semantic analysis (D) Structure analysis
102. A grammar for a programming language is a formal
description of
(A) Syntax (B) Semantics (C) Structure (D) Code
103._______ is a technique of temporarily removing inactive
programs from the memory of computer system
(A) Swapping (B) Spooling (C) Semaphore (D) Scheduler
104______ is a technique of improving the priority of process
waiting in Queue for CPU allocation
(A) Starvation (B) Ageing (C) Revocation (D) Relocation
 GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 4003132 (M) 9837253111, 9837464507 Operating System Spcl Assignment
105._______ is the time required by a sector to reach below
read/write head.
(A) Seek Time (B) Latency Time (C) Access time (D) None
106. Which of the following is most general phase structured
grammar?
(A) Context Sensitive (B) Regular
(C) Context Free (D) None of the above
107 File record length
(A) Should always be fixed (B) Should always be variable
(C) Depends upon the size of file
(D) Should be chosen to match the data characteristics.
108. A public key encryption system
(A) Allows only the correct receiver to decode the data
(B) Allows only one to decode the transmission.
(C) Allows only the correct sender to decode the data.
(D) Does not encode the data before transmitting it.

Answer Sheet:
1.1 2.1 3.4 4.2 5.2 6.3 7.1 8.4
9.3 10.3 11.4 12.3 13.4 14.2 15.1 16.2
17.2 18.1 19.4 20.4 21.1 22.3 23.2 24.2
25.2 26.3 27.1 28.1 29.3 30.1 31.1 32.a
33.b 34.b 35.b 36.a 37.a 38.b 39.c 40.b
41.c 42.c 43.d 44.b 45.a 46.c 47.d 48.c
49.c 50.d 51.a 52.a 53.b 54.c 55.d 56.a
57.c 58.d 59.a 60.b 61.a 62.b 63.d 64.c
65.c 66.c 67.a 68.b 69.c 70.b 71.d 72.d
73.b 74.c 75.a 76.d 77.c 78. 79.a 80.a
81.c 82.c 83.a 84.a 85.a 86.b 87.a 88.a
89.b 90.b 91.a 92.b 93.b 94.c 95.b 96.a
97.d 98.a 99.d 100.d 101.b 102.c 103.a 104.b
105.b 106.a 107.d 108.a