1. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. 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
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
4. 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
5. 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
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
7. 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
8. 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) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above
10. ………… 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
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
12. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
13. 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) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
15. Herder node is used as sentinel in …..
A) Graphs
B) Stacks
C) Binary tree
D) Queues
16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack
18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
21. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected
22. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A) Depth First
B) Breadth First
C) With First
D) Depth Limited
23. State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
A) True, False, True
B) True, True, False
C) True, True, True
D) False, True, True
24. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
25. The number of comparisons done by sequential search is ………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2
26. In ……………, search start at the beginning of the list and check every element in the list.
A) Linear search
B) Binary search
C) Hash Search
D) Binary Tree search
27. State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(logn).
A) True, False
B) False, True
C) False, False
D) True, True
28. Which of the following is not the internal sort?
A) Insertion Sort
B) Bubble Sort
C) Merge Sort
D) Heap Sort
29. State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.
A) True, True
B) False, True
C) False, False
D) True, False
30. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
A) Partite
B) Bipartite
C) Rooted
D) Bisects
31. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
A) 0 and 1
B) 0 and -1
C) -1 and 0
D) 1 and 0
32. In a circular queue the value of r will be ..
A) r=r+1
B) r=(r+1)% [QUEUE_SIZE – 1]
C) r=(r+1)% QUEUE_SIZE
D) r=(r-1)% QUEUE_SIZE
33. Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
A) i-only
B) ii-only
C) Both i and ii
D) None of both
34. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
A) Lists
B) Linked Lists
C) Trees
D) Queues
35. What will be the value of top, if there is a size of stack STACK_SIZE is 5
A) 5
B) 6
C) 4
D) None
36. ………… is not the operation that can be performed on queue.
A) Insertion
B) Deletion
C) Retrieval
D) Traversal
37. There is an extra element at the head of the list called a ……….
A) Antinel
B) Sentinel
C) List header
D) List head
38. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A) vertices, edges
B) edges, vertices
C) vertices, paths
D) graph node, edges
39. A ……….. is a graph that has weights of costs associated with its edges.
A) Network
B) Weighted graph
C) Both A and B
D) None A and B
40. In general, the binary search method needs no more than ……………. comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1
41. Which of the following is not the type of queue?
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
42. The property of binary tree is
A) The first subset is called left subtree
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
43. State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.
A) True, True
B) True, False
C) False, True
D) False, False
44. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
D) None of the above
45. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
46. ………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B) only a and b
C) All of the above
D) None of the above
47. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above
48. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
49. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
50. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
51. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
52. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
53. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….
A. Underflow
B. overflow
C. houseful
D. saturated
54. A data structure where elements can be added or removed at either end but not in the middle is called …
A. linked lists
B. stacks
C. queues
D. dequeue
55. Operations on a data structure may be …..
A. creation
B. destruction
C. selection
D. all of the above
56. The way in which the data item or items are logically related defines …..
A. storage structure
B. data structure
C. data relationship
D. data operation
57. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
58. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
A. pointers
B. linked allocation
C. stack
D. queue
59. 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 non of above situation
60. 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.
Data Structures and Algorithms Multiple Choice Questions and Answers :-
61. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
62. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
63. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
64. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
65. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
66. 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 the above
67. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
68. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
69. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
70. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
71. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
72. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
73. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
74. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
75. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
76. 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 the above
77. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
78. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
79. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
80. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
91. 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
92. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
93. The disadvantage in using a circular linked list is …………………….
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
94. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
95. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
96. In a priority queue, insertion and deletion takes place at ………………
A) front, rear end
B) only at rear end
C) only at front end
D) any position
97. The time complexity of quick sort is …………..
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
98. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
99. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph
100. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees
2. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
3. The disadvantage in using a circular linked list is .........................
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
6. In a priority queue, insertion and deletion takes place at ..................
A) front, rear end
B) only at rear end
C) only at front end
D) any position
7. The time complexity of quick sort is ..............
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
8. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
9. The data structure which is one ended is ..................
A) queue
B) stack
C) tree
D) graph
10. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. 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
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out
5. 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
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
7. 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
8. 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) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above
10. ………… 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
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
12. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
13. 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) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
15. Herder node is used as sentinel in …..
A) Graphs
B) Stacks
C) Binary tree
D) Queues
16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack
18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
21. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected
22. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A) Depth First
B) Breadth First
C) With First
D) Depth Limited
23. State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
A) True, False, True
B) True, True, False
C) True, True, True
D) False, True, True
24. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
25. The number of comparisons done by sequential search is ………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2
26. In ……………, search start at the beginning of the list and check every element in the list.
A) Linear search
B) Binary search
C) Hash Search
D) Binary Tree search
27. State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(logn).
A) True, False
B) False, True
C) False, False
D) True, True
28. Which of the following is not the internal sort?
A) Insertion Sort
B) Bubble Sort
C) Merge Sort
D) Heap Sort
29. State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.
A) True, True
B) False, True
C) False, False
D) True, False
30. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
A) Partite
B) Bipartite
C) Rooted
D) Bisects
31. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
A) 0 and 1
B) 0 and -1
C) -1 and 0
D) 1 and 0
32. In a circular queue the value of r will be ..
A) r=r+1
B) r=(r+1)% [QUEUE_SIZE – 1]
C) r=(r+1)% QUEUE_SIZE
D) r=(r-1)% QUEUE_SIZE
33. Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
A) i-only
B) ii-only
C) Both i and ii
D) None of both
34. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
A) Lists
B) Linked Lists
C) Trees
D) Queues
35. What will be the value of top, if there is a size of stack STACK_SIZE is 5
A) 5
B) 6
C) 4
D) None
36. ………… is not the operation that can be performed on queue.
A) Insertion
B) Deletion
C) Retrieval
D) Traversal
37. There is an extra element at the head of the list called a ……….
A) Antinel
B) Sentinel
C) List header
D) List head
38. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A) vertices, edges
B) edges, vertices
C) vertices, paths
D) graph node, edges
39. A ……….. is a graph that has weights of costs associated with its edges.
A) Network
B) Weighted graph
C) Both A and B
D) None A and B
40. In general, the binary search method needs no more than ……………. comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1
41. Which of the following is not the type of queue?
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
42. The property of binary tree is
A) The first subset is called left subtree
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
43. State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.
A) True, True
B) True, False
C) False, True
D) False, False
44. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
D) None of the above
45. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
46. ………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B) only a and b
C) All of the above
D) None of the above
47. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above
48. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
49. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
50. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
51. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
52. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
53. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….
A. Underflow
B. overflow
C. houseful
D. saturated
54. A data structure where elements can be added or removed at either end but not in the middle is called …
A. linked lists
B. stacks
C. queues
D. dequeue
55. Operations on a data structure may be …..
A. creation
B. destruction
C. selection
D. all of the above
56. The way in which the data item or items are logically related defines …..
A. storage structure
B. data structure
C. data relationship
D. data operation
57. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
58. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
A. pointers
B. linked allocation
C. stack
D. queue
59. 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 non of above situation
60. 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.
Data Structures and Algorithms Multiple Choice Questions and Answers :-
61. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
62. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
63. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
64. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
65. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
66. 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 the above
67. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
68. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
69. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
70. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
71. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
72. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
73. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
74. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
75. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
76. 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 the above
77. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
78. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
79. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
80. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
91. 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
92. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
93. The disadvantage in using a circular linked list is …………………….
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
94. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
95. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
96. In a priority queue, insertion and deletion takes place at ………………
A) front, rear end
B) only at rear end
C) only at front end
D) any position
97. The time complexity of quick sort is …………..
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
98. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
99. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph
100. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees
1)
......... form of access is used to add and
remove nodes from a queue.
A. LIFO, Last In First Out
B. FIFO, First In First Out
C. Both a and b
D. None of these
2) In liked representation of stack ....... holds the elements of the stack.
A. INFO fields
B. TOP fields
C. LINK fields
D. NULL fields
3) ........ form of access is used to add remove nodes from a stack.
A. LIFO
B. FIFO
C. Both A and B
D. None of these
4) In the linked representation of the stack ......... behaves as the top pointer variable of stack.
A. Stop pointer
B. Begin pointer
C. Start pointer
D. Avail pointer
5) New nodes are added to the ......... of the queue.
A. Front
B. Back
C. Middle
D. Both A and B
6) In linked representation of stack the null pointer of the last node in the list signals ..........
A. Beginning of the stack
B. Bottom of the stack
C. Middle of the stack
D. In between some value
7) What happens when you push a new node onto a stack?
A. The new node is placed at the front of the linked list
B. The new node is placed at the back of the linked list
C. The new node is placed at the middle of the linked list
D. No Changes happens
8) A queue is a .........
A. FIFO
B. LIFO
C. FILO
D. LOFI
9) Which of the following name does not relate to stacks?
A. FIFO lists
B. LIFO lists
C. Piles
D. Push down lists
10) The retrieval of items in a stack is ........... operation.
A. push
B. pop
C. retrieval
D. access
11) The term push and pop is related to
A. Array
B. Lists
C. Stacks
D. Trees
12) Which is the pointer associated with the stack?
A. FIRST
B. FRONT
C. TOP
D. REAR
13) The elements are removal from a stack in .......... order.
A. Reverse
B. Hierarchical
C. Alternative
D. Sequential
14) The insertion operation in the stack is called .........
A. insert
B. push
C. pop
D. top
15) ...... is the term used to insert an element into stack.
A. Push
B. Pull
C. Pop
D. Pump
16) Stack follows the strategy of ........
A. LIFO
B. FIFO
C. LRU
D. RANDOM
17) .......... is the term used to delete an element from the stack.
A. Push
B. Pull
C. Pop
D. Pump
18) Deletion operation is done using ......... in a queue.
A. front
B. rear
C. top
D. list
19) A pointer variable which contains the location at the top element of the stack is called .....
A. Top
B. Last
C. Final
D. End
20) Which of the following is an application of stack?
A. finding factorial
B. tower of Hanoi
C. infix to postfix
D. all of the above
A. LIFO, Last In First Out
B. FIFO, First In First Out
C. Both a and b
D. None of these
2) In liked representation of stack ....... holds the elements of the stack.
A. INFO fields
B. TOP fields
C. LINK fields
D. NULL fields
3) ........ form of access is used to add remove nodes from a stack.
A. LIFO
B. FIFO
C. Both A and B
D. None of these
4) In the linked representation of the stack ......... behaves as the top pointer variable of stack.
A. Stop pointer
B. Begin pointer
C. Start pointer
D. Avail pointer
5) New nodes are added to the ......... of the queue.
A. Front
B. Back
C. Middle
D. Both A and B
6) In linked representation of stack the null pointer of the last node in the list signals ..........
A. Beginning of the stack
B. Bottom of the stack
C. Middle of the stack
D. In between some value
7) What happens when you push a new node onto a stack?
A. The new node is placed at the front of the linked list
B. The new node is placed at the back of the linked list
C. The new node is placed at the middle of the linked list
D. No Changes happens
8) A queue is a .........
A. FIFO
B. LIFO
C. FILO
D. LOFI
9) Which of the following name does not relate to stacks?
A. FIFO lists
B. LIFO lists
C. Piles
D. Push down lists
10) The retrieval of items in a stack is ........... operation.
A. push
B. pop
C. retrieval
D. access
11) The term push and pop is related to
A. Array
B. Lists
C. Stacks
D. Trees
12) Which is the pointer associated with the stack?
A. FIRST
B. FRONT
C. TOP
D. REAR
13) The elements are removal from a stack in .......... order.
A. Reverse
B. Hierarchical
C. Alternative
D. Sequential
14) The insertion operation in the stack is called .........
A. insert
B. push
C. pop
D. top
15) ...... is the term used to insert an element into stack.
A. Push
B. Pull
C. Pop
D. Pump
16) Stack follows the strategy of ........
A. LIFO
B. FIFO
C. LRU
D. RANDOM
17) .......... is the term used to delete an element from the stack.
A. Push
B. Pull
C. Pop
D. Pump
18) Deletion operation is done using ......... in a queue.
A. front
B. rear
C. top
D. list
19) A pointer variable which contains the location at the top element of the stack is called .....
A. Top
B. Last
C. Final
D. End
20) Which of the following is an application of stack?
A. finding factorial
B. tower of Hanoi
C. infix to postfix
D. all of the above
1. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
2. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
3. The logical or mathematical model of a particular
organization of data is called a .........
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
4. The simplest type of data structure is ..................
A) Multidimensional
array
B) Linear array
C) Two dimensional array
D) Three dimensional array
5. Linear arrays are also called ...................
A) Straight line array
B) One-dimensional
array
C) Vertical array
D) Horizontal array
6. 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 the above
7. Which of the following data structures are indexed
structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
8. Each node in a linked list has two pairs of
.............. and ...................
A) Link field and
information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
9. A ........................ does not keep track of address
of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
10. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
2. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
3. The disadvantage in using a circular linked list is .........................
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.
A) circular queue
B) random of queue
C) priority
D) dequeue
6. In a priority queue, insertion and deletion takes place at ..................
A) front, rear end
B) only at rear end
C) only at front end
D) any position
7. The time complexity of quick sort is ..............
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
8. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
9. The data structure which is one ended is ..................
A) queue
B) stack
C) tree
D) graph
10. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees
1.
Which of the following is not the type of queue?
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
2. The property of binary tree is
A) The first subset is called left subtree
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
3. State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.
A) True, True
B) True, False
C) False, True
D) False, False
4. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
D) None of the above
5. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
6. ………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B) only a and b
C) All of the above
D) None of the above
7. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above
8. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
9. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
10. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
11. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
12. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
13. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ....
A. Underflow
B. overflow
C. houseful
D. saturated
14. A data structure where elements can be added or removed at either end but not in the middle is called ...
A. linked lists
B. stacks
C. queues
D. dequeue
15. Operations on a data structure may be .....
A. creation
B. destruction
C. selection
D. all of the above
16. The way in which the data item or items are logically related defines .....
A. storage structure
B. data structure
C. data relationship
D. data operation
17. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
18. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ....
A. pointers
B. linked allocation
C. stack
D. queue
19. 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 non of above situation
20. 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.
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
2. The property of binary tree is
A) The first subset is called left subtree
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
3. State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.
A) True, True
B) True, False
C) False, True
D) False, False
4. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
D) None of the above
5. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
6. ………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B) only a and b
C) All of the above
D) None of the above
7. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above
8. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
9. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
10. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
11. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
12. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
13. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ....
A. Underflow
B. overflow
C. houseful
D. saturated
14. A data structure where elements can be added or removed at either end but not in the middle is called ...
A. linked lists
B. stacks
C. queues
D. dequeue
15. Operations on a data structure may be .....
A. creation
B. destruction
C. selection
D. all of the above
16. The way in which the data item or items are logically related defines .....
A. storage structure
B. data structure
C. data relationship
D. data operation
17. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
18. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ....
A. pointers
B. linked allocation
C. stack
D. queue
19. 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 non of above situation
20. 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.
1.
Which if the following is/are the levels of
implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. 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
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
4. 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
5. 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
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
7. 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
8. 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) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above
10. ………… 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
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
12. Which of the following data structure can't store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
13. 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) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
15. Herder node is used as sentinel in .....
A) Graphs
B) Stacks
C) Binary tree
D) Queues
16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack
18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. 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
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
4. 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
5. 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
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
7. 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
8. 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) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above
10. ………… 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
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
12. Which of the following data structure can't store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
13. 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) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
15. Herder node is used as sentinel in .....
A) Graphs
B) Stacks
C) Binary tree
D) Queues
16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack
18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
1) 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. data structure
D. for none of above situation
2) The operation of processing each
element in the list is known as ......
A. sorting
B. merging
C. inserting
D.
traversal
3) The situation when in a linked
list START=NULL is ....
A.
Underflow
B. Overflow
C. Houseful
D. Saturated
4) Each node in singly linked list
has ........ fields.
A.
2
B. 3
C. 1
D. 4
5) Which of the following is two way
lists?
A. Grounded header list
B. Circular header list
C. Linked list with header and
trailer nodes
D.
List traversed in two directions
6) Which is the pointer associated
with the availability list?
A. FIRST
B.
AVAIL
C. TOP
D. REAR
7) Value of first linked list index
is ....
A.
0
B. 1
C. -1
D. 2
8) In linked lists there are no NULL
links in
A. single linked list
B. linear doubly linked list
C.
circular linked list
D. linked list
9) Each node in a linked list must
contain at least .....
A. Three fields
B.
Two fields
C. Four fields
D. Five fields
10) The dummy header in linked list
contain .....
A.
first record of the actual data
B. last record of the actual data
C. pointer to the last record of the
actual data
D. middle record of the actual data
11) In a linked list the ..........
field contains the address of next element in the list.
A.
Link field
B. Next element field
C. Start field
D. Info field
12) LLINK is the pointer pointing to
the ...
A. successor node
B.
predecessor node
C. head node
D. last node
13) .......... refers to a linear
collection of data items.
A.
List
B. Tree
C. Graph
D. Edge
14) A run list is ......
A.
small batches of records from a file
B. number of elements having same
value
C. number of records
D. number of files in external
storage
15) A ...... indicates the end of
the list.
A. Guard
B.
Sentinel
C. End pointer
D. Last pointer
16) A ........ is a linear list in
which insertions and deletions are made to from either end of the structure.
A. circular queue
B. random of queue
C. priority
D.
dequeue
17) Indexing the ........ element in
the list is not possible in linked lists.
A.
middle
B. first
C. last
D. any where in between
18) A linear list in which the
pointer points only to the successive node is ......
A.
singly linked list
B. circular linked list
C. doubly linked list
D. none of the above
19) .......... may take place only
when there is some minimum amount(or) no space left in free storage list.
A. Memory management
B.
Garbage collection
C. Recycle bin
D. Memory management
20) A linear list in which the last
node points to the first node is ........
A. singly linked list
B.
circular linked list
C. doubly linked list
D. none of the above
1)
Finding the location of a given item in a
collection of items is called ......
A. Discovering
B. Finding
C. Searching
D. Mining
2) Which of the following is an external sorting?
A. Insertion Sort
B. Bubble Sort
C. Merge Sort
D. Tree Sort
3) Very slow way of sorting is ..........
A. Insertion sort
B. Heap sort
C. Bubble sort
D. Quick sort
4) Which of the following is an internal sorting?
A. Tape Sort
B. 2-way Merge Sort
C. Merge Sort
D. Tree Sort
5) Sorting a file F usually refers to sorting F with respect to a particular key called .....
A. Basic key
B. Primary key
C. Starting key
D. Index key
6) The time complexity of quick sort is ........
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
7) Selection sort first finds the .......... element in the list and put it in the first position.
A. Middle element
B. Largest element
C. Last element
D. Smallest element
8) Quick sort is also known as ........
A. merge sort
B. tree sort
C. shell sort
D. partition and exchange sort
9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....
A. Inserting
B. Mixing
C. Merging
D. Sharing
10) A tree sort is also known as ......... sort.
A. quick
B. shell
C. heap
D. selection
11) .......... sorting is good to use when alphabetizing large list of names.
A. Merge
B. Heap
C. Radix
D. Bubble
12) The easiest sorting is ........
A. quick sort
B. shell sort
C. heap sort
D. selection sort
13) Which of the following sorting algorithm is of divide and conquer type?
A. Bubble sort
B. Insertion sort
C. Quick sort
D. Merge sort
14) Merging k sorted tables into a single sorted table is called ......
A. k way merging
B. k th merge
C. k+1 merge
D. k-1 merge
15) The function used to modify the way of sorting the keys of records is called ........
A. Indexing function
B. Hash function
C. Addressing function
D. All of the above
16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.
A. Merge
B. Heap
C. Radix
D. Bubble
17) The total number of comparisons in a bubble sort is ....
A. O(n logn)
B. O(2n)
C. O(n2)
D. O(n)
18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.
A. Merge
B. Heap
C. Quick
D. Bubble
19) The time complexity of heap sort is ....
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
20) The complexity of selection sort is .......
A. O(n)
B. O(n2)
C. O(n logn)
D. O(logn)
A. Discovering
B. Finding
C. Searching
D. Mining
2) Which of the following is an external sorting?
A. Insertion Sort
B. Bubble Sort
C. Merge Sort
D. Tree Sort
3) Very slow way of sorting is ..........
A. Insertion sort
B. Heap sort
C. Bubble sort
D. Quick sort
4) Which of the following is an internal sorting?
A. Tape Sort
B. 2-way Merge Sort
C. Merge Sort
D. Tree Sort
5) Sorting a file F usually refers to sorting F with respect to a particular key called .....
A. Basic key
B. Primary key
C. Starting key
D. Index key
6) The time complexity of quick sort is ........
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
7) Selection sort first finds the .......... element in the list and put it in the first position.
A. Middle element
B. Largest element
C. Last element
D. Smallest element
8) Quick sort is also known as ........
A. merge sort
B. tree sort
C. shell sort
D. partition and exchange sort
9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....
A. Inserting
B. Mixing
C. Merging
D. Sharing
10) A tree sort is also known as ......... sort.
A. quick
B. shell
C. heap
D. selection
11) .......... sorting is good to use when alphabetizing large list of names.
A. Merge
B. Heap
C. Radix
D. Bubble
12) The easiest sorting is ........
A. quick sort
B. shell sort
C. heap sort
D. selection sort
13) Which of the following sorting algorithm is of divide and conquer type?
A. Bubble sort
B. Insertion sort
C. Quick sort
D. Merge sort
14) Merging k sorted tables into a single sorted table is called ......
A. k way merging
B. k th merge
C. k+1 merge
D. k-1 merge
15) The function used to modify the way of sorting the keys of records is called ........
A. Indexing function
B. Hash function
C. Addressing function
D. All of the above
16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.
A. Merge
B. Heap
C. Radix
D. Bubble
17) The total number of comparisons in a bubble sort is ....
A. O(n logn)
B. O(2n)
C. O(n2)
D. O(n)
18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.
A. Merge
B. Heap
C. Quick
D. Bubble
19) The time complexity of heap sort is ....
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
20) The complexity of selection sort is .......
A. O(n)
B. O(n2)
C. O(n logn)
D. O(logn)
1) The worst case occur in linear search algorithm when
.......
A. Item is somewhere in the middle of the array
B. Item is not in the array at all
C. Item is the last element in the array
D. Item is the last
element in the array or item is not there at all
2) If the number of records to be sorted is small, then
...... sorting can be efficient.
A. Merge
B. Heap
C. Selection
D. Bubble
3) The complexity of sorting algorithm measures the ......
as a function of the number n of items to be sorter.
A. average time
B. running time
C. average-case complexity
D. case-complexity
4) 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 more than 1500.
5) The Average case occurs in linear search algorithm
..........
A. when item is
somewhere in the middle of the array
B. when item is not the array at all
C. when item is the last element in the array
D. Item is the last element in the array or item is not
there at all
6) Binary search algorithm cannot be applied to ...
A. sorted linked list
B. sorted binary trees
C. sorted linear array
D. pointer array
7) Complexity of linear search algorithm is .........
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
8) Sorting algorithm can be characterized as ......
A. Simple algorithm which require the order of n2
comparisons to sort n items.
B. Sophisticated algorithms that require the O(nlog2n)
comparisons to sort items.
C. Both of the above
D. None of the above
9) The complexity of bubble sort algorithm is .....
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
10) State True or False for internal sorting algorithms.
i) Internal sorting are applied when the entire collection
if data to be sorted is small enough that the sorting can take place within
main memory.
ii) The time required to read or write is considered to be
significant in evaluating the performance of internal sorting.
A. i-True, ii-True
B. i-True, ii-False
C. i-False, ii-True
D. i-False, ii-False
11) The complexity of merge sort algorithm is ......
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
12) .......... is putting an element in the appropriate
place in a sorted list yields a larger sorted order list.
A. Insertion
B. Extraction
C. Selection
D. Distribution
13) ............order is the best possible for array sorting
algorithm which sorts n item.
A. O(n logn)
B. O(n2)
C. O(n+logn)
D. O(logn)
14) ......... is rearranging pairs of elements which are out
of order, until no such pairs remain.
A. Insertion
B. Exchange
C. Selection
D. Distribution
15) ............ is the method used by card sorter.
A. Radix sort
B. Insertion
C. Heap
D. Quick
16) Which of the following sorting algorithm is of divide
and conquer type?
A. Bubble sort
B. Insertion sort
C. Merge sort
D. Selection sort
17) ........ sorting algorithm is frequently used when n is
small where n is total number of elements.
A. Heap
B. Insertion
C. Bubble
D. Quick
18) Which of the following sorting algorithm is of priority
queue sorting type?
A. Bubble sort
B. Insertion sort
C. Merge sort
D. Selection sort
19) 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 sub list
C. There must be
mechanism to delete and/or insert elements in list.
D. Number values should only be present
20) Partition and exchange sort is ........
A. quick sort
B. tree sort
C. heap sort
D. bubble sort
1) To insert a new node in linked list free node will be
available in ........
A. Available list
B. Avail list
C. Free node list
D. Memory space lis
2) A singly linked list is also called as ........
A. linked list
B. one way chain
C. two way chain
D. right link
3) A ..... list is a header list where the node points back
to the header node.
A. Circular header
B. Grounded header
C. Two way header
D. One way header
4) A doubly linked list has .......... pointers with each
node.
A. 0
B. 1
C. 2
D. 3
5) Header linked lists are frequently used for maintaining
........ in memory.
A. Polynomials
B. Binomial
C. Trinomial
D. Quadratic equation
6) The pointer that points to the first node in the list is
........
A. FIRST
B. AVAIL
C. TOP
D. REAR
7) Two-way list may be maintained in memory by means of
.............
A. Queues
B. Linear arrays
C. Non linear arrays
D. Stacks
8) A doubly linked list is also called as ..........
A. linked list
B. one way chain
C. two way chain
D. right link
9) The list that requires two pointer variables FIRST and
LAST is called ........
A. Circular list
B. Header list
C. One way list
D. Two way list
10) If the availability list is null, then the condition is
said to be .........
A. nil block
B. availability list
underflow
C. availability list overflow
D. memory loss
11) The list which has its own pointer is called ........
A. pointer list
B. self pointer
C. free pool
D. own pointer
12) Which of the following is two way lists?
A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. None of the above
13) A .......... is a header list where the last node
contains the null pointer.
A. grounded header
list
B. bottom header list
C. down header list
D. dropped header list
14) RLINK is the pointer pointing to the ...
A. successor node
B. predecessor node
C. head node
D. last node
15) A ............. is a header list where the last node
points back to the header node.
A. rounded header list
B. circular header list
C. common header list
D. forward header list
16) In a linked list, insertion can be done as .........
A. beginning
B. end
C. middle
D. all of the above
17) In a two-way lists each node is divided into
.......parts.
A. 1
B. 2
C. 3
D. 4
18) The disadvantage in using a circular linked list is
.......
A. it is possible to
get into infinite loop
B. last node points to fist node.
C. time consuming
D. requires more memory space.
19) Which of the following conditions checks available free
space in avail list?
A. Avail=Null
B. Null=Avail
C. Avail=Max stack
D. Avail=Top
20) A linear list in which each node has point to the
predecessor and successors nodes is called ........
A. singly linked list
B. circular linked list
C. doubly linked list
D. linear linked list