Data Structure and Algorithms

Data Structure and Algorithms.

Click here to Download this file
Multiple Choice Questions and Answers:-
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
Answer:D
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
Answer:A
3. ……………….. level is where the model becomes compatible executable code

A) Abstract level
D) All of the above
Answer:C
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
Answer:A
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
Answer:C
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
Answer:D
7. Which of the following is not the part of ADT description?

A) Data
B) Operations
C) Both of the above
Answer:D
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
Answer:A
9. ……………. Is a pile in which items are added at one end and removed from the
other.
A) Stack
B) Queue
C) List
Answer:B
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
Answer:A
11. Which data structure allows deleting data elements from and inserting at
rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
Answer:B
12. Which of the following data structure can’t store the non-homogeneous data
elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
Answer:A
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
Answer:A
14. Which of the following is non-liner data structure?

A) Stacks
B) List
C) Strings
D) Trees
Answer:D
15. Herder node is used as sentinel in …..

A) Graphs
B) Stacks
C) Binary tree
D) Queues
Answer:C
16. Which data structure is used in breadth first search of a graph to hold
nodes?
A) Stack
B) queue
C) Tree
D) Array
Answer:B
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
Answer:A
18. Which of the following data structure is non linear type?

A) Strings
B) Lists
C) Stacks
D) Graph
Answer:D
19. Which of the following data structure is linear type?

A) Graph
B) Trees
C) Binary tree
D) Stack
Answer:D
20. To represent hierarchical relationship between elements, Which data

structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
Answer:C
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
Answer:B
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
Answer:A
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
Answer:B
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
Answer:C
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
Answer:B
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
Answer:A
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
Answer:D
28. Which of the following is not the internal sort?

A) Insertion Sort
B) Bubble Sort
C) Merge Sort
D) Heap Sort
Answer:C

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
Answer:A
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
Answer:B
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
Answer:B
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
Answer:C
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
Answer:C
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
Answer:B
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
Answer:C
36. ………… is not the operation that can be performed on queue.

A) Insertion
B) Deletion
C) Retrieval
D) Traversal
Answer:D
37. There is an extra element at the head of the list called a ……….
A) Antinel
B) Sentinel
C) List header
D) List head
Answer:B
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
Answer:A
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
Answer:C
40. In general, the binary search method needs no more than …………….
comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1
Answer:D
41. Which of the following is not the type of queue?

A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
Answer:B
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
Answer:D
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
Answer:C
44. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
Answer:B
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
Answer:B
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
Answer:D
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
Answer:D
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
Answer:A
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
Answer:B

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
Answer:C
51. Which of the following data structures are indexed structures?

A. Linear arrays
B. Linked lists
C. Queue
D. Stack
Answer:A
52. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
Answer:B
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
Answer:B
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
Answer:D
55. Operations on a data structure may be …..

A. creation
B. destruction
C. selection
D. all of the above
Answer:D
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
Answer:B
57. Which of the following are the operations applicable an primitive data
structures?
A. create
B. destroy
C. update
D. all of the above
Answer:D
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
Answer:B
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
Answer:A
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.
Answer:C
61. Which of the following data structure is non-linear type?

A) Strings
B) Lists
C) Stacks
D) Tree
Answer:D

A) Array
B) Tree
C) Graphs
D) Hierarchy
Answer:A
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
Answer:A
64. The simplest type of data structure is ………………

A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
Answer:B
65. Linear arrays are also called ……………….

A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
Answer:B
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
Answer:A

A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
Answer:A
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
Answer:A
69. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
Answer:C
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
Answer:D

A) Strings
B) Lists
C) Stacks
D) Tree
Answer:D

A) Array
B) Tree
C) Graphs
D) Hierarchy
Answer:A
73. The logical or mathematical model of a particular organization of data is

called a ………
A) Data structure
B) Data arrangement
D) Data formation
Answer:A

B) Linear array
Answer:B

C) Vertical array
D) Horizontal array
Answer:B

B) For the size of the structure and the data in the structure are constantly
changing
Answer:A

A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
Answer:A
Answer:A
79. 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 first data from the set to be stored
D) the index set of the array
Answer:C

A) Before deletion
D) After deletion
Answer:D
81. 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
82) 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
83) Finding the location of the element with a given value is:
A) Traversal
B) Search
C) Sort
D) None of above
Answer:B
84) The operation of processing each element in the list is known as

A) Sorting
B) Merging
C) Inserting
D) Traversal
Answer:D
85) The complexity of the average case of an algorithm 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
86) 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
87) Which of the following case does not exist in complexity theory
A) Best case
B) Worst case
C) Average case
D) Null case
Answer:D
88) The space factor when determining the efficiency of algorithm is measured
by
A) Counting the maximum memory needed by the algorithm
B) Counting the minimum memory needed by the algorithm
C) Counting the average memory needed by the algorithm
D) Counting the maximum disk space needed by the algorithm
Answer:A
89) The time factor when determining the efficiency of algorithm 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
90) 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
B) for the size of the structure and the data in the structure are constantly
changing
Answer:A
92. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
Answer:D
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
Answer:A
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
Answer:C
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
Answer:D
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
Answer:D
97. The time complexity of quick sort is …………..

A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
Answer:C
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
Answer:D
99. The data structure which is one ended is ………………

A) queue
B) stack
C) tree
D) graph
Answer:B
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
Answer:A
Data structure mcq questions

1. Which if the following is/are the levels of implementation of data structure
A) Abstract 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
A) Abstract level
D) All of the above
DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers

C) Last in last out
5. Which of the following is true about the characteristics of abstract data types?
A) True, False
B) False, True
C) True, True
D) False, False
A) Operations
C) Algorithms
D) None of above
A) Data
B) Operations
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
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
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.
C) Both of them
D) Neither of them
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.
C) Priority queues
D) Stack
A) Strings
B) Lists
C) Stacks
D) Graph
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
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
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
A) Ordinary queue
C) Circular queue
D) Priority queue
A) True, True
B) True, False
C) False, True
D) False, False
A) Successor node
B) Ancestor node
C) Internal node
A) True, True
B) True, False
C) False, True
D) False, False
A) only a,b and c
B) only a and b
C) All of the above
A) Function calls
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
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
A) True, False
B) False, True
C) True, True
D) False, False
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
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 …..
B. data structure
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
C. stack
D. queue
B. for the size of the structure and the data in the structure are constantly changing
D. Linked lists are collection of the nodes that contain information part and next pointer.
Data Structures and Algorithms Multiple Choice Questions and Answers :-
A) Strings
B) Lists
C) Stacks
D) Tree
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
D) Data formation
B) Linear array
C) Vertical array
D) Horizontal array
B) For the size of the structure and the data in the structure are constantly changing
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
A) Stack
B) String
C) Linear array
D) Queue
A) Before deletion
D) After deletion
A) Strings
B) Lists
C) Stacks
D) Tree
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
D) Data formation
B) Linear array
C) Vertical array
D) Horizontal array
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
A) Stack
B) String
C) Linear array
D) Queue
A) Before deletion
D) After deletion
B) for the size of the structure and the data in the structure are constantly changing
A) Arrays
B) Linked lists
93. The disadvantage in using a circular linked list is …………………….
C) Time consuming
94. A linear list in which each node has pointers to point to the predecessor and
successors nodes is called as ..
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
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)
B) tower of Hanoi
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) Strings
B) Lists
C) Stacks
D) Tree
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
D) Data formation
4. The simplest type of data structure is ..................
B) Linear array
5. Linear arrays are also called ...................
C) Vertical array
D) Horizontal array
6. Arrays are best data structures ............
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
8. Each node in a linked list has two pairs of .............. and ...................
9. A ........................ does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
A) Before deletion
D) After deletion
A) Arrays
B) Linked lists
3. The disadvantage in using a circular linked list is .........................
C) Time consuming

4. A linear list in which each node has pointers to point to the predecessor and successors
nodes is called as ..
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
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)
B) tower of Hanoi
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) Ordinary queue
C) Circular queue
D) Priority queue
A) True, True
B) True, False
C) False, True
D) False, False
A) Successor node
B) Ancestor node
C) Internal node

A) True, True
B) True, False
C) False, True
D) False, False
A) only a,b and c
B) only a and b
C) All of the above
A) Function calls
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

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
A) True, False
B) False, True
C) True, True
D) False, False
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
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 .....
B. data structure
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
C. stack
D. queue
B. for the size of the structure and the data in the structure are constantly changing
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
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
A) Abstract level
D) All of the above

C) Last in last out
5. Which of the following is true about the characteristics of abstract data types?
A) True, False
B) False, True
C) True, True
D) False, False
A) Operations
C) Algorithms
D) None of above
A) Data
B) Operations
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
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
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.
C) Both of them
D) Neither of them
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.
C) Priority queues
D) Stack
A) Strings
B) Lists
C) Stacks
D) Graph
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 ........
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)
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?
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 ........
D. linear linked list
This is a linear list in which insertions and deletions are made to form either end of the
structure.
Select one:
a.
Circular queue
b.
Random of queue
c.
Priority
d.
Dequeue
In a graph, the vertices

TRUE represent the items
being modeled.
A bank simulation of its teller operation to see how waiting times would
Queue
be affected by adding another teller.
In the linked representation of the stack, __________ pointer behaves
Start
as the top pointer variable of stack.
FIFO, First In First Out This form of access is used to add and remove nodes from a queue.
Back New nodes are added to the ________ of the queue.
TRUE The root of a tree is the node that has no ancestors.
It is a windows 7 feature that enables support staff to connect to a
Remote Assistance
remote desktop computer.
all of these Which of the following is an application of stack?
A word processor to have a PF key that causes the preceding
command to be redisplayed. Every time the PF key is pressed, the
Stack
program is to show the command that preceded the one currently
displayed
Which data structure is suitable to represent the hierarchal relationship
Tree
between elements?
A binary tree is a tree in which each node can have zero, one, or two
TRUE
children.
Broadcast Which of the following is not an IPv6 Address types?
LIFO This form of access is used to add/remove nodes from a stack.
circular linked list In linked lists, there are no NULL links in ______________
List This refers to a linear collection of data items.
This is a linear list in which insertions and deletions are made to form
Dequeue
either end of the structure.
Dequeue "This form of access is used to add/remove nodes from a stack. "
A pointer variable which contains the location at the top element of the
Top
stack.
The operation of processing each element in the list is known as
traversal
________________.
None of these Which of the following is not the part of ADT description?
This may take place only when there is some minimum amount or no
Garbage collection
space left in free storage list.
The value in the right child of a node (if it exists) in a binary search tree
TRUE
will be greater than the value in the node itself.
TOP Which is the pointer associated with the stack?
FALSE A queue displays LIFO behavior.
FIFO What is a queue?
AVAIL Which is the pointer associated with the availability list?
Last in, first out Stack is also called the ________________.
In linked representation of stack, the null pointer of the last node in the
Bottom of the stack
list signals _____________________.
circular linked list A linear list in which the last node points to the first node.
small batches of
What is a run list?
records from a file
Which of the following data structure can't store the non-homogeneous
Arrays
data elements?
Binary search tree An electronic address book ordered by name
Two fields Each node in a linked list must contain at least ___________________.
List traversed in two
Which of the following is a two-way list?
directions
Graph A program to maintain the routes in an airline.
Your company has asked you to implement Network Access
Protection(NAP) on the network. You already have Windows Server
Windows XP with SP2 2008 installed on your servers but your organization wants to know
which client operating systems will support NAP. What operating
system does not support NAP?
Inserting an item into the stack when stack is not full is called
push, pop ____________ while operation and deletion of item from the stack,
when stack is not empty is called ________________ operation.
A program to keep track of patients as they check into a medical clinic,
Queue
assigning patients to doctors on a first-come, first-served basis.
Reverse The elements are removal from a stack in _________ order.
for the size of the
structure and the data in
Linked lists are best suited _____________________.
the structure are
constantly changing
Your company network includes desktop computers that have Windows
From the Action Center, 7 installed. Microsoft updates are applied automatically at a scheduled
open the Windows time. A use1- reports that a proprietary application has stopped
Update window. working. You need to uninstall the most recent update from Microsoft.
What should you do first?
LIFO Stack follows the strategy of ________________.
In linked representation of stack, the null pointer of the last node in the
Bottom of the stack
list signals ____________
push The term used to insert an element into stack.
first record of the actual
The dummy header in linked list contains ____________________.
data
The value in the left child of a node (if it exists) in a binary search tree
FALSE
will be greater than the value in the node itself.
A binary search tree whose left subtree and right subtree differ in height
AVL tree
by at most 1 unit is called ____________________.
Stack A program keeping track of where canned goods are located on a shelf.
Trees Which of the following is non-linear data structure?
Indicate which structure would be a more suitable choice for each of the
Tree, Binary search tree
following applications.
In linked representation of stack, ___________ fields hold the elements
INFO
of the stack.
Alexandria is the payroll manager and stores critical file on her local
drive for added security on her Windows 7 computer. She wants to
Mirrored volumes ensure that she is using the disk configuration with the most fault
tolerance and the highest level of consistent availability. Which of the
following provisions should she use?
Reverse "The elements are removal from a stack in _________ order. "
push This is the insertion operation in the stack.
Algorithms that use a list must know whether the list is array based or
FALSE
linked.
stacks The term push and pop is related to _____________.
The situation when in a linked list START=NULL is
Underflow
____________________.
A _______________ is a data structure that organizes data similar to a
Queue linked list
line in the supermarket, where the first one in line is the first one out.
TRUE Binary search trees are ordered.
front Deletion operation is done using __________ in a queue.
Identify the data structure which allows deletions at both ends of the list
Input restricted dequeue
but insertion at only one end.
FIFO lists Which of the following names does not relate to stacks?
Which data structure is used in breadth first search of a graph to hold
Queue
nodes?
stacks The term push and pop is related to _____________
Pop This is the term used to delete an element from the stack.
Which of the following is/are the levels of implementation of data
All of these
structure?
2 Each node in singly linked list has _______ fields.
____________________ level is where the model becomes compatible
Implementation level
executable code.
It provides transparent access to internal network resources whenever
they are connected to the Internet. It also enables the IT Professionals
DirectAccess
to manage remote computers outside of the office and does not require
a VPN connection.
0 Value of first linked list index is _______________.
This are point-to-point connection across a private or public network. It
Virtual Private Network uses special protocols, called tunneling protocol to make a virtual call to
a virtual port.
On average, searching in a binary search tree is faster than searching
FALSE
in a list.
Tree A program to keep track of the soccer teams in a city tournament
You are a desktop administrator for an enterprise organization. A user
applies a device update from the manufacturer, and now the computer
Restore Windows by
is displaying error messages. The user has critical documents on the
using the most recent
computer that need to be preserved. You need to restore the computer
System Restore point
to an operating state and preserve applications and data. What should
you do?
Stack Which of the following data structures is linear type?
Graph Which of the following data structure is non-linear type?
Sentinel This indicates the end of the list.
The new node is placed
at the front of the linked What happens when you push a new node onto a stack?
list
A dictionary of words used by a spelling checker to be built and
Binary search tree
maintained.
In a linked list, the ____________ contains the address of next element
Link field
in the list.
Which data structure allows deleting data elements from and inserting
queues
at rear?
It is a pile in which items are added at one end and removed from the
queue
other.
FALSE A stack and a queue are different names for the same ADT.
FALSE A list may be linear or nonlinear, depending on its implementation.
FALSE A binary search tree is another name for a binary tree.
Indexing the ________________ element in the list is not possible in
middle
linked lists.
pop The retrieval of items in a stack is ___________ operation.
TRUE A leaf in a tree is a node with no children.
A program to receive data that is to be saved and processed in the
Stack
reverse order.
predecessor node LINK is the pointer pointing to the ____________________.
You use a portable computer that has Windows 7 Enterprise SP1
From Accessories, click
installed. A conference room at your company has a network projector
Connect to a Network
installed on a server within the company network. You need to connect
Projector
to the projector from your computer. What should you do?
None of these ____________________ is not the component of data structure.
FALSE A stack displays FIFO behavior.
You are the system administrator for your company. You are
configuring the services on a Windows 7 computer. You want to ensure
Recovery
that if a service fails to load, it will attempt to restart. Which tab of the
service`s Properties dialog box should you use?
FALSE A binary search cannot be applied to a tree.
Kayla is dissatisfied with the configuration of her keyboard and mouse.
She wants to reset the keyboard speed and the mouse pointer rate.
Control Panel
Which utility should she use to configure the keyboard and mouse
properties?
Binary tree Herder node is used as sentinel in __________________.
This is very useful in situation when data have to be stored and then
stack
retrieved in reverse order.
singly linked list A linear list in which the pointer points only to the successive node.
It is a windows 7 feature that enables user to connect to their desktop
Remote Desktop
computer from another device.
Data Structures and Algorithms

BY-LANGGA
PRELIM QUIZ 1
1. Linked lists are best suited …..
A. for relatively permanent collections of data.

B. the size of the structure and the data in the structure are constantly changing.
C. data structure
D. for none of the 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 are two-way lists?

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 ……
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 ……..
PRELIM QUIZ 2
Question 1
Answer saved
Marked out of 1.00
Flag question
Question text
The term used to insert an element into stack.
Select one:
a.
pump
b.
pop
c.
pull
d.
push
Clear my choice
Question 2
Answer saved
Marked out of 1.00
Flag question
Question text
A pointer variable which contains the location at the top element of the stack.
Select one:
a.
Last
b.
End
c.
Final
d.
Top
Clear my choice
Question 3
Answer saved
Marked out of 1.00
Flag question
Question text
Deletion operation is done using __________ in a queue.
Select one:
a.
list
b.
rear
c.
front
d.
top
Clear my choice
Question 4
Answer saved
Marked out of 1.00
Flag question
Question text
This is the insertion operation in the stack.
Select one:
a.
insert
b.
top
c.
pop
d.
push
Clear my choice
Question 5
Answer saved
Marked out of 1.00
Flag question
Question text
This form of access is used to add/remove nodes from a stack.
Select one:
a.
FIFO
b.
Both of these
c.
LIFO
d.
None of these
Clear my choice
Question 6
Answer saved
Marked out of 1.00
Flag question
Question text
Stack follows the strategy of ________________.
Select one:
a.
LRU
b.
RANDOM
c.
FIFO
d.
LIFO
Clear my choice
Question 7
Answer saved
Marked out of 1.00
Flag question
Question text
In linked representation of stack, the null pointer of the last node in the list signals
_____________________.
Select one:
a.
Bottom of the stack
b.
In between some value
c.
Beginning of the stack
d.
Middle of the stack
Clear my choice
Question 8
Answer saved
Marked out of 1.00
Flag question
Question text
New nodes are added to the ________ of the queue.
Select one:
a.
Back
b.
Middle
c.
Front
d.
Front and Back
Clear my choice
Question 9
Answer saved
Marked out of 1.00
Flag question
Question text
Which of the following names does not relate to stacks?
Select one:
a.
Push down lists
b.
Piles
c.
FIFO lists
d.
LIFO lists
Clear my choice
Question 10
Answer saved
Marked out of 1.00
Flag question
Question text
This form of access is used to add and remove nodes from a queue.
Select one:
a.
FIFO, First In First Out
b.
Both of these
c.
None of these
d.
LIFO, Last In First Out
Clear my choice
MIDTERM QUIZ 1
Question 1
Answer saved
Marked out of 1.00
Flag question
Question text
The complexity of linear search algorithm.
Select one:
a.
O(logn)
b.
O(n2)
c.
d.
O(n logn)
Clear my choice
Question 2
Answer saved
Marked out of 1.00
Flag question
Question text
Which of the following is not the required condition for binary search algorithm?
Select one:
a.
There must be mechanism to delete and/or insert elements in list
b.
There should be the direct access to the middle element in any sub list.
c.
The list must be sorted
d.
Number values should only be present
Clear my choice
Question 3
Answer saved
Marked out of 1.00
Flag question
Question text
The average case occurs in linear search algorithm _______________.
Select one:
a.
when item is not the array at all
b.
when item is somewhere in the middle of the array
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
Clear my choice
Question 4
Answer saved
Marked out of 1.00
Flag question
Question text
The complexity of sorting algorithm measures the __________ as a function of the number n
of items to be shorter.
Select one:
a.
average-case complexity
b.
case-complexity
c.
running time
d.
average time
Clear my choice
Question 5
Answer saved
Marked out of 1.00
Flag question
Question text
The method used by card sorter.
Select one:
a.
Radix sort
b.
Heap
c.
Insertion
d.
Quick
Clear my choice
Question 6
Answer saved
Marked out of 1.00
Flag question
Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Select one:
a.
O(logn)
b.
O(n2)
c.
O(n logn)
d.
O(n+logn)
Clear my choice
Question 7
Answer saved
Marked out of 1.00
Flag question
Question text
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 significant in evaluating the performance
of internal sorting.
Select one:
a.
False, True
b.
False, False
c.
True, True
d.
True, False
Clear my choice
Question 8
Answer saved
Marked out of 1.00
Flag question
Question text
The complexity of merge sort algorithm.
Select one:
a.
b.
O(n logn)
c.
O(logn)
d.
O(n2)
Clear my choice
Question 9
Answer saved
Marked out of 1.00
Flag question
Question text
The worst case occurs in linear
search algorithm when ________________.
Select one:
a.
Item is the last element in the array or item is not there at all
b.
Item is somewhere in the middle of the array
c.
Item is not in the array at all
d.
Item is the last element in the array
Clear my choice
Question 10
Answer saved
Marked out of 1.00
Flag question
Question text
___________ sorting algorithm is frequently used when n is small, where n is the total number
of elements.
Select one:
a.
Bubble
b.
Heap
c.
Insertion
d.
Quick
Clear my choice
MIDTERM QUIZ 2
Question 1
Not yet answered
Marked out of 1.00
Flag question
Question text
Which of the following is not the required condition for binary search algorithm?
Select one:
a.
Number values should only be present
b.
There must be mechanism to delete and/or insert elements in list
c.
The list must be sorted
d.
There should be the direct access to the middle element in any sub list.
Clear my choice
Question 2
Not yet answered
Marked out of 1.00
Flag question
Question text
A connected graph T without any cycles is called a ____________.
Select one:
a.
Free tree
b.
A tree
c.
A tree graph
d.
all of these
Clear my choice
Question 3
Not yet answered
Marked out of 1.00
Flag question
Question text
This is a binary tree whose every node has either zero or two children.
Select one:
a.
extended binary tree
b.
binary search tree
c.
complete binary tree
d.
data structure
Clear my choice
Question 4
Not yet answered
Marked out of 1.00
Flag question
Question text
In a graph, if e=[u,v], then u and v are called _______________
Select one:
a.
All of the choices
b.
End points of e
c.
Adjacent nodes
d.
Neighbors
Clear my choice
Question 5
Not yet answered
Marked out of 1.00
Flag question
Question text
This is a terminal node in a binary tree.
Select one:
a.
Branch
b.
Leaf
c.
Root
d.
Child
Clear my choice
Question 6
Not yet answered
Marked out of 1.00
Flag question
Question text
The complexity of sorting algorithm measures the __________ as a function of the number n
of items to be shorter.
Select one:
a.
average-case complexity
b.
running time
c.
average time
d.
case-complexity
Clear my choice
Question 7
Not yet answered
Marked out of 1.00
Flag question
Question text
The complexity of linear search algorithm.
Select one:
a.
O(logn)
b.
O
c.
O(n2)
d.
O(n logn)
Clear my choice
Question 8
Not yet answered
Marked out of 1.00
Flag question
Question text
The average case occurs in linear search algorithm _______________.
Select one:
a.
when item is somewhere in the middle of the array
b.
item is the last element in the array or item is not there at all
c.
when item is the last element in the array
d.
when item is not the array at all
Clear my choice
Question 9
Not yet answered
Marked out of 1.00
Flag question
Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Select one:
a.
O(logn)
b.
O(n logn)
c.
O(n+logn)
d.
O(n2)
Clear my choice
Question 10
Not yet answered
Marked out of 1.00
Flag question
Question text
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path
from v to u.
Select one:
a.
Literally connected
b.
Unliterally connected
c.
Directly connected
d.
Widely connected
FINAL QUIZ 1
Question 1
Not yet answered
Marked out of 1.00
Flag question
Question text
Which of the following is not a limitation of binary search algorithm?
Select one:
a.
there must be a mechanism to access middle element directly
b.
must use a sorted array
c.
requirement of sorted array is expensive when a lot of insertion and deletions are needed
d.
binary search algorithm is not efficient when the data elements more than 1500
Clear my choice
Question 2
Not yet answered
Marked out of 1.00
Flag question
Question text
These are binary trees with threads.
Select one:
a.
Threaded trees
b.
Special trees
c.
Pointer trees
d.
Special pointer trees
Clear my choice
Question 3
Not yet answered
Marked out of 1.00
Flag question
Question text
Sorting algorithm can be characterized as ________________.
Select one:
a.
Both of the choices
b.
Sophisticated algorithms that require the O(nlog2n) comparisons to sort items
c.
Simple algorithm which require the order of n2 comparisons to sort n items
d.
None of these
Clear my choice
Question 4
Not yet answered
Marked out of 1.00
Flag question
Question text
Which of the following sorting algorithm is of the divide and conquer type?
Select one:
a.
Merge sort
b.
Selection sort
c.
Bubble sort
d.
Insertion sort
Clear my choice
Question 5
Not yet answered
Marked out of 1.00
Flag question
Question text
Trees are ________ if they are similar and have the same contents at corresponding nodes.
Select one:
a.
duplicate
b.
copies
c.
carbon copy
d.
replica
Clear my choice
Question 6
Not yet answered
Marked out of 1.00
Flag question
Question text
Binary search algorithm cannot be applied to _______________.
Select one:
a.
sorted linear array
b.
sorted linked list
c.
pointer array
d.
sorted binary trees
Clear my choice
Question 7
Not yet answered
Marked out of 1.00
Flag question
Question text
Partition and exchange sort is ____________.
Select one:
a.
tree sort
b.
bubble sort
c.
quick sort
d.
heap sort
Clear my choice
Question 8
Not yet answered
Marked out of 1.00
Flag question
Question text
In a 2-tree, nodes with 0 children are called ___________.
Select one:
a.
outside node
b.
exterior node
c.
external node
d.
outer node
Clear my choice
Question 9
Not yet answered
Marked out of 1.00
Flag question
Question text
In binary trees, nodes with no successor are called _______________.
Select one:
a.
Final nodes
b.
Terminal nodes
c.
End nodes
d.
Last nodes
Clear my choice
Question 10
Not yet answered
Marked out of 1.00
Flag question
Question text
Every node N in a binary tree T except the root has a unique parent called the ________ of N.
Select one:
a.
Antecedents
b.
Forerunner
c.
Predecessor
d.
Precursor
Clear my choice
FINAL QUIZ 2

Data Structure and Algorithms

Uploaded by

Data Structure and Algorithms

Uploaded by

Data Structure and Algorithms.

Multiple Choice Questions and Answers:-

1. Which if the following is/are the levels of implementation of data

3. ……………….. level is where the model becomes compatible executable code

4. Stack is also called as

5. Which of the following is true about the characteristics of abstract data

7. Which of the following is not the part of ADT description?

14. Which of the following is non-liner data structure?

15. Herder node is used as sentinel in …..

18. Which of the following data structure is non linear type?

19. Which of the following data structure is linear type?

20. To represent hierarchical relationship between elements, Which data

22. In the …………….. traversal we process all of a vertex’s descendants before

23. State True of False.

24. Match the following.

27. State True or False.

28. Which of the following is not the internal sort?

29. State True or False.

32. In a circular queue the value of r will be ..

33. Which of the following statement is true?

36. ………… is not the operation that can be performed on queue.

41. Which of the following is not the type of queue?

42. The property of binary tree is

43. State true or false.

45. State true of false.

46. ………………. is not an operation performed on linear list

47. Which is/are the application(s) of stack

50. State true or false.

51. Which of the following data structures are indexed structures?

55. Operations on a data structure may be …..

58. The use of pointers to refer elements of a data structure in which

59. Arrays are best data structures

60. Which of the following statement is false?

61. Which of the following data structure is non-linear type?

62. Which of the following data structure is linear type?

63. The logical or mathematical model of a particular organization of data is

64. The simplest type of data structure is ………………

65. Linear arrays are also called ……………….

66. Arrays are best data structures …………

67. Which of the following data structures are indexed structures?

70. When does top value of the stack changes?

71. Which of the following data structure is non-linear type?

72. Which of the following data structure is linear type?

73. The logical or mathematical model of a particular organization of data is

74. The simplest type of data structure is ………………

75. Linear arrays are also called ……………….

76. Arrays are best data structures …………

77. Which of the following data structures are indexed structures?

80. When does top value of the stack changes?

82) Linked lists are best suited

84) The operation of processing each element in the list is known as

85) The complexity of the average case of an algorithm is

86) The Average case occur in linear search algorithm

90) Two main measures for the efficiency of an algorithm are

93. The disadvantage in using a circular linked list is …………………….

96. In a priority queue, insertion and deletion takes place at ………………

97. The time complexity of quick sort is …………..

98. Which of the following is an application of stack?

99. The data structure which is one ended is ………………

100. A list which displays the relationship of adjacency between elements is

Data structure mcq questions

DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers

A. LIFO, Last In First Out

B. FIFO, First In First Out

3) ........ form of access is used to add remove nodes from a stack.

5) New nodes are added to the ......... of the queue.

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

9) Which of the following name does not relate to stacks?

D. Push down lists