DataStructures

1.

1 point

A complete Binary Tree with 15 nodes contains________edges

16

14

30

15

2.

1 point

The balance factor for an AVL tree is either

0,1 or –1

–2,–1 or 0

0,1 or 2

All the above

3.

1 point

The operation of processing each element in the list is known as

Sorting

Inserting

Traversal

Merging

4.

1 point

In a binary tree, the number of terminal or leaf nodes is 10. The number of nodes with two children is

9

15

11

20

5.

1 point

The search technique for searching a sorted file that requires increased amount of space is

indexed sequential search

interpolation search

sequential search

tree search

6.

1 point

When determining the efficiency of algorithm the time factor is measured by

Counting the number of statements

Counting microseconds

Counting the number of key operations

Counting the kilobytes of algorithm

7.

1 point

The number of unused pointers in a complete binary tree of depth 5 is

4

32

16

8

8.

1 point

The prefix form of an infix expression A+B-C*D is

-+A B C * D

+AB-*CD

- + *ABCD

-+A B * C D

9.

1 point

What will be the output of following statements ?
char x[ ] = "hello hi"; printf("%d%d",sizeof(*x),sizeof(x));

88

19

18

29

10.

1 point

The Average case occur in linear search algorithm

When Item is the last element in the array or is not there at all

When Item is somewhere in the middle of the array

When Item is not in the array at all

When Item is the last element in the array

11.

1 point

Inorder to get the information stored in a BST in the descending order, one should traverse it in which of the following order?

right, root, left

right, left, root

left, root, right

root, left, right

12.

1 point

The elements of an array are stored successively in memory cells because

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

the architecture of computer memory does not allow arrays to store other than serially

both of above

none of above

13.

1 point

Level of any node of a tree is

Its distance from the root

None of these

Height of its left subtree minus height of its right subtree

Height of its right subtree minus height of its left subtree

14.

1 point

Which of the following data structure is linear data structure?
a.
b.
c.
d.

Trees

Graphs

Arrays

None of above

15.

1 point

The postfix form of A ^ B * C - D + E/ F/ (G + H),

ABCDEFGH+//+-*^

AB^CD-EP/GH+/+*

AB^C*D-EF/GH+/+

AB^D +EFGH +//*+

16.

1 point

Arrays are best data structures

for relatively permanent collections of data

for the size of the structure and the data in the structure are constantly changing

for both of above situation

for none of above situation

17.

1 point

Applications of Linked List are

Fixed block storage allocation, garbage collection

Postfix and prefix manipulations

Simulation , event driven systems

Dictionary systems, polynomial manipulations

18.

1 point

A graph with n vertices will definitely have a parallel edge or self loop if the total
number of edges are

more than (n+1)/2

more than n

more than n(n-1)/2

more than n+1

19.

1 point

Which of the following case does not exist in complexity theory

Worst case

Best case

Null case

Average case

20.

1 point

Finding the location of the element with a given value is:

None of above

Traversal

Sort

Search

21.

1 point

The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is

3

2

4

5

22.

1 point

Graphs are represented using

Adjacency tree

Adjacency graph

Adjacency linked list

Adjacency queue

23.

1 point

The complexity of Binary search algorithm is

O(n2)

O(n log n)

O(n)

O(log n)

24.

1 point

What will be the output of following statements ?
char x[ ] = "hello hi"; printf("%d%d",sizeof(*x),sizeof(x));

18

29

19

88

25.

1 point

Which is not dynamic memory allocation function?

alloc

free

calloc

malloc

26.

1 point

The elements of an array are stored successively in memory cells because
a.
b.
c.
d.

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

the architecture of computer memory does not allow arrays to store other than serially

both of above

none of above

27.

1 point

Two main measures for the efficiency of an algorithm are

Time and space

Processor and memory

Complexity and capacity

Data and space

28.

1 point

In linear search algorithm the Worst case occurs when

The item is somewhere in the middle of the array

The item is not in the array at all

The item is the last element in the array

The item is the last element in the array or is not there at all

29.

1 point

What would be returned by the following recursive function after we call test (0, 3)
int test (int a, int b)
{
if (a==b) return (1);
else if (a>b) return(0);
else return (a+test(a+1, b));
}

2

1

3

4

30.

1 point

What will be the output of the following statements ?int i = 1,j; j=i--- -2; printf("%d",j);

3

error

-3

2

31.

1 point

Direct or random access of elements is not possible in

String

Linked list

Array

None of these

32.

1 point

In ________, it is possible to traverse a tree without using stacks either implicitly or
explicitly.

Heap

Threaded binary trees.

B+ tree

AVL Tree

33.

1 point

Out of the following, the slowest sorting procedure is

Heap Sort

Shell Sort

Quick Sort

Bubble Sort

34.

1 point

For implementing recursive function the data structure used is:

Queue

Linked List

Tree

Stack

35.

1 point

The result of evaluating the following postfix expression is
5, 7, 9, *, +, 4, 9, 3, /, +, -

50

69

61

65

36.

1 point

When determining the efficiency of algorithm, the space factor is measured by

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

Counting the average memory needed by the algorithm