UGC NET CS 2015 Jun - II

Last Updated :
Discuss
Comments

Question 1

Given that x = 7.5, j = -1.0, n = 1.0, m = 2.0 the value of - - x + j == x>n> = m is: 

  • 0

  • 1

  • 2

  • 3

Question 2

The translator which performs macro calls expansion is called: 

  • Macro processor

  • Micro pre - processor

  • Macro pre - processor

  • Dynamic Linker

Question 3

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cylinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cylinder 24. A seek takes 6 msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?

  • 0.984 sec

  • 0.396 sec

  • 0.738 sec

  • 0.42 sec

Question 4

Match the following port numbers with their uses: 271

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

Question 5

Which of the following is not associated with the session layer ?
  • Dialog control
  • Token management
  • Semantics of the information transmitted
  • Synchronization

Question 6

To determine the efficiency of an algorithm the time factor is measured by:

  • Counting micro seconds

  • Counting number of key operations

  • Counting number of statements

  • Counting kilobytes of algorithm

Question 7

Which of the following algorithms sort n integers, having the range 0 to (n2 - 1), in ascending order in O(n) time ?

  • Selection sort
  • Bubble sort
  • Radix sort
  • Insertion sort

Question 8

A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty?
  • 6
  • 7
  • 8
  • 5

Question 9

Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj which of the following conditions is not true?

  • R(Pi) ∩ W(Pj) = Ф

  • W(Pi) ∩ R(Pj) = Ф

  • R(Pi) ∩ R(Pj) = Ф

  • W(Pi) ∩ W(Pj) = Ф

Question 10

Match the following:
 31

  • (1)

  • (2)

  • (3)

  • (4)

Tags:
UGC-NET

There are 49 questions to complete.

Take a part in the ongoing discussion