UGC NET CS 2017 Jan - III

Last Updated :
Discuss
Comments

Question 1

One of the disadvantages of user level threads compared to Kernel level threads is
  • If a user-level thread of a process executes a system call, all threads in that process are blocked.
  • Scheduling is application dependent.
  • Thread switching doesn’t require kernel mode privileges.
  • The library procedures invoked for thread management in user level threads are local procedures.

Question 2

Names of some of the Operating Systems are given below: (a) MS-DOS (b) XENIX (c) OS/2 In the above list, following operating systems didn’t provide multiuser facility.
  • (a) only
  • (a) and (b) only
  • (b) and (c) only
  • (a), (b) and (c)

Question 3

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error.

  • t + 1

  • t

  • t - 2

  • t / 2

Question 4

Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be:
  • (1 + x) is factor of G(x)
  • (1 – x) is factor of G(x)

  • (1 + x2) is factor of G(x)

  • x is factor of G(x)

Question 5

In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ________.
  • 2 bytes
  • 1 bytes
  • 4 bytes
  • 5 bytes

Question 6

Any decision tree that sorts n elements has height ________.

  • Ω(log n)

  • Ω(n)

  • Ω(n log n)

  • Ω(n2)

Question 7

What is the best method to go for the game playing problem?

  • Optimal Search

  • Random Search

  • Heuristic Search

  • Stratified Search

Question 8

A recursive function h is defined as follows :

h(m) = k, if m = 0
     = 1, if m = 1
     = 2 h(m – 1) + 4h(m – 2), if m ≥ 2

If the value of h(4) is 88 then the value of k is :

  • 0

  • 1

  • 2

  • -1

Question 9

Match the following with respect to algorithm paradigms : 

 

  • (1)

  • (2)

  • (3)

  • (4)

Question 10

Dijkstra’s algorithm is based on

  • Divide and conquer paradigm

  • Dynamic programming

  • Greedy Approach

  • Backtracking paradigm

Tags:
UGC-NET

There are 76 questions to complete.

Take a part in the ongoing discussion