Data Structure MCQ Solved Paper for SSC Scientific Assistant
Thursday 9th of March 2023
Sharing is caring
1. 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
A. grounded header list
B. circular header list
C. linked list with header and trailer nodes
D. none of above
Answer : D
2. 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
A. Arrays
B. Linked lists
C. Both of above
D. None of above
Answer : D
3. 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
A. 11
B. 12
C. 13
D. 14
Answer : D
4. Which of the following data structure is linear type?
A. Graph
B. Binary tree
C. Trees
D. Stack
Answer : D
A. Graph
B. Binary tree
C. Trees
D. Stack
Answer : D
5. Which of the following is non-liner data structure?
A. List
B. Stacks
C. Trees
D. Strings
Answer : C
A. List
B. Stacks
C. Trees
D. Strings
Answer : C
6. 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
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
7. Which of the following name does not relate to stacks?
A. FIFO lists
B. LIFO list
C. Piles
D. Push-down lists
Answer : A
A. FIFO lists
B. LIFO list
C. Piles
D. Push-down lists
Answer : A
8. The number of possible ordered trees with three nodes A,B,C is?
A. 16
B. 12
C. 6
D. 10
Answer : B
A. 16
B. 12
C. 6
D. 10
Answer : B
9. The elements of an array are stored successively in memory cells because
A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
Answer : A
A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
Answer : A
10. 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
A. elementary items
B. atoms
C. scalars
D. all of above
Answer : D
11. _______ 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
A. Abstract level
B. Implementation level
C. Application level
D. All of the above
Answer : B
12. The complexity of linear search algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : A
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : A
13. Linked lists are best suited
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 : B
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 : B
14. 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
A. linear arrays
B. linked lists
C. both of above
D. none of above
Answer : A
15. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. None
Answer : A
A. Arrays
B. Records
C. Pointers
D. None
Answer : A
16. 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
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
17. Stack is also called as
A. Last in first out
B. First in last out
C. Last in last out
D. First in first out
Answer : A
A. Last in first out
B. First in last out
C. Last in last out
D. First in first out
Answer : A
18. 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
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
19. 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
A. Best case
B. Null case
C. Worst case
D. Average case
Answer : B
20. The situation when in a linked list START=NULL is
A. underflow
B. overflow
C. housefull
D. saturated
Answer : A
A. underflow
B. overflow
C. housefull
D. saturated
Answer : A
21. 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
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
22. Which of the following data structure can't store the non-homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Stacks
Answer : A
A. Arrays
B. Records
C. Pointers
D. Stacks
Answer : A
23. 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
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
24. 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
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
25. ……………. 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
A. Queue
B. Stack
C. List
D. None of the above
Answer : A
26. Merge sort uses ?
A. Divide and conquer strategy
B. Backtracking approach
C. Heuristic search
D. Greedy approach
Answer : A
A. Divide and conquer strategy
B. Backtracking approach
C. Heuristic search
D. Greedy approach
Answer : A
27. Two dimensional arrays are also called
A. tables arrays
B. matrix arrays
C. both of above
D. none of above
Answer : C
A. tables arrays
B. matrix arrays
C. both of above
D. none of above
Answer : C
28. Which of the following data structure is linear data structure?
A. Trees
B. Graphs
C. Arrays
D. None of above
Answer : C
A. Trees
B. Graphs
C. Arrays
D. None of above
Answer : C
29. Which of the following data structure cant store the non-homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. None
Answer : A
A. Arrays
B. Records
C. Pointers
D. None
Answer : A
30. The complexity of Binary search algorithm is
A. O(n)
B. O(log )
C. O(n2)
D. O(n log n)
Answer : B
A. O(n)
B. O(log )
C. O(n2)
D. O(n log n)
Answer : B
31. 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
A. underflow
B. overflow
C. housefull
D. saturated
Answer : B
32. 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
A. Processor and memory
B. Complexity and capacity
C. Time and space
D. Data and space
Answer : C
33. 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
A. mn
B. max(m,n)
C. min(m,n)
D. m+n-1
Answer : D
34. 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
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
35. 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
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
36. 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
A. Stack
B. Input restricted dequeue
C. Priority queues
D. Output restricted qequeue
Answer : B
37. _____ is not the component of data structure.
A. Operations
B. Algorithms
C. Storage Structures
D. None of above
Answer : D
A. Operations
B. Algorithms
C. Storage Structures
D. None of above
Answer : D
38. Herder node is used as sentinel in ____
A. Graphs
B. Binary tree
C. Stacks
D. Queues
Answer : B
A. Graphs
B. Binary tree
C. Stacks
D. Queues
Answer : B
39. 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
A. Data
B. Operations
C. Both of the above
D. None of the above
Answer : D
40. 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
A. Linked lists
B. Stacks
C. Queues
D. Deque
Answer : D
41. 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
A. Array
B. Stack
C. Tree
D. queue
Answer : D
42. 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
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
43. 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
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
44. The term push and pop is related to the
A. array
B. lists
C. stacks
D. all of above
Answer : C
A. array
B. lists
C. stacks
D. all of above
Answer : C
45. 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
A. AVL tree
B. Red-black tree
C. Lemma tree
D. None of the above
Answer : A
46. The memory address of fifth element of an array can be calculated by the formula
A. LOC(Array[5]=Bae(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
A. LOC(Array[5]=Bae(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
47. ______ 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
A. Stack
B. Queue
C. List
D. Link list
Answer : A
48. When determining the efficiency of algorithm the time factor is measured by
A. Counting microseconds
B. Counting the number of key operations
C. Counting the number of statements
D. Counting the kilobytes of algorithm
Answer : B
A. Counting microseconds
B. Counting the number of key operations
C. Counting the number of statements
D. Counting the kilobytes of algorithm
Answer : B
49. 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
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
50. Which data structure allows deleting data elements from and inserting at rear?
A. Stacks
B. Dequeues
C. Queues
D. Binary search tree
Answer : C
A. Stacks
B. Dequeues
C. Queues
D. Binary search tree
Answer : C
Sharing is caring
Related Post
1000+ Basics of Neurology MCQ for CEED [Solved]
1000+ Applied Mechanics and Graphic Statics MCQ for XAT [Solved]
1000+ Urologic infections and inflammations MCQ for RBI Grade B officer [Solved]
ESIC - IBPS Common Written Exam (PO/MT) Main 2016 Solved Paper 1000+ MCQ [Solved] PDF Download
LIC AAO - Engineering Materials 1000+ MCQ [Solved] PDF Download
CorelDraw 1000+ MCQ with answer for SSC CHSL