UGC NET CS 2015 Jun - III

Last Updated :
Discuss
Comments

Question 1

Dining Philosopher's problem is a:
  • Producer - consumer problem
  • Classical IPC problem
  • Starvation problem
  • Synchronization primitive

Question 2

Match the following:

List - I List - II
(a) Spooling (i) Allows several jobs in memory to improve CPU utilization
(b) Multiprogramming (ii)Access to shared resources among geographically dispersed computers in a transparent way
(c)Time sharing (iii) Overlapping I/O and computations
(d)Distributed computing (iv)Allows many users to share a computer simultaneously by switching processor frequently

codes:

(a) (b) (c) (d)
(1) (iii) (i) (ii) (iv)
(2) (iii) (i) (iv) (ii)
(3) (iv) (iii) (ii) (i)
(4) (ii) (iii) (iv) (i)
  • (1)
  • (2)
  • (3)
  • (4)

Question 3

In a binary Hamming Code the number of check digits is r then number of message digits is equal to:

  • 2r - 1

  • 2r - r - 1

  • 2r - r + 1

  • 2r + r - 1

Question 4

Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits?
  • 32 kbps
  • 64 kbps
  • 128 kbps
  • 256 kbps

Question 5

Which design matrix is used to measure the compactness of the program in terms of lines of code?

  • Consistency

  • Conciseness

  • Efficiency

  • Accuracy

Question 6

An all-pairs shortest-paths problem is efficiently solved using:

  • Dijkstra\' algorithm

  • Bellman-Ford algorithm

  • Kruskal algorithm

  • Floyd-Warshall algorithm

Question 7

The travelling salesman problem can be solved in:

  • Polynomial time using dynamic programming algorithm

  • Polynomial time using branch-and-bound algorithm

  • Exponential time using dynamic programming algorithm or branch-and-bound algorithm

  • Polynomial time using backtracking algorithm

Question 8

What is the output of the following recursive function when called with n=5?

C++ 
int foo(int n) {
	if(n == 0) 
      return 1;
	else 
      return n * foo(n - 1);
}

  • 1

  • 5

  • 120

  • 720

Question 9

Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct?

  • θ ( f (n)*g(n)) = min (f (n), g(n))

  • [Tex]\theta[/Tex] ( f (n)*g(n)) = max (f (n), g(n))

  • θ( f (n) + g(n)) = min (f (n), g(n))

  • θ ( f (n) + g(n)) = max (f (n), g(n))

Question 10

What is the most appropriate function of Memory Management Unit (MMU)?
  • It is an associative memory to store TLB
  • It is a technique of supporting multiprogramming by creating dynamic partitions
  • It is a chip to map virtual address to physical address
  • It is an algorithm to allocate and deallocate main memory to a process
Tags:
UGC-NET

There are 75 questions to complete.

Take a part in the ongoing discussion