UNIT – 1
2 - MARKS
Q.
No.
Questions
Marks
1
Define ADT. Give any two examples.
2
2
List out the areas in which data structures are applied
2
extensively
3
Define data structure with example.
2
4
Distinguish between linear and nonlinear data structures
2
5
2
6
State the purpose of the data structure which is required to check
an expression contains balanced parenthesis.
Illustrate an application in which implicit data structure are used.
7
Why abstract data types are to be used?
2
8
Why dynamic memory allocation data structures to be used?
2
2
Comment.
9
What is data processing cycle?
2
10
Differentiate linear and non-linear data structures with example.
2
11
What are linear data structures? List the operations performed.
2
12
State the classification of Linear Data Structure.
2
13
Draw the node diagram for single linked list and double linked list. 2
14
State the benefits of recursive procedure over iterative procedure. 2
15
State the classification and purpose of Non-Linear Data Structure. 2
Draw the node diagram for circular linked list and double linked
16
List.
17
Differentiate between Primitive Data types and Abstract Data
2
2
Types.
18
How Dynamic Data Structure is best when compared to Static Data
2
Structure? Explain with an example?
19
List the four major operations in the linear data structures.
20
Write down the abstract data types of Stack ADT.
2
1
Highlight the features of Non-Primitive data structures.
5
2
Write down the features of Linear Data Structures.
5
3
Classify the categories of data types in detail and Explain.
5
Persistent data structures are used in real time scenarios.
5
2
Can you suggest few applications and explain the way how
4
persistent data structures are used.
Briefly discuss the features of using persistent data structures in any 5real
5
time applications.
6
List the four different types of Persistent Data Structure.
5
Why Succinct Data Structure is used. Explain the functionality of5the
7
Succinct Data Structure.
Why Linked Data Structure is used. Explain important
8
5
features of Linked Data Structures.
Suggest few applications of Implicit Data Structures and explain how
5
9
implicit data structures are used.
State the difference between Arrays and linked list
10
5
Data structures are an arrangement of data. Explain the
10
classification and purpose of data structure based on the data
1
arrangement with suitable applications.
Explain the classification of Data Structure in detail.
10
Discuss and high light the features of different types of data
structures.
10
Discuss the following:
a) Succinct data structures b) Implicit data structures
10
Expalin the following
A) Search data structures B) Persistent data structures
10
Explain Persistent Data Structures and Succinct Data Structures
with its classifications.
10
Discuss and high light the features of Static and Dynamic data
10
2
3
4
5
6
7
structures.
Explain Search and Compressed Data Structure with real time
8
application.
Explain classification of linear and non linear data structure with
9
10
example.
Define a) Data b) Data Object c) ADT d) primitive and non
10
10
10
primitive data structure
What are the operations performed in list?
2
Why circular queue is better than standard linear queue.
2
Binary search cannot be performed on a linked list. Examine.
2
What are Stack operations? Give example
2
Name some of the stack applications.
2
1
2
3
4
5
What is a queue? List its advantages.
2
Compare Array and linked list.
2
What are the postfix and prefix forms of the expression:
2
6
7
8
A + B* (C – D) / (P – R)
What is circular linked list?
2
List out the advantage of circular linked list.
2
Interpret the advantages and disadvantages of linked lists over
arrays..
2
Differentiate arrays and linked lists.
2
Give an example for linked list application.
2
Examine a doubly linked list with neat diagram.
2
Illustrate the basic operations carried out in a linked list.
2
Show the ways in which list ADT can be implemented.
2
Compare calloc() and realloc() function and mention its
application in linked list.
2
Compare singly linked list with circular linked list.
2
What are the applications of priority queue?
2
Circular queue is better than standard linear queue, Why?
2
1 university announced the selected candidates register number
The
2 placement training. The student XXX, reg. no. 20142010
for
3
wishes to check whether his name is listed or not. The list is not
4
sorted
in any order. Identify the searching technique that can be
5
applied and explain the searching steps with the suitable
5
9
10
11
12
13
14
15
16
17
18
19
20
1
procedure. List includes 20142015, 20142033, 20142011,
20142017, 20142010, 20142056, 20142003 .
2
Convert the given infix expression (A + B) * (C - D) into postfix
and prefix expression
5
3
Inserting the following element 150, 250, 350, 450, 550 into the
5
linked list and delete the elements 150 and 250 from the single
linked list . Show the node diagram for linked list structure
before, and after insertion operations.
4
Mr. XYZ booked ticket in Pandian Express. He reached station
5
and was looking for his PNR number in the chart. Call out binary
search procedure to search the PNR number 4056786. The ticket
numbers are 4056779, 4056780, 4056781, 4056782, 4056783,
4056784, 4056785, 4056786, 4056787, 4056788, 4056789.
5
6
Customers are standing in a line before a Banker Casher Count to
perform bank transaction. What data structure will be suitable to
perform customer transaction. Give a suitable data structure
diagram to serve the customer without bias.
Define an array. What are the operations to be performed in an
5
5
array. Explain how to delete an element in the end of an array with
a suitable array diagram and pseudo code.
7
Write a C program, to employ linear search and return the index
5
position of element 20.
8
Write an algorithm that checks if expression is correctly
5
parenthesized using stack illustrate with example.
9
Analyze and write a routine to check whether the queue is full or
5
empty.
10
Write a C program for the given array to insert element after 8,
delete an element 12 and update element 20 in the place of 18.
5
7
8
12
15
16
18
5
1
Write a C program to implement any one of the stack application
10
2
Write a C program for implementation of single linked list for
insertion and deletion operation using pointers.
10
3
What is a linked list? Describe the suitable routine segments for
any two operations.
With a suitable stack diagram and pseudo code explain the
10
4
10
operations of push and pop in linear stack.
5
Consider an array A[1: n] Given a position, write an algorithm to
insert an element in the Array. If the position is empty, the
element is inserted easily. If the position is already occupied the
element should be inserted with the minimum number of
shifts.(Note: The elements can shift to the left or to the right to
make the minimum number of moves).
A circular queue has a size of 5 and has 3 elements 10,20 and 40
where F=2 and R=4.After inserting 50 and 60,what is the value of
F and R.Trying to insert 30 at this stage what happens? Delete 2
elements from the queue and insert 70, 80 & 90.Assess the
sequence of steps with necessary diagrams with the value of F &
R.
Describe about stack ADT using array in detail.
10
8
Discuss and write a C program to implement queue functions
using arrays.
10
9
Illustrate the application of stack with an example.
a) Trace the algorithm to convert the infix expression
“3-(4/2) +(1*5) + 6” to a postfix expression using stack.
b)Show the simulation using stack for the following expression
to convert infix to postfix :p*q+ (r-s/t).
In the railway station, tickets are provided in a counter. Name a
suitable data structure for this. Explain the various operations of
queue data structures. Write a C program to insert and delete
operation queue using array implementation.
10
6
7
10
10
10
10
A Binary Search Tree is given with 9 nodes. How a node 15 can
2
be inserted to the given Binary Search Tree.
1
A strictly binary tree contains 10 leaves which don’t have
2
2
branches. Find the total number of nodes in the tree?
Differentiate B-Tree and Binary Search Tree with a tree diagram.
2
How is AVL tree better than a binary search tree.
2
State the rotations of splay tree.
2
State the properties of red-black tree.
2
What is a balance factor in AVL tree. Calculate balance factor for
2
3
4
5
6
7
an AVL tree with example.
State the purpose of using chaining techniques to handle collision.
2
Define Tree.
2
Give some applications of Trees.
2
Define node, degree, siblings, depth/height and level.
2
State the properties of a Binary Tree.
2
What are the drawbacks of AVL trees?
2
8
9
10
11
12
13
State the merits of linear representation of binary trees.
2
Write some of the tree applications.
2
What are the properties of Red-Black Tree?
2
What is the special property of red-black trees and what root
2
14
15
16
17
should always be?
How many distinct binary search trees can be created out of
18
2
4 distinct keys?
What is self balanced binary tree? Give example.
2
Define Find Max ( ) in a Binary Search Tree.
2
A Binary tree with 7 nodes are shown below. User wants to visit
5
19
20
1
the node . Write a suitable pseudocode explain how to traverse the
binary tree in the following form – inorder, preorder and
postorder.
6
5
2
Write an algorithm for inserting and deleting a node in a binary
search tree.
3
Construct B Tree of order m=5 for the following keys
1,12,8,2,25,5,14,28,17,7,52,16,48,68,3,26,29,53,55,45.
5
4
Analyze the operations of B-tree using 2-3 tree with example.
5
Show the result of inserting 3,1,4,6,9,2,5,7 in to an initially
empty binary search tree and binary tree.
5
5
Discuss in detail the various methods in which a binary tree can
be represented. Discuss the advantage and disadvantage of each
method.
5
7
Insert the following elements 2,1,4,5,9,3,6,7 into an initially
empty AVL Tree.
Insert the following elements step by step in sequence into an
empty AVL tree 44,30,76,16,39,37.
5
9
Discuss in detail the various methods in which a binary tree can
be represented. Discuss the advantage and disadvantage of each
method.
5
10
Discuss how to insert an element in a AVL tree and explain with
algorithm.
5
List and brief the types of rotations available in Splay tree with
10
8
1
5
example.
Perform rotation for the given tree (i)Zig Rotation (Splay 3) (ii)
Zag Rotation (Splay 6) (ii) Zig-Zig (Splay 2) (iii) Zag- Zig (Splay
4)
10
Evaluate the following for the given tree
10
2
(a) ROOT
(b) DEGREE
(c) LEVEL
(d) DEPTH
3
(e) HEIGHT
10
Write a C program for Binary Search Tree to perform insertion
operation and display nodes using inorder tree traversal for the
given tree diagram.
4
Write an algorithm for preorder, inorder and postorder traversal
of a binary tree.
10
6
Explain the following operations on a binary search tree with
suitable algorithms.
i) Find a node
ii)Find the minimum and maximum elements of binary search tree.
10
7
Analyze the operations of B-tree using 2-3 tree with example.
10
8
1
Define AVL trees. Describe the different rotations defined for
AVL tree. Insert the following elements step by step in sequence
into an empty AVL tree 15, 18, 20, 21, 28, 23, 30, 26.
Define AVL trees. Describe the different rotations defined for
AVL tree. Insert the following elements step by step in sequence
into an empty AVL tree 15, 18, 20, 21, 28, 23, 30, 26.
Build a max heap for the following numbers - 20, 35, 23, 22, 4,
45, 21, 5, 42 and 19. At each stage of heap tree construction,
ensure heap properties are satisfied. Sort the numbers using heap
sort techniques.
Define hashing. Give an example.
2
2
What is meant by open addressing?
2
3
What is divide and conquer strategy?
2
4
Name some of the sorting methods.
2
5
9
10
10
10
8
5
What is meant by internal and external sorting? Give any
two
examples for each type.
2
6
Give the time complexities of insertion sort.
2
2
2
2
2
2
12
Give the advantage of Merge sort.
Distinguish quick sort and insertion sort.
Define Sorting.
What is collision in hashing and how to resolve the collision.
Write down the methods to handle collision during hash table
construction.
Differentiate between merge sort and quick sort?
13
Define radix sort.
14
What is Rehashing?
15
What are the steps in Quick sort?
16
17
Give the general idea of hashing and what is the use of
hashing function?
What is open addressing?
18
Define separate chaining.
19
What are the three cases that arise during the left to right
scan in quick sort?
7
8
9
10
11
20
2
2
2
2
2
2
2
2
What is insertion sort? How many passes are required for the
elements to be sorted?
1
A deck of shuffled 10 numbers such as 170, 45, 75, 90, 802,
2
5
24, 2, 66, 93, 895 are given to the customer. Customers are
instructed to sort the numbers by radix sort and show the
process at each iterations.
2
3
Construct a Merge sort for the following numbers 20, 45, 15,
18, 25, 40, 10 and get the sorted numbers in sequence
Apply Radix Sort for the following numbers
308, 275, 431, 23, 95, 87, 22, 110.
4
Given input {4371,1323,6173,4199,4344,9679,1989}
5
5
5
and a hash function h(x)=x mod 10. Show the result
using Closed hash table using linear probing.
5
6
7
8
Write an algorithm to sort ‘n’ numbers using quick sort.
Show how the following numbers are sorted using quick
sort : 42, 28, 90,2, 56. 39, 12, 87
Examine the algorithm for Insertion sort and sort the
following array: 77, 33, 44, 11, 88, 22, 66, 55
Sort the following numbers with Radix Sort Techniques
38,27,43,3,9,8,2,10.
Arrange the given elements in the ascending order using
insertion
sort
and
write
appropriate
pseudo
5
5
5
5
code.
A=77,33,44,11,88,22,66,55.
9
Insert the following keys 132,4,5,22,62,25,8,98,9,10 in the hash
7
table of size 10 using separate chaining.
10
1
Select the best sorting method out of the following 5
insertion sort, quick sort and merge sort and give
justification.
10
Given input { 4371,1323,6173,4199,4344,9679,1989} and a hash
function h(X) = X (mod 10).Show the resulting.
1. Separate chaining table.
2. Open addressing hash table using linear probing.
2
Insert the following keys 132,4,5,22,62,25,8,98,9,10 in the hash
10
table of size 10 using separate chaining and Open addressing
method.
3
Explain quick sort algorithm with an example.
10
4
What is collision? Explain any one collision resolving technique
10
in detail?
5
Which hashing technique is best and illustrate with an example?
10
Analyze why do we need hash table?
6
Examine the algorithm for Insertion sort and sort the following
10
array: 77, 33, 44, 11, 88, 22, 66, 55.
7
10
1
List the different types of hashing techniques? Explain them in
detail with an example.
Show the result of inserting 15,17,6,19,11,10,13,20,8,14,12 one at
a time, into an initially empty binary min heap. Also show the
result of performing three delete operations in Min heap.
Explain the operation and implementation of merge sort with
example.
Sort the sequence 96, 31, 27,42,76,61,10,4 using insertion sort
and radix sort and prepare the required steps.
Define adjacency matrix of a graph.
2
What is a directed graph?
2
3
What is meant by strongly connected in a graph?
2
4
What is the in degree and out degree of node 1 and 4 in the following2
8
9
10
8
8
10
2
graph?
5
What is a graph and mention its types?
2
6
Differentiate BFS and DFS.
2
7
What is meant by bi-connected graph?
2
8
Give the purpose of Dijikstra’s algorithm.
2
9
Differentiate cyclic and acyclic graph.
2
10
Classify strongly connected and weakly connected graph.
2
11
Define minimum spanning tree. Give an example.
2
12
State the principle of Topological sorting.
2
13
Give two applications of graphs.
2
1
Define Acyclic Graph.
How to represent the graph in Array and List.
Define Graph and list any three application area of graph.
Write the pseudo code for depth first traversal of graph.
2
2
2
5
2
What is the minimum spanning tree for the given graph?
5
3
Perform the topological sorting for the given DAG.
5
14
15
16
A
C
B
D
4
Find out the in-degree and out-degree of each node in the given Graph. 5
5
Explain procedure for Depth first search algorithm.
5
6
Analyze the different ways of representing a graph.
5
7
Create an undirected graph and its adjacency matrix for the
following specification of a graph G.
V(G)=1,2,3,4.
E(G) ={ (1,2),(1,3),(3,3),3,4),(4,1)}.
5
8
Consider the graph given below and show its adjacency list in the
memory.
5
9
Perform the topological sorting for the given DAG.
5
List 10 basic terminologies of Graph.
Find the Minimum Spanning tree by using Kruskal’s algorithm
and draw the matrix.
5
10
10
1
2
V1
V2
4
3
1
2
V3
V4
8
10
7
V5
4
6
5
V6
1
V7
2
Find minimum spanning tree for the graph using Kruskal's Algorithm. 10
3
Describe in detail about the following representations of a graph.
i) Adjacency Matrix
ii) Adjacency List
10
4
Examine topological sorting of a graph G with suitable example.
10
5
Differentiate depth-first search and breadth-first search traversal
of
a graph with suitable examples.
10
6
Explain with algorithm, How DFS be performed on a undirected
Graph with example.
10
7
Discuss an algorithm for Breadth first Search on a graph with example.10
8
Describe any one of the shortest path algorithms with suitable
example.
Discuss the prim’s algorithm for minimum spanning tree. Give
an
example.
10
10
Consider the graph G given below. The adjacency list of G is also
given. Evaluate the steps needed to print all the nodes that can be
reached from the node H (including H itself).One alternative is to
use a depth-first search of G starting at node H.
10
1
Define Algorithm. State any four characteristics to be satisfied.
2
2
Derive the time complexity for the following algorithm.
(2 Marks)
Algorithm MatSub(A,B,C)
{
for i=1 to n do
{
for j=1 to n do
{
C[i][j]=A[i][j]-B[i][j];
}
}
}
2
9
10
3
Derive the time complexity for the following algorithm.
2
(2 Marks)
Algorithm Sum(A,n)
{
s=0;
for i=1 to n do
{
s=s+A[i];
}
return s;
}
4
How is Polynomial Time verification performed?
2
5
What is NP Completeness?
2
6
What is reducibility?
2
7
Write down the algorithm design tools.
2
8
Is clique problem NP-Complete? Justify.
2
9
Is Hamiltonian circuit NP-Complete? Justify.
2
10
What is polynomial-time approximation scheme?
2
11
Derive the time complexity for the following algorithm.
(2 Marks)
Algorithm MatAdd(A,B,C)
{
for i=1 to n do
{
for j=1 to n do
{
C[i][j]=A[i][j]+B[i][j];
}
}
2
}
12
Is vertex cover problem NP-Complete? Justify.
2
13
What is a P-type problem?
2
14
What is NP-Type problem?
2
15
Define NP-Complete Problem.
2
16
What is a tractable problem?
2
17
What is an intractable problem?
2
18
What is an undecidable problem?
2
19
State Cook's Theorem.
2
20
What is a satisfiability problem?
2
1
Explain NP-Complete with example.
5
2
Explain vertex cover problem.
5
3
Explain satisfiability problem
5
4
Explain with few examples for polynomial-time algorithm.
5
5
Explain polynomial time reduction?
5
6
Explain polynomial-time approximation scheme?
5
7
5
8
What is the difference between NP-complete and NP-Hard
problems.
Explain Set Cover Problem with example.
1
Discuss about P-type, NP-type and NP-Complete problems with
10
examples.
5
2
Prove that vertex cover is a NP-Complete problem.
10
3
State Cook's Theorem. Prove that satisfiability problem is NP-
10
Complete.
4
What is an approximation algorithm? Explain with an example
10
and state its time complexity.
5
How can we find its approximate solution in polynomial time?
10
6
What is set cover problem and how it could be solved?
10
7
Define vertex cover problem and give approximate algorithm to
10
solve it?
Q.
No
.
1
Questions
Marks
Define ADT. Give any two examples.
2
2
List out the areas in which data structures are applied extensively,
2
3
Define data structure with example.
2
4
Distinguish between linear and nonlinear data structures.
2
5
2
6
State the purpose of the data structure which is required to check an
expression contains balanced parenthesis.
Illustrate an application in which implicit data structure are used.
7
Why abstract data types are to be used?
2
8
Why dynamic memory allocation data structures to be used.
2
2
Comment.
9
What is data processing cycle?
2
10
Differentiate linear and non-linear data structures with example.
2
11
What are linear data structures? List the operations performed.
2
12
State the classification of Linear Data Structure.
2
13
Draw the node diagram for single linked list and double linked list.
2
14
State the benefits of recursive procedure over iterative procedure.
2
15
State the classification and purpose of Non-Linear Data Structure.
2
16
Draw the node diagram for circular linked list and double linked list.
2
17
Differentiate between Primitive Data types and Abstract Data Types.
18
How Dynamic Data Structure is best when compared to Static Data Structure
2
explain with an example?
19
List the four major operations in the linear data structures.
20
Write down the abstract data types of Stack ADT.
1
Highlight the features of Non-Primitive data structures.
5
2
Write down the features of Linear Data Structures.
5
3
Classify the categories of data types in detail and Explain.
5
2
2
2
Persistent data structures are used in real time scenarios. Can you suggest few 5
4
applications and explain the way how persistent data structures are used.
Briefly discuss the features of using persistent data structures in any real time 5
5
applications.
6
List the four different types of Persistent Data Structure.
5
Why Succinct Data Structure is used. Explain the functionality of the
5
7
8
Succinct Data Structure
Why Linked Data Structure is used. Explain important features of
5
Linked Data Structures.
Suggest few applications of Implicit Data Structures and explain how implicit
5
9
data structures are used.
State the difference between Arrays and linked list.
5
10
Data structures are arrangement of data. Explain the classification and
10
purpose of data structure based on the data arrangement with suitable
1
applications.
Explain the classification of Data Structure in detail.
10
Discuss and high light the features of different types of data
structures.
10
Discuss the following:
a) Succinct data structures.
b) Implicit data structures.
10
Explain the following
b) Search data structures d) Persistent data structures.
10
Explain Persistent Data Structures and Succinct Data Structures with its
classifications.
10
Discuss and high light the features of Static and Dynamic data structures.
10
Explain Search and Compressed Data Structure with real time application.
10
Explain classification of linear and non linear data structure with example.
10
Define a) Data b) Data Object c) ADT d) primitive and non primitive data
10
2
3
4
5
6
7
8
9
10
structure.
What are the operations performed in list?
2
Circular queue is better than standard linear queue. Explain.
2
1
2
Binary search cannot be performed on a linked list. Examine.
2
What are Stack operations? Give example.
2
Name some of the stack applications.
2
What is a queue? List its advantages.
2
Compare Array and linked list.
2
What are the postfix and prefix forms of the expression:
2
3
4
5
6
7
8
A + B* (C – D) / (P – R)
What is circular linked list?
2
List out the advantage of circular linked list.
2
Interpret the advantages and disadvantages of linked lists over arrays.
2
Differentiate arrays and linked lists.
2
Give an example for linked list application.
2
Examine a doubly linked list with neat diagram.
2
Illustrate the basic operations carried out in a linked list.
2
Show the ways in which list ADT can be implemented.
2
Compare calloc() and realloc() function and mention its application in
linked list.
2
Compare singly linked list with circular linked list.
2
What are the applications of priority queue?
2
9
10
11
12
13
14
15
16
17
18
19
Circular queue is better than standard linear queue, Why?
2
1 university announced the selected candidates register number for
The
2
placement
training. The student XXX, reg. no. 20142010 wishes to
3
check
whether his name is listed or not. The list is not sorted in any
4
order.
Identify the searching technique that can be applied and explain
5
the searching steps with the suitable procedure. List includes
20142015, 20142033, 20142011, 20142017, 20142010, 20142056,
20142003.
Convert the given infix expression (A + B) * (C - D) into postfix and
prefix expression.
5
Inserting the following element 150, 250, 350, 450, 550 into the linked
5
20
1
2
3
5
list and delete the elements 150 and 250 from the single linked list.
Show the node diagram for linked list structure before, and after
insertion operations.
4
Mr. XYZ booked ticket in Pandian Express. He reached station and
5
was looking for his PNR number in the chart. Call out binary search
procedure to search the PNR number 4056786. The ticket numbers are
4056779, 4056780, 4056781, 4056782, 4056783, 4056784, 4056785,
4056786, 4056787, 4056788, 4056789.
5
6
Customers are standing in a line before a Banker Casher Count to
perform bank transaction. What data structure will be suitable to
perform customer transaction. Give a suitable data structure diagram to
serve the customer without bias.
Define an array. What are the operations to be performed in an array?
5
5
Explain how to delete an element in the end of an array with a suitable
array diagram and pseudo code.
7
Write a C program, to employ linear search and return the index
5
position of element 20.
8
Write an algorithm that checks if expression is correctly parenthesized
using stack illustrate with example.
5
9
Analyze and write a routine to check whether the queue is full or
5
empty.
10
Write a C program for the given array to insert element after 8, delete
5
an element 12 and update element 20 in the place of 18.
5
7
8
12
15
16
18
1
Write a C program to implement any one of the stack application.
10
2
Write a C program for implementation of single linked list for
insertion and deletion operation using pointers.
10
3
What is a linked list? Describe the suitable routine segments for any
two operations.
With a suitable stack diagram and pseudo code explain the
10
4
10
operations of push and pop in linear stack.
5
Consider an array A[1: n] Given a position, write an algorithm to insert
an element in the Array. If the position is empty, the element is inserted
easily. If the position is already occupied the element should be
inserted with the minimum number of shifts.(Note: The elements can
shift to the left or to the right to make the minimum number of moves).
A circular queue has a size of 5 and has 3 elements 10,20 and 40 where
F=2 and R=4.After inserting 50 and 60,what is the value of F and R.
Trying to insert 30 at this stage what happens? Delete 2 elements from
the queue and insert 70, 80 & 90. Assess the sequence of steps with
necessary diagrams with the value of F & R.
Describe about stack ADT using array in detail.
10
8
Discuss and write a C program to implement queue functions using
arrays.
10
9
Illustrate the application of stack with an example.
a) Trace the algorithm to convert the infix expression “3-(4/2) + (1*5)
+ 6” to a postfix expression using stack.
b) Show the simulation using stack for the following expression to
convert infix to postfix : p*q+ (r-s/t).
In the railway station, tickets are provided in a counter. Name a suitable
data structure for this. Explain the various operations of queue data
structures. Write a C program to insert and delete operation queue using
array implementation.
10
6
7
10
10
10
10
A Binary Search Tree is given with 9 nodes. How a node 15 can be
1
inserted to the given Binary Search Tree.
A strictly binary tree contains 10 leaves which don’t have
2
2
2
branches. Find the total number of nodes in the tree?
Differentiate B-Tree and Binary Search Tree with a tree diagram.
2
How is AVL tree better than a binary search tree?
2
State the rotations of splay tree.
2
State the properties of red-black tree.
2
What is a balance factor in AVL tree? Calculate balance factor for an
2
3
4
5
6
7
AVL tree with example.
State the purpose of using chaining techniques to handle collision.
2
Define Tree.
2
Give some applications of Trees.
2
Define node, degree, siblings, depth/height, and level.
2
State the properties of a Binary Tree.
2
What are the drawbacks of AVL trees?
2
State the merits of linear representation of binary trees.
2
Write some of the tree applications.
2
What are the properties of Red-Black Tree?
2
What is the special property of red-black trees and what root should
2
8
9
10
11
12
13
14
15
16
17
always be?
How many distinct binary search trees can be created out of
18
2
4 distinct keys?
What is self balanced binary tree? Give example.
2
Define Find Max ( ) in a Binary Search Tree.
2
A Binary tree with 7 nodes are shown below. User wants to visit the
5
19
20
1
node . Write a suitable pseudocode explain how to traverse the binary
tree in the following form – inorder, preorder and postorder.
Write an algorithm for inserting and deleting a node in a binary
search tree.
5
2
3
Construct B Tree of order m=5 for the following keys
1,12,8,2,25,5,14,28,17,7,52,16,48,68,3,26,29,53,55,45.
5
4
Analyze the operations of B-tree using 2-3 tree with example.
5
Show the result of inserting 3,1,4,6,9,2,5,7 in to an initially empty
binary search tree and binary tree.
5
5
6
Discuss in detail the various methods in which a binary tree can be
represented. Discuss the advantage and disadvantage of each method.
5
7
Insert the following elements 2,1,4,5,9,3,6,7 into an initially empty
AVL Tree.
Insert the following elements step by step in sequence into an empty
AVL tree 44,30,76,16,39,37.
5
9
Discuss in detail the various methods in which a binary tree can be
represented. Discuss the advantage and disadvantage of each method.
5
10
Discuss how to insert an element in a AVL tree and explain with
algorithm.
List and brief the types of rotations available in Splay tree with
5
8
1
5
10
example.
2
Perform rotation for the given tree (i)Zig Rotation (Splay 3) (ii) Zag
Rotation (Splay 6) (ii) Zig-Zig (Splay 2) (iii) Zag- Zig (Splay 4).
10
Evaluate the following for the given tree.
10
(a) ROOT
(b) DEGREE
(c) LEVEL
(d) DEPTH
3
(e) HEIGHT
Write a C program for Binary Search Tree to perform insertion
10
operation and display nodes using inorder tree traversal for the given
tree diagram.
4
5
6
Write an algorithm for preorder, inorder and postorder traversal of a
binary tree.
10
Explain the following operations on a binary search tree with suitable
algorithms.
i) Find a node
10
ii)Find the minimum and maximum elements of binary search tree.
7
Analyze the operations of B-tree using 2-3 tree with example.
8
1
Define AVL trees. Describe the different rotations defined for AVL
tree. Insert the following elements step by step in sequence into an
empty AVL tree 15, 18, 20, 21, 28, 23, 30, 26.
Define AVL trees. Describe the different rotations defined for AVL
tree. Insert the following elements step by step in sequence into an
empty AVL tree 15, 18, 20, 21, 28, 23, 30, 26.
Build a max heap for the following numbers - 20, 35, 23, 22, 4, 45, 21,
5, 42 and 19. At each stage of heap tree construction, ensure heap
properties are satisfied. Sort the numbers using heap sort techniques.
Define hashing. Give example.
2
2
What is meant by open addressing?
2
3
What is divide and conquer strategy?
2
4
Name some of the sorting methods.
2
5
What is meant by internal and external sorting? Give any two
examples for each type.
Give the time complexities of insertion sort.
2
Give the advantage of Merge sort.
Distinguish quick sort and insertion sort.
Define Sorting.
2
2
2
9
10
6
7
8
9
1
0
11
12
What is collision in hashing and how to resolve the collision.
Write down the methods to handle collision during hash table
construction.
Differentiate between merge sort and quick sort?
13
Define radix sort.
14
What is Rehashing?
15
What are the steps in Quick sort.
10
2
2
2
2
2
2
2
10
10
8
16
17
Give the general idea of hashing and what is the use of hashing
function?
What is open addressing?
18
Define separate chaining
19
What are the three cases that arise during the left to right scan in
quick sort?
2
What is insertion sort? How many passes are required for the
elements to be sorted?
2
A deck of shuffled 10 numbers such as 170, 45, 75, 90, 802, 24, 2,
5
20
1
2
2
2
66, 93, 895 are given to the customer. Customers are instructed to
sort the numbers by radix sort and show the process at each
iteration.
2
3
Construct a Merge sort for the following numbers 20, 45, 15, 18,
25, 40, 10 and get the sorted numbers in sequence.
Apply Radix Sort for the following numbers 308, 275, 431, 23,
5
95, 87, 22, 110.
4
5
6
7
8
Given input {4371,1323,6173,4199,4344,9679,1989} and a
hash function h(x)=x mod 10. Show the result using Closed
hash table using linear probing.
5
Write an algorithm to sort ‘n’ numbers using quick sort.
Show how the following numbers are sorted using quick
sort : 42, 28, 90,2, 56. 39, 12, 87.
Examine the algorithm for Insertion sort and sort the following
array: 77, 33, 44, 11, 88, 22, 66, 55.
Sort the following numbers with Radix Sort Techniques
38,27,43,3,9,8,2,10.
Arrange the given elements in the ascending order using insertion
sort
and
5
write
appropriate
pseudo
5
5
5
5
code.
A=77,33,44,11,88,22,66,55.
9
Insert the following keys 132,4,5,22,62,25,8,98,9,10 in the hash
7
table of size 10 using separate chaining.
10
Select the best sorting method out of the following - insertion
sort, quick sort and merge sort and give justification.
5
1
Given input { 4371,1323,6173,4199,4344,9679,1989} and a hash
10
function h(X) = X (mod 10). Show the resulting
1. Separate chaining table
2. Open addressing hash table using linear probing
2
Insert the following keys 132,4,5,22,62,25,8,98,9,10 in the hash
10
table of size 10 using separate chaining and Open addressing
method.
3
Explain quick sort algorithm with an example.
10
4
What is collision? Explain any one collision resolving technique in
10
detail?
5
Which hashing technique is best and illustrate with an example?
10
Analyze why do we need hash table?
6
Examine the algorithm for Insertion sort and sort the following
array: 77, 33, 44, 11, 88, 22, 66, 55.
10
7
10
1
List the different types of hashing techniques? Explain them in
detail with an example.
Show the result of inserting 15,17,6,19,11,10,13,20,8,14,12 one at a
time, into an initially empty binary min heap. Also show the result
of Min heap obtained after performing three delete.
Explain the operation and implementation of merge sort with
example.
Sort the sequence 96, 31, 27,42,76,61,10,4 using insertion sort and
radix sort and prepare the required steps.
Define adjacency matrix of a graph.
2
What is a directed graph?
2
3
What is meant by strongly connected in a graph?
2
4
What is the in degree and out degree of node 1 and 4 in the following2
8
9
10
graph?
8
8
10
2
5
What is a graph and mention its types?
2
6
Differentiate BFS and DFS.
2
7
What is meant by bi-connected graph?
2
8
Give the purpose of Dijikstra’s algorithm.
2
9
Differentiate cyclic and acyclic graph.
2
10
Classify strongly connected and weakly connected graph.
2
11
Define minimum spanning tree. Give an example.
2
12
State the principle of Topological sorting.
2
13
Give two applications of graphs.
2
1
Define Acyclic Graph.
How to represent the graph in Array and List.
Define Graph and list any three application area of graph.
Write the pseudo code for depth first traversal of graph.
2
2
2
5
2
What is the minimum spanning tree for the given graph?
5
3
Perform the topological sorting for the given DAG.
5
14
15
16
A
B
C
4
Find out the in-degree and out-degree of each node in the given graph.
5
5
Explain procedure for Depth first search algorithm.
5
6
Analyze the different ways of representing a graph.
5
7
Create an undirected graph and its adjacency matrix for the
following specification of a graph G.
V(G)=1,2,3,4.
E(G) ={ (1,2),(1,3),(3,3),3,4),(4,1)}.
5
8
Consider the graph given below and show its adjacency list in the
memory.
5
9
10
1
Perform the topological sorting for the given DAG.
5
List 10 basic terminologies of Graph.
Find the Minimum Spanning tree by using Kruskal’s algorithm and
draw the matrix.
5
10
2
V1
4
V2
3
1
2
V3
V4
8
10
7
V5
4
6
5
V6
1
V7
2
Find minimum spanning tree for the graph using Kruskal's algorithm.
10
3
Describe in detail about the following representations of a graph.
i) Adjacency Matrix
ii) Adjacency List
10
4
Examine topological sorting of a graph G with suitable example.
10
5
Differentiate depth-first search and breadth-first search traversal of
a graph with suitable examples.
Explain with algorithm, How DFS be performed on a undirected
Graph with example.
10
6
10
7
Discuss an algorithm for Breadth first Search on a graph with example. 10
8
Describe any one of the shortest path algorithms with suitable
example.
Discuss the prim’s algorithm for minimum spanning tree. Give an
example.
Consider the graph G given below. The adjacency list of G is also
given. Evaluate the steps needed to print all the nodes that can be
reached from the node H (including H itself).One alternative is to
use a depth-first search of G starting at node H.
9
10
10
10
10
1
What is the basic idea of shell sort?
2
2
What is the other name for shell sort?
2
3
What is Selection Sort?
2
4
What is Bubble Sort?
2
5
How is Polynomial Time verification performed?
2
6
What is NP Completeness?
2
7
What is reducibility?
2
8
Write down the algorithm design tools.
2
9
Define Big-Omega Notation.
2
10
Define Big-Theta Notation.
2
11
Define Big-Omega Notation.
2
12
Derive the time complexity for the following algorithm.
(2 Marks)
Algorithm MatAdd(A,B,C)
{
for i=1 to n do
{
for j=1 to n do
{
C[i][j]=A[i][j]+B[i][j];
}
}
}
2
13
Write down the time complexity of Binary Search Algorithm.
2
14
What is the feature of bucket sort algorithm?
2
15
2
16
What is sorting? How is sorting essential for database
applications?
What is a P-type problem?
17
What is NP-Type problem?
2
18
Define NP-Complete Problem.
2
1
Explain the algorithm of selection sort.
5
2
Describe the concept of Bubble Sort with example.
5
3
Give the algorithm for Shell sort.
5
4
Explain with few examples for polynomial-time algorithm.
5
5
Explain polynomial time reduction?
5
6
Explain polynomial-time approximation scheme?
5
7
What is the difference between NP-complete and NP-Hard
problems.
What is the worst case scenario for bubble sort, and why?
5
What would happen if bubble sort didn't keep track of the number
of swaps made on each pass through the list?
Discuss about P-type, NP-type and NP-Complete problems with
5
8
9
1
2
5
10
examples.
2
Perform Selection Sort for the following values 8 9 3 5 6 4 2 1 7 0.
10
3
Write algorithm for Selection Sort.
10
4
Write algorithm for Shell Sort.
10
5
Perform Shell Short for the Following values 35, 14, 33, 19, 42, 27
10
, 10 and 44.
6
Trace the operation of bubble sort on the following list:
10
4, 7, 2, 5, 6.
7
What is the worst case scenario for bubble sort, and why?
10
8
What simple modification could be made to the bubble sort
10
algorithm that would make it perform more efficient?
1. Justify why do we need data structures?
2
2.
2
List different types of data structures
3. List the operations performed in the Linear Data Structure.
2
4. Define Data Structure
2
5.
2
Illustrate the use of linked list with an example.
6. Give example for primitive data types and Abstract Data Types.
2
7. Specify the limitations of arrays?
2
8. Differentiate Data type & Data Structure
2
9. Differentiate Tree and Graph Non-Linear Data Structures
2
10. List the applications of data structure
2
Why abstract data types are used. Write down the structure for Array
ADT.
Differentiate between Primitive Data types and Non-Primitive Data
12. types.
2
11.
13.
14.
15.
16.
State the classification of Linear Data Structure
2
List the four different types of Persistent Data Structure
2
Write down the abstract data types of Stack ADT
2
Draw the node diagram for circular linked list
2
17. Differentiate Linear Queue and Linear Stack
18.
2
Draw the node diagram for single linked list and double linked list
2
2
19.
20.
Draw the node diagram for double linked list
2
State the classification of Non-Linear Data Structure
2
21. Write a C program to implement the Factorial
5
22. Distinguish between Static and dynamic data structures.
5
23. Explain the difference between Array & Pointers
5
How Dynamic Data Structure is best when compared to Static Data
24. Structure explain with an example?
5
Briefly discuss the features of using persistent data structures in any
25. real time applications.
5
26. Write a C program to implement the Fibonacci
5
27. Define primitive & non primitive Data Structure
5
28. Explain Persistent Data Structures with its classifications
5
Persistent data structures are used in real time scenarios. Can you
29.
suggest few applications and explain the way how persistent data
5
structures are used
30. Explain the four major operations in the linear data structures.
5
Data structures is an arrangement of data. Explain the classification
31. and purpose of data structure based on the data arrangement with a
suitable applications.
10
32. Discuss and high light the features of different types of data structures.
10
Explain the classification of Linear Data Structure with proper
examples
Discuss the following:
a) Succinct data structures c) Implicit data structures
34.
b) Search data structures
d) Persistent data structures
Compare the linear data structures and non-linear data structures with
35. example.
10
Explain the classification of Data Structures based on application
10
33.
36.
10
10
37. Explain Persistent Data Structures with its classifications
10
38. Write a C program to perform matrix multiplication
10
To find the factorial of a number, which method is so prompt to
39. execute. Why?
2
40. List the variables needed to access the stack?
2
41. List the variables needed to access queue
2
42. Define Recursion with example
2
43. Point out the advantages of circular linked list over singly linked list?
2
44. Which sorting algorithm is best if the list is already sorted? Justify
2
45. Mention the operations of stack ADT.
2
46. Name the data structures used to perform recursion
2
47. State the condition when a binary search is best applied?
2
48. What are the advantages in the array implementation of list?
2
Translate infix expression into its equivalent post fix expression:
49.
2
(A-B)*(D/E)
50. Point out the steps required to evaluate the postfix expression.
2
51. Differentiate Queue ADT and Stack ADT
2
52. Define Doubly Linked List with example
2
53. What are the advantages and disadvantages of linked list?
2
54. List the applications of Linked List
2
Mention the condition checked before inserting a new element in the
55. stack while doing array implementation
2
56. Point out the advantages of binary search over linear search
2
57. Mention the operations of queue ADT.
2
Mention the condition checked before deleting a new element in the
58. stack while doing array implementation
2
Inserting the following element 100, 200, 300, 400, 500 into the linked
59. queue and delete the elements 100 and 200 from the linked queue.
Show the linked structure before and after queue operations.
5
60. State the difference between arrays and linked list.
5
61. Point out the rules for in-fix, pre-fix and post-fix traversal
5
Write a C program to find the Factorial of given number using
62. recursion
63. Distinguish between linear and non-linear data structures.
Explain how to delete an element in the end of an array with a suitable
64. array diagram and pseudo code.
Give the linked list representation for the following items.
BAD, CAD, DAD, MAD, PAD.
Write a C program to find the Fibonacci of given number using
66. recursion
65.
5
5
5
5
5
Insert the following elements 150, 250, 350, 450, 550 into the double
linked list and delete the elements 150 and 250 from the double linked
67. list. Show the linked structure using a node diagram before and after
delete operations
5
Customers are standing in a line before a Banker Casher Count to
perform bank transaction. What data structure will be suitable to
68. perform customer transaction. Give a suitable data structure diagram
to serve the customer without bias.
5
Explain the various operations of stack data structures. Write a C
program to push and pop operation stack using array implementation.
In the railway station, tickets are provided in a counter. Name a
suitable data structure for this. Explain the various operations of queue
70.
data structures. Write a C program to insert and delete operation queue
using array implementation.
What are the postfix and prefix forms of the following expression?
10
71.
10
69.
 A+B*(C-D)/(P-R)
 ((A + B) * C – (D – E) ^ (F + G))
To search an item in one hundred items, which type of data structure,
72. can be used. Write a program for it.
Write a program to search an element in array of size 1000, such that
73. the searching can be done within half of the actual size.
10
10
10
Explain any 3 operations in singly linked list with the structure
74. declaration
10
Explain how an element is inserted in the linked list at front, middle
75. and at the end?
10
Implement a C program to Perform the Linear Search operation 20,
30, 40, 10, 15, 25, 35, 45, 60, 70. Search for the element 45 in the list
Explain the various operations of queue data structures. Write a C
77. program to Enqueue and Dequeue operation stack using array
implementation.
Write the procedure to insert the following elements one by one in a
78. queue: 34, 67, 21, 12, 43.
10
Searching a node in a binary search tree is efficient than that of a
simple binary tree. Defend
A strictly binary tree contains 10 leaves which don’t have
80.
branches. Find the total number of nodes in the tree?
2
81. Define balance factor in AVL trees
2
82. How is AVL tree better than a binary search tree
2
83. How to find a Degree of a Tree?
2
76.
79.
10
10
2
A Binary Search Tree is given with 9 nodes. How a node 15 can be
84. inserted to the given Binary Search Tree.
2
State the properties of red-black tree
2
86. Name the applications of binary tree
2
87. Define non-linear data structure
2
88. How to find a depth of a Tree?
2
85.
89.
State the rotations of splay tree
2
90. Draw the expression tree for infix expression : a+(b*c)
2
91. How to find a height of a Tree?
2
92. Discuss the tasks performed while traversing a binary tree
2
93. Justify the need of hashing?
2
94. State the properties of a Binary Tree.
95.
State the purpose of using chaining techniques to handle collision
2
2
What is a balance factor in AVL tree? Calculate balance factor for an
96. AVL tree with example.
97.
98.
2
State skewed binary tree with an example.
2
Differentiate Binary Tree and Binary Search Tree with a tree diagram
2
In the given binary tree below, in which location the node 4 is stored
in an array? Draw the array representation for the below tree.
99.
5
Calculate the balance factor of each node for the given non-linear data
structure using AVL method
100.
5
Write an algorithm for inserting and deleting a node in a binary
101.search tree
5
Explain with diagram how many null nodes will a binary tree with 20
102.nodes have?
5
Answer the following:
(i) Identify the heap,
(ii) Check for structure property,
103.
5
(iii) Check for heap order property
104.Point out the merits & demerits of linear representation of binary trees.
5
105.Draw a Binary Tree for the expression A*B-(C+D)*(P/Q)
5
106.Explain briefly the need for Priority queue with example?
Determine the In-order, Pre-order and Post-order traversal of the given
107.
tree.
5
5
Differentiate single rotation and double rotation in AVL tree with
108.example
5
Consider the tree shown in figure
For each node in the tree
i. Name the parent node
109.
ii. List the children
iii. List the siblings
iv. Compute the depth of each node
v. Compute the height of each node
Define binary search tree. Explain the various operations with an
110.
example.
10
10
111.Construct a B-Tree of Order 3 by inserting numbers from 1 to 10.
10
112.Explain the different types of traversing with examples
10
113.Construct a 2-3-4 Tree by inserting the following sequence of numbers
Construct a Binary Search Tree by inserting the following sequence of
114.
numbers 45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48.
Construct a 2-3 Tree by inserting the following sequence of numbers
115.
5, 21, 8, 63, 69, 32, 7, 19, 25
Describe briefly the types of rotations available in Splay tree with
116.
example.
Build Max Heap for the following elements: 20, 35, 23, 22, 4, 45, 21,
117.
5, 42 and 19.
Construct AVL tree for the following elements. Mention the
118.
rotations in each step of insertion. 1,2,3,4,5,6,7,8,9,10.
Write down the methods to handle collision during hash table
119.construction.
10
120.Classify the different sorting methods.
2
121.What are the steps in Quick sort
2
122.What is meant by open addressing?
2
Identify whether the given heap is Max heap or Min heap. Justify
123.
2
10
10
10
10
10
2
124.Give the advantage of Merge sort
2
125.Mention Hashing techniques
2
126.Point out the advantages of using quick sort.
2
Give the general idea of hashing and what is the use of hashing
127.
function?
128.What is collision in hashing and how to resolve the collision
2
129.Distinguish merge sort and insertion sort.
2
Interpret the results for the given input {86, 45, 23, 72, 99, 89}
130.
into a hash function h(X)=X(mod10) using Separate chaining table
5
2
131.Explain different hashing technique.
5
132.Illustrate an algorithm to sort the elements using quick sort
5
133.Explain the procedure of merge sort
5
134.Develop an algorithm for merge sort
5
135.Explain the mode of operation in Dijkstra's algorithm
5
136.List out the different types of hashing functions.
5
137.Sort 20,35,40,100,3,10,15 using insertion sort
5
138.Explain the procedure for insertion sort
Determine the merge sort technique based on divide and conquer
139.technique to sort the following elements 14,33,27,10,35,19,42,44
5
Describe the algorithm to sort the elements 170, 45, 75, 90, 802,
140.
24, 2, 66 using Radix sort. Explain with each phase?
Sort the given integers and Explain the intermediate results using
141.
heap sort: 4, 3, 7, 1, 8, 5
Construct a Max Heap for the following:
142.
305, 133, 142, 110, 214, 319, 127, 144
Explain the method for Resolving collision to construct hash
143.
table with suitable example?
Construct a Min Heap for the following 35, 33, 42, 10, 14, 19, 27, 44,
144.26, 31.
145.Explain quick sort algorithm with an example
5
10
10
10
10
10
10
Write a procedure to perform percolate up and percolate down in a
146.heap sort.
10
Build a max heap for the following numbers - 20, 35, 23, 22, 4, 45, 21,
147.5, 42 and 19. At each stage of heap tree construction, ensure heap
properties are satisfied. Sort the numbers using heap sort techniques.
10
Identify the sorting method that works the way we sort playing cards
148.in our hands with the card numbers 4,3,2,10,12,1,5,6. Explain in stepwise.
Describe the open addressing and chaining methods of collusion
149.
resolution techniques in hashing
Which are the two standard ways of traversing a graph?
150.
10
10
2
151.Classify strongly connected and weakly connected graph.
Define minimum spanning tree. Give an example
152.
2
153.Define adjacency matrix of a graph
2
Create the adjacency matrix of the following graph
154.
2
155.What are the different types of graph in data structure?
2
156.What is a graph and mention its types?
157.When do you say a graph is bi-connected?
2
2
158.What is meant by bi-connected graph
2
Prove that the number of edges in a complete graph of n vertices in
159.
N(N-1)/2
160.Illustrate an articulation point with example.
2
161.Differentiate cyclic and acyclic graph
2
Classify strongly connected and weakly connected graph with
162.example.
5
2
2
Find out the in-degree and out-degree of each node in the given graph
163.
5
Find out the in-degree and out-degree of each node in the given
graph
164.
5
165.Analyze the different ways of representing a graph.
5
Given the following adjacency matrix, draw the weighted graph.
5
166.
Traverse the graph using Depth First Search Algorithm and Breadth
First Algorithm. Starting from ‘a’.
5
167.
Consider the graph below and create the adjacency list and matrix
5
168.
Create an undirected graph and its adjacency matrix for the
Following specification of a graph G.
169.V(G)=1,2,3,4
5
E(G) ={ (1,2),(1,3),(3,3),3,4),(4,1)}
Describe in detail about the following representations of a graph.
170. i) Adjacency Matrix
5
ii) Adjacency List
Evaluate the output for the given graph with weighted edges for
171.minimal spanning tree.
10
Write the program to execute the Dijikstra’s algorithm to find the shortest
path for a given graph.
10
172.
173.Develop a C program to find a minimum tree using Prim’s Algorithm
10
Find minimum spanning tree for the graph using Kruskal's algorithm
174.
10
175.Write a C Program to implements Breadth first search algorithm
10
Discuss the prim’s algorithm for minimum spanning tree. Give an
176.
example.
10
Write the procedure and algorithms for BFS and DFS.
177.
10
Develop an algorithm to compute the shortest path using
178.
Dijkstra’s algorithm
Find minimum spanning tree for the graph using Kruskal's algorithm
and explain the steps.
179.
10
180.Write a C Program to implements depth first search algorithm
10
181.Point out the strategy behind the Divide and Conquer method
2
182.State the principles of Greedy algorithm
2
183.What are the features of dynamic programming?
2
10
184.Write down the disadvantages in application of Dynamic Programming 2
185.Define Back tracking with example
2
Write down the difference between Back tracking and Branch & Bound
2
186.Method
187.Name the 3 search strategies for Branch & Bound Method
2
188.List out the memory functions used under Dynamic programming
2
189.Define Memory Functions
2
State the difference between the Greedy method and Dynamic
190.programming
2
What is the difference between dynamic programming and
191.
greedy algorithm
5
192.Explain the general procedure for dynamic programming
5
Solve 4-Queen’s problem & discuss the possible solutions using
193.
Back Tracking method
5
194.Explain the steps for solving Dynamic Programming
5
195.Explain briefly the general plan for divide-and-conquer algorithms.
5
196.Explain Divide and Conquer with an example
10
197.Explain the function of recursion using back tracking
10
Using Backtracking enumerate how can you solve the 8-queens
198.
Problem
10
199.Explain briefly Tower of Hanoi problem using dynamic programming
10
200.Explain briefly about Dynamic Programming
10