1000+ Data Structure Multiple Choice Question Answer [Solved]

1. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. None
Answer : A

2. Which of the following statement is false?
A. Arrays are dense lists and static data structure
B. data elements in linked list need not be stored in adjacent space in memory
C. pointers store the next data element of a list
D. linked lists are collection of the nodes that contain information part and next pointer
Answer : C

3. Which of the following data structures are indexed structures?
A. linear arrays
B. linked lists
C. both of above
D. none of above
Answer : A

4. The operation of processing each element in the list is known as
A. Sorting
B. Merging
C. Inserting
D. Traversal
Answer : D

5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
A. True, False
B. False, True
C. True, True
D. False, False
Answer : C

6. The memory address of the first element of an array is called
A. floor address
B. foundation address
C. first address
D. base address
Answer : B

7. Each array declaration need not give, implicitly or explicitly, the information about
A. the name of array
B. the data type of array
C. the index set of the array
D. the first data from the set to be stored
Answer : D

8. Which of the following name does not relate to stacks?
A. FIFO lists
B. LIFO list
C. Piles
D. Push-down lists
Answer : A

9. Which of the following is not a limitation of binary search algorithm?
A. must use a sorted array
B. requirement of sorted array is expensive when a lot of insertion and deletions are needed
C. there must be a mechanism to access middle element directly
D. binary search algorithm is not efficient when the data elements are more than 1000.
Answer : D

10. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A. Stack
B. Input restricted dequeue
C. Priority queues
D. Output restricted qequeue
Answer : B

11. Which of the following statement is true ?
A. Breath first search cannot be used to find converted components of a graph.
B. Optimal binary search tree construction can be performed efficiently using dynamic programming.
C. Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
D. Depth first search can be used to find connected components of a graph.
Answer : B

12. A data structure where elements can be added or removed at either end but not in the middle
A. Linked lists
B. Stacks
C. Queues
D. Deque
Answer : D

13. Merge sort uses ?
A. Divide and conquer strategy
B. Backtracking approach
C. Heuristic search
D. Greedy approach
Answer : A

14. Which if the following is/are the levels of implementation of data structure
A. Application level
B. Abstract level
C. Implementation level
D. All of the above
Answer : D

15. _______ level is where the model becomes compatible executable code
A. Abstract level
B. Implementation level
C. Application level
D. All of the above
Answer : B

16. The complexity of linear search algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : A

17. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
A. underflow
B. overflow
C. housefull
D. saturated
Answer : B

18. The number of possible ordered trees with three nodes A,B,C is?
A. 16
B. 12
C. 6
D. 10
Answer : B

19. Arrays are best data structures
A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for none of above situation
Answer : A

20. Finding the location of the element with a given value is:
A. Traversal
B. Search
C. Sort
D. None of above
Answer : B

21. The memory address of fifth element of an array can be calculated by the formula
A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
B. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
D. None of above
Answer : A

22. Which of the following data structure is non linear type?
A. Lists
B. Strings
C. Graph
D. Stacks
Answer : C

23. If the values of a variable in one module is indirectly changed by another module, this situation is called
A. internal change
B. inter-module change
C. side effect
D. side-module update
Answer : C

24. Which of the following data structure is linear type?
A. Graph
B. Binary tree
C. Trees
D. Stack
Answer : D

25. Which of the following is not the part of ADT description?
A. Data
B. Operations
C. Both of the above
D. None of the above
Answer : D

26. Which of the following is non-liner data structure?
A. List
B. Stacks
C. Trees
D. Strings
Answer : C

27. A variable P is called pointer if
A. P contains the address of an element in DATA.
B. P points to the address of first element in DATA
C. P can store only memory addresses
D. P contain the DATA and the address of DATA
Answer : A

28. _____ is not the component of data structure.
A. Operations
B. Algorithms
C. Storage Structures
D. None of above
Answer : D

29. The difference between linear array and a record is
A. An array is suitable for homogeneous data but the data items in a record may have different data type
B. In a record, there may not be a natural ordering in opposed to linear array.
C. A record form a hierarchical structure but a linear array does not
D. All of above
Answer : D

30. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
A. elementary items
B. atoms
C. scalars
D. all of above
Answer : D

31. Linked list are not suitable data structure of which one of the following problems ?
A. Binary search
B. Insertion sort
C. Radix sort
D. Polynomial manipulation
Answer : A

32. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
A. AVL tree
B. Red-black tree
C. Lemma tree
D. None of the above
Answer : A

33. Which of the following case does not exist in complexity theory
A. Best case
B. Null case
C. Worst case
D. Average case
Answer : B

34. Which of the following is two way list?
A. grounded header list
B. circular header list
C. linked list with header and trailer nodes
D. none of above
Answer : D

35. Which of the following algorithm design technique is used in the quick sort algorithm?
A. Dynamic programming
B. Greedy method
C. Divide and conquer
D. Backtracking
Answer : C

36. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
A. 11
B. 12
C. 13
D. 14
Answer : D

37. 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 ?
A. 3 additions and 2 deletions
B. 2 deletions and 3 additions
C. 3 deletions and 4 additions
D. 3 deletions and 3 additions
Answer : D

38. Binary search algorithm can not be applied to
A. sorted linked list
B. sorted binary trees
C. sorted linear array
D. pointer array
Answer : A

39. The complexity of Bubble sort algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : B

40. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
A. mn
B. max(m,n)
C. min(m,n)
D. m+n-1
Answer : D

41. Two dimensional arrays are also called
A. tables arrays
B. matrix arrays
C. both of above
D. none of above
Answer : C

42. To represent hierarchical relationship between elements, Which data structure is suitable?
A. Tree
B. Graph
C. Priority
D. Dequeue
Answer : A

43. Which of the following data structure is linear data structure?
A. Trees
B. Graphs
C. Arrays
D. None of above
Answer : C

44. Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
A. 3,4,5,2,1
B. 3,4,5,1,2
C. 5,4,3,1,2
D. 1,5,2,3,4
Answer : A

45. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
A. FAEKCDBHG
B. FAEKCDHGB
C. EAFKHDCBG
D. FEAKDCHBG
Answer : B

46. When determining the efficiency of algorithm, the space factor is measured by
A. Counting the maximum memory needed by the algorithm
B. Counting the minimum memory needed by the algorithm
C. Counting the average memory needed by the algorithm
D. Counting the maximum disk space needed by the algorithm
Answer : A

47. In linear search algorithm the Worst case occurs when
A. The item is somewhere in the middle of the array
B. The item is not in the array at all
C. The item is the last element in the array
D. The item is the last element in the array or is not there at all
Answer : D

48. Which data structure allows deleting data elements from and inserting at rear?
A. Stacks
B. Dequeues
C. Queues
D. Binary search tree
Answer : C

49. Which of the following data structure cant store the non-homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. None
Answer : A

50. Which of the following data structure is not linear data structure?
A. Arrays
B. Linked lists
C. Both of above
D. None of above
Answer : D