1) Round robin scheduling is essentially the preemptive version of ________.

1 FIFO
2 Shortest job first
3 Shortest remaining
4 Longest time first

2) A page fault occurs

1 when the page is not in the memory
2 when the page is in the memory
3 when the process enters the blocked state
4 when the process is in the ready state

3) Which of the following will determine your choice of systems software for your computer ?
1 Is the applications software you want to use compatible with it ?
2 Is it expensive ?
3 Is it compatible with your hardware ?
4 Both 1 and 3

4) Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements
wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above
situation depicts a _________ .
1 Semaphore
2 Deadlock
3 Signal
4 Interrupt

5) What is a shell ?
1 It is a hardware component
2 It is a command interpreter
3 It is a part in compiler
4 It is a tool in CPU scheduling

6) Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The
main program is loaded into memory & is executed. This type of loading is cal led _________
1 Static loading
2 Dynamic loading
3 Dynamic linking
4 Overlays
7) In the blocked state
1 the processes waiting for I/O are found
2 the process which is running is found
3 the processes waiting for the processor are found
4 none of the above

8) What is the memory from 1K - 640K called ?

1 Extended Memory
2 Normal Memory
3 Low Memory
4 Conventional Memory

9) Virtual memory is __________.

1 An extremely large main memory
2 An extremely large secondary memory
3 An illusion of extremely large main memory
4 A type of memory used in super computers.

10) The process related to process control, file management, device management, information about
system and communication that is requested by any higher level language can be performed by
__________.
1 Editors
2 Compilers
3 System Call
4 Caching

11) If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk
queue of I/O blocks requests are 98,37,14,124,65,67.
1 310
2 324
3 315
4 321

12) Multiprogramming systems ________.

1 Are easier to develop than single programming systems
2 Execute each job faster
3 Execute more jobs in the same time
4 Are used only on large main frame computers

13) Which is not the state of the process ?

1 Blocked
2 Running
3 Ready
4 Privileged

14) The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
1 The statement is false
2 The statement is true.
3 The statement is contradictory.
4 None of the above

15) The problem of thrashing is effected scientifically by ________.

1 Program structure
2 Program size
3 Primary storage size
4 None of the above

16) The state of a process after it encounters an I/O instruction is __________.

1 Ready
2 Blocked/Waiting
3 Idle
4 Running

17) The number of processes completed per unit time is known as __________.
1 Output
2 Throughput
3 Efficiency
4 Capacity

18) _________ is the situation in which a process is waiting on another process,which is also waiting on
another process ... which is waiting on the first process. None of the processes involved in this circular
wait are making progress.
1 Deadlock
2 Starvation
3 Dormant
4 None of the above

19) Which of the following file name extension suggests that the file is Backup copy of another file ?
1 TXT
2 COM
3 BAS
4 BAK
20) Which technique was introduced because a single job could not keep both the CPU and the I/O
devices busy?
1 Time-sharing
2 SPOOLING
3 Preemptive scheduling
4 Multiprogramming

21) A critical region

1 is a piece of code which only one process executes at a time
2 is a region prone to deadlock
3 is a piece of code which only a finite number of processes execute
4 is found only in Windows NT operation system

22) The mechanism that bring a page into memory only when it is needed is called _____________
1 Segmentation
2 Fragmentation
3 Demand Paging
4 Page Replacement

23) PCB =
1 Program Control Block
2 Process Control Block
3 Process Communication Block
4 None of the above

24) FIFO scheduling is ________.

1 Preemptive Scheduling
2 Non Preemptive Scheduling
3 Deadline Scheduling
4 Fair share scheduling

25) Switching the CPU to another Process requires to save state of the old process and loading new
process state is called as __________.
1 Process Blocking
2 Context Switch
3 Time Sharing
4 None of the above

26) Which directory implementation is used in most Operating System?

1 Single level directory structure
2 Two level directory structure
3 Tree directory structure
4 Acyclic directory structure

27) The Banker’s algorithm is used

1 to prevent deadlock in operating systems
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 switching 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- structured file directory system

1 allows easy storage and retrieval of file names
2 is a much debated unnecessary feature
3 is not essential when we have millions of files
4 none of the above

Q.1 Translator for low level programming language were termed as

(A) Assembler (B) Com piler
(C) Linker (D) Loader
Ans: ( A)
Q.2 Analysis which determines the meaning of a statement once its gramm atical structure
becom es known is term ed as
(A) Sem antic analysis (B) Syntax analysis
(C) Regular analysis (D) General analysis
Ans: ( A)
Q.3 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
Ans: (B)
Q.4 Symbolic names can be associated with
(A) Inform ation (B) data or instruction
(C) operand (D) mnemonic operation
Ans: (B)
Q.5 The translator which perform m acro expansion is called a
(A) Macro processor (B) Macro pre-processor
(C) Micro pre-processor (D) assembler
Ans: (B)
Q.6 Shell is the exclusive feature of
(A) UNIX (B) DOS
(C) System software (D) Application software
Ans: ( A)
Q.7 A program in execution is called
(A) Process (B) Instruction
(C) Procedure (D) Function
DC14 Syste m Software and Operating Syste m
2
Ans: ( A)
Q.8 Interval between the time of subm ission and completion of the job is
called
(A) Waiting time (B) Turnaround time
(C) Throughput (D) Response time
Ans: (B)
Q.9 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.
Ans: (C)
Q.10 The scheduling in which CPU is allocated to the process with leas t CPU-burst time
is called
(A) Priority Scheduling (B) Shortest job first Scheduling
(C) Round Robin Scheduling (D) Multilevel Queue Scheduling
Ans: (B)
Q.11 The term „page traffic‟ describes
(A) number of pages in mem ory 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.
Ans: (C)
Q.12 The “turn-around” time of a user job is the
(A) tim e since its submission to the time its results become available.
(B) tim e duration for which the CPU is allotted to the job.
(C) total tim e taken to execute the job.
(D) tim e taken for the job to move from assem bly phase to com pletion phase.
Ans: (C)
Q.13 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.
Ans: (D)
Q.14 Memory utilization factor shall be com puted as follows
(A) memory in use/allocated mem ory.
(B) memory in use/total memory connected.
(C) memory allocated/free existing memory.
(D) memory committed/total m emory available.
DC14 Syste m Software and Operating Syste m
3
Ans: (B)
Q.15 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 com pleting its task.
(C) forced allotment of CPU by a program to itself.
(D) a program terminating itself due to detection of an error.
Ans: ( A)
Q.16 An assembler is
(A) programming language dependent.
(B) syntax dependant.
(C) machine dependant.
(D) data dependant.
Ans: (C)
Q.17 Which of the following is not a fundamental process state
(A) ready (B) terminated
(C) executing (D) blocked
Ans: (D)
Q.18 „LRU‟ page replacement policy is
(A) Last Replaced Unit. (B) Last Restored Unit.
(C) Least Recently Used. (D) Least Required Unit.
Ans: (C)
Q.19 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).
Ans: (C)
Q.20 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.
Ans: (D)
Q.21 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
DC14 Syste m Software and Operating Syste m
4
Ans: ( A)
Q.22 Which amongst the following is not an advantage of Distributed systems?
(A) Reliability (B) Incremental growth
(C) Resource sharing (D) None of the above
Ans: ( A)
Q.23 An imperative statement
(A) Reserves areas of m emory and associates names with them
(B) Indicates an action to be perform ed during execution of assembled program
(C) Indicates an action to be perform ed during optimization
(D) None of the above
Ans: (B)
Q.24 Which of the following loader is executed when a system is first turned on or
restarted
(A) Boot loader (B) Com pile and Go loader
(C) Bootstrap loader (D) Relating loader
Ans: (C)
Q.25 Poor response tim e is usually caused by
(A) Process busy
(B) High I/O rates
(C) High paging rates
(D) Any of the above
Ans: (D)
Q.26 “Throughput” of a system is
(A) Number of programs processed by it per unit time
(B) Number of times the program is invoked by the system
(C) Number of requests made to a program by the system
(D) None of the above
Ans: ( A)
Q.27 The “blocking factor” of a file is
(A) The num ber of blocks accessible to a file
(B) The num ber of blocks allocated to a file
(C) The num ber of logical records in one physical record
(D) None of the above
Ans: (C)
Q.28 Which of these is a component of a process precedence sequence?
(A) Process nam e (B) Sequence operator „;‟
(C) Concurrency operator „,‟ (D) All of the above
DC14 Syste m Software and Operating Syste m
5
Ans: (D)
Q.29 Which amongst the following is valid syntax of the Fork and Join Prim itive?
(A) Fork <label> (B) Fork <label>
Join <var> Join <label>
(C) For <var> (D) Fork <var>
Join <var> join <var>
Ans: ( A)
Q.30 Nested Macro calls are expanded using the
(A) FIFO rule (First in first out) (B) LIFO (Last in First out)
(C) FILO rule (First in last out) (D) None of the above
Ans: (B)
Q.31 A parser which is a variant of top-down parsing without backtracking is
(A) Recursive Descend. (B) Operator Precedence.
(C) LL(1) parser. (D) LALR Parser.
Ans: ( A)
Q.32 The expansion of nested macro calls follows
(A) FIFO rule. (B) LIFO rule.
(C) LILO rule. (D) priority rule.
Ans: (B)
Q.33. In a two-pass assembler, the task of the Pass II is to
(A) separate the sym bol, m nemonic opcode and operand
fields.
(B) build the symbol table.
(C) construct intermediate code.
(D) synthesize the target program.
Ans: (D)
Q.34 A linker program
(A) places the program in the mem ory for the purpose of execution.
(B) relocates the program to execute from the specific mem ory area
allocated to it.
(C) links the program with other programs needed for its execution.
(D) interfaces the program with the entities generating its input data.
Ans: (C)
Q.35 Which scheduling policy is most suitable for a time-shared operating system
(A) Shortest-job First. (B) Elevator.
(C) Round-Robin. (D) First-Come-First-Serve.
Ans: (C)
DC14 Syste m Software and Operating Syste m
6
Q.36 A critical section is a program segment
(A) which should run in a certain specified amount of tim e.
(B) which avoids deadlocks.
(C) where shared resources are accessed.
(D) which must be enclosed by a pair of semaphore operations, P and V.
Ans: (C)
Q.37 An operating system contains 3 user processes each requiring 2 units of resource
R .The minim um number of units of R such that no deadlocks will ever arise is
(A) 4. (B) 3.
(C) 5. (D) 6.
Ans: ( A)
Q.38 Locality of reference im plies that the page reference being made by a process
(A) will always be to the page used in the previous page reference.
(B) is likely to be the one of the pages used in the last few page references .
(C) will always be to one of the pages existing in memory.
(D)will always lead to a page fault.
Ans: (B)
Q.39 Which of these is not a part of Synthesis phase
(A) Obtain machine code corresponding to the mnemonic from the
Mnemonics table
(B) Obtain address of a memory operand from the symbol table
(C) Perform LC processing
(D) Synthesize a machine instruction or the machine form of a constant
Ans: (C)
Q.40 The syntax of the assembler directive EQU is
(A) EQU <address space> (B) <symbol>EQU<address space>
(C) <symbol>EQU (D) None of the above
Ans: (B)
Q.41 The following features are needed to im plem ent top down parsing
(A) Source string m arker
(B) Prediction making mechanism
(C) Matching and Backtracking mechanism
(D) All of the above
Ans: (D)
Q.42 A macro definition consists of
(A) A macro prototype statem ent (B) One or more model statements
(C) Macro pre-processor statements (D) All of the above
DC14 Syste m Software and Operating Syste m
7
Ans: (D)
Q.43 The m ain reason to encrypt a file is to ______________.
(A) Reduce its size (B) Secure it for transmission
(C) Prepare it for backup (D) Include it in the start-up sequence
Ans: (B)
Q.44 Which of the following is not a key piece of information, stored in single page table
entry, assuming pure paging and virtual mem ory
(A) Frame num ber
(B) A bit indicating whether the page is in physical memory or on the disk
(C) A reference for the disk block that stores the page
(D) None of the above
Ans: (C)
Q.45 A UNIX device driver is
(A) Structured into two halves called top half and bottom half
(B) Three equal partitions
(C) Unstructured
(D) None of the above
Ans: ( A)
Q.46 The following is not a layer of IO managem ent module
(A) PIOCS (Physical Input Output Control System)
(B) LIOCS (Logical Input Output Control System)
(C) FS (File System)
(D) MCS (Managem ent Control System)
Ans: (D)
Q.47 Which amongst the following is not a valid page replacem ent policy?
(A) LRU policy (Least Recently Used)
(B) FIFO policy (First in first out)
(C) RU policy (Recurrently used)
(D) Optimal page replacem ent policy
Ans: (C)
Q.48 Consider a program with a linked origin of 5000. Let the memory ar ea 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
Ans: (None of the above choice in correct. )
Q.49 An assembly language is a
(A) low level programming language
DC14 Syste m Software and Operating Syste m
8
(B) Middle level programming language
(C) High level programming language
(D) Internet based programming language
Ans: ( A)
Q.50 TII stands for
(A) Table of incom plete instructions
(B) table of information instructions
(C) translation of instructions inform ation
(D) translation of inform ation instruction
Ans: ( A)
Q.51 An analysis, which determines the syntactic structure of the source statement, is
called
(A) Sem entic analysis (B) process analysis
(C) Syntax analysis (D) function analysis
Ans: (C)
Q.52 Action implementing instruction‟s meaning are a actually carried out by
(A) Instruction fetch
(B) Instruction decode
(C) instruction execution
(D) Instruction program
Ans: (C)
Q.53 The field that contains a segm ent index or an internal index is called
(A) target datum (B) target offset
(C) segm ent field (D) fix dat
Ans: ( A)
Q.54 A program in execution is called
(A) process (B) function
(C) CPU (D) Memory
Ans: ( A)
Q.55 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
Ans: ( A)
Q.56 A set of techniques that allow to execute a program which is not entirely in mem ory
is called
(A) demand paging (B) virtual m emory
(C) auxiliary mem ory (D) secondary m emory
DC14 Syste m Software and Operating Syste m
9
Ans: (B)
Q. 57 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
Ans: ( A)
Q.58 Before proceeding with its execution, each process must acquire all the resources
it needs is called
(A) hold and wait (B) No pre-em ption
(C) circular wait (D) starvation
Ans: ( A)
Q.59 Virtual m emory 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
Ans: (B)
Q.60 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)
Ans: (B)
Q.61 Resolution of externally defined symbols is performed by
(A) Linker (B) Loader
(C) Compiler (D) Editor
Ans: ( A)
Q.62 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
Ans: (B)
Q.63 Page stealing
(A) is a sign of efficient system
(B) is taking page fram es other working sets
(C) should be the tuning goal
(D) is taking larger disk spaces for pages paged out
Ans: (B)
DC14 Syste m Software and Operating Syste m
10
Q.64 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
Ans: (C)
Q.65 To avoid race condition, the m aximum number of processes that m ay be
simultaneously inside the critical section is
(A) zero (B) one
(C) two (D) m ore than two
Ans: (B)
Q.66 The m emory allocation schem e subject to “external” fragm entation is
(A) segm entation (B) swapping
(C) pure demand paging (D) multiple fixed contiguous partitions
Ans: ( A)
Q.67 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
Ans: (D)
Q.68 In which of the following page replacem ent policies Balady‟s anomaly occurs?
(A) FIFO (B) LRU
(C) LFU (D) NRU
Ans: ( A)
Q.69 Which of the following are language processors?
(A) Assembler (B) Com piler
(C) Interpreter (D) All of the above
Ans: (D)
Q.70 Virtual m emory can be implemented with
(A) Segmentation (B) Paging
(C) None (D) all of the above
Ans: (D)
Q.71 Recognition of basic syntactic constructs through reductions, this task is performed
by
(A) Lexical analysis (B) Syntax analysis
DC14 Syste m Software and Operating Syste m
11
(C) Sem antic analysis (D) Structure analysis
Ans: (B)
Q.72 A grammar for a programming language is a formal description of
(A) Syntax (B) Semantics
(C) Structure (D) Code
Ans: (C)
Q.73 ___________ is a technique of tem porarily rem oving inactive programs from the
memory of computer system
(A) Swapping (B) Spooling
(C) Sem aphore (D) Scheduler
Ans: ( A)
Q.74 ___________ is a technique of improving the priority of process waiting in Queue
for CPU allocation
(A) Starvation (B) Ageing
(C) Revocation (D) Relocation
Ans: (B)
Q.75 ________ is the time required by a sector to reach below read/write head.
(A) Seek Time (B) Latency Tim e
(C) Access time (D) None
Ans: (B)
Q.76 Which of the following is m ost general phase structured grammar?
(A) Context – Sensitive (B) Regular
(C) Context – Free (D) None of the above
Ans: ( A)
Q.77 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.
Ans: (D)
Q.78 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.
Ans: ( A)