GRE - Data Structure 1000+ MCQ [Solved] PDF Download
Thursday 9th of March 2023
Sharing is caring
1. 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
2. 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
3. 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
4. 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
5. 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
6. 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
7. 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
8. 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
9. 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
10. 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
11. 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
12. 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
13. 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
14. 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
15. 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
16. 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
17. ______ 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
18. 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
19. 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
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. 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
22. Which of the following data structures are indexed structures?
A. linear arrays
B. linked lists
C. both of above
D. non of above
Answer : A
A. linear arrays
B. linked lists
C. both of above
D. non of above
Answer : A
23. 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
24. 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
25. 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
26. 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
27. 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
28. 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
29. 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
30. 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
31. 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
32. 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
33. 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
34. 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
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
35. 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
36. 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
37. 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
38. 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
39. ……………. 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
40. 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
41. _______ 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
42. 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
43. _____ 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
44. When new data are to be nserted 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
45. 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
46. 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
47. 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
48. 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
49. 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
50. 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
A. Dynamic programming
B. Greedy method
C. Divide and conquer
D. Backtracking
Answer : C
Sharing is caring
Related Post
Engineering Materials 1000+ MCQ with answer for NEET PG
1000+ Current Affairs April 2017 MCQ for IBPS SO [Solved]
1000+ Fill in the blanks Multiple Choice Question Answer [Solved]
SSC GD - Workshop Technology 1000+ MCQ [Solved] PDF Download
1000+ Direct and Indirect Speech Multiple Choice Question Answer [Solved]
IBPS Common Written Exam (PO/MT) Main 2016 Solved Paper MCQ Solved Paper for GATE