Latest topics

1) In memory management, a technique called as paging, the physical memory is broken into fixed sized blocks called ......... A. pages B. frames C. blocks D. segments 2) Which method is used to recover from deadlock? A. Process termination B. Resource preemption C. Resource non-preemption D. Process termination and Resource preemption 3) Saving the state of the old process and loading the saved state of the new process is called .... A. context switch B. static C. multi programming D. none of the above 4) The degree of Multiprogramming is controlled by ...... A. CPU scheduler B. context switching C. long term scheduler D. medium term scheduler 5) Input transfers are done in advance and output transfers are done after sometimes in which of these technique? A. Spooling B. Buffering C. Swapping D. Paging 6) A binary semaphore ......... A. has the values one or zero B. is essential to binary computers C. is used only for synchronization D. is used only for mutual exclusion 7) A scheduling ...

1) An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of process is ... A. FCFS scheduling B. Round robin scheduling algorithm C. Shortest job first scheduling algorithm D. Priority scheduling algorithm 2) The hardware mechanism that enables a device to notify the CPU is called ....... A. polling B. interrupt C. system call D. none of the above 3) In the running state ........ A. only the process which has control of the processor is found B. all the process waiting for I/O to be completed are found C. all the processes waiting for the processor are found D. none of the above 4) Which technique was introduced because a single job could keep both the CPU and the I/O devices busy? A. Time sharing B. Spooling C. Preemptive scheduling D. Multiprogramming 5) RMA works on static priorities while EDF algorithm works on ........ A. starvation B. dynamic priorities C. RR scheduling D. FIFO scheduling 6) In the ........... method of data transfer, the ...

1) Which of the following is crucial time while accessing data on the disk? A. Seek time B. Rotational time C. Transmission time D. Waiting time 2) What is the primary job of the operating system is a computer? A. Command resources B. Manage resources C. Provide utilities D. Be user friendly 3) The ......... is a user process that initiates a remote procedure call. A. client B. server C. network D. operating system 4) Which of the following memory allocation scheme suffers from external fragmentation? A. Segmentation B. Pure demand paging C. Swapping D. Paging 5) Which of the following is used to removal of process from active contention of CPU and reintroduce them into memory later? A. Interrupt B. Swapping C. Signal D. Thread 6) The operating system manages ..... A. memory B. processor C. disk and I/O devices D. all of the above 7) Information about a process is maintained in a ......... A. stack B. translation look a side buffer C. process control block D. program control block 8) P...

1) The process of storing extra or duplicate information used for rebuilding the lost information in event of disks failure is known as ... A. stripping B. redundancy C. disk array D. RAID 2) A thread that is to be canceled is often referred to as the .... A. target thread B. thread cancellation C. asynchronous cancellation D. defined cancellation 3) ........... ensures the every message sent to a group of receivers will be delivered to either all of them or none of them. A. Ordered delivery B. Atomicity B. Survivability D. Realiability 4) An arrangement of record in a sequence in which they arrive is known as a ........... A. pile B. file C. disk D. directory 5) ........... also known as monitor mode. A. User mode B. System mode C. Unprivileged mode D. Process mode 6) The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly such that each job appears to have the computer to itself, is called ........ A. time sharing B. time out C. time domai...

1) The process is ........ A. an instance of a program in execution B. a program only C. a processor state D. the kernel state 2) The mechanism that brings a page into memory only when it is needed is called ..... A. segmentation B. fragmentation C. demand paging D. page replacement 3) The two paradigms if IPC are ............ and ....... A. call, reply B. shared memory, message passing C. send, receive D. call by value, call by reference 4) A program is passive while a process is .......... A. inactive B. spontaneous C. active D. impulse 5) FIFO scheduling is .......... A. preemptive scheduling B. non preemptive scheduling C. deadline scheduling D. fair share scheduling 6) ......... ensures that once transaction completes successively, the results of the operations become permanent. A. serializability B. synchronizability C. atomicity D. durability 7) A process is created and is initially put in the ........ A. ready queue B. device queue C. i/o queue D. waiting queue 8) Which directo...

1. A small program which loads OS into the memory is called as ........... System management components (Photo credit: Wikipedia ) A) ROM B) bootstrap loader C) BIOS D) RAM 2. Virtual memory is .............. A) Simple to implement B) Used by all major commercial OS C) Less efficient memory utilization D) Less effective 3. A special purpose register that is set to the highest address occupied by the OS code is ........... A) fence register B) general purpose register C) protection register D) control register 4. As OS program module that selects the next job to be admitted for execution is called as ..... A) scheduler B) compiler C) throughput D) dispatcher 5. Multiprogramming systems ................. A) are easier to develop than single programming systems. B) execute each job faster C) execute more jobs in the same time. D) are used only on large main frame computers 6. SSTF stands for ........................ A) Small seek Time First B) Simple Seek Time First C) Shortest Seek T...

1. Operating System means ........................ A) a set of programs which controls computer working. Operating System (Photo credit: Wikipedia ) B) a way of computer drives works C) a set of devices and programs D) All of the above 2. The basic types of OS are ................... A) batch and time sharing B) sequential and real time C) direct and interactive D) batch and interactive 3. The simplest way of deadlock is to ... A) preempt a resource B) rollback C) kill one of the processes D) lock one of the processes 4. 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 5. Which of the following is not OS layer? A) Kernel B) Shell C) Application Programs D) Critical Section 6. Round robin scheduling is essentially the preemptive version of ........... A) first in first out B) shortest job first C) shortest remaining D) longest...

In uniprogramming system, main memory is divided into two parts, one pare for the operating system (resident monitor, kernel) and one part for the program currently being executed. In multiprogramming system, the 'user' part of the memory must be further subdivided to accommodate multiple processes. The task of subdivision is carried out dynamically by operating system and is known as memory management . Memory management by OS can be divided into two methods:    # Real Memory Management In real memory management OS operates the space of the main memory only. There are two ways of real memory management. a) Mono Programming System:– Execution of one program at one time. The memory is divided into two parts, one is to save the OS and the other is to save programs. b) Multi Programming System:– Several simultaneous processes can be executed at the same time. Memory space is shared by several processes. To enable it to run a process should be stored into the memory. ...

Process scheduling is one way for a processor to handle n processes , by scheduling the execution process. Each process is executed one by one according to prescribed schedule. The aim of processor scheduling is to assign processes to be executed by the processor or processors over time, in a way that meets system objectives, such as response time, throughput and processor efficiency. In many systems, this scheduling activity is broken down into three separate functions: long, medium and short-term scheduling. Types of Scheduling  Long term Scheduling The long term scheduler determines which programs are admitted to the system for processing. Thus, it controls the degree of multiprogramming. Once admitted a job or user program becomes a process and added to the queue for the short term scheduler. In some systems, a newly created process begins in a swapped-out condition, in which case it is added to the queue for the medium term scheduler. Medium term scheduling  Medium te...

1. …………….. are used in denial of service attacks, typically against targeted web sites. A) Worm B) Zombie C) Virus D) Trojan horse 2. Select the correct order for the different phases of virus execution. i) Propagation phase                      ii) Dormant phase iii) Execution phase                         iv) Triggering phase A) i, ii, iii, and iv B) i, iii, ii and iv C) ii, i, iv an iii D) ii, iii, iv and i 3. A ………………… attaches itself to executable files and replicates, when the infected program is executed, by finding other executable files to infect. A) Stealth virus B) Polymorphic Virus C) Parasitic Virus D) Macro Virus 4. …………………….. is a form of virus explicitly designed to hide itself from detection by antivirus software. A) Stealth virus B) Polymorphic Vir...

1. In computer security, ……………………. means that computer system assets can be modified only by authorized parities. A) Confidentiality B) Integrity C) Availability D) Authenticity 2. In computer security, …………………….. means that the information in a computer system only be accessible for reading by authorized parities. A) Confidentiality B) Integrity C) Availability D) Authenticity 3. The type of threats on the security of a computer system or network are …………………….. i) Interruption                   ii) Interception                  iii) Modification iv) Creation                         v) Fabrication A) i, ii, iii and iv only B) ii, iii, iv and v only C) i, ii, iii and v only D) All i, ii, iii, iv and v 4. Whi...

1. …………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above 2. A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory 3. In process scheduling, …………………… determines when new processes are admitted to the system. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above 4. In process scheduling, ………………… determines which ready process will be executed next by processor. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above 5. The sum of the seek time, and the rotational delay is called the ……………….. A) reached time B) access time C) arrived time D) common time 6. The …………….. policy se...

1. The unit of dispatching is usually referred to as a ………….. A) Thread B) Lightweight process C) Process D) Both A and B 2. ……………….. is a example of an operating system that support single user process and single thread. A) UNIX B) MS-DOS C) OS/2 D) Windows 2000 3. State true or false. i) Unix, support multiple user process but only support one thread per process. ii) A java run time environment is an example of a system of one process with multiple threads. A) True, False B) True, True C) False, True D) False, False 4. …………… are very effective because a mode switch is not required to switch from one thread to another. A) Kernel-level threads B) User-level threads C) Alterable threads D) Application level threads 5. …………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation 6. …………………. Techniques can be used to resolve...