Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is [G16S2Q21]

Explanation

B+ Trees are considered BALANCED because [G16S2Q31]

Explanation

A complete binary min-heap is made by including each integer in [1,1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is [G16S2Q44]

Explanation

The following function computes X Y for positive integers X and Y [G16S2Q45]

Explanation

Consider the following New-order strategy for traversing a binary tree: [G16S2Q46]

Explanation

Consider the following program: [G16S2Q47]

Explanation

The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is [G16S2Q50]

Explanation

In an adjacency list representation of an undirected simple graph G = (V,E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. [G16S2Q51]

Explanation

The value printed by the following program is . [G16S2Q22]

Explanation

Consider the following directed graph: [G16S1Q21]

Explanation

Consider the following C program [G16S1Q22]

Explanation

Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? [G16S1Q24]

Explanation

Consider the following C program. [G16S1Q25]

Explanation

Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is . [G16S1Q29]

Explanation

The following function computes the maximum value contained in an integer array p[] of size n (n >= 1). [G16S1Q44]

Explanation

What will be the output of the following C program? [G16S1Q45]

Explanation

What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? [G16S1Q46]

Explanation

A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. we maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue respectively. [G17S2Q13]

Explanation

Consider the following function implemented in C: [G17S2Q14]

Explanation

The Breadth First Search(BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below. [G17S2Q15]

Explanation