1000+ Data Structure MCQ for SSC JE [Solved]
Thursday 9th of March 2023
Sharing is caring
1. 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
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
2. _____ 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
3. 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
4. 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
5. 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
6. 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
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
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
A. FIFO lists
B. LIFO list
C. Piles
D. Push-down lists
Answer : A
9. Which of the following data structure is non linear type?
A. Lists
B. Strings
C. Graph
D. Stacks
Answer : C
A. Lists
B. Strings
C. Graph
D. Stacks
Answer : C
10. 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
11. 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
12. 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
13. 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
14. 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
15. 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
16. 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
17. 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
18. 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
19. _______ 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
20. 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
21. 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
22. 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
23. 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
24. hich 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
25. 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
26. 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
27. 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
28. 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
29. 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
30. 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
31. 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
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
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. 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
34. 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
35. 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
36. 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
37. 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
38. 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
39. 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
40. 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
41. 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
42. 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
43. 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
44. 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
45. 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
46. 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
47. 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
48. 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
49. 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
50. 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
Sharing is caring
Related Post
1000+ General knowledge Multiple Choice Question Answer [Solved]
1000+ Building Construction Multiple Choice Question Answer [Solved]
Multimedia and Graphics MCQ Solved Paper for RBI Assistant
1000+ General Physics MCQ for SSC GD [Solved]
LIC AAO - Current Affairs January 2023 1000+ MCQ [Solved] PDF Download
Current Affairs January 2023 MCQ Solved Paper for CEED