March 14, 2025

GATE 2009

Question 36 The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open […]
March 14, 2025

GATE 2009

Question 37 What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0. […]
March 14, 2025

GATE 2008

Question 42 G is a graph on n vertices and 2n–2 edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which of […]
March 15, 2025

GATE 1987

Question 7 If the number of leaves in a tree is not a power of 2, then the tree is not a binary tree. A True […]
March 22, 2025

GATE-2024-CS1(Forenoon)

Question 21 In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases? A Only […]
March 22, 2025

NTA UGC NET Dec 2024 Paper-2

Question 5 Which of the following uses only increment operations for adding and removing element at either end? A Queues B Stacks C Priority Queues D […]
March 23, 2025

GATE-2024-CS1(Forenoon)

Question 45 Let G be a directed graph and T a depth first search (DFS) spanning tree in G that is rooted at a vertex v. […]
April 5, 2025

GATE 2008-IT

Question 12 Which of the following is TRUE? A The cost of searching an AVL tree is θ (log n) but that of a binary search […]
April 5, 2025

Nielit Scientist-B CS 4-12-2016

Question 15 Which of the following need not be a binary tree? A Search tree B Heap C AVL tree D B tree Data-StructuresBinary-Trees Question 15 […]
April 6, 2025

GATE 2006-IT

Question 11 If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum […]
April 14, 2025

NTA UGC NET Aug 2024 Paper-2

Question 36 Let G(V, E) be an un-directed graph with l edges. Then the sum of degree of all vertices is equal to _________. A 2l […]
April 15, 2025

UGC NET JRF November 2020 Paper-2

Question 32 Which among the following statement(s) is (are) true? A) A hash function takes a message of arbitrary length and generates a fixed length code. […]