0% found this document useful (0 votes)
13 views

Test 15 Minutes

This document contains 42 multiple choice questions related to operating systems concepts. The questions cover a wide range of topics including memory hierarchy, virtual memory, CPU scheduling algorithms, concurrency issues like deadlocks, I/O management, file systems, and real-time systems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views

Test 15 Minutes

This document contains 42 multiple choice questions related to operating systems concepts. The questions cover a wide range of topics including memory hierarchy, virtual memory, CPU scheduling algorithms, concurrency issues like deadlocks, I/O management, file systems, and real-time systems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Q0: Which of following statements about the memory hierarchy is false?

A. Small amount of fast expensive memory - cache


B. Gigabytes of slow cheap disk storage
C. None of the other choices
D. Some medium-speed medium price main memory
Q1: Which of following is true about main memory in the memory hierarchy?
A. Small amount of fast expensive memory.
B. Some medium-speed medium price.
C. Gigabytes of slow cheap memory.
D. None of the other choices.
Q2: Which of following is true about cache in the memory hierarchy?
A. Small amount of fast expensive memory.
B. Some medium-speed medium price.
C. Gigabytes of slow cheap memory.
D. None of the other choices.
Q3: Suppose a virtual address space of 2^28 words and the page size is 2^12 words. If the virtual
1234567 in Hexadecimal, what would be the page number in Hexadecimal?
A. 123
B. 1234
C. 12345
D. 123456
Q4: The scheduling strategy where each process in the queue is given a certain amount of time.
elapsed, the process is preempted and added to the end of the ready queue is referred to as
A. Prioritization
B. Round-Robin
C. LIFO
D. All of the other choices
Q5: Failure to lock database records before updating them may result in a_______ between process
A. Struggle
B. Race
C. Deadlock
D. Livelock
Q6: The major operating system services provide mechanisms for secure and efficient are:
A. Communication between processes
B. File manipulation
C. Execution of a program, I/O operations performed by it, and detecting and reporting errors
D. All of the other choices
Q7: When there is an excessive amount of page swapping between main memory and secondary
operation becomes inefficient, which is called________.
A. excessive demand paging
B. hot swapping
C. thrashing
D. Over swapping
Q8: How large is the block size, if the maximum partition size is 8 MB and the FAT type is FAT- 12
A. 1KB
B. 2KB
C.4 KB
D. 8 KB
Q9: The methods determine where page is on the disk when it is paged out is
A. Paging to a static swap area
B. Backing up pages dynamically
C. Both Paging to a static swap area and Backing up pages dynamically
D. None of the other choices
Q10: Which mechanism is described as "the device controller sneaks in and steals an occasional the
CPU once in a while, delaying it slightly"?
A. Interrupt stealing
B. Cycle sneaking
C. Cycle stealing
D. All of the others
Q11: Multiprogramming increases processor efficiency by
A. Increasing processor speed
B. Taking advantage of time wasted by long wait I/O handling
C. Eliminating all idle processor cycles
D. All of the other choices
Q12: Assume jobs A-D arrive in quick succession in the READY queue. Using round robin
scheduling (quantum-4), the turnaround time for job D is_____.
Arrival time: 0 1 2 3
Job: A B C D
CPU cycle: 8 4 9 5
A. 7
B. 20
C. 22
D. 24
Q13: The general role of an operating system is to:
A. Act as an interface between various computers
B. Provide a set of services to system users
C. Manage files for application programs
D. None of the other choices Sent Write to
Q14: Event Action Assume the following events and actions take place. The following
statement_____ is true.
1 P1 requests and is allocated R1.
2 P2 requests and is allocated R2.
3 4 P3 requests and is allocated R3.
4 P1 requests R2.
5 P2 requests R3.
6 P3 requests R1.
A. There is no deadlock
B. Event 4 caused deadlock
C. Event 5 caused deadlock.
D. Event 6 caused deadlock.
Q15: _______allocation allows files to use any storage space available on the disk.
A. Contiguous storage
B. Noncontiguous storage
C. Fragmented storage
D. Add-on storage
Q16: The aspect of disk performance that represents the time it takes to position the head a the
desired track is known as
A. Seek time
B. Rotational delay
C. Access time
D. None of the other choices
Q17: Which RAID level employs a Hamming code to correct single bit errors and detect double bit
errors?
A1
B. 2
C. 3
D. 4
E. 5
Q18: Five batch jobs A through E, arrive at a computer center at almost the same time. They have
estimated running times of 8, 6, 2, 10, and 4 minutes. Determine the average waiting time for SJF
(Shortest job first) scheduling. Ignore process switching overhead.
A. 14 minutes
B. 8 minutes
C. 6 minutes
D. 18.8 minutes
Q19: A computer with a 32-bit address uses a two-level page table. Virtual addresses are split into a
10-bit top-level page table field, an 12-bit second-level page table field, and an offset. How large are
the pages?
A. 4-KB page
B. 2-KB page
C. 1-KB page
D. 512B page
Q20: Which is space efficiency, if 4KB-file using file system with 8KB-block?
A. 50%
B. 75%
C. 25%
D. 100%
Q21: Which of the following statement is not true about separating I/O and memory space?
A. Device drivers must be written using assembly language
B. Programs must use 2 instructions to test whether the device is ready
C. There is special protection mechanism to keep user processes from performing I/O
D. Caching a device control register would be disastrous
Q22: A computer has four page frames. The time of loading, time of last access, and the R and M bits
for each page are as shown below (the times are in clock ticks):
Page Loaded Last ref. R M
------------------------------------------------------------
0 226 280 0 0
1 160 265 0 1
2 110 270 1 0
3 120 285 1 1
Which page will LRU replace?
A. 0
B. 1
C. 2
D. 3
Q23: A simplest way to break a deadlock is to
A. preempt a resource
B. Rollback
C. kills one of the processes
D. locks one of the processes
Q24: Deadlock definition:
A set of processes is deadlocked if each process in the set is waiting for an event that only another
process in the set can cause. What does event mean?
A. The event is release of a currently held resource
B. The event is press some key on keyboard
C. The event is some mouse click
D. None of the other choices
Q25: In "No Memory Abstraction", the static relocation technique is
A. When the program is loaded at address n, the constant n was added to every program address
B. When the program is compiled, the address of program is added with the constant value where the
program will be loaded
C. After the program is loaded at address n, the constant n is stored at a particular register.
D. None of the other choices
Q26: Which of the following statements about the task of device controller of I/O devices is correct?
A. Convert serial bit stream to block of bytes
B. Perform error correction as necessary
C. Make available to main memory
D. All of the other choices
Q27: Five batch jobs A through E, arrive at a computer center at almost the same time. They have
estimated running times of 8, 6, 2, 10, and 4 minutes. Determine the average turnaround time for
FCFS scheduling. Ignore process switching overhead.
A 17 minutes
B. 18 minutes
C. 18.8 minutes
D. 20 minutes
Q28: Which of the following is not file structure?
A. Byte sequence
B. Record sequence
C. Ring
D. Tree Sent Write to
Q29: Which of the following is correct about Shortest Job First scheduling algorithm?
A. Avoid Starvation
B. Minimize average waiting time
C. Avoid Starvation and Minimize average waiting time
D. None of the other choices
Q30: Which of the following is not true about process hierarchy?
A. A process creates child process. The child process can itself creates more processes, forming a
process hierarchy
B. In Unix, a process and all its children and further descendants together form a process group C.
Window has no concept of a process hierarchy
D. A process may have more than one parent
Q31: Which of a system call is to allow the system announce that the file is coming and set some of
the attributes?
A OPEN
B. CLOSE
C. CREATE
D. RENAME
Q32: Increasing file system performance is implemented by
A. Buffer cache
B. Block Read Ahead
C. Defragmenting Disks
D. All of the other choices
Q33: A well-known Real-Time operating system is:

A. TinyOS

B. MS-DOS

C. Personal Operating System

D. None of the others.

Q34: A disk queue with requests for I/O blocks on cylinders in orders: 10, 22, 20, 2, 40, 6, 38. Assume
that the disk head is initially at cylinder 20. How many cylinder do Total head movement using FCFS?

A. 146

B. 60
C. 58

D. None of the others

Q35: Which of the following conditions that causes the processes to be terminated, when the processes
have a program bug?

A. Normal exit (voluntary)

B. Error exit (voluntary)

C. Fatal error (involuntary)

D. Killed by another process (involuntary)

Q36: If there are 128 pages and the page size is 32 K words, what is the length of logical address?

A. 24 bits

B. 26 bits

C. 30 bits

D. 22 bits

Q37: Assume jobs A-D arrive at almost the same time in the READY queue. Determine the average
turnaround time for SJF scheduling. Ignore process switching overhead

Job: A B C D

CPU cycle: 5 2 6 4

A. 5.5

B. 6.8

C. 9.0

D. 11.1

Q38: Which of the following is specified to indicate the directory where the file is located?

A. Extension

B. Path name

C. Root directory

D. Sub-directory

Q39: Which deadlock condition does "Spool everything" attack?

A. Mutual exclusion

B. Hold and wait


C. No preemption

D. Circular-wait condition

Q40: Which of the following environments preemption is essential?

A. Batch

B. Interactive

C. Real time

D. None of the other choices

Q41: Which of the following is not special file?

A. Character special file

B. Stream special file

C. Block special file

D. None of the other choices

Q42: Which of these statements about the algorithm "Best fit" is true?

A. Memory Manager scans along the list of segments until it finds a hole that is big enough.

B. Memory Manager starting searching the list of segments from the place where it left off last time.

C. Memory Manager searches the entire list of segments from beginning to end and take smallest hole
that is adequate.

D. None of the other choices

Q43: One of the primary disadvantages of contiguous storage is that

A. It is hard to implement and manage

B. It is difficult to find information in files

C. File can't be expanded unless there is empty space available immediately following it

D. It is an inefficient use of space

Q44: Which of the following statements is incorrect about Translation Look-aside Buffer (TLB)?

A TLB only maintains a subset of the entries stored in the full memory-based page table

B. When there is a TLB miss the system needs to access the page table

C. The use of TLB eliminates the need for keeping a page table in memory

D. None of the other choices


Q45: Consider the following state of a system with four processes, P1, P2, P3 and P4, and five types of
resources RS1, RS2, RS3, RS4 and RS5.

Process Allocated Matrix Request Matrix

---------------------------------------------------------------------------

P1 01010 01021 E = (24144)

P2 00001 02031 A-(01021)

P3 21000 02110

P4 01112 11021

Deadlocked processes are :

A. P1, P2

B. P1, P3

C. P3, P4

D. P1, P4

Q46: Which is not a goal of a scheduling algorithm for real-time systems?

A. Meeting deadlines

B. Predictability

C. Fairness

D. None of the other choices

Q47: Which of the following is not a operating mode of CPU

A. User mode

B. Kernel mode

C. Management mode

D. None of the other choices

Q48: Which of the following operating systems is an example of monolithic system?

A UNIX

B. Windows XP

C. Mac OS
D. MS-DOS

Q49: Which of special register in the CPU points to the top of the current stack in the memory?

A. IR

B. PC

C. PSW

D. SP

Q50: _____ is when, in modern printing systems, a disk accepts output from several users and acts as a
temporary storage area for all output until the printer is ready to accept it

A. Buffering

B. Lagging

C. Spooling

D. Spoofing

You might also like