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.

Saturday, 25 February 2017

UGC NET Computer Science Previous Paper II June 2009 - Part 3

21.       Which construct in SQL is used to test whether a subquery has any tuples in its result?
(A) UNIQUE
(B) EXISTS
(C) GROUP BY
(D) EXCEPT
Answer: B
22.       ORACLE supports:
(A) inner join and outer join only
(B) outer join and semi join only
(C) inner join, outer join , semi join only
(D) inner join, outer join, semi join and anti join
Answer:
23.       Which two of the following are equivalent for an undirected graph G?
(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n-1) edges
(iv) G has n edges
(A) (i) and (ii)
(B) (i) and (iii)
(C) (i) and (iv)
(D) (ii) and (iii)
Answer: B
24.       In a B tree of order m with p nodes the average number of splits is at most:
Answer: B
25.       The prepositional formula given by the tree:
is:
(A) ˄˅x2˅x1¬x1¬x1
(B) (x2˅¬x2)˄(x1˅x2)
(C) (¬x1˅x2)˄(¬x1˅x2)
(D) None
Answer: C

26.       Queue is a ............. list.
(A) LIFO
(B) LILO
(C) FILO
(D) FIFO
Answer: D
27.       In a full binary tree of height k, there are ................. internal nodes.
(A) 2k-1
(B) 2k-1
(C) 2k     
(D) 2k+1
Answer: A
28.       A binary tree is said to have heap property if the elements along any path:
(A) from leaf to root are non-increasing
(B) from leaf to root are non-decreasing
(C) from root to leaf are non-decreasing
(D) from root to leaf are non-increasing
Answer: D
29.       X.25 protocol consists of:
(A) Physical and Frame levels
(B) Frame and Packet levels
(C) Physical, Frame and Packet levels
(D) None of the above
Answer: C
30.    GSM/CDMA systems:
(A) are limited to very low speed data
(B) require no local loop wires
(C) are predominantly used for voice
(D) all of the above
Answer: D

Pages   2   3   4   5 

No comments:

Post a Comment