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.


MCQs Data Structure|UGC-NET|GATE|Data Structures

1.Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is
View/Hide Ans
2.The amortized time complexity to perform ______ operation(s) in Splay trees is O(Ig n).
B.Search & Insert
C.Search & Delete
D.Search,Insert & Delete
View/Hide Ans
3.Suppose that the splits at every level of Quicksort are in proportion 1-β to β, where 0 ‹ β ‹ = 0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately
A.0.5 β Ig n
B.0.5 (1 − β) Ig n
C.β (Ig n)/(Ig β)
D.− (Ig n)/Ig (1 − β)
View/Hide Ans
4.The min. number of nodes in a binary tree of depth d (root at level 0) is
A.2d − 1
B.2d + 1 − 1
C.d + 1
View/Hide Ans
5.The efficient data structure to insert/delete a number in a stored set of numbers is
B.Linked list
C.Doubly linked list
D.Binary tree
View/Hide Ans
6.Consider the following statements : (i) A graph in which there is a unique path between every pair of vertices is a tree. (ii) A connected graph with e = v − 1 is a tree. (iii) A graph with e = v − 1 that has no circuit is a tree. Which of the above statements is/are true ?
A.(i) & (iii)
B.(ii) & (iii)
C.(i) & (ii)
D.All of the above
View/Hide Ans
7.Consider the In-order and Post-order traversals of a tree as given below : In-order : j e n k o p b f a c l g m d h i Post-order : j n o p k e f b c l m g h i d a The Pre-order traversal of the tree shall be
A.a b f e j k n o p c d g l m h i
B.a b c d e f j k n o p g l m h i
C.a b e j k n o p f c d g l m h i
D.j e n o p k f b c l m g h i d a
View/Hide Ans
8.A simple graph G with n − vertices is connected if the graph has
A.(n − 1) (n − 2)/2 edges
B.more than (n − 1) (n − 2)/2 edges
C.less than (n − 1) (n − 2)/2 edges
D.k(i=1) C(ni, 2) edges
View/Hide Ans
9.Linked Lists are not suitable for _____.
A.Binary Search
B.Polynomial Manipulation
D.Radix Sort
View/Hide Ans
10.The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
B.O(n Ig n)
D.None of the above
View/Hide Ans

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

Pages: 1 2 3 4 5 6