Data Structures

31. Accessing and processing each array elements is called _________.

1. sorting.
2. traversing.
3. searching.
4. merging.

View answer

32. Allocating memory for arrays during program compilation is_________.

1. dynamic memory allocation.
2. memory allocation.
3. static allocation.
4. random allocation.

View answer

33. An _________ is a well defined list of steps for solving a problem.

1. Algorithm.
2. Program.
3. Procedure.
4. Process.

View answer

34. An algorithm that calls itself directly or indirectly is known as _________.

1. Sub algorithm. .
2. Recursion.
3. Polish notation.
4. Traversal algorithm.

View answer

35. An edge E is called _________ if it has identical endpoints.

1. multiple edges.
2. loops.
3. finite.
4. digraph.

View answer

36. An m*n array has _________ number of elements.

1. m.
2. n.
3. m2.
4. m*n.

View answer

37. Arrays are best data structures for _________.

1. relatively permanent collections of data.
2. the size of the structure and the data in the structure are constantly changing.
3. both of above situation.
4. None of the above.

View answer

38. Base address is the address of _________.

1. first element
2. middle element
3. last element
4. pivot element

View answer

39. Binary search algorithm cannot be applied to _________ concept.

1. unsorted linked list.
2. sorted binary trees.
3. sorted linear array.
4. pointer array.

View answer

40. Breadth First search is used in_________.

1. binary tree.
2. stacks.
3. graphs.
4. both a and c.

View answer