Friday 27 July 2012

BC0042 , BCA-3, Operating System

BCA-3---BC0042
OPERATING SYSTEM
PART-A
  1. A sequence of instruction telling the computer what to do is called :-
(A) Data                                (B) Code                                                (C) Program                        (D) All of these
  1. Code files can contain a _________________ a table indicating the names of all functions and global variables and the virtual addresses they correspond to
(A) Symbol table                                                                                 (B) Data table
(C) Instruction table                                                                            (D) Formal table
  1. The symbol table is used by the __________ when it combines several relocatable object files into a single executable code files.
(A) Loader                                                                                            (B) Assembler
(C) Linker                                                                                            (D) None of these
  1. An _____________ is software that hides lower level details and provides a set of higher level function.
(A) Threading                                                                                       (B) Synchronization
(C) Abstraction                                                                                   (D) Virtual
  1. An ________________ transforms the physical world of devices instruction, memory time into virtual world that is the result of abstraction.
(A) Hardware                                                                                       (B) Operating system
(C) Processor                                                                                        (D) Memory
  1. ___________________ system guarantees that critical task complete at a specific time.
(A) Soft – real – time                                                                          (B) Hard real time
(C) Time sharing                                                                                  (D) All of these
  1. _______________ provide the interface to running program and the operating system,
(A) System software                                                                           (B) System calls
(C) Kernel                                                                                             (D) None
  1. An operating system is ______________ software
(A) Application                                                                                    (B) System
(C) Both  A & B                                                                                   (D) None
  1. __________________ refers to a situation when single CPU divides its time between more than one job
(A) Multi processing                                                                            (B) Multi programming
(C) Time sharing                                                                                (D) Multitasking
  1. ________________ is not a multi programming operating system
(A) DOS                                                                                                 (B) Window XP
(C) UNIX                                                                                               (D) Window 98
  1. A ________________ can be defined as a program in execution
(A) Thread                                                                                            (B) Process
(C) Program code                                                                                (D) None
  1. Background process are called :-
(A) Exact clone                                                                                    (B) Fork
(C) Daemons                                                                                        (D) Operations
  1. In the ________________ the process cannot run, even if the CPU is available
(A) Ready state                                                                                    (B) Running state
(C) Blocked state                                                                                (D) New state
  1. What action is between running – ready
(A) Admitted                                                                                        (B) Scheduler dispatch
(C) Event completion                                                                         (D) None
  1. __________________ is used to store parameters and calling address for procedure
(A) User program                                                                                 (B) PCB
(C) System stack                                                                                 (D) User data
  1. ________________ is occurs when a process has executed its current time quantum active was allocated to is
(A) Memory fault                                                                                (B) CPU timing
(C) Clock interrupt                                                                            (D) None
  1. ______________ is occurs of the instruction being executed has any error or exception
(A) UNIX process                                                                                (B) Context switching
(C) I/o interrupt                                                                                    (D) Trap
  1. _______________ occurs when a process specifies that it is not to be move between processors
(A) Hard affinity                                                                                (B) Soft affinity
(C) Mixture of both                                                                             (D) None
  1. ___________ occurs when the system attempts to keep processes on the same processor but makes no guarantee
(A) Processor affinity                                                                          (B) Hard affinity
(C) Soft affinity                                                                                  (D) None
  1. _______________ is in which threads concept for the use of physical CPU’s
(A) Symmetric multithreading                                                          (B) Contention scope
(C) Load balancing                                                                             (D) Logical CIU
  1. A ________________ is a collection of processors that do not share memory
(A) Networking                                                                                     (B) Distributed system
(C) Secondary storage management                                               (D) None
  1. _______________ process the CPU output is not sent to the printer directly but is redirected to a disk file
(A) Spooling                                                                                         (B) Buffering
(C) Both A & B                                                                                    (D) None
  1. The delay between job submission and job completion is called _____________ time
(A) Overhead                                                                                        (B) Turnaround
(C) Waiting time                                                                                  (D) Response time
  1. A process that spends more of its time doing I/o is known as
(A) CPU bound                                                                                    (B) I/O bound
(C) Time bound                                                                                   (D) Process bound
  1. AS process enter the system, they are put into a
(A) ready queue                                                                                   (B) Waiting queue
(C) Job queue                                                                                      (D) Device queue
  1. If process is in blocked after wakeup process goes to __________ state
(A) Running                                                                                          (B) Ready
(C) Terminated                                                                                    (D) Both  B & C
  1. The PCB _____________ indicates the address of the next instruction to be executed for this process.
(A) Program counter                                                                         (B) Process state
(C) Register                                                                                           (D) None
  1. The major difficulty with the layered approach involves ___________ the various layers
(A) Lower – level layer                                                                       (B) Appropriately defining
(C) Careful planning                                                                           (D) CPU scheduling
  1. The process that modularized the kernel using the micro kernel approach is called.
(A) Operating system                                                                          (B) UNIX
(C) MACH                                                                                            (D) None of these
  1. The main advantage of the layered approach is
(A) Debugging                                                                                     (B) Device management
(C) H/W                                                                                                 (D) Correct functioning
  1. CPU scheduling is the basis of ______________  operating system
(A) Time sharing                                                                                  (B) Multi programmed
(C) Single user                                                                                      (D) None
  1. ______________ time is the sum of the periods spent waiting in the ready queue
(A) Turnaround                                                                                    (B) Response
(C) Waiting                                                                                          (D) All
  1. One measure of work is the number of processes that are completed per time unit called.
(A) CPU utilization                                                                              (B) Through put
(C) Turnaround time                                                                           (D) Waiting time
  1. In FCFS scheduling algorithm when the CPU is free, it is allocated to the process at the _____________ of the queue
(A) Tail                                                                                                  (B) Head
(C) Either  A & B                                                                                 (D) None
  1. Result of all algorithm of different process is represented by
(A) Structure chart                                                                               (B) Pie chart
(C) Gantt chart                                                                                    (D) PERT Chart
  1. In SJF algorithm if two process have the same length next CPU burst _____________ scheduling is used to break the tie
(A) Priority                                                                                            (B) FCFS
(C) RR                                                                                                   (D) All
  1. Communication between client program and the various service are provided by
(A) Servers                                                                                            (B) Message passing
(C) Micro kernel                                                                                   (D) User space
  1. A process may create a new process by executing system call
(A) Foreground process      (B) Clone                                               (C) Child process                 (D) None
  1. A process is said to be ______________ if it actually using CPU at that particular instant.
(A) Ready state                    (B) Running state                                (C) Waiting state                  (D) None
  1. The current mode information is stored in the _______________i.e. whether the processor is ruing in user mode.
(A) PSW                                (B) PWS                                                 (C) PCB                                 (D) SPW
  1. _______________ involves traversing the entire file system, marking everything that can be accessed.
(A) Garbage collection     (B) Symbol table                                 (C) Both A & B                    (D) None
  1. ______________involves the system scheduling kernel threads to run on one or more CPU.
(A) PCS                                  (B) SMT                                                (C) SCS                                  (D) SCP
  1. Continuous allocation suffer the problem of
(A) Internal fragmentation                                                                (B) External fragmentation
(C) Both A & B                                                                                    (D) None
  1. _____________________ allocation is similar to the paging scheme
(A) Continuous                    (B) Linked                                             (C) Indexed                          (D) All
  1. The free space list is implemented as a
(A) Bit map                           (B) Bit vector                                        (C) Both A & B                    (D) None
  1. In bit vector free space management if the block is allocated, the bit is
(A) 1                                       (B) 0                                                       (C) Either A & B                  (D) None
  1. A _______________ is abstract data type defined and implemented by the operating system
(A) Record                            (B) Drive                                                (C) File                                  (D) Directory
  1. __________________ is a technique that allover the execution of process that may not be completely in memory
(A) Main memory               (B) Swapping                                        (C) Virtual memory           (D) Demand paging
  1. Replace the page that will not be used for the longest period of time. Is ______________ algorithm
(A) FIFO                                (B) Optimal                                          (C) LRU                                 (D) Global
  1. Which programmed running at all time on the inputs
(A) Application program                                                                    (B) System program
(C) Operating system                                                                        (D) None of these
  1. The objective of ______________ is to switch the CPU among frequently that user can interact with each program while it in running
(A) Simple batch system                                                                    (B) Multi programming
(C) Time sharing system                                                                  (D) Real time system
  1. Which scheduling is performed in batch system
(A) Round robin scheduling                                                               (B) Priority scheduling
(C) First come first serve                                                                 (D) None of above
  1. Which system has more than 1 CPU in clock communication.
(A) Distributed system        (B) Parallel system                            (C) Real time system          (D) Multi programming batch
  1. A _______________ operating system reads a stream of separate jobs, each with its own control cards that predefined what the job does :-
(A) Group                              (B) Multi user                                       (C) Batch                              (D) Multi tasking
  1. If one site fails in a distributed system, the remaining sits can potentially continue operating this is ____
(A) Resource sharing           (B) Computation speedup                 (C) Reliability                     (D) Communication
  1. A common representation for a discussion of process scheduling is a _______________ diagram
(A) Queering                        (B) Processing                                       (C) Pictorial                           (D) None of these
  1. In UNIX a new processes created by the ______________ call.
(A) Scheduler                        (B) Fork system                                  (C) Queering                         (D) Any of these
  1. One solution to the problem of external fragmentation is __________
(A) Compaction                  (B) Paging                                             (C) Swapping                        (D) None
  1. Virtual memory is commonly is implemented by :-
(A) Demand paging             (B) Demand segmentation                (C) Both A & B                    (D) None
  1. For free space management ______________ approach used :-
(A) Bit vector                                                                                        (B) Linked list
(C) Both A & B                                                                                    (D) None
  1. A file is a sequence of
(A) Logical record                                                                             (B) Physical record
(C) Instruction                                                                                      (D) All
  1. ___________________ is set of method for ensuring that at least one of the necessary conditions cannot hold :-
(A) Dead lock prevention                                                                 (B) Hold and wait
(C) Mutual exclusion                                                                          (D) None
  1. At least one resource must be held in a non – sharable mode, that is only one process at a time can use the resource
(A) Mutual exclusion                                                                         (B) Hold and wait
(C) NO preemption                                                                              (D) Circular wait
  1. This scheduling similar to FCFS scheduling but preemption is added to switch between processes
(A) SJF                                   (B) Aging                                               (C) Round robin                  (D) Multi level
  1. ________________ is a technique of gradually increasing the priority of process that wait in the system for a long time
(A) SJF                                   (B) Aging                                              (C) Round robin                   (D) None
  1. Windows 2000 kernel mode has full access to the ______________- and _______________ of the computer and run code in a protected memory area.
(1) Hardware                                                                                        (2) Software
(3) System resources                                                                           (4) Kernel
(A) 1, 2                                   (B) 2, 3                                                   (C) 3, 4                                   (D) 1, 3
  1. ________________ handles plug and play and supports device detection and installation at boot time
(A) Process manager                                                                           (B) PnP manager
(C) Virtual memory manager                                                            (D) Power manager
  1. The window 2000 hardware abstraction layer is between the ___________ of the computer and rest of the operating system
(A) Logical software                                                                           (B) Port number
(C) Physical hardware      (D) I/O device only
  1. ____________________ short for inter process communication manager, this manages the communication between clients and server.
(A) SRM                                (B) IPC manager                                (C) PnP manager                 (D) None
  1. __________________ responsible for drawing windows and menus.
(A) Power manager                                                                             (B) Window manager
(C) GDI                                                                                                  (D) SRM
  1. The __________________ introduced strong encryption into the windows file world. 
(A) Encrypting file system                                                               (B) GDI
(C) NTFS                                                                                               (D) RAID
  1. _______________ multiple key strokes to one key to be ignored within a certain timeframe
(A) Filter key                                                                                         (B) Bounce keys
(C) Repeat keys                                                                                   (D) None
  1. ______________ are a group of key board related support for people with typing issues  
(A) Filter keys                                                                                     (B) Mouse keys
(C) Toggle keys                                                                                    (D) None
  1. A ______________ controller allows devices to transfer data to or from the system memory without the intervention of processor
(A) I/O                                   (B) DMA                                               (C) CPU                                 (D) Memory
  1. Accumulators index registers, stack pointer are all examples of _________
(A) Program counters                                                                          (B) CPU register
(C) Process states                                                                                 (D) None of these
  1. The long term scheduler controls the degree of :-
(A) Perfect ness                                                                                    (B) Accuracy
(C) Multi programming   (D) Computing 
  1. A ______________ is a part of program that accesses a shared resource that must not be concurrently accessed by more than one process of execution
(A) Critical section                                                                             (B) Race conditions
(C) Mutual exclusion                                                                          (D) Concurrency
  1. _______________ occurs when two or more execution flows are able to run simultaneously.
(A) Concurrency                                                                                 (B) Race condition
(C) Both A & B                                                                                    (D) None
  1. IN order for dead lock to occurs, which conditions must be true.
(A) Mutual exclusion                                                                          (B) Hold and wait
(C) No preemption                                                                              (D) All of these
  1. _____________ is a situation in which two or more processes continuously change their state in response to changes in the other process without doing useful work.
(A) Zumbies                                                                                          (B) Lovelock
(C) Dead lock                                                                                       (D) None
PART-B
  1. Each process is represented in the operating system by a : - 
(1) PCB                                  (2) TCB                                                 (3) PC                                     (4) DS
(A) 1, 2                                   (B) 2, 3                                                   (C) 3, 4                                   (D) 1
  1. The main advantage of the layered approach is simplicity of
(1) Planning                          (2) I/O                                                    (3) Construction                   (4) Debugging
(A) 1, 2                                   (B) 2, 3                                                   (C) 3, 4                                   (D) 1, 4
  1. A __________ system is a collection of processors that do not share memory or clock
(1) Real time                         (2) Parallel                                             (3) Distributed                      (4) Time sharing
(A) 2, 1                                   (B) 2, 4                                                   (C) 3                                       (D) None
  1. In priority scheduling equal priority processes are scheduled in
(1) SJF                                    (2) FCFS                                                (3) RR                                   
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) 2
  1. To maximize CPU utilization and through put and minimum
(1) Turnaround time                                                                           (2) Waiting time
(3) Response time                                                                                (4) Seeking time
(5) Latency time
(A) 1, 2, 4                              (B) 2, 3, 5                                              (C) 1, 2, 3                              (D) 4, 5
  1. Major problem of priority scheduling is
(1) Indefinite blocking                                                                        (2) Aging
(3) Starvation                                                                                       (4) Indefinite postponement
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 4                                   (D) 2, 4
  1. State true or false :-
(1) Multi programming features were superimposed on batch processing
(2) In multi programming system time elapsed between submitting a job and getting the result was unacceptably high.
(A) TF                                    (B) FT                                                    (C) TT                                   (D) FF
  1. The processors in the distributed system referred by a
(1) Sites                                  (2) Nodes                                               (3) Computers                     
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. State true or false :-
(1) Time sharing provide very poor response time to computer user
(2) A real time operating system is one which helps to fulfill the worst case response time requirement of an application
(A) TT                                    (B) TF                                                    (C) FT                                    (D) FF
  1. The operating system manages many kinds of activities ranging from user programs to system program like.
(1) Printer spooler                (2) Name server                                   (3) File serer                         
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. ___________________ is a large array of words or bytes
(1) Primary memory                                                                           (2) Main memory
(3) Cache memory
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. State true or false :- 
(1) Main memory provides storage that can be access directly by the CPU
(2) Program to be executed it must in the main memory.
(A) TF                                    (B) FT                                                    (C) TT                                   (D) FF
  1. State true or false :-
(1) A common interpreter is an interface of the operating system with the computer hardware
(2) The main function of a command interpreter is to get and execute the next user specified command
(A) TT                                    (B) TF                                                    (C) FF                                     (D) FT
  1. Super computer are the :-
(1) Fastest computers                                                                         (2) Very expensive
(3) Require immense amount of mathematical calculations
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. State true or false :-
(1) The components of a cluster are commonly, connected to each other through fast local area networks
(2) Linux is popularly used for computer clusters.
(A) TT                                   (B) TF                                                    (C) FT                                    (D) FF
  1. Main frames are still useful for some large scale tasks such as :-
(1) Centralized billing system                                                            (2) Inventory system
(3) Database system          
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. Each program requires an _______________ & produces _____________
(1) User detail                       (2) Input                                                (3) Process can output       
(A) 1, 2, 3                              (B) 2, 4                                                   (C) 2, 3                                   (D) 2, 4
  1. The kernel provides the
(1) File system                                                                                      (2) Memory management
(3) CPU scheduling                                                                              (4) Monolithic structure 
(A) 1, 2, 4                              (B) 2, 4                                                   (C) 3, 4                                   (D) All of these
  1. The process control subsystem contains
(1) Schedulers                                                                                       (2) Subsystem
(3) Memory management                                                                 (4) Inter – process communication
(A) 4                                       (B) 1, 3                                                   (C) 1, 2, 3                              (D) 1, 3, 4
  1. The PCB contains various attributes such as
(1) Process status                                                                                 (2) Control information
(3) Data structure                                                                                (4) User program
(A) 1, 2                                   (B) 2, 3                                                   (C) 2, 4                                   (D) 3, 4
  1. Balancing can be achieved through
(1) Push migration                                                                               (2) Pull migration
(3) Processor affinity                                                                          (4) Load balancing
(A) 1, 2                                   (B) 3, 4                                                   (C) 1                                       (D) 4
  1. ____________________ permits a program’s memory to be non contiguous, thus allowing a program to be allocated physical memory wherever it is available. 
(1) Swapping                        (2) Paging                                              (3) Segmentation                                
(A) 2, 3                                   (B) 2                                                       (C) Only 1                             (D) 1, 3
  1. Logical address consist of two parts in segmentation :-
(1) Segment number           (2) Logical number                              (3) Page number                                 
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. Each segment has :-
(1) Name                                                                                               (2) Length                            
(3) Address of first block    (4) Address of  last block
(A) 2, 3                                   (B) 1, 2                                                   (C) 2, 4                                   (D) None
  1. In linked allocation the directory contains
(1) Pointer of first block                                                                     (2) Pointer of second block
(3) Length of blocks                                                                            (4) Index number
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) 1, 4
  1. The major goal of as OS in to make computer system & computer hardware
(1) Convenient                                                                                     (2) Security
(3) Sufficient                                                                                        (4) Networking
(A) 1, 2                                   (B) 1, 3                                                   (C) 1, 4                                   (D) 2, 4
  1. The disadvantage of batch OS
(1) Non interactive environment                                                      (2) Off line debugging
(3) Spooling
(A) 1, 2                                   (B) 1, 3                                                   (C) 2, 3                                   (D) None of these
  1. The deal of ______________ is to keep in memory only those instruction and data that are needed at any given time :-
(1) Setup                                (2) Absolute                                          (3) Overlays                         
(A) 1, 2                                   (B) 2, 3                                                   (C) 3                                       (D) 2
  1. Allocate the smallest hole that is big enough this is ______________ fit
(1) First                                  (2) Best                                                  (3) Worst
(A) 1, 2                                   (B) 2, 3                                                   (C) 2                                       (D) 3
  1. A process is ______________ if it is ending more time paging than executing
(1) Demand paging             (2) Virtual memory                             (3) Thrashing
(A) Only 3                             (B) 1                                                       (C) 1, 3                                   (D) 2, 3
  1. Window 2008 kernel mode controls access to
(1) Scheduling                      (2) Memory management                 (3) Interaction with hardware
(A) 1, 2                                   (B) 2, 3                                                   (C) 1, 3                                   (D) All of these
  1. State true or false according to SJF algorithm for CPU scheduling
(1) SJF can be either preemptive or non – preemptive
(2) Preemptive SJF is sometime referred to as shortest remaining time first scheduling
(A) TT                                   (B) TF                                                    (C) FT                                    (D) FF
  1. State true or false:-
(1) Either the CPU or the I/o device can act as the talker or the listener
(2) When communicating with a terminal keyboard the CPU act as talker
(A) TT                                    (B) TF                                                    (C) FT                                    (D) FF
  1. State true or false :-
(1) System process is used to allocated instruction belong to kernel
(2) User processes is used to enter in the kernel
(A) TT                                    (B) TF                                                    (C) FT                                    (D) FF
  1. State true or false :-
(1) The parent and the child process having the same memory image
(2) Scheduler decides the running process
(A) TF                                    (B) FT                                                    (C) TT                                   (D) FF
  1. Operating system interact with the hardware hiding it from the _____________- and ________
(1) Hardware                        (2) User                                                  (3) System software            (4) Application program
(A) 1, 2                                   (B) 2, 4                                                   (C) 3, 4                                   (D) 2, 4
  1. UNIX kernel component divided into
(1) User mode                                                                                       (2) Operation mode
(3) Kernel mode                                                                                   (4) Hardware
(A) 1, 2, 3                              (B) 1, 3, 4                                              (C) 1, 2, 4                              (D) All of these
  1. Which transition occurs when scheduler decides that running process has run long enough
(1) Running – blocked                                                                        (2) Running – ready
(3) Blocked – ready                                                                            (4) Running – termination
  1. Process major pare are :-
(1) Controller                        (2) System stack                                  (3) User stake                       (4) PCB
(A) 1, 2                                   (B) 2, 3                                                   (C) 3, 4                                   (D) 2, 4
  1. A context is the contents of a CPU’s ______________ and ______________- at any point in time
(1) Program counter            (2) Register                                           
(3) Memory                          (4) Input / output devices
(A) 1, 2                                   (B) 2, 3                                                   (C) 3, 4                                   (D) 1, 4
  1. State true or false :-
(1) UNIX uses three categories of processes
(2) System processes run in kernel mode
(A) TT                                    (B) TF                                                    (C) FT                                    (D) FF
PART-C
  1. State true or false :-
(1) Super computer user its power in to executing a few programs as fast as possible
(2) Secondary storage consist of tapes
(3) Mainframes user its power into execute many program concurrently
(4) Super computers are the fastest computer.
(A) TFFT                               (B) TTFF                                               (C) FFTF                                (D) TTTT
  1. Match the following -
(1)
Para virtualization
(A)
A piece of computer S/W that isolates the application
(2)
Virtual machine
(B)
The VM doesn’t simulate H/W but instead offers a special API
(3)
Virtual environment
(C)
Host computer which can provide the capability to sharing
(4)
Hyper visor
(D)
H is created environment for running user level programs 
        (a) 1 – A, 2 – B, 3 – C, 4 – D                                                             (b) 1 – A, 2 – C, 3 – D, 4 – B
        (c) 1 – B, 2 – A, 3 – C, 4 – D                                                              (d) 1 – B, 2 – A, 3 – D, 4 – C 
  1. State true or false :-
(1) The memory management is not responsible for allocation
(2) Layered approach having seven layers
(3) The idea behind a VM is not to abstract the H/W of a computer
(A) TTF                  (B) FTF                                 (C) TTT                 (D) FFT
  1. Match the following -
(1)
Parallel system
(A)
Home – appliance controllers
(2)
Distributed system
(B)
Used when short response time is required
(3)
Real time system
(C)
Processors vary in size and function
(4)
Time sharing
(D)
These system are referred to as tightly coupled systems
        (a) 1 – D, 2 – C, 3 – A, 4 – B                                                             (b) 1 – B, 2 – C, 3 – D, 4 – B
        (c) 1 – C, 2 – D, 3 – B, 4 – A                                                              (d) 1 – C, 2 – B, 3 – A, 4 – D
  1. State true or false according to time sharing system :-
(1) An interactive system is used when a short response time is required
(2) An time shared operating system not uses CPU scheduling
(3) Each user has at least one separate program in memory
(4) This system defines master – slave relationship
(A) TFFT                               (B) TFFF                                (C) FTFT                               (D) TFTF
  1. State true or false according to simple batch system :-
(1) The definitive feature of a batch system is the lack of interaction between the user and the job while that job is executing
(2) In this execution, the CPU is often idle
(3) Spooling process in not used for processing data as remote sites
(4) Spooling overlaps the I/O of one jobs with the computation of other jobs
(A) TTTT                               (B) TTFT                              (C) TTFF                               (D) FFTT
  1. State true or false :-
(1) Mutual exclusion is one of the key problems in concurrent programming
(2) A process must block in its critical section.
(3) Critical section is carefully coded i.e. to avoid the possibility of infinite loop
(4) Mutual exclusion needs to be enforced only when processes access shared modifiable data
(A) TFTT                              (B) TTFT                               (C) TTFF                               (D) TFFF
  1. State true or false according to feature of multi level feedback queue scheduler
(1) The scheduling algorithm for each queue
(2) The method used to determine when to demote a process to a high priority queue
(3) The method used to determine when to up grade a process to lower priority queue.
(4) The number of queues increase
(A) FTFT                               (B) TFTF                              (C) FFTT                               (D) TTFF
  1. State true or false according to function of scheduler
(1) Switching context
(2) Switching to user mode
(3) Jumping to the proper location in the user program to restart the program
(4) Dispatcher select from among the processes n memory that are ready to execute and allocates the CPU to one of them.
(A) TTTT                               (B) TFTF                               (C) TFTT                               (D) TTTF
  1. If scheduling takes place only under conditions _______________ the system is said to be non – preemptive or cooperative
(1) When a process switches from the running state to the waiting state
(2) When a process switches from the running state to the ready state
(3) When a process switches from the waiting state to the ready state
(4) When a process terminates
(A) 1, 2                                   (B) 2, 3                                   (C) 1, 4                                   (D) 3, 4
  1. Match the following -
Process
Burst time
P1
P2
P3
24
3
3
         (A) 17                                    (B) 18                                     (C) 16.5                 (D) 20
  1. Match the following -
(1)
Normal exit
(A)
Caused by process due to a bug in program
(2)
Fatal error
(B)
Executes a system call, it terminate the some other process
(3)
Error exit
(C)
The process has done their i.e. are terminated
(4)
Killed by another process
(D)
When process discovers fatal error
        (a) 1 – B, 2 – C, 3 – A, 4 – D                                                             (b) 1 – C, 2 – A, 3 – B, 4 – D
        (c) 1 – C, 2 – D, 3 – B, 4 – A                                                              (d) 1 – B, 2 – D, 3 – A, 4 – C 
  1. Match the following -
(1)
Waiting time
(A)
Process complete per unit time
(2)
Through put
(B)
Time required for a particular process to complete
(3)
CPU utilization
(C)
Time taken in an interactive program the issuance of a command
(4)
Response time
(D)
Time processes spend in the ready queue
(5)
Turnaround
(E)
How much CPU utilize
        (a) 1 – C, 2 – B, 3 – E, 4 – D, 5 – A                                  (b) 1 – D, 2 – A, 3 – E, 4 – C, 5 – B
        (c) 1 – B, 2 – C, 3 – E, 4 – A, 5 – D                                                  (d) 1 – D, 2 – B, 3 – E, 4 – A, 5 – A
  1. State true or false according to virtual memory :-
(1) Virtual memory is the separation of user logical memory form physical memory
(2) Virtual memory makes the task of programming much easier
(3) Virtual memory is only implemented by demand paging
(4) Virtual memory is easy to implement however and may substantially increase performance it is used.
(A) TTFT                               (B) TFFT                                               (C) TTFF                              (D) FTTT
  1. State true or false according to dead lock detection
(1) Read only resources are good example of a sharable resource
(2) To ensure that hold and wait condition never occur in the system we must guarantee that whenever process request a resource, it does hold any other resource
(3) Resource utilization may be low and starvation both are disadvantages of protocol used in circular wait condition.
(A) TTF                                 (B) TFF                                                  (C) FTF                                  (D) FFT
  1. Match the following -
(1)
Time sharing system
(A)
Defines master slave
(2)
Symmetric system
(B)
Many user simultaneously share the computer
(3)
Asymmetric multi – programming system resources system
(C)
Multi processor system uses
(4)
Hard real time system
(D)
Have less timing constraint
(5)
Soft real time system
(E)
Critical task completion time
        (a) 1 – A, 2 – D, 3 – C, 4 – E, 5 – B                                  (b) 1 – B, 2 – C, 3 – A, 4 – E, 5 – D
        (c) 1 – D, 2 – E, 3 – A, 4 – B, 5 – C                                                  (d) 1 – C, 2 – D, 3 – E, 4 – A, 5 – B
  1. Choose the 4 reason for building distributed system
(1) Resource sharing                                                                           (2) For dedicated application
(3) Communication                                                                            (4) Reliability
(5) Computation speedup
(A) 1, 2, 3, 4                          (B) 2, 3, 4, 5                                          (C) 1, 3, 4, 5                          (D) All
  1. To illustrate the page replacement algorithm with the help of FIFO algorithm find the page fault of following string 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2  for a memory with 3 frames
(A) 3                                       (B) 4                                                       (C) 6                                       (D) 8
  1. State true or false according to page replacement algorithm
(1) Probably every operating system has same replacement scheme
(2) As the number of frame available of increase the number of page faults will increases
(3) Adding physical memory increase the number of frames.
(A) FFT                                 (B) TTF                                                  (C) TFT                                  (D) TTT
  1. State true or false :- according to contiguous implementation of file system
(1) It’s simple
(2) We can represent any file with a pair of numbers : the block number of first block and the length of the file
                (3) The blocks of the file are all physically near each other on the disk.
                (A) TTF                                  (B) FTF                                                  (C) TTT                                (D) FFT
  1. Match the following according to various components of kernel mode
(1)
I/O manager
(A)
Handles process and thread creation and termination
(2)
SRM
(B)
The primary authority for enforcing the security rules
(3)
IPC manager
(C)
Short for inter processes communication manager
(4)
Process manager
(D)
Allow devices to communicate with user mode sub systems by translating user mode read and write command
        (a) 1 – D, 2 – B, 3 – C, 4 – A                                                             (b) 1 – A, 2 – C, 3 – D, 4 – B
        (c) 1 – A, 2 – C, 3 – B, 4 – D                                                              (d) None of these
  1. State true or false according to distributed system
(1) Each processor has its own memory
(2) Processor in a distributed system may same size and function
(3) It increase the computation speed
(A) TFT                                 (B) TTT                                                 (C) TTF                                  (D) FFT
  1. Process is
(1) A program in execution                                                (2) The synchronous activity
(3) The dispatch able unit                                                  (4) The entity to which processor are assigned
(A) 1, 2, 3                              (B) 2, 3, 4                                              (C) 1, 2, 4                              (D) All of these
  1. State true or false :-
(1) Segmentation allows different pieces of a program to e compiled
(2) Segmentation easer the control of sharing and protection
(3) When a memory request is generated the request is first presented to the main memory.
(A) TTT                                 (B) TTF                                                 (C) FFT                                  (D) FTF
  1. How many page fault occurs when LRU algorithm use for page replacement policy pages are in the order :-
2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2
                (A) 3                                       (B) 4                                                       (C) 6                                       (D) 5
  1. The average waiting time for given process using SJF algorithm
Process                   Arrival time                                           Burst time
P1                                           0                                                              8
P2                                           1                                                              4
P3                                           2                                                              9
P4                                           3                                                               5
(A) 8.75                 (B) 7.75                                 (C) 6.5                                    (D) None
  1. Match the following -
(1)
Demand fetch
(A)
Which is fetching block before they are requested
(2)
Pre – fetch
(B)
Which dependent upon some defined criterion
(3)
Selective fetch
(C)
Which is the fetching a block when it is need
        (a) 1 – C, 2 – A, 3 – B                                                                         (b) 1 – A, 2 – B, 3 – C
        (C) 1 – B, 2 – C, 3 – A                                                                        (d) 1 – C, 2 – B, 3 – A
  1. Internal priorities are assigned by the OS using criteria such as
(1) Average burst time                                                                        (2) Ratio of CPU to I/O activity
(3) System resources use                                                                    (4) Available memory are
(A) 1, 2, 3                                              (B) 1, 2, 4                              (C) 1, 3, 4                              (D) All of these
  1. State true or false :-
(1) When different kind of CPU’s use system called heterogeneous
(2) Processors contain cache memory which speeds up repeated accesses to the same memory locations
(3) SMP systems attempt to keep processes on the same processor via processor affinity
(A) TFF                                                  (B) FTF                                  (C) TTT                                (D) FFT

No comments:

Post a Comment