UGC NET CS 2014 Dec - III

Last Updated :

Discuss

Comments

Question 1

For switching from a CPU user mode to the supervisor mode following type of interrupt is most appropriate

A
Internal interrupts
B
External interrupts
C
Software interrupts
D
None of the above

Question 2

In a dot matrix printer the time to print a character is 6 m.sec., time to space in between characters is 2 m.sec., and the number of characters in a line are 200. The printing speed of the dot matrix printer in characters per second and the time to print a character line are given by which of the following options?

A
125 chars/second and 0.8 seconds
B
250 chars/second and 0.6 seconds
C
166 chars/second and 0.8 seconds
D
250 chars/second and 0.4 seconds
E
125 chars/second and 1.6 seconds

Question 3

Monitor is an Interprocess Communication (IPC) technique which can be described as

A
It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package.
B
It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations.
C
It uses two primitives, send and receive which are system calls rather than language constructs.
D
It consists of the IPC primitives implemented as system calls to block the process when they are not allowed to enter critical region to save CPU time.

Question 4

How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous ? (Assuming 1 start bit and 1 stop bit)

A
300
B
320
C
360
D
400

Question 5

What is the propagation time if the distance between the two points is 48,000 ? Assume the propagation speed to be 2.4 × 10⁸ meter/second in cable.

A
0.5 ms
B
20 ms
C
50ms
D
200ms

Question 6

Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _________

A
Greedy algorithm, Divide-conquer algorithm
B
Divide-conquer algorithm, Greedy algorithm
C
Greedy algorithm, Dynamic programming algorithm
D
Dynamic programming algorithm, Greedy algorithm

Question 7

Match the following:

List - I	List - II
(a) Bucket sort	(i) O(n³ lgn)
(b) Matrix chain multiplication	(ii) O(n³)
(c)Huffman codes	(iii) O(nlgn)
(d)All pairs shortest paths	(iv)O(n)

codes:

	(a)	(b)	(c)	(d)
(A)	(iv)	(ii)	(i)	(iii)
(B)	(ii)	(iv)	(i)	(iii)
(C)	(iv)	(ii)	(i)	(iii)
(D)	(iii)	(ii)	(iv)	(i)

A
(A)
B
(B)
C
(C)
D
(D)

Question 8

Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ?

A
Windows Vista
B
Windows 2000
C
Windows NT
D
Windows 98

Question 9

An operating system has 13 tape drives. There are three processes P1, P2 & P3. Maximum requirement of P1 is 11 tape drives, P2 is 5 tape drives and P3 is 8 tape drives. Currently, P1 is allocated 6 tape drives, P2 is allocated 3 tape drives and P3 is allocated 2 tape drives. Which of the following sequences represent a safe state ?

A
P2 P1 P3
B
P2 P3 P1
C
P1 P2 P3
D
P1 P3 P2

Question 10

Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16, 34, 9 and 12 in that order. The number of arm motions using shortest seek first algorithm is

A
111
B
112
C
60
D
61

Tags:

UGC-NET

There are 74 questions to complete.

Take a part in the ongoing discussion