(A) Lemma tree
(B) Red Black tree
(C) AVL tree
(D) None of the above
Tag: Data Structures and Algorithms Mcq
Which among the following are the levels of implementation of data structure?
(A) Implementation level
(B) Abstract level
(C) Application level
(D) All of the above
Which among following concept makes extensive use of arrays?
(A) Spatial locality
(B) Caching
(C) Scheduling of processes
(D) Binary trees
What is the correct way to declare multidimensional array in java?
(A) int[[]] arr;
(B) int[][]arr;
(C) int[] arr;
(D) All are correct
Among following identify linear data structure?
(A) Binary trees
(B) AVL trees
(C) Graphs
(D) Arrays
Sparse array is?
(A) An array in which the most of the elements have the same value
(B) Array in which the memory is allocated in run time
(C) Data structure that compactly stores bit
(D) Data structure for representing arrays of records
Sparse array used when?
(A) The data type of elements differs
(B) Elements are sorted
(C) There are unique elements in the array
(D) The array has more occurrence of zero elements
Maximum number of children that a node can have in a binary tree is?
(A) 1
(B) 2
(C) 3
(D) 4