Test Preparation on UGC-NET, GATE, Data Structure & Computer Science Test Preparation
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
2.
The amortized time complexity to perform ______ operation(s) in Splay trees is O(Ig n).
3.
Which of the following are unary operators in C? 1. ! 2. size of 3. ~ 4. &&
4.
The minimum number of nodes in a binary tree of depth d (root is at level 0) is
5.
The efficient data structure to insert/delete a number in a stored set of numbers is
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 ?
