UGC NET CS 2015 Dec – III

Last Updated :
Discuss
Comments

Question 1

In an operating system, indivisibility of operation means:

  • Operation is interruptible

  • Race - condition may occur

  • Processor can not be pre-empted

  • All of the above

Question 2

Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in:

  • safe state
  • unsafe state
  • deadlocked state
  • starvation state

Question 3

In CRC based design, a CRC Team consists of: 

(a)one or two users representatives 

(b)several programmers 

(c)project co-ordinators 

(d)one or two system analysts Codes:

  • (a) and (c)

  • (a), (b), (c) and (d)

  • (a), (c) and (d)

  • (a), (b) and (d)

Question 4

In electronic mail, which of the following protocols allows the transfer of multimedia messages?
  • IMAP
  • SMTP
  • POP 3
  • MIME

Question 5

The combination of an IP address and a port number is known as ___________.
  • network number
  • socket address
  • subnet mask number
  • MAC address

Question 6

Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.

  • Greedy algorithm, θ (V3)

  • Greedy algorithm, θ (V2 lgn)

  • Dynamic programming, θ (V3)

  • Dynamic programming, θ (V2 lgn)

Question 7

Given two sequences X and Y : X = < a, b, c, b, d, a, b > Y = < b, d, c, a, b, a > . The longest common subsequence of X and Y is :

  • < b, c, a>

  • < c, a, b>

  • < b, c, a, a>

  • < b, c, b, a>

Question 8

Match the following with respect to various memory management algorithms: 37

  • (1)
  • (2)
  • (3)
  • (4)

Question 9

The character set used in Windows 2000 operating system is __________
  • 8 bit ASCII
  • Extended ASCII
  • 16 bit UNICODE
  • 12 bit UNICODE

Question 10

A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes?
  • 0.64
  • 0.96
  • 2.00
  • 0.32
Tags:
UGC-NET

There are 74 questions to complete.

Take a part in the ongoing discussion