Q. Consider the following operations performed on a stack of size 5:
Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e);
Which of the following statements is correct?

View solution

Q. Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

View solution

Q. Which of the following is not an inherent application of stack?

View solution

Q. In how many ways can the string
A∩B - A ∩ B -A
be fully parenthesized to yield an infix expression ?

View solution

Q. The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............

View solution

Q. Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array?

View solution

Q. The seven elements A, B, C, D, E, F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ...................

View solution

Q. What features make C++ so powerful ?

View solution

Q. The mechanism that binds code and data together and keeps them secure from outside world is known as

View solution

Q. Assume that we have constructor functions for both base class and derived class. Now consider the declaration in main( ). Base * P = New Derived; in what sequence will the constructor be called ?

View solution

Q. Any decision tree that sorts n elements has height ..............

View solution

Q. Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case.

View solution

Q. Dijkstra’s algorithm is based on

View solution

Q. Match the following with respect to algorithm paradigms:
List-I                              List-II
a. Merge sort                 i. Dynamic Programming
b. Huffman coding       ii. Greedy approach
c. Optimal polygon triangulation iii. Divide and conquer
d. Subset sum problem          iv. Back tracking

Codes:
     a   b  c   d

View solution

Q. Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements?

I. Abstraction allows us to focus on what something does without considering the complexities of how it works.
II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us.

View solution

Q. Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE?

I. An abstract class is one that is not used to create objects.
II. An abstract class is designed only to act as a base class to be inherited by other classes.

View solution

Q. With respect to a loop in the transportation table, which one of the following is not correct?

View solution

Q. At which of the following stage(s), the degeneracy do not occur in transportation problem?
(m, n represents number of sources and destinations respectively)

(a) While the values of dual variables ui and vj cannot be computed.
(b) While obtaining an initial solution, we may have less than m + n -1 allocations.
(c) At any stage while moving towards optimal solution, when two or more occupied cells with the same minimum allocation become unoccupied simultaneously.
(d) At a stage when the no. of +ve allocation is exactly m + n - 1.

View solution

Q. Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ?

View solution

Q. Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is

View solution