September 30, 2023

Data-Structures

Question 1 Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case […]
October 3, 2023

Data-Structures

Question 3 A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT […]
October 3, 2023

UGC NET CS 2011 June-Paper-2

Question 24 Consider a hash table of size m = 10000 and the hash function h(k) = ⌊m(kA mod 1)’⌋ for      A=(√5 – 1)/2 . The […]
October 3, 2023

GATE 2007

Question 12 The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in […]
October 3, 2023

Data-Structures

Question 259 If node A has three siblings and B is a parent of A, what is the degree of A? A 0 B 3 C […]
October 3, 2023

Data-Structures

Question 266 In an array of 2N elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be […]
October 4, 2023

GATE 2019

Question 41 Consider the following statements: I. The smallest element in a max-heap is always at a leaf node. II. The second largest element in a […]
October 4, 2023

Data-Structures

Question 9 The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is ___________. A 80 B 81 […]
October 4, 2023

UGC-NET DEC-2019 Part-2

Question 84 Consider the game tree given below Here Ο and • represent MIN and MAX nodes respectively. The value of the root node of the […]
October 4, 2023

Data-Structures

Question 682 Let ‘n’ denote a positive integer. Suppose a function F is defined as What is f(25)? and what does this function find? A 1 […]
October 5, 2023

GATE 2008

Question 7 The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity […]
October 5, 2023

GATE 2007

Question 5 Consider the DAG with Consider V = {1, 2, 3, 4, 5, 6}, shown below. Which of the following is NOT a topological ordering? […]