Discussion Forum

Interative Forum for discussing any query literally to UGC-NET Computer Science, GATE Computer Science and Computer Sciene and Technology in general.

ugc_net image

UGC-NET Computer Science

Correspondence Courses and Test Series to prepare for UGC-NET computer science and applications

GATE image


MCQs, Lecture Notes, Ebooks for GATE preparation

freestuff image
jobs image

Jobs Newsfeed

Timely information of various Recruitments.


Answer Key and Solved Questions Paper-3 UGC-NET Computer Science November 2017

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
Code :
A.(a) is true; (b) is false
B.(a) is false; (b) is true
C.Both (a) and (b) are true
D.Both (a) and (b) are false
View/Hide Ans
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.

If we implement Deadlock detection algorithm we claim that system is ..................
B.Deadlock state
C.Circular wait
D.Not in deadlock state
View/Hide Ans
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.
View/Hide Ans
54.The Bounded buffer problem is also known as ..................
A.Producer - consumer problem
B.Reader - writer problem
C.Dining Philosophers problem
D.Both (2) and (3)
View/Hide Ans
55.In Artificial Intelligence (AI), which agent deals with happy and unhappy state?
A.Simple reflex agent
B.Model based agent
C.Learning agent
D.Utility based agent
View/Hide Ans
56.If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
View/Hide Ans
57.Let P, Q, R and S be Propositions. Assume that the equivalences P?(Q?Q) and Q?R hold. Then the truth value of the formula (P?Q)?((P?R)?S) is always : (1) True (2) False (3) Same as truth table of Q (4) Same as truth table of S Answer: 1
View/Hide Ans
58.If X, then Y unless Z is represented by which of the following formulae in propositional logic?
A.(X Λ Y) → ¬ Z
B.(X Λ ¬ Z) → Y
C.X → (Y Λ ¬ Z)
D.Y → (XΛ ¬ Z)
View/Hide Ans
59.Consider the following two well-formed formulas in prepositional logic.
F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ? (¬ P ⇒ P)
Which of the following statements is correct?
A.F1 is Satisfiable, F2 is valid
B.F1 is unsatisfiable, F2 is Satisfiable
C. F1 is unsatisfiable, F2 is valid
D.F1 and F2 both are Satisfiable
View/Hide Ans
60.Standard planning algorithms assume environment to be .................
A.Both deterministic and fully observable
B.Neither deterministic nor fully observable
C.Deterministic but not fully observable
D.Not deterministic but fully observable
View/Hide Ans

Author Does Not claim of any answer these answers are as per expert opinion

Pages: 1 2 3 4 5 6