Anda di halaman 1dari 35

S.

No
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170

171

172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
Question
Process of inserting an element in stack is called
Process of removing an element from stack is called
Stack is a
In a stack, if a user tries to remove an element from empty stack it is called
Pushing an element into stack already having five elements and stack size of 5, then stack becomes
Entries in a stack are “ordered”. What is the meaning of this statement?
Every stack has a variable called
Basic Stack operations are
Which of the following applications may use a stack?
The process of accessing data stored in a serial access memory is similar to manipulating data on a
In which position the new element is inserted in STACK
Which is/are the application(s) of stack
When an operand is read, which of the following is done?
What should be done when a left parenthesis ‘(‘ is encountered?
Which of the following is an infix expression?
What is the time complexity of an infix to postfix conversion algorithm?
What is the result of the following operation: Top (Push (S, X))
Which notation is also called Reverse polish notation
Which notation is also called polish notation
What is the postfix expression for the infix expression? For a-b-c
In infix to postfix conversion algorithm, the operators are associated from?
What will be the postfix expression for following infix expression b * c + d / e
Which expression does not follow the Operator preceedence
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
The postifx expression for the infix expression A + B* (C+D) / F + D*E is
The postfix form of A*B+C/D is?
The prefix form of an infix expression p + q - r * t is?
The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack?
Which of the following is not an inherent application of stack?
Which of the following is an example of Postfix expression ?
The type of expression in which operator succeeds its operands is?
Evaluate the Postfix Expression 9 3 4 * 8 + 4 / -
Evaluate the Postfix Expression 10 75 - 10 + 2 / +
Evaluate the Postfix Expression 14 7 + 8 +
The element in a Queue are added to one end is called
The element in a Queue are removed from one end is called
Queues can be easily represented using ----------- arrays
Before inserting an element in a Queue we must check for -------------- conditions
if we want to delete an element from the Queue then the value of ----------- will be incremented
Before deleting an element in a Queue we must check for -------------- conditions
Queues can be implemented by using either-------------
A Queue follows ---------------
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the o
The data structure required for Breadth First Traversal on a graph is?
Circular Queue is also known as ________
A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
A normal queue, if implemented using an array of size MAX_SIZE, gets full when
Queues serve major role in ______________
Which of the following is not the type of queue?
The minimum number of stacks needed to implement a Queue is
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be
A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The
A normal queue, if implemented using an array of size MAX_SIZE, gets full when
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change duri
What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?
……………. Is a pile in which items are added at one end and removed from the other.
A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the fir
In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
In a circular queue the value of r will be ..
………… is not the operation that can be performed on queue.
A common example of a queue is people waiting in line at a__________.
Which of the following data structure may give overflow error,even though the current number of element in it is less
The initial configuration of a queue is a, b, c, d, ('a' is in the front end). To get the configuration d, c, b, a, one needs a
Queue can be used to implement
What is a dequeue?
Which of them is an abstract data structure (ADT)?
Stack cannot be used to
If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before stack overflow?
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change duri
What does creating a node mean?
Generally collection of Nodes is called as __________.
Any node is the path from the root to the node is called
…………………. Is a directed tree in which out degree of each node is less than or equal to two.
A binary tree whose every node has either zero or two children is called
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
The in order traversal of tree will yield a sorted listing of elements of tree in
B Trees are generally
If a node having two children is deleted from a binary tree, it is replaced by its
A full binary tree with 2n+1 nodes contain
The number of different directed trees with 3 nodes are
One can convert a binary tree into its mirror image by traversing it in
The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum
What is the maximum possible number of nodes in a binary tree at level 6?
How many nodes in a tree have no ancestors.
In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which
The node at the top of a tree is known as the ________of the tree.
Internal nodes have___________.
A binary tree is a ________data structure; each node belongs to a particular level number.
The nodes belonging to the same parent node are known as_______.
The depth of a binary tree is the highest level number of any ______ in the binary tree.
Any node is the path from the root to the node is called
…………………. Is a directed tree in which out degree of each node is less than or equal to two.
A binary tree whose every node has either zero or two children is called
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficien
The in order traversal of tree will yield a sorted listing of elements of tree in
What does creating a node mean?
The number of edges from the node to the deepest leaf is called _________ of the tree.
If a node having two children is deleted from a binary tree, it is replaced by its
What is the maximum possible number of nodes in a binary tree at level 6?
Which of the following is false about a binary search tree?
What is the speciality about the inorder traversal of a binary search tree?
What are the worst case and average case complexities of a binary search tree?
How many children does a binary tree have?
What must be the ideal size of array if the height of tree is ‘n’
Which of the following traversing algorithm is not used to traverse in a tree?
The number of edges from the root to the node is called __________ of the tree.
What is the maximum number of children that a binary tree node can have?
How many common operations are performed in a binary tree?
What is the traversal strategy used in the binary tree?
How many types of insertion are performed in a binary tree?
How many orders of traversal are applicable to a binary tree (In General)?
Using what formula can a parent node be located in an array?
What is the time complexity of pre-order traversal in the iterative fashion?
To obtain a prefix expression, which of the tree traversals is used?
Which of the following pair’s traversals on a binary tree can build the tree uniquely?
The number of edges from the node to the deepest leaf is called _________ of the tree.
Which of the following statement about binary tree is CORRECT?
Which type of traversal of binary search tree outputs the value in sorted order?
If a node having two children is to be deleted from binary search tree, it is replaced by its
Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
Advantages of linked list representation of binary trees over arrays?
Disadvantages of linked list representation of binary trees over arrays?
Identify the reason which doesn’t play a key role to use threaded binary trees?
In order to get the contents of a Binary search tree in ascending order, one has to traverse it in
In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which
How many common operations are performed in a binary tree?
How many types of insertion are performed in a binary tree?
What must be the ideal size of array if the height of tree is ‘n’
Level order traversal of a tree is formed with the help of
What is the maximum number of children that a binary tree node can have?
What is an AVL tree?
What maximum difference in heights between the leafs of a AVL tree is possible?
In how many ways a node can be deleted from an AVL tree
After every insertion of a node in a tree which factor has to be check
When we say a tree as an AVL tree
AVL tree is also called as
what are the various rotations that we have in an AVL tree
LR rotation performs which rotation
What is the number of edges present in a complete graph having n vertices?
In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
Which of the following properties does a simple graph not hold?
Which of the following is true?
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is
Which of the following ways can be used to represent a graph?
What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?
From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.
Minimum number of spanning tree in a connected graph is
The minimum number of edges required to create a cyclid graph of n vertices is
A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A ……….. is a graph that has weights of costs associated with its edges.
A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
In a graph if e=[u, v], Then u and v are called
A connected graph T without any cycles is called
In a graph if e=(u, v) means
For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is
A complete graph can have ...............
The number of edges in a simple, n-vertex, complete graph is
Graphs are represented using ............
The spanning tree of connected graph with 10 vertices contains ..............
If locality is a concern, you can use ................ to traverse the graph.
Which of the following is useful in traversing a given graph by breadth first search?
Which of these adjacency matrices represents a simple graph?
If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.
Which of the following algorithms solves the all-pair shortest path problem?
The minimum number of edges in a connected cyclic graph on n vertices is
The number of edges in a regular graph of degree d and n vertices is
Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph ?

Traversal of a graph is different from tree because

Which of the following condition is sufficient to detect cycle in a directed graph?


In a depth-first traversal of a graph G with n vertices, k edges are marked as tree edges. The number of connected componen
The number of elements in the adjacency matrix of a graph having 7 vertices is __________
What
For would
the be thematrix
adjacency number of of zeros in graph
a directed the adjacency matrix
the row sum is of
thethe given graph?
_________ degree and the column
sum is the ________ degree.
Dijkstra’s Algorithm is used to solve _____________ problems.
Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?
What is the time complexity of Dijikstra’s algorithm?
How many times the insert and extract min operations are invoked per vertex?
The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ___________
Dijkstra’s Algorithm is the prime example for ___________
Which of the following is true?
Prim’s algorithm is a ______
Prim’s algorithm can be efficiently implemented using _____ for graphs with greater density.
Prim’s algorithm is also known as __________
Kruskal’s algorithm is used to ______
Kruskal’s algorithm is a ______
What is the time complexity of Kruskal’s algorithm?
Which of the following is true?
Which of the following is false about the Kruskal’s algorithm?
Floyd Warshall’s Algorithm is used for solving ____________
Floyd Warshall’s Algorithm can be applied on __________
What is the running time of the Floyd Warshall Algorithm?
What approach is being followed in Floyd Warshall Algorithm?
Floyd Warshall Algorithm can be used for finding _____________
What procedure is being followed in Floyd Warshall Algorithm?
Floyd- Warshall algorithm was proposed by ____________
Who proposed the modern formulation of Floyd-Warshall Algorithm as three nested loops?
Find the odd out
II B.TECH DS &
Option1
Create
Create
LIFO
Underflow
Overflow
A collection of stacks is sortable
Front
PUSH
A parentheses balancing program
heap
PUSH
Function calls
It is placed on to the output
It is ignored
(a+b)*(c+d)
O(N log N)
X
Infix
Postfix
-ab-c
right to left
bc*de/+
Postfix
LinkList
AB+CD + *F/ D+E*
*AB/CD+
+ pq - *rt
600
First node
Reversing a string
(A + B) / C
Infix Expression
44
166
29
Rear
Rear
linear
UNDERFLOW
Front
UNDERFLOW
arrays/Linked list
FIFO
Queue
Stack
Ring Buffer
Queue
Rear = MAX_SIZE – 1
Simulation of recursion
Ordinary queue
3
ABCD
0
Rear=MAX_SIZE-1
Only front pointer
θ (n)
Stack
Queue linked list
0 and 1
r=r+1
Insertion
Bus stop
Simple queue
2 deletions and 3 additions
recursion
A queue with insert/delete defined for both front and rear ends of the queue
Stacks
Evaluation of Expression in Postfix form
12
Only front pointer
Defining its structure
Stack
Successor node
Unary tree
Complete binary tree
ABFCDE
Binary trees
very deep and narrow
Inorder predecessor
n leaf nodes
2
inorder
Three nodes
36
0
left, root, right
Heap
Child nodes
Dual level
Sibling nodes
Leaf node
Successor node
Unary tree
Complete binary tree
ABFCDE
Leaf
Binary trees
Defining its structure
Height
Inorder predecessor
36
The left child is always lesser than its parent
It traverses in a non increasing order
O(n), O(n)
2
2n-1
post order
Height
0
1
depth-first traversal
1
1
(i+1)/2
O(1
Level-order traversal
post order and pre order
Height
Every binary tree is either complete or full
Pre-order
In-order predecessor
Yes just traverse through the array and form the tree
dynamic size
Randomly accessing is not possible
The storage required by stack and queue is more
pre-order
left, root, right
1
1
2n-1
breadth first search
0
a tree which is balanced and is a height balanced tree
log(n) where n is the number of nodes
1
balance factor
balance factors are either 2, -2 , 1
balanced tree
LL,LR,RL,RR
Left Left
(n*(n+1))/2
TRUE
Must be connected
A graph may contain no edges and many vertices
v=e
Adjacency List and Adjacency Matrix
(n*(n-1))/2
e-n+1
n
n
Weakly connected
vertices, edges
Network
Directed tree
endpoints of e
a tree graph
u is adjacent to v but v is not adjacent to u
ne
n^2 spanning trees
n*(n-2)
Adjacency tree
9 edges
Breadth First Search
set
[ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]
x=5, y=3
Floyd's algorithm
n
nd
Depth First Search
There can be a loop in graph so we must maintain a visited flag for every vertex

There is an edge from currently being visited node to an already visited node.
k
7
10
in, out
All pair shortest path
Max priority queue
O(N)
1
Total number of vertices
Greedy algorithm
Prim’s algorithm initialises with a vertex
Divide and conquer algorithm
d-ary heap
Dijkstra–Scholten algorithm
find minimum spanning tree
divide and conquer algorithm
O(log V)
Prim’s algorithm can also be used for disconnected graphs
It is a greedy algorithm
All pair shortest path problems
Undirected and unweighted graphs
Big-oh(V)
Greedy technique
Single source shortest path
Top down
Robert Floyd and Stephen Warshall
Robert Floyd
Prim's Minimal Spanning Tree Algorithm
II B.TECH DS & A BIT BANK OF UNITS -----4,5,6
Option2
Push
Push
FIFO
Empty collection
Crash
Stack entries may be compared with the ‘<‘ operation
Rear
POP
Tracking of local variables at run time
queue
TOP
Large number Arithmetic
It is placed in operator stack
It is placed in the output
ab+c*
O(N)
null
Postfix
Prefix
ab – c –
left to right
bc*de+/
Prefix
Stack
A + *BCD/ F* DE ++
AB*CD/+
- +pqr * t
350
Last node
Evaluation of postfix expression
ABC^/DE*+AC*-
pre fix Expression
444
16
28
Front
Front
Non Linear
OVERFLOW
Rear
OVERFLOW
stacks/arrays
LIFO
Stack
Array
Square Buffer
Circular queue
Front = (rear + 1)mod MAX_SIZE
Simulation of arbitrary linked list
Single ended queue
1
DCBA
7
Front=(rear+1)mod MAX_SIZE
Only rear pointer
θ (n + k)
Queue
Stacks linked list
0 and -1
r=(r+1)% [QUEUE_SIZE – 1]
Deletion
Movie hall
Circular queue
3 deletion and 2 additions
radix sort
A queue implemented with a doubly linked list
Functions
Reversing String
66
Only rear pointer
Allocating memory to it
Linked List
Ancestor node
Binary tree
Binary search tree
ADBFEC
Binary search trees
very wide and shallow
Inorder successor
n non-leaf nodes
3
preorder
Two nodes
6
1
root, left, right
Leaf nodes
Parent nodes
Multilevel
Parent nodes
Parent node
Ancestor node
Binary tree
Binary search tree
ADBFEC
branch
Binary search trees
Allocating memory to it
Depth
Inorder successor
6
The right child is always greater than its parent
It traverses in an increasing order
O(logn), O(logn)
any number of childs
n-1
pre order
Depth
1
2
breadth-first traversal
2
4
(i-1)/2
O(n)
Pre-order traversal
post order and in order
Depth
Every complete binary tree is also a full binary tree
In-order
In-order successor
No we need one more traversal to form a tree
ease of insertion/deletion
Extra memory for a pointer is needed with every element in the list
The pointers in most of nodes of a binary tree are NULL
in order
root, left, right
2
2
n-1
depth first search
1
a tree which is unbalanced and is a height balanced tree
n where n is the number of nodes
2
impact factor
balance factors are either -1, 0,1
balanced tree with 0,-1,1
LM,ML,MM,LMM
Right Right
(n*(n-1))/2
False
Must be unweighted
A graph may contain many edges and no vertices
v = e+1
Incidence Matrix
(n*(n+1))/2
n-e+1
n(n-1)
n+1
Strongly Connected
edges, vertices
Weighted graph
Undirected tree
adjacent nodes
free tree
e begins at u and ends at v
2n
n^(n-2) spanning trees
n*(n-1)
Adjacency linked list
11 edges
Depth First Search
List
[ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]
x=3, y=5
Prim's algorithm
n+1
n+d
Breadth First Search
DFS of a graph uses stack, but inorrder traversal of a tree is recursive
There is an edge from currently being visited node to an ancestor of currently
visited node in DFS forest.
k+1
14
6
out, in
Single source shortest path
Stack
O(N3)
2
Total number of edges
Branch and bound
Prim’s algorithm initialises with a edge
Greedy algorithm
linear search
Borůvka’s algorithm
find single source shortest path
dynamic programming algorithm
O(E log V)
Kruskal’s algorithm can also run on the disconnected graphs
It constructs MST by selecting edges in increasing order of their weights
Single Source shortest path problems
Undirected graphs
Theta(V2)
Dynamic Programming
Topological sort
Bottom up
Stephen Floyd and Robert Warshall
Stephen Warshall
Kruskal's Minimal Spanning Tree Algorithm
---4,5,6
Option3
Evaluation
Evaluation
FILO
Overflow
Underflow
The entries are stored in a linked list
TOP
PEEK
Compiler Syntax Analyzer
stack
PEEK
Evaluation of arithmetic expressions
It is ignored
It is placed in the operator stack
+ab
O(N2)
S
prefix
iInfix
– -abc
centre to left
bcd*e/+
Infix
Queue
A*B + CD / F* DE ++
A*BC+/D
- +pq * rt
650
Any node
Implementation of recursion
*+ABC
postfix Expression
4
12
27
TOP
TOP
Primitive
a and b
NULL
a and b
linked list/stacks
Ordered array
Tree
Queue
Rectangle Buffer
Dequeue
Front = rear + 1
Simulation of limited resource allocation
Circular queue
2
DCAB
9
Front=rear+1
Both front and rear pointer
θ (nk)
List
Both of them
-1 and 0
r=(r+1)% QUEUE_SIZE
Retrieval
Shopping mall
Priority Queues
3 deletions and 3 additions
quick sort
A queue implemented with both singly and doubly linked lists
Queues
Implementation of Recursion
60
Both front and rear pointer
Initialization
Heap
Internal node
Trinary tree
Extended binary tree
ABDECF
Heaps
very deep and very wide
Preorder predecessor
n-1 leaf nodes
4
postorder
One node
1
2
right, root, left
Child nodes
Both (a) and (b)
Tri level
Child nodes
Sibling node
Internal node
Trinary tree
Extended binary tree
ABDECF
path
Heaps
Initialization
Length
Preorder predecessor
1
The left and right sub-trees should also be binary search trees
It traverses in a random fashion
O(logn), O(n)
0 or 1 or 2
n
inorder
Length
2
3
random traversal
3
2
i/2
O(logn)
post order traversal
post and level order
Length
Every full binary tree is also a complete binary tree
Post-order
Pre-order predecessor
No in case of sparse trees
ease in randomly accessing a node
Difficulty in deletion
It is Difficult to find a successor node
post order
right, root, left
3
3
n
dijkstra’s algorithm
2
a tree with three children
0or 1
3
non impact factor
both 1 and 2
height balanced tree
MA,MB,MC,M
Left Left Right
n
But not both
Must have no loops or multiple edges
A graph may contain no edges and no vertices
v+1=e
Adjacency List, Adjacency Matrix as well as Incidence Matrix
n*(n-1)
n+e-1
1
n-1
Tightly Connected
vertices, paths
Both A and B
Dis-joint tree
neighbors
a tree
u is processor and v is successor
2e
n^(n+1) spanning trees
n*(n-1)/2
Adjacency graph
10 edges
Either BFS or DFS
Stacks
[ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]
x=3, y=3
Dijkstra's algorithm
n-1
nd/2
Prim's Minimum Spanning Tree Algorithm
BFS of a graph uses queue, but a time efficient BFS of a tree is recursive.

Every node is seen twice in DFS.


n-k-1
36
16
in, total
Network flow
Circular queue
O(N2)
3
Number of vertices – 1
Back tracking
Prim’s algorithm initialises with a vertex which has smallest edge
Dynamic Programming
fibonacci heap
Floyd–Warshall algorithm
find all pair shortest path algorithm
greedy algorithm
2
O(E )
Prim’s algorithm is simpler than Kruskal’s algorithm
It can accept cycles in the MST
Network flow problems
Directed graphs
Big-Oh(VE)
Linear Programming
Minimum spanning tree
Big bang
Bernad Floyd and Robert Warshall
Bernard Roy
Floyd-Warshall's All pair shortest path Algorithm
Option4 Correct Answer
Pop 2
Pop 4
LILO 2
Garbage Collection 1
User flow 1
There is a Sequential entry that is one by one 4
MAX 3
All of the above 4
Data Transfer between two asynchronous process 4
binary tree 3
pop 2
All of the above 4
Operator stack is emptied 1
The contents of the operator stack is emptied 3
abc 1
O(M log N) 2
None of these 1
None of the above 2
Both a and b 2
abc+- 2
centre to right 2
b*cde/+ 1
Both a and c 1
Tree 2
ABCD + *F / + DE* + 4
ABCD+/* 2
- + * pqrt 3
588 2
Middle node 1
Job scheduling 4
None of these 2
None 3
0 3
14 2
25 1
LAST 1
LAST 2
non Primitive 1
None of the above 2
None of the above 1
None of the above 1
All of the above 1
Linear Tree 1
Linked list 1
Tree 3
Curve Buffer 1
Priority queue 3
Rear = front 1
Simulation of heap sort 3
Priority queue 2
4 3
ABCD 1
10 1
Rear=front 1
None 3
θ (n2) 1
None of the above 2
Neither of them 1
1 and 0 2
r=(r-1)% QUEUE_SIZE 3
Traversal 4
None of the above 1
None of these 2
3 deletions and 4 additions 3
depth first search 2
None of the mentioned 1
Both A and C 4
Allocating Resources and Scheduling 4
26 2
None 3
All of the above 4
Pointer 2
None of the above 2
Both B and C 2
None of above 3
ABDCEF 3
None of above 2
cannot say 4
None of the above 2
n-1 non-leaf nodes 2
5 2
any order 3
Any number of nodes 3
64 4
n 2
right, left, root 3
Root 4
None of the above 3
Single level 2
None of the above 1
None of the above 1
None of the above 2
Both B and C 2
None of above 3
ABDCEF 3
thread 4
None of above 2
All of the above 4
Width 2
None of the above 2
64 4
In order sequence gives decreasing order of elements 4
It traverses based on priority of the node 2
O(n), O(logn) 4
0 or 1 3
2n 1
randomised 4
Width 2
3 3
4 3
Priority traversal 2
4 3
3 4
2i/2 3
O(nlogn) 2
in order traversal 2
level and pre order 2
Width 2
A binary tree cannot be both complete and full 3
None 2
none 2
Yes by using both inorder and array elements 2
both dynamic size and ease in insertion/deletion 4
Random access is not possible and extra memory with every element 4
They occupy less size 2
not possible 2
right, left, root 3
4 3
4 3
2n 1
prims algorithm 1
3 3
a tree with atmost 3 children 1
atmost1 1
4 3
none of these 1
only 1 2
none 3
none 1
first Left rotation and after Right rotation 4
Information given is insufficient 2
none 2
Must have no multiple edges 1
A graph may contain no vertices and many edges 2
v = e-1 2
No way to represent 3
n*(n+1) 3
e-n-1 1
0 3
2n 1
Linearly Connected 2
graph node, edges 1
None of the above 3
Direction oriented tree 1
all of above 4
All of above 4
both b and c 4
e^n 3
n^n spanning trees 2
n*(n-1)*(n-2) 3
Adjacency queue 2
9 vertices 1
None of these 2
Queue 4
[ [0, 0, 1], [1, 0, 1], [1, 0, 0] ] 4
x=5, y=5 1
Warshall's algorithm 1 and 4
none of the above 1
maximum of n,d 3
Kruskal' Minimum Spanning Tree Algorithm 1
1
All of the above

2
None of the bove
n-k 4
49 4
0 2
total, out 2
Sorting 2
Min priority queue 4
O(logN) 3
0 1
Number of edges – 1 2
Dynamic programming 1
Prim’s algorithm initialises with a forest 1
Approximation algorithm 2
binary search 1
DJP Algorithm 4
traverse the graph 1
approximation algorithm 3
O(V log E) 2
In Kruskal’s sort edges are added to MST in decreasing order of their weights 2
It uses union-find data structure 3
Sorting problems 1
Acyclic graphs 3
Theta(V3) 4
Backtracking 2
Transitive closure 4
Sandwich 2
Robert Floyd and Bernad Warshall 1
Peter Ingerman 4
Dijkstra's Minimal Spanning Tree Algorithm 3
Topic No Level
1 Easy
1 Easy
1 Easy
1 moderate
1 moderate
1 moderate
1 difficult
1 difficult
1 difficult
1 difficult
2 Easy
2 Easy
2 Easy
2 moderate
2 moderate
2 moderate
2 difficult
2 difficult
2 difficult
2 difficult
3 Easy
3 Easy
3 Easy
3 moderate
3 moderate
3 moderate
3 difficult
3 difficult
3 difficult
3 difficult
4 Easy
4 Easy
4 Easy
4 moderate
4 moderate
4 moderate
4 difficult
4 difficult
4 difficult
4 difficult
5 Easy
5 Easy
5 Easy
5 moderate
5 moderate
5 moderate
5 difficult
5 difficult
5 difficult
5 difficult
6 Easy
6 Easy
6 Easy
6 moderate
6 moderate
6 moderate
6 difficult
6 difficult
6 difficult
6 difficult
7 Easy
7 Easy
7 Easy
7 moderate
7 moderate
7 moderate
7 difficult
7 difficult
7 difficult
7 difficult
8 Easy
8 Easy
8 Easy
8 Moderate
8 Moderate
8 Moderate
8 difficult
8 difficult
8 difficult
8 difficult
9 Easy
9 Easy
9 Easy
9 Moderate
9 Moderate
9 Moderate
9 Difficult
9 Difficult
9 Difficult
9 difficult
10 Easy
10 Easy
10 Easy
10 Moderate
10 Moderate
10 Moderate
10 difficult
10 Difficult
10 Difficult
10 difficult
11 easy
11 easy
11 easy
11 Moderate
11 Moderate
11 Moderate
11 Difficult
11 Difficult
11 Difficult
11 Difficult
12 easy
12 easy
12 easy
12 Moderate
12 Moderate
12 Moderate
12 Difficult
12 Difficult
12 Difficult
12 Difficult
13 easy
13 easy
13 easy
13 Moderate
13 Moderate
13 Moderate
13 Difficult
13 Difficult
13 Difficult
13 Difficult
14 easy
14 easy
14 easy
14 Moderate
14 Moderate
14 Moderate
14 Difficult
14 Difficult
14 Difficult
14 Difficult
15 easy
15 easy
15 easy
15 Moderate
15 Moderate
15 Moderate
15 Difficult
15 Difficult
15 Difficult
15 Difficult
16 easy
16 easy
16 easy
16 Moderate
16 Moderate
16 Moderate
16 Difficult
16 Difficult
16 Difficult
16 Difficult
17 easy
17 easy
17 easy
17 Moderate
17 Moderate
17 Moderate
17 Difficult
17 Difficult
17 Difficult
17 Difficult

18 easy

18 easy
18 easy
18 Moderate
18 Moderate
18 Moderate
18 Difficult
18 Difficult
18 Difficult
18 Difficult
19 easy
19 easy
19 easy
19 Moderate
19 Moderate
19 Moderate
19 Difficult
19 Difficult
19 Difficult
19 Difficult
20 easy
20 easy
20 easy
20 Moderate
20 Moderate
20 Moderate
20 Difficult
20 Difficult
20 Difficult
20 Difficult

Anda mungkin juga menyukai