Computer Science Study Materials for Competitive Exams

Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Sunday, 9 October 2016

UGC NET Computer Science Previous Questions June 2013 Paper 2 - Part 4

31.       Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as
(A) Data mining                       (B) Meta data
(C) Data warehousing                        (D) Database
Answer: C
32.       The task of correcting and pre processing data is called as
(A) Data streaming      (B) Data cleaning
(C) Data mining           (D) Data storming
Answer: B
33.       Using data p=3, q=11, n=pq, d=7  in RSA algorithm find the cipher text of the given plain text SUZANNE
(A) BUTAEEZ               (B) SUZANNE
(C) XYZABCD              (D) ABCDXYZ
Answer: A
34.       The relation "divides" on a set of positive integers is ..................
(A) Symmetric and transitive
(B) Anti symmetric and transitive
(C) Symmetric only
(D) Transitive only
Answer: B
The ‘divide’ operation is antisymmetric because if a divides b does not necessarily implies that b divides a. If a divides b and b divides c then a divides c. So, it is transitive as well.
35.       Give as good a big-O estimate as possible for the following functions:
(nlogn+n2)(n3+2) and (n!+2n)(n3+log(n2+ 1))
(A) O(n5+2n2) & O(n3*n!)
(B) O(n5) & O(n3*2n)
(C) O(n5) & O(n3*n!)
(D) O(n5+2n2) & O(n3*2n)
Answer: C

36.       A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.
(A) 100P2             (B) 100C2    
(C) 2100              (D) 3100
Answer: D
For every question we can leave it blank or answer TRUE or answer FALSE. So, for each question we have 3 options.
So, total ways of answering the test is 3*3*3*..... 100 times = 3100
37.       Which of the following connected simple graph has exactly one spanning tree?
(A) Complete graph     (B) Hamiltonian graph
(C) Euler graph                        (D) None of the above
Answer: D
38.       How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?
(A) M+N-C         (B) M-N-C
(C) M-N+C        (D) M+N+C
Answer: C
39.       Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?
(A) (pq˥r) (pqr) (˥pqr)
(B) (pqr) (pqr) (˥q˥p˥r)
(C) (pq˥r) (p˥qr) (˥pqr)
(D) (prq) (pqr) (˥pqr)
Answer: C
40.    The truth value of the statements:
!xP(x)→xP(x) and !x˥P(x)→˥xP(x), (where the notation !xP(x) denotes the proposition "There exists a unique x such that P(x) is true'') are:
(A) True and False      (B) False and True
(C) False and False    (D) True and True
Answer: D

Pages   2   3   4   5 

No comments:

Post a Comment