Data Structure & Algorithms Question and Answer
Data Structure & Algorithms Question and Answer
41. Two dimensional arrays are also called
- tables arrays
- matrix arrays
- both of the above
- none of the above
43. A data structure where elements can be added or removed at either end but not in the middle is referred as
- Linked lists
- Stacks
- Queues
- Deque
44. The following sorting algorithm is of divide ad-conquer type
- Bubble sort
- Insertion sort
- Quick sort
- None of the above
45. An algorithm that calls itself directly or indirectly is known as
- Recursion
- Polish notation
- Traversal algorithm
- None of the above
46. 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
- A and B both false
- A and B both true
47. The memory address of the first element of an array is called
- base address
- floor address
- foundation address
- first address
48. The memory address of fifth element of an array can be calculated by the formula
- LOC(Array[5])=Base(Array[5])+(5-lower boun(D). where w is the number of words per memory cell for the array words per memory cell for the array
- LOC(Array[5]=Base(Array[4])+(5-upper boun(D), where w is the number of words per memory cell for the array
- LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array words per memory cell for the arrray
- None of the above
49. The following data structure can't store the non-homogeneous data elements
- Arrays
- Records
- Pointers
- None of the above
50. The in order traversal of tree will yield a sorted listing of element of tree in
- Binary trees
- Binary search trees
- Heaps
- None of above