A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

71. In an operating system, indivisibility of operation means :
a. Operation is interruptable
b. Race - condition may occur
c. Processor can not be pre-empted
d. All of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Processor can not be pre-empted

72. The character set used in Windows 2000 operating system is ...............
a. 8 bit ASCII
b. Extended ASCII
c. 16 bit UNICODE
d. 12 bit UNICODE
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).16 bit UNICODE

73. The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are :
a. Loosely coupled hardware on tightly coupled software and disk sharing, respectively
b. Tightly coupled hardware on loosely coupled software and shared memory, respectively
c. Tightly coupled software on loosely coupled hardware and message passing, respectively
d. Loosely coupled software on tightly coupled hardware and file sharing, respectively
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Tightly coupled software on loosely coupled hardware and message passing, respectively

74. In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is
a. 91 ns
b. 69 ns
c. 200 ns
d. 160 ns
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).160 ns

75. Match the following:

List-I                                                               List-II
a. Multilevel feedback queue           i. Time-slicing
b. FCFS                                                 ii. Criteria to move processes between queues
c. Shortest process next                   iii. Batch processing
d. Round Robin Scheduling             iv. Exponential Smoothening

Codes:
      a    b    c    d
a. i     iii    ii    iv
b. iv   iii    ii    i
c. iii   i     iv    i
d. ii    iii   iv    i
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).ii    iii   iv    i

76. Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time T0, the following snapshot of the system has been taken :

Allocation R1 R2 R3 P0 0 1 0 P1 2 0 0 P2 3 0 2 P3 2 1 1 P4 0 2 2
Max R1 R2 R3 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3
Available R1 R2 R3 3 3 2

Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be
a. Ready State
b. Safe State
c. Blocked State
d. Unsafe State
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Safe State

77. Match the following:

List-I                                                      List-II
a. Contiguous Allocation       i. This scheme supports very large file sizes.
b. Linked allocation                 ii. This allocation technique supports only sequential files.
c. Indexed allocation               iii. Number of disks required to access file is minimal.
d. Multi-level indexed                         iv. This technique suffers from maximum wastage of space in storing pointers

Codes:
      a    b    c    d
a. iii    iv   ii     i
b. iii    ii    iv    i
c. i     ii    iv   iii
d. i    iv    ii    iii
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).iii    ii    iv    i

78. Which of the following is the correct value returned to the operating system upon the successful completion of a program?
a. 0
b. 1
c. -1
d. Program do not return a value
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).0

79. Match the following:

List – I                                                   List - II
Process state transition                   Reason for transition
a. Ready→Running                           i. Request made by the process
is satisfied or an event for which
it was waiting occurs.
b. Blocked→Ready                             ii. Process wishes to wait for
some action by another process.
c. Running→Blocked                         iii. The process is dispatched.
d Running→Ready                            iv. The process is preempted.

Codes :
      a   b   c    d
a. iii   i    ii    iv
b. iv   i    iii   ii
c. iv  iii   i     ii
d. iii  iii   ii     i
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).iii   i    ii    iv

80. The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ................
a. 36 ns
b. 140 ns
c. 122 ns
d. 40 ns
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).140 ns

Page 8 of 18