DATA STRUCTURES
Prof. Akhil Jaiswal
9028637523
Content : 6 Parts Total Hrs: 40
Parts Outcomes Topic and Sub-topics Hr
1a. Classify the given type of Data 1.1 Concept and need of DS,
Structures based on their Abstract Data Type
characteristics.
1b. Explain complexity of the given 1.2 Types of Data Structures:
algorithm in terms of time and (i) Linear Data Structures
space. (ii) Non-Linear Data Structures
Part 1 1c. Explain the given operations to
Introductio be performed on the given type of 1.3 Algorithm Complexity:
n To Data data structures. (i)Time 04
Structures (ii)Space
1.4 Operations on Data Structures:
(i) Traversing,
(ii)Searching,
(iii)Insertion,
(iv)Deletion,
(v) Sorting
2a. Explain working of the given 2.1 Searching: searching an item in a
search method with an example. data set using following
2b. Write an algorithm to search the methods:
given key using binary Search (i) Linear Search
method. (ii) Binary Search
2c. Write an Algorithm to sort data 2.2 Sorting: sorting of data set in an
using a specified sorting method. order using following methods:
2d. Explain the working of given (i) Bubble Sort
sorting method step-by-step with (ii) Selection Sort
Part 2 an example and small data set. (iii) Insertion Sort
Searching 2e. Explain the mathematical
And
(iv) Quick Sort 08
background for algorithm (v) Radix Sort.
Sorting analysis using Selection sort and 2.3 Decision and Analysis
insertion sort methods. Fundamentals
- Performance Analysis
- Growth of Function Big O,
Omega and Theta notations
- Mathematical Background
for Analysis
- Analysis of Selection Sort &
Insertion Sort
[1]
3a. Develop an algorithm to perform 3.1 Introduction to Stack
PUSH and POP operations for - Stack representation in
the given item in a Stack. memory using array
3b. Convert the given expression - Stack as an ADT
from Infix to Prefix/Postfix using - Stack Operations – PUSH,
Stack. POP
3c. Write steps to evaluate the given - Stack Operations Conditions –
expression using the stack. Stack Full / Stack Overflow, Stack
3d. Develop a program to perform Empty / Stack Underflow.
the given operation on a linear - Applications of Stack
Queue. Reversing a list
3e. Write Algorithm to perform the Polish notations
given operations on circular
queue. 3.2 Conversion of infix to postfix
expression, Evaluation of postfix
Part 3 expression, Converting an infix
Stacks And into prefix expression, Evaluation 10
Queues
of prefix expression, Recursion,
Tower of Hanoi
3.3 Introduction to Queue:
- Queue representation in memory
using array
- Queue as an ADT
- Types of Queues :- Linear Queue,
Circular Queue, Concept of
Priority Queue
- Queue Operations – INSERT,
DELETE
- Queue Operations Conditions –
Queue Full, Queue Empty
- Applications of Queue
4a. Create relevant structure to 4.1 Introduction to Linked List
represent the given node using Terminologies: node, Address,
linked list. Pointer, Information field / Data
4b. Develop algorithm to insert the
field, Next pointer, Null Pointer,
given item in linear linked list.
4c. Develop algorithm to delete the Empty list.
Part 4 4.2 Type of lists: Linear list, Circular
given item from linear linked list
Linked
4d. Develop algorithm to traverse a list 05
List
circular linked list. 4.3 Operations on a singly linked list:
Traversing a singly linked list,
Searching a key in linked list,
Inserting a new node in a linked
list, Deleting a node from a linked
list
[2]
5a. Draw Binary Search Tree for the 5.1 Introduction to Trees,
given data set. Terminologies: tree, degree of a
5b. Write algorithms to traverse the node, degree of a tree, level of a
tree using the given method. node, leaf node, Depth / Height
5c. Construct Expression tree for the of a tree, In‐degree & Out‐
given data. Degree, Path, Ancestor &
Part 5 descendant nodes
Trees 5.2 Tree Types and Traversal 05
methods
Types of Trees: General tree,
Binary tree, Binary search tree
(BST).
Binary tree traversal : In order
traversal, Preorder traversal, Post
order traversal
5.3 Expression tree.
6a. Represent the given Graph using 6.1 Introduction to Graph
adjacency matrix and adjacency terminologies: graph, node
list (Vertices), arcs (edge), directed
6b. Differentiate between Breath- graph, undirected graph, in‐
First search and Depth-First degree, out‐degree, adjacent,
search traversal of a Graph successor, predecessor, relation,
6c. Find out shortest path of a graph path, sink, articulation point.
using shortest-Path algorithm 6.2 Adjacency List, Adjacency
Part 6 6d. Develop algorithm for Minimum Matrix of directed / undirected
Graphs Spanning Tree graph. 08
6.3 Elementary Graph Operations :
Breadth_first Search, Depth_first
Search
6.4 Shortest Path Algoritm:
Dijkstra's algorithm, Warshall
algorithm,
6.5 Spanning tree : Minimum
Spanning tree, kruskal’s
algorithm , Prim’s algorithm
Prof. Akhil Jaiswal
Ph.D(Pur.), B.E , M.E.
Amravati, Maharashtra
[3]
