Course Code: 20MC9102 R20

SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR

(AUTONOMOUS)
Siddharth Nagar, Narayanavanam Road – 517583

QUESTION BANK (DESCRIPTIVE)

Subject with Code: Data Structures (20MC9102) Course & Branch: MCA
Year & Sem: I-MCA & I-Sem Regulation: R20

UNIT –I
BASIC CONCEPT, LINEAR LIST

1 a) What is an Algorithm? [4M]

b) Write an Algorithm for sum of two numbers. [8M]
2 a) What is a Data Structure? Explain its advantages. [4M]
b) Explain various types of Data Structures. [8M]
3 Find the O(n), Ω(n) and θ(n) values for the functions f(n)=3n+2 and g(n)=n. [12M]
4 Explain Space Complexity Performance with example. [12M]
5 Discuss about algorithm with an example algorithm and program. [12M]
6 a) What is an Array? [6M]
b) Explain the representation of an array. [6M]
7 a) Explain Linear Data structure with examples [6M]
b) Explain Non Linear Data structure with examples [6M]
8 Analyze and write a program to store a set of values of same data type into a single [12M]
variable.
9 Explain the following i) Big-Oh ii) Big-Omega iii) Big-Theta [12M]
10 Discuss about Asymptotic Notations with their types. [12M]
Course Code: 20MC9102 R20
UNIT –II
LINKED REPRESENTATION, STACK & QUEUE

1 a) Write an algorithm to insert an element at the end of doubly linked list. [6M]
b) Write an algorithm to delete an element at specified position in single linked list. [6M]
2 Explain different ways for insert elements into a Single Linked List with example. [12M]
3 Discuss about Circularly Linked List with operations. [12M]
4 a) What is linked list? What are the different types of linked list? [6M]
b) Explain the advantages of linked list over arrays. [6M]
5 a) Write an algorithm to insert an element at beginning of circularly linked list. [6M]
b) Write an algorithm to delete an element at end of doubly linked list. [6M]
6 a) What is a Stack? What are the operations that perform on a stack? [6M]
b) What is a Queue? What are the operations that perform on a Queue? [6M]
7 a) Explain the implementation of stack operations using arrays. [6M]
b) Explain the implementation of stack operations using linked list. [6M]
8 What is an expression? Explain various types of expressions with example. [12M]
9 a) Explain the implementation of queue operations using arrays. [6M]
b) Explain the implementation of queue operations using linked list. [6M]
10 a) Convert the expression (5 + 6) * (6 - 5) from infix to postfix [6M]
b) Write the steps for evaluating postfix expression. [6M]
Course Code: 20MC9102 R20
UNIT –III
TREES & MULTIWAY TREES

1 a) Explain BFS Tree Traversal with an example. [6M]

b) Explain DFS Tree Traversal with an example. [6M]

2 Explain Binary Tree with their types and representation. [12M]

3 Describe different cases to delete an element in BST with an algorithm and examples. [12M]

4 Discuss about B – Tree with their operations. [12M]

5 a) Write an algorithm to insert elements into Binary Search Tree. [6M]

b) Write an algorithm to search element in Binary Search Tree. [6M]

6 Write the algorithms for inserting elements into B+ Tree with example. [12M]

7 Discuss about trees with their terminology. [12M]

8 Construct Binary Search Tree for the following nodes 43, 10, 79, 90, 12, 54, 11, 9 & 50 [12M]

9 Write the algorithms for deleting elements from B+ Tree with example. [12M]

10 a) Define Multiway Tree. What are the different Multiway trees? [6M]

b) Differentiate B-Tree with B+ Tree. [6M]

Course Code: 20MC9102 R20
UNIT –IV
SEARCHING AND SORTING

1 a) What do you mean by searching? What are the types of searching? [6M]
b) Differentiate various searching techniques. [6M]
2 a) Explain Linear Search with an algorithm and example. [6M]
b) Write a program to demonstrate Linear Search. [6M]
3 Explain about Hashing with an example. [12M]
4 a) Explain Binary Search with an algorithm and example. [6M]
b) Write a program to demonstrate Binary Search. [6M]
5 a) Discuss Space and Time Complexity for Linear and Binary Search. [3M]
b) Distinguish between Linear Search and Binary Search. [9M]
6 a) Explain insertion sort with an algorithm and example. [3M]
b) Write a program to demonstrate insertion sort. [9M]
7 a) Explain bubble sort with an algorithm and example. [3M]
b) Write a program to demonstrate bubble sort. [9M]
8 a) Explain selection sort with an algorithm and example. [3M]
b) Write a program to demonstrate selection sort. [9M]
9 a) Write an algorithm for Quick sort with example. [3M]
b) Write an algorithm for Merge sort with example. [9M]
10 Differentiate various sorting techniques with time complexity. [12M]
Course Code: 20MC9102 R20
UNIT –V
GRAPHS & GRAPH ALGORITHMS

1 a) Define Graph. List out various graph operations? [4M]

b) What are the various applications and properties of Graphs? [8M]
2 a) Discuss BFS Graph Traversal with an algorithm. [3M]
b) Explain BFS Graph traversal with steps for the following Graph. [9M]

3 What is a Graph? Explain various Graph terminologies. [12M]

4 a) Discuss DFS Graph Traversal with an algorithm. [3M]
b) Explain DFS Graph traversal with steps for the following Graph. [9M]

5 a) What is minimum –cost spanning tree? [4M]

b) Discuss Prim’s algorithm with example. [8M]
6 a) Discuss how to represent Graph storage using Adjacency matrix. [7M]
b) Briefly explain about Adjacency List with example. [5M]
7 Explain Dijkstra’s algorithm with an example. [12M]
8 Explain about shortest path problem with an algorithm and example. [12M]
9 Explain in detail about various minimum cost spanning tree algorithms. [12M]
10 Discuss and compare various graph traversals. [12M]

Prepared by:
Mr. J. S. ANANDA KUMAR
Assistant Professor/MCA