January 8, 2025

ISRO CS 2015

Question 11 If the sequence of operations – push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on […]
January 13, 2025

GATE-2024-CS1(Forenoon)

Question 41 An array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the following options represents the first three […]
January 13, 2025

GATE-2024-CS1(Forenoon)

Question 43 Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the […]
January 20, 2025

GATE 2011

Question 40 We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate […]
January 27, 2025

UGC NET CS 2013 Sep-paper-2

Question 12 The efficient data structure to insert/delete a number in a stored set of numbers is A Queue B Linked list C Doubly linked list […]
February 19, 2025

Data-Structures

Question 691 A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to s7 are initially entered using a […]
February 27, 2025

BFS-and-DFS

Question 3 Let U = {1, 2, 3}. Let 2U denote the powerset of U. Consider an undirected graph G whose vertex set is 2U . […]
March 8, 2025

BFS-and-DFS

Question 14 Consider the following directed graph. Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier […]
March 12, 2025

GATE 2005

Question 6 An undirected graph C has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are […]
March 12, 2025

GATE 2005

Question 36 In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is: […]
March 12, 2025

GATE 2005

Question 84 Let s and t be two vertices in a undirected graph G=(V,E) having distinct positive edge weights. Let [X, Y] be a partition of […]
March 12, 2025

GATE 2005

Question 83 Let s and t be two vertices in a undirected graph G=(V,E) having distinct positive edge weights. Let [X, Y] be a partition of […]