Data Structures

61. In a graph G if e=(u,v), then u and v are called _________.

1. endpoints.
2. adjacent nodes.
3. neighbours.
4. all of the above.

View answer

62. In a linked list the __________field contains the address of next element in the list.

1. Link field.
2. Next element field.
3. Start field.
4. Info field .

View answer

63. In linear search algorithm the Worst case occurs when _________.

1. The item is somewhere in the middle of the array.
2. The item is not in the array at all.
3. The item is the last element in the array.
4. The item is the last element in the array or is not there at all.

View answer

64. In variable length storage two dollar signs are used to signal the _________.

1. end of the string.
2. beginning of the string.
3. mid-level of the string.
4. index.

View answer

65. Inorder traversal of binary search tree will produce _________.

1. unsorted list.
2. sorted list.
3. reverse of input.
4. none of these.

View answer

66. Length of linear array can be found by using the formula _________

1. UB-LB+1
2. LB+UB
3. LB-UB
4. LB-UB+1

View answer

67. Linked lists are suitable for which of the following problems?

1. Insertion sort
2. Binary search
3. Radix sort
4. dequeue.

View answer

68. Matrices with a relatively high proportion of zero entries are called _________ matrices.

1. sparse.
2. Null.
3. Zero.
4. worse.

View answer

69. Maximum degree in any vector in a graph with n vertices is _________.

1. n.
2. n-1.
3. n+1.
4. 2n+1.

View answer

70. New data are to be inserted into a data structure, but there is no available space; this situation is usually called _________.

1. Underflow.
2. Overflow.
3. Houseful.
4. Saturated.

View answer