Question

DOS is a single user operating system.

1. True
2. False

Answer: 1

Chapter No.

Question

The major advantage of multi-programming system is

1. More than one jobs can be processed at a given time
2. CPU utilization can be increases
3. Jobs can be completed quickly
4. All of the given

Answer:

Chapter No.

Question

Linux OS can support multiple users at a time

1. True
2. False

Answer:

Chapter No.

Question

_________ command is used to change the directory.

1. ls
2. cp
3. cd
4. mv

Answer: 3

Chapter No.

Question

I/O instructions are Privileged instruction.

1. True
2. False

Answer:

Chapter No.

Question

The nice value helps in assigning ______ to a process.

1. Priority
2. Weight
3. Time
4. Scheduling

Answer:

Chapter No.

Question

Which part of the computer system helps in managing the file and memory management system?

1. Operating System
2. Device Drivers
3. Application Software
4. Hardware

Answer: 1

Chapter No.

Question

Physical memory is broken down into fixed-sized blocks, called ________ and Logical memory is divided into blocks of the same size, called _________.

1. Frames, pages
2. Pages, Frames
3. Frames, holes
4. Holes, segments

Answer: 1

Chapter No.

Question

The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a _________ address, and the address it gets translated to by the MMU is called a _________ address.

1. Virtual, physical
2. Hexadecimal, Binary
3. Valid, invalid
4. Physical, Virtual

Answer: 1

Chapter No.

Question

When a ________link is created, a directory entry for the existing file is created

1. Soft
2. None of the given
3. Hard
4. Soft or Hard

Answer: 3

Chapter No.

Question

If a system is not in a safe state, there can be no deadlocks.

1. True
2. False

Answer: 2

Chapter No.

Question

If a process continues to fault, replacing pages, for which it then faults and brings back in right away. This high paging activity is called _________.

1. paging
2. thrashing
3. page fault
4. CPU utilization

Answer: 2

Chapter No.

Question

An acyclic graph does not allow directories to have shared subdirectories and files.

1. True
2. False

Answer: 2

Chapter No.

Question

A modification of free-list approach in free space management is to store the addresses of n free blocks in the first free block, known as _________.

1. counting
2. linked list
3. bit vector
4. grouping

Answer: 4

Chapter No.

Question

Following is NOT true about Virtual memory.

1. Virtual memory help in executing bigger programs even greater in size that of main memory.
2. Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory.
3. Virtual memory also allows files and memory to be shared by several different processes through page sharing.
4. Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory.

Answer: 2

Chapter No.

Question

_________ indicates size of the page table.

1. translation look-aside buffers
2. Page-table length register (PTLR)
3. Page-table base register (PTBR)
4. Page offset

Answer: 4

Chapter No.

Question

If validation bit is 0, it indicates a/an ________ state of segment.

1. protected
2. shared
3. legal
4. illegal

Answer: 4

Chapter No.

Question

Which command display permissions and some other attributes for prog1.c in your current directory?

1. ls –l prog1.c
2. ls –d prog1.c
3. ls file prog1.c
4. ls –l prog1.c /Directory

Answer: 1

Chapter No.

Question

The logical address of Intel 80386 is _________.

1. 36 bits
2. 48 bits
3. 64 bits
4. 128 bits

Answer:

Chapter No.

Question

The main memory is usually divided into partitions, one for __________ and other for __________.

1. Operating System, User processes
2. Operating system, CPU
3. Processes, Virtual Memory
4. Base Register, Limit Register

Answer:

Chapter No.

Question

_________ keep in memory only those instructions and data that are needed at any given time.

1. Fragmentation
2. Paging
3. Swapping
4. Overlays

Answer:

Chapter No.

Question

In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the ___________.

1. amount of memory swapped
2. amount of space on backing store
3. space on main memory
4. all the given options are correct

Answer:

Chapter No.

Question

The major criterion in the selection of a particular algorithm is that we want to ___________.

1. minimize the number of page faults
2. increase efficiency
3. reduce running time of page replacement algorithm
4. maximize the number of page faults

Answer:

Chapter No.

Question

A dashed line is used to represent a __________ in Resource Allocation Graph.

1. Claim edge
2. Request edge
3. Assignment edge
4. Allocation edge

Answer:

Chapter No.

Question

Banker’s algorithm is used for ___________.

1. Deadlock avoidance
2. Deadlock detection
3. Deadlock prevention
4. Deadlock removal

Answer:

Chapter No.

Question

_________ algorithm is used in Deadlock avoidance.

1. Bakery
2. Banker’s
3. Mutual exclusion
4. Safe Sequence

Answer:

Chapter No.

Question

The segment table maps the ___________ to physical addresses.

1. Page addresses
2. Shared page addresses
3. One-dimensional logical addresses
4. Two-dimensional logical addresses

Answer:

Chapter No.

Question

What do we name to an address that is loaded into the memory-address register of the memory?

1. Logical address
2. Physical address
3. Binary addresses
4. None of the given options

Answer:

Chapter No.

Question

Following is not the classical problem of synchronization.

1. Bounded buffer problem
2. Reader writer problem
3. Dining philosophers problem
4. Counting Semaphore problem

Answer:

Chapter No.

Question

When the address used in a program gets converted to an actual physical RAM address, it is called _________.

1. Execution
2. Loading
3. Address Binding
4. Compiling

Answer:

Chapter No.

Question

Address Binding will be at _______ in Multiprogramming with Fixed Tasks (MFT)

1. Run time
2. Load time
3. Dynamic time
4. None of the given options

Answer:

Chapter No.

Question

The condition in which a set {P0, P1… Pn} of waiting processes must exist such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0. This condition is known as _________.

1. Mutual exclusion
2. Hold and wait
3. No preemption
4. Circular wait

Answer:

Chapter No.

Question

Deadlock detection and recovery technique is exactly similar to deadlock avoidance technique to handle deadlock in the system.

1. True
2. False

Answer:

Chapter No.

Question

The size of pages and frames are same in logical memory and physical memory respectively.

1. True
2. False

Answer:

Chapter No.

Question

Optimal Page Replacement Algorithm provides a benchmark in assessing other page replacement algorithms.

1. True
2. False

Answer:

Chapter No.

Question

To eliminate external fragmentation in segmentation the scheme used is __________.

1. Fixed size partition scheme
2. Variable size partition scheme
3. Fixed size paging scheme
4. Variable size paging scheme

Answer:

Chapter No.

Question

The process id returned to the child process after successful fork system call execution is __________.

1. 0
2. 1
3. 2
4. 3

Answer: 1

Chapter No.

Question

Shared libraries and kernel modules are stored in __________ directory.

1. /bin
2. /dev
3. /boot
4. /lib

Answer: 4

Chapter No.

Question

_________ is a piece of code in a cooperating process in which the process may updates shared data (variable, file, database, etc.)

1. Critical Analysis
2. Critical Section
3. Critical Path
4. Critical Code

Answer: 2

Chapter No.

Question

Round Robin algorithm is similar to __________ scheduling but preemption is added to switch between processes.

1. Shortest Job First
2. Shortest Remaining Time First
3. First Come First Serve
4. None of these

Answer: 3

Chapter No.

Question

You can use the mv file1 file2 command to move __________.

1. file1 to file2
2. file2 to file1
3. this command will not work for moving files
4. None of the option is correct.

Answer: 1

Chapter No.

Question

A process is said to be in critical section if it executes code that manipulates shared data.

1. True
2. False

Answer: 1

Chapter No.

Question

When process opens its first file explicitly it will get descriptor number ________.

1. 1
2. 2
3. 3
4. 4

Answer: 1

Chapter No.

Question

A parent process calling _________ system call will be suspended until children process terminates.

1. wait
2. fork
3. exit
4. exec

Answer: 3

Chapter No.

Question

A solution to the critical section problem must satisfy the following requirements except

1. Progress
2. Mutual Exclusion
3. Bounded Waiting
4. Race Condition

Answer: 4

Chapter No. 19

Select a course code for Objective Questions:

ACC501 CS101 CS201 CS301 CS401 CS402 CS403 CS501 CS502 CS504 CS506 CS601 CS604 CS605 CS607 CS609 CS610 CS614 CS707 CS710 ECO401 ECO404 ENG201 ENG301 IT430 MGMT623 MGT101 MGT211 MGT301 MGT401 MGT501 MGT503 MGT510 MGT601 MKT501 MKT630 MTH202 MTH302 PHY301 STA630

Select a course code for Subjective Questions:

ACC311 CS101 CS607 CS701 CS702 CS703 CS704 CS707 CS708 CS710 CS711 CS718 CS721 ENG101 MGT703