Data Structures

101. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

1. 2 deletions and 3 additions
2. 3 additions and 2 deletions
3. 3 deletions and 3 additions
4. 3 deletions and 4 additions

View answer

102. The length of the path is the number of_________ on the path.

1. nodes.
2. fields.
3. data.
4. edges.

View answer

103. The length of the string can be listed as an additional item in _________.

1. base pointer.
2. pointer array.
3. node.
4. record.

View answer

104. The logical or mathematical model of a particular organization of data is called a _________.

1. data structure.
2. algorithms.
3. structure.
4. logic structure.

View answer

105. The maximum number of nodes on level i of a binary tree is _________.

1. 2i-1.
2. 3i-1.
3. i+1.
4. 2i+1.

View answer

106. The memory address of the first element of an array is called _________.

1. floor address.
2. foundation address.
3. first address.
4. base address.

View answer

107. The number of edges in a regular graph of degree d and n vertices is _________.

1. maximum of n,d.
2. n+d.
3. nd.
4. nd/2.C

View answer

108. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is _________.

1. 6
2. 5
3. 7
4. 8

View answer

109. The number of nodes in a complete binary tree of level 5 is__________.

1. 15
2. 20
3. 63
4. 31

View answer

110. The number of possible ordered trees with three nodes A,B,C is?

1. 16
2. 12.
3. 10
4. 6

View answer