MUTHAYAMMAL ENGINEERING COLLEGE
(An Autonomous Institution)
(Approved by AICTE, New Delhi, Accredited by NAAC & Affiliated to Anna University)
Rasipuram - 637 408, Namakkal Dist., Tamil Nadu.
Department of Master of Computer Applications
Question Bank - Academic Year (2020-21)
Course Code & Course Name
: 19CAB02 & Data structures and Algorithms
Year/Sem/Sec
: I / I / -
Unit-I:
Part-A (2 Marks)
1.
Define Data structure.
2.
Define Linear Data structure with Examples.
3.
What is an Array and its types?
4.
What is Stack ADT?
5.
Write an Algorithm to convert infix to Postfix Conversion?
6.
Write Down the Applications of Queue.
7.
Define Linked List.
8.
What is Enqueue and Dequeue?
9.
What is Circular Linked List?
10.
What is Structure with Examples?
Unit-II : Tree Structures
Part-A (2 Marks)
1.
Define the Non-Linear Structures.
2.
What is Tree?
3.
List out the types of tree..
4.
Define Height and Level of tree
5.
What is Binary Tree?
6.
Difference Between Binary Tree and Binary Search tree.
Part-B (16 Marks)
1.
(i)Explain Stack and its infix to postfix conversion
(8)
2.
(ii)Describe Queue and its Applications.
(16)
3.
Discuss in detail about Linked list and its types.
(16)
4.
Rules for the conversion from infix to postfix expression with Example
(16)
5.
Discuss in detail about Polynomial Addition
(16)
7.
What is Binary Tree Traversal and its types.
8.
List out applications of trees.
9.
Define Huffman coding.
10.
List out Types of Binary tree.
Unit-III : Graphs
Part-A (2 Marks)
1.
Define Graph.
2.
List out the Graph Traversals.
3.
Mention Applications of graph.
4.
List out the Types of Graph.
5.
What is Topological Sort?
6.
What is Shortest-path algorithms?
7.
What is Minimum spanning tree?
8.
Difference Between – Prim's and Kruskal's algorithms
9.
What is Biconnectivity?
10.
Define Euler circuits.
Part-B (16 Marks)
1.
Discuss in detail about Tree and its Representation.
(16)
2.
Discuss in detail about Binary Tree Traversal,
(16)
3.
Explain in detail about left child right sibling data structures for general trees
(16)
4.
Write short notes on Binary Tree
(16)
5.
Briefly discuss about Huffman Algorithm
(16)
Part-B (16 Marks)
1.
Write short notes on Graph Traversals with Examples.
(16)
2.
Discuss in detail about Shortest-path algorithms.
(16)
3.
Explain in detail about Minimum Spanning tree.
(16)
4.
Write short notes on Prim’s and Kruskal’s Algorithms.
(16)
5.
Discuss in detail about Topological sort and Biconnectivity.
(16)
6.
Briefly discuss about Representation Graph.
(16)
Unit-IV : Introduction To Algorithms
Part-A (2 Marks)
1.
Define Algorithm.
2.
List out the Notion of Algorithms.
3.
Mention the five Pillars of Greedy Algorithms.
4.
Difference between Greedy Technique and Dynamic Programming.
5.
Difference between recursive and non-recursive Algorithms.
6.
Define Dynamic Programming.
7.
Define Sorting and with examples.
8.
What is Best, Worst and Average- Case?
9.
List out the types of Asymptotic Notations.
10.
Define Sort and its types..
Unit-V : Algorithm Design and Analysis
Part-A (2 Marks)
1.
List out the Analysis of algorithms
2.
Define Time and Space Complexity of Algorithm
3.
Mention the phases of Divide and Conquer.
4.
Define Binary Search.
5.
Define Merge Sort.
6.
What is Greedy Algorithm?
7.
What is Dynamic Programming?
8.
What is Backtracking?
9.
What is state Space Tree?
10.
Define Branch and Bound Technique.
Part-B (16 Marks)
1.
Comparing the performance of Different algorithms.
(16)
2.
Write Short notes on Asymptotic Notations.
(16)
3.
Write short notes on Bubble sort and Selection Sort
(16)
4.
Discuss in detail about Mathematical analysis for recursive and non recursive
algorithms.
(16)
5.
Explain about Selection Sort and Bubble Sort.
(16)
Part-B (16 Marks)
1.
Explain in detail about Asymptotic Notations
(16)
2.
Write short notes on Divide and Conquer with example.
(16)
3.
Explain Greedy algorithm with knapsack problem.
(8)
3.
Explain Travelling salesman problem in Branch and Bound Method.
(16)
4.
Discuss in detail about Warshall’s Algorithm for Finding Transitive Closure
(16)
