Question No: 1    ( Marks: 1 )    - Please choose one

A subscript of an array may be an integer or an integer expression.

 

► True

► False

Question No: 2    ( Marks: 1 )    - Please choose one

Doubly Linked List always has one NULL pointer.

 

► True

► False

Question No: 3    ( Marks: 1 )    - Please choose one

 

In which of the traversal method, the recursive calls can be used to traverse a binary tree  ?

►  In preorder traversal only

►  In inorder traversal only

►  In postorder traversal only

►  All of the given options

Question No: 4    ( Marks: 1 )    - Please choose one

A tree is an AVL tree if 

 

► Any one node fulfills the AVL condition

► At least half of the nodes fulfill the AVL condition

► All the nodes fulfill the AVL condition

► None of the given options

Question No: 5    ( Marks: 1 )    - Please choose one

Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What boolean expression will be true when cursor refers to the tail node of the list?

 

► (currentNode == null)

► (currentNode->nextNode == null)

► (nextNode.data == null)

► (currentNode.data == 0.0)

Question No: 6    ( Marks: 1 )    - Please choose one

Suppose that the class declaration of SomeClass includes the following function prototype.

bool LessThan( SomeClass anotherObject );

Which of the following tests in the client code correctly compares two class objects alpha and beta?

 

► if (alpha < beta)

► if (alpha.LessThan(beta))

► if (LessThan(alpha, beta))

► if (LessThan(alpha).beta)

Question No: 7    ( Marks: 1 )    - Please choose one

In C what is the operation that you can not do with primitive types?

► Assign a value to primitive type using a literal

► Declare primitive types to be constant using the Const keyword

► Create a new instance of primitive type with New keyword

► None of these

Question No: 8    ( Marks: 1 )    - Please choose one

The operation for adding an entry to a stack is traditionally called :      

► add

► append

► insert

► push

Question No: 9    ( Marks: 1 )    - Please choose one

The operation for removing an entry from a stack is traditionally called:     

► delete

► peek

► pop

► remove

Question No: 10    ( Marks: 1 )    - Please choose one

Consider the following sequence of push operations in a stack:      

stack.push(’7’);

stack.push(’8’);

stack.push(’9’);

stack.push(’10’);

stack.push(’11’);

stack.push(’12’);

 

► 7 8 9 10 11 12

► 9 8 11 10 7 12

► 9 10 8 11 12 7

► 9 10 8 12 7 11

Question No: 11    ( Marks: 1 )    - Please choose one

________ is the maximum number of nodes that you can have on a stack-linked list ?

► Zero

► 2n (where n is the number of nodes in linked list)

► Any Number

► None of these

Question No: 12    ( Marks: 1 )    - Please choose one

Which of the following can be used to reverse a string value,

 

► Stack

 

► Queue

 

► Both of these

 

► None of these

 

Question No: 13    ( Marks: 1 )    - Please choose one

Consider the following tree,

 

 

 

 

 

 

 

How many leaves does it have?

 

► 2

► 4

► 6

► 9

Question No: 14    ( Marks: 1 )    - Please choose one

AVL Tree is,

 

► Non Linear data structure

 

► Linear data structure

 

► Hybrid data structure (Mixture of Linear and Non Linear)

 

► None of the given options.