Data Structure MCQ Solved Paper for SSC CGL
Thursday 9th of March 2023
Sharing is caring
1. 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
A. Application level
B. Abstract level
C. Implementation level
D. All of the above
Answer : D
2. 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
3. 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
4. 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
5. 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
6. ……………. 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
7. 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
8. 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
9. _______ 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
10. The complexity of Bubble sort algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : B
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : B
11. 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
12. 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
13. 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
14. 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
15. 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
16. 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
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
A. underflow
B. overflow
C. housefull
D. saturated
Answer : B
18. 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
19. 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
20. 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
A. floor address
B. foundation address
C. first address
D. base address
Answer : B
21. 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
22. 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
23. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
A. Stacks linked list
B. Queue linked list
C. Both of them
D. Neither of them
Answer : B
A. Stacks linked list
B. Queue linked list
C. Both of them
D. Neither of them
Answer : B
24. 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
25. 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
A. push, pop
B. insert, delete
C. pop, push
D. delete, insert
Answer : A
26. 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
27. 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
28. 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
29. 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
30. 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
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
A. 11
B. 12
C. 13
D. 14
Answer : D
32. 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
A. FAEKCDBHG
B. FAEKCDHGB
C. EAFKHDCBG
D. FEAKDCHBG
Answer : B
33. 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
34. 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
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
35. 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
36. 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
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
37. 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
A. sorted linked list
B. sorted binary trees
C. sorted linear array
D. pointer array
Answer : A
38. 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
39. 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
40. Finding the location of the element with a given value is:
A. Traversal
B. Search
C. Sort
D. None of above
Answer : B
A. Traversal
B. Search
C. Sort
D. None of above
Answer : B
41. 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
A. internal change
B. inter-module change
C. side effect
D. side-module update
Answer : C
42. 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
43. 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
44. 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
45. The operation of processing each element in the list is known as
A. Sorting
B. Merging
C. Inserting
D. Traversal
Answer : D
A. Sorting
B. Merging
C. Inserting
D. Traversal
Answer : D
46. 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
47. 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
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
48. To represent hierarchical relationship between elements, Which data structure is suitable?
A. Tree
B. Graph
C. Priority
D. Dequeue
Answer : A
A. Tree
B. Graph
C. Priority
D. Dequeue
Answer : A
49. The complexity of merge sort algorithm is
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : D
A. O(n)
B. O(log n)
C. O(n2)
D. O(n log n)
Answer : D
50. 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
A. Binary search
B. Insertion sort
C. Radix sort
D. Polynomial manipulation
Answer : A
Sharing is caring
Related Post
Senile enlargement of the prostate MCQ Solved Paper for SSC MTS
IBPS RRB - Phylum - Platyhelminthes 1000+ MCQ [Solved] PDF Download
1000+ Visual Basic .NET MCQ for JEE Main [Solved]
JavaScript 1000+ MCQ with answer for GRE
1000+ Strength of Materials Multiple Choice Question Answer [Solved]
LIC AAO - Selenium automation 1000+ MCQ [Solved] PDF Download