Data Structure 1000+ MCQ with answer for SBI PO

1. 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

2. Two main measures for the efficiency of an algorithm are
A. Processor and memory
B. Complexity and capacity
C. Time and space
D. Data and space
Answer : C

3. 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

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

5. Which of the following is not the required condition for binary search algorithm?
A. The list must be sorted
B. there should be the direct access to the middle element in any sublist
C. There must be mechanism to delete and/or insert elements in list
D. none of above
Answer : C

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

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

8. 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

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

10. 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

11. 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

12. 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

13. 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

14. 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

15. 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

16. 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

17. 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

18. 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

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

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

21. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
A. Stack
B. Queue
C. List
D. Link list
Answer : A

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

23. ……………. Is a pile in which items are added at one end and removed from the other.
A. Queue
B. Stack
C. List
D. None of the above
Answer : A

24. Herder node is used as sentinel in ____
A. Graphs
B. Binary tree
C. Stacks
D. Queues
Answer : B

25. 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

26. 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

27. Which of the following data structure can't store the non-homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Stacks
Answer : A

28. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
A. push, pop
B. insert, delete
C. pop, push
D. delete, insert
Answer : A

29. 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

30. The situation when in a linked list START=NULL is
A. underflow
B. overflow
C. housefull
D. saturated
Answer : A

31. 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

32. 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

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

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

35. 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

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

37. 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

38. 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

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

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

41. 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

42. 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

43. The Average case occur in linear search algorithm
A. When Item is somewhere in the middle of the array
B. When Item is not in the array at all
C. When Item is the last element in the array
D. When Item is the last element in the array or is not there at all
Answer : A

44. For an algorithm the complexity of the average case is
A. Much more complicated to analyze than that of worst case
B. Much more simpler to analyze than that of worst case
C. Sometimes more complicated and some other times simpler than that of worst case
D. None or above
Answer : A

45. 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

46. _______ 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

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

48. Which data structure is used in breadth first search of a graph to hold nodes?
A. Array
B. Stack
C. Tree
D. queue
Answer : D

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

50. 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