Follow Us :

PREVIOUS YEAR SOLVED PAPERS - November 2017 Paper 3

Avatto > > UGC NET COMPUTER SCIENCE > > PREVIOUS YEAR SOLVED PAPERS > > November 2017 Paper 3

51. 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

  • Option : A
  • Explanation :
    (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 All statement are correct.
    So, option (A) is correct.
Cancel reply
Cancel reply

52. Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0 we have the following allocation.

Nov2017 cs

If we implement Deadlock detection algorithm we claim that system is __________.
(1) Semaphore
(2) Deadlock state
(3) Circular wait
(4) Not in deadlock state

Cancel reply
Cancel reply

53. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are __________ if the disk head is initially at 53.

  • Option : C
  • Explanation :
    Nov2017 cs
    Now add all seek time: 12+2+30+23+84+24+2+59=236 So, option (C) is correct.
Cancel reply
Cancel reply

54. The Bounded buffer problem is also known as __________.

  • Option : A
  • Explanation :
    The bounded buffer problem is also known as producer-consumer problem.
    So, option (A) is correct.
Cancel reply
Cancel reply

55. In Artificial Intelligence (AI), which agent deals with happy and unhappy state?

  • Option : D
  • Explanation :
    Utility based agent deals with happy and unhappy state in artificial intelligence (AI). So, option (D) is correct.
Cancel reply
Cancel reply
Related Quiz.
November 2017 Paper 3