Explore topic-wise MCQs in Master of Science in Computer Science (M.Sc CS).

This section includes 332 Mcqs, each offering curated multiple-choice questions to sharpen your Master of Science in Computer Science (M.Sc CS) knowledge and support exam preparation. Choose a topic below to get started.

101.

The term paging refers to

A. boosting up the priority of a process in multilevel of queues without feedback
B. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking
C. keeping track of the time a page has been in memory for the purpose of LRU replacement
D. letting job reside in memory for a certain amount of time, so that the number of pages required can be estimated accurately
Answer» C. keeping track of the time a page has been in memory for the purpose of LRU replacement
Discussion
102.

Memory that is located on the disk either Hard or floppy is referred as

A. Virtual memory
B. Real memory
C. Main memory
D. None of these.
Answer» B. Real memory
Discussion
103.

The process scheduler in the processor management unit

A. gives all jobs to the job scheduler
B. selects a job to run
C. selects a process to run
D. co-ordinates the process synchronization
Answer» D. co-ordinates the process synchronization
Discussion
104.

Address Binding is defined as

A. Compiler will typically bind these symbolic addresses to relocatable addressees
B. Each binding is a mapping from one address space to another
C. The linkage editor or loader win in turn bind these relocatable addresses to absolute addresses
D. All of the above
Answer» E.
Discussion
105.

The following

A. Start? Fetch next instruction? Execute Instruction ? Halt, represents
B. Instruction cycle with interrupt
C. Instruction cycle without interrupt
D. Instruction cycle with two interrupts
Answer» D. Instruction cycle with two interrupts
Discussion
106.

In uni-processor scheduling, a priorities enforcement is

A. When processes are assigned priorities and scheduling policy favor higher priority processes.
B. The scheduling keeps resources of system busy.
C. Here currently running process can be interrupted and moved to ready state by the operating system.
D. None of these.
Answer» B. The scheduling keeps resources of system busy.
Discussion
107.

When an interrupt occurs, an operating system

A. ignores the interrupt
B. always changes state of interrupted process after processing the interrupt
C. always resumes execution of interrupted process after processing the interrupt
D. may change state of interrupted process to blocked and schedule another process
Answer» E.
Discussion
108.

UNIX was developed by

A. Bell Labs for PDP-7 in 1970
B. Microsoft for IBM computers
C. Macintosh
D. None of these.
Answer» B. Microsoft for IBM computers
Discussion
109.

RAID-O does not support the following characteristics: A: RAID is a set of physical disk drives viewed by the operating system as a single logical drive. B: Data distributed across the physical drives of an array. C: Re- demdant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.

A. A and B
B. A only
C. B only
D. C only
Answer» E.
Discussion
110.

In RAID (Redundant Array of IndependentDisks) scheme, which of the following RAID level does not include redundancy to improve performance ?

A. RAID level 0
B. RAID level 1
C. RAID level 2
D. RAID level 4
Answer» B. RAID level 1
Discussion
111.

In cluster

A. Computers communicate with each other’s via fixed paths or via some network facilities
B. Computer communicates with each other’s via a shared memory.
C. Both (A) and (B)
D. None of these.
Answer» B. Computer communicates with each other’s via a shared memory.
Discussion
112.

In file management, users and applications access records via

A. Physical I/O
B. Basic I/O supervisor
C. Logical I/O
D. None of these.
Answer» D. None of these.
Discussion
113.

In virtual memory systems, dynamic addresstranslation

A. is the hardware necessary to implement paging
B. stores pages at a specific location on disk
C. is useless when swapping is used
D. is the part of the operating system paging algorithm
Answer» B. stores pages at a specific location on disk
Discussion
114.

In three tier client/server architecture application software match the following: A- User machine, 1-Client, B- Middle-tier, 2- Application server, C- Backend server, 3 Data servers.

A. A – 1, B – 2, C – 3
B. A – 1, B – 3, C – 2
C. A – 2, B – 1, C – 3
D. A – 3, B – 2, C – 1
Answer» B. A – 1, B – 3, C – 2
Discussion
115.

The total time to prepare a disk drivemechanism for a block of data to be read from it is

A. seek time
B. Latency
C. latency plus seek time
D. transmission time
Answer» D. transmission time
Discussion
116.

In disk storage devices the width of head is:

A. Same of the track
B. More than of the track
C. Less than of the track
D. None is true.
Answer» B. More than of the track
Discussion
117.

In memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.

A. A – 1, B – 2, C – 3
B. A – 2, B – 1, C – 3
C. A – 2, B – 1, C – 3
D. A – 3, B – 1, C – 2
Answer» D. A – 3, B – 1, C – 2
Discussion
118.

In secondary storage management, “If allocation of file is made on an individual block basis and each block contains a pointer to the next block in the chain” then it is referred as

A. Contiguous allocation
B. Chained allocation
C. Indexed allocation
D. None of these.
Answer» C. Indexed allocation
Discussion
119.

The C–SCAN, in disk scheduling states

A. The arm movement is uni directional
B. The arm movement is bidirectional
C. The are is to be state fixed
D. None of these.
Answer» D. None of these.
Discussion
120.

The principle of locality states

A. The program and data references within a process tend to cluster.
B. The program and data references within a process do not tend to cluster.
C. A process actually referred in virtual memory.
D. None of these.
Answer» B. The program and data references within a process do not tend to cluster.
Discussion
121.

Statement A: The placement policy determines where in real memory a process piece is to reside. Statement B: The fetch policy determines when a page should be bought into main memory.

A. A and B both true
B. A and B both false
C. A is true, B is false
D. A is false, B is true
Answer» B. A and B both false
Discussion
122.

A task in a blocked state is

A. Executable
B. Waiting for some temporarily unavailable resource
C. Running
D. None of these
Answer» C. Running
Discussion
123.

The transfer time in disk scheduling is

A. Proportional to rotation speed.
B. Inversely proportional to rotation speed.
C. Equal to rotation spe
Answer» B. Inversely proportional to rotation speed.
Discussion
124.

In memory management where replacement is allowed in First-in-First-out (FIFO) fashion

A. The page frames are allocated to a process as circular buffer and pages are removed in random order.
B. The page frames are allocated to a process as circular buffer and pages are removed in round-robin order.
C. Replaces the pages that are least referr
Answer» C. Replaces the pages that are least referr
Discussion
125.

A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on

A. First Come First Served
B. Shortest Seek Time First
C. Sean
D. None of these
Answer» D. None of these
Discussion
126.

Which type of design problem in file system

A. how the file system should look to the user
B. algorithm and data structure must be created to map the logical file system onto the secondary storage device
C. Both A and B above
D. none of the above
Answer» D. none of the above
Discussion
127.

The time table of railway, and airline which defines arrival and departure can be considered as

A. Hard real time scheduling
B. Soft real time scheduling
C. None real time scheduling.
D. None of these.
Answer» B. Soft real time scheduling
Discussion
128.

In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.

A. A – 1, 3, B – 2
B. A – 1, B – 3
C. A – 2, B – 1, 3
D. A – 1, 2, B – 3
Answer» B. A – 1, B – 3
Discussion
129.

Match the following access rights :A-Specific user, B-User group, C-All ; 1- Individual user who are designated by user I, 2-A set of users who are individually defined, 3-Every user has access to the system.

A. A – 1, B – 2, C – 3
B. A – 2, B – 1, C – 3
C. A – 1, B – 3, C – 2
D. A – 3, B – 2, C – 1
Answer» B. A – 2, B – 1, C – 3
Discussion
130.

In micro kernel architecture following is false.

A. Intersection takes place only between adjacent layers.
B. Intersection takes place via micro kernel.
C. It supports portability.
D. It supports object-oriented operating system.
Answer» B. Intersection takes place via micro kernel.
Discussion
131.

By principle of locality, in least recently used policy, in memory management

A. The page replaced in memory is least likely to be referenced in the near future.
B. The page replaced in memory is most likely to be referenced in the near future.
C. The pages replaced in memory in round-robin fashion.
D. None of these.
Answer» B. The page replaced in memory is most likely to be referenced in the near future.
Discussion
132.

If in a computer networking environment when all the processing is done on single computer can be referred as

A. Host based processing
B. Server based processing
C. Client based processing
D. None of these.
Answer» B. Server based processing
Discussion
133.

In which of the following RAID scheme, redundancy is achieved by the simple expedient of duplicating all the data ?

A. RAID level 0
B. RAID level 1
C. RAID level 2
D. RAID level 3
Answer» C. RAID level 2
Discussion
134.

When a frame in main memory is locked

A. The page currently stored in that frame can be replaced.
B. The page currently stored in that frame cannot be replaced.
C. Pages currently in frame can be removed in round-robin style.
D. None of these.
Answer» C. Pages currently in frame can be removed in round-robin style.
Discussion
135.

Following is not the stream oriented I/Odevice

A. Printer
B. Mouse
C. Communication modules
D. Disk/tape
Answer» E.
Discussion
136.

UNIX is a

A. Operating system
B. Hardware
C. Programming language
D. None of these.
Answer» B. Hardware
Discussion
137.

The RAID scheme indicate

A. Random access of information data.
B. Random array of independent disks.
C. Redundant array of independent disks.
D. Redundant access of information data.
Answer» E.
Discussion
138.

Load time

A. where the process will reside in memory, then absolute code can be generated
B. where the process will reside in memory, then the compiler must generate relocatable memory
C. if the process can be moved during its execution from one memory segment to another, then binding must be delayed until run time
D. all of the above
Answer» C. if the process can be moved during its execution from one memory segment to another, then binding must be delayed until run time
Discussion
139.

Following is/are operating system used in computers

A. MS-DOS
B. OS/2
C. UNIX
D. All of the above
Answer» E.
Discussion
140.

In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.

A. A – 2, 2, B – 3
B. A – 1, 3, B – 2
C. A – 2, B – 1, 2
D. A – 2, B – 1, 3
Answer» C. A – 2, B – 1, 2
Discussion
141.

Wild-card specifies

A. provide an easy way of finding groups of related files
B. are only used when printing the contents of files
C. can be used when writing a file
D. allow several files to be read simultaneously
Answer» B. are only used when printing the contents of files
Discussion
142.

Round robin is a

A. kind of magnetic drum
B. process scheduling policy
C. process synchronization policy
D. memory allocation policy
Answer» C. process synchronization policy
Discussion
143.

Relative address in memory management is

A. Independent of some known point
B. Dependent to some known point
C. Actual location in the main memory
D. None of these.
Answer» C. Actual location in the main memory
Discussion
144.

Following illustrates Associative Memory

A. The address of the data is supplied by the user
B. Same as the tracks associated with disk memory
C. No need for address; information is used as address
D. Data is accessed serially
Answer» D. Data is accessed serially
Discussion
145.

In aperiodic (real time) tasks

A. The dead line for start is mandatory, but for finish it is not.
B. The dead line for finish is mandatory, but for start it is not.
C. The dead line for finish and start is mandatory.
D. The dead line for finish and start is not mandatory.
Answer» D. The dead line for finish and start is not mandatory.
Discussion
146.

The RAID (Redundant Array of Independent Disks) level one requires

A. Same disk space of the logical disk that it support.
B. Twice disk space of the logical disk that it support.
C. Thrice disk space of the logical disk that it support.
D. Half disk space of the logical disk that it support.
Answer» C. Thrice disk space of the logical disk that it support.
Discussion
147.

In secondary storage management, bit table,for each block on disk a vector contains

A. One bit each block
B. Two bit each block
C. Three bit each block
D. Four bit each block.
Answer» B. Two bit each block
Discussion
148.

The frame

A. Can hold exactly one page of data
B. Can hold more than one page of data
C. Can hole two page of data
D. None of these.
Answer» B. Can hold more than one page of data
Discussion
149.

Real-time systems are

A. primarily used on mainframe computers
B. used for monitoring events as they occur
C. used for program development
D. used for real-time interactive users.
Answer» C. used for program development
Discussion
150.

The Window 2000 (W2K) and Linux are the example of

A. User Level Thread (ULT)
B. Kernel Level Thread (KLT)
C. A and B both
D. None of these.
Answer» C. A and B both
Discussion