UGC-NET CS 2017 Nov - III

Last Updated :
Discuss
Comments

Question 1

The Bounded buffer problem is also known as __________.
  • Producer - consumer problem
  • Reader - writer problem
  • Dining Philosophers problem
  • Both (2) and (3)

Question 2

User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads. Which of the following statements is/are true ? (a) (i) The Many - to - one model maps many user threads to one kernel thread (ii) The one - to - one model maps one user thread to one kernel thread (iii) The many - to - many model maps many user threads to smaller or equal kernel threads (b) (i) Many - to - one model maps many kernel threads to one user thread (ii) One - to - one model maps one kernel thread to one user thread (iii) Many - to - many model maps many kernel threads to smaller or equal user threads

  • (a) is true; (b) is false

  • (a) is false; (b) is true

  • Both (a) and (b) are true

  • Both (a) and (b) are false

Question 3

Match the following: 1

  • (1)

  • (2)

  • (3)

  • (4)

Question 4

If a file consisting of 50,000 characters takes 40 seconds to send, then the data rate is __________.
  • 1 kbps
  • 1.25 kbps
  • 2 kbps
  • 10 kbps

Question 5

Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an average of 24 lines with 80 characters in each line. What is the required bit rate of the channel?

  • 192 kbps

  • 512 kbps

  • 1.248 Mbps

  • 1.536 Mbps

Question 6

Consider the recurrence relation: 33 Where b and c are constants. The order of the algorithm corresponding to above recurrence relation is:

  • n

  • n2

  • n log n

  • n3

Question 7

If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?

  • O(b+m)

  • O(bm)

  • O(bm)

  • O(mm)

Question 8

You are given a sequence of n elements to sort. The input sequence consists of n/k subsequences,each containing k elements. The elements in a given subsequence are all smaller than the elements in the succeeding subsequence and larger than the elements in the preceding subsequence. Thus, all that is needed to sort the whole sequence of length n is to sort the k elements in each of the n/k subsequences. The lower bound on the number of comparisons needed to solve this variant of the sorting problem is
  • Ω (n)
  • Ω (n/k)
  • Ω (nlogk )
  • Ω (n/klogn/k)

Question 9

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:

  • 2.40

  • 2.16

  • 2.26

  • 2.15

Question 10

Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then __________ page replacement algorithm has minimum number of page faults.
  • FIFO
  • LIFO
  • LRU
  • Optimal
Tags:
UGC-NET

There are 74 questions to complete.

Take a part in the ongoing discussion