Wednesday, 3 February 2016

CBSE UGC NET Computer Science Paper III Solved December 2015 - Part 5

41.       Match the following in Unix file system :
List - I                         List - II
(a) Boot block               (i) Information about file system
(b) Super block            (ii) Information about file
(c) Inode table              (iii) Storage space
(d) Data block               (iv) Code for making OS ready
Codes :
      (a)  (b)  (c)  (d)
(A) (iv)  (i)   (ii)  (iii)
(B) (i)    (iii) (ii)  (iv)
(C) (iii)  (i)   (ii)  (iv)
(D) (iv)  (ii)  (i)   (iii)
Answer: A
42.       In an operating system, indivisibility of operation means :
(A) Operation is interruptable
(B) Race - condition may occur
(C) Processor can not be pre-empted
(D) All of the above
Answer: C
43.       A horn clause is ......................
(A) A clause in which no variables occur in the expression
(B) A clause that has at least one negative literal
(C) A disjunction of a number of literals
(D) A clause that has at most one positive literal
Answer: D
44.       In Propositional Logic, given P and P→Q, we can infer .................
(A) ~Q                (B) Q
(C) PQ             (D) ~PQ
Answer: B
45.       Reasoning strategies used in expert systems include ...............
(A) Forward chaining, backward chaining and problem reduction
(B) Forward chaining, backward chaining and boundary mutation
(C) Forward chaining, backward chaining and back propagation
(D) Backward chaining, problem reduction and boundary mutation
Answer: A

46.       Language model used in LISP is .................
(A) Functional programming                         (B) Logic programming
(C) Object oriented programming     (D) All of the above
Answer: A
47.       In constraint satisfaction problem, constraints can be stated as ...................
(A) Arithmatic equations and inequalities that bind the values of variables
(B) Arithmatic equations and inequalities that doesn’t bind any restriction over variables
(C) Arithmatic equations that impose restrictions over variables
(D) Arithmatic equations that discard constraints over the given variables
Answer: A
48.       As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), purchase method has following advantage :
(A) It has high level of flexibility
(B) It doesn’t require cash up-front
(C) It is a business investment
(D) Little risk of obsolescence
Answer: C
49.       Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has alphabet X={0,1} and associated probabilities {1/2,1/2}. The channel matrix is
where p is the transition probability. Then the conditional entropy is given by :
(A) 1                                           (B) -plog(p)-(1-p)log(1-p)
(C) 1+plog(p)+(1-p)log(1-p)    (D) 0
Answer: B
50.    Which of the following is not a lossy compression technique ?
(A) JPEG           (B) MPEG
(C) FFT              (D) Arithmetic coding
Answer: D


0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App