Question 1

In which tree, for every node the height of its left subtree and right subtree differ almost by one?

Accepted Answer

A)  binary search tree
B)  avl tree
C)  threaded binary tree
D)  complete binary tree B

Question 2

The "C" language is

Accepted Answer

A)  context free language
B)  context sensitive language
C)  regular language
D)  none of the above A

Question 3

int constant var =10;

Accepted Answer

A)  int
B)  const var = 10;
C)  const int var = 10;
D)  b & c both D

Question 4

The statement printf("%c", 100); will print?

Accepted Answer

A)  prints 100
B)  print garbage
C)  prints ascii equivalent of 100
D)  none of the above

Question 5

Which is the correct syntax to declare constant pointer?

Accepted Answer

A)  int *const constptr;
B)  *int constant constptr;
C)  const int *constptr;
D)  a and c both

Question 6

The statement print f ("%d", 10 ? 0 ? 5 : 1 : 12); will print?

Accepted Answer

A)  10
B)  0
C)  12
D)  1

Question 7

To represent hierarchical relationship between elements, which data structure is suitable?

Accepted Answer

A)  priority
B)  tree
C)  dqueue
D)  all of the above

Question 8

The Default Parameter Passing Mechanism is called as

Accepted Answer

A)  call by value
B)  call by reference
C)  call by address
D)  call by name

Question 9

Which of the following data structure is linear type?

Accepted Answer

A)  strings
B)  queue
C)  lists
D)  all of the above

Question 10

The smallest individual units of c program

Accepted Answer

A)  the basic element
B)  ecognized by the compiler
C)  the largest individual units of program
D)  a & b both

Question 11

C is ______ Language?

Accepted Answer

A)  low level
B)  high level
C)  assembly level
D)  machine level

Question 12

Queue is a _____________ list.

Accepted Answer

A)  lifo
B)  lilo
C)  filo
D)  fifo

Question 13

The _______ memory allocation function modifies the previous allocated space.

Accepted Answer

A)  calloc
B)  free
C)  malloc
D)  realloc

Question 14

What is Dequeue?

Accepted Answer

A)  elements can be added from front
B)  elements can be added to or removed from either the front or rear
C)  elements can be added from rear
D)  none of the above

Question 15

Number of binary trees formed with 5 nodes are

Accepted Answer

A)  30
B)  36
C)  108
D)  42

Question 16

The worst case time complexity of AVL tree is better in comparison to binary search tree for

Accepted Answer

A)  search and insert operations
B)  search and delete operations
C)  insert and delete operations
D)  search, insert and delete operations

Question 17

In which linked list last node address is null?

Accepted Answer

A)  doubly linked list
B)  circular list
C)  singly linked list
D)  none of the above

Exam 2: Data Structures and Programming