B.
Tech in Computer Science and Engineering (Session- 2024-28 onwards)
Course Code-105302 Data Structure & Algorithms 3003
Unit-1.0 7 hrs
Introduction: Basic Terminologies: Elementary Data Organizations, Data
Structure Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm,
Asymptotic Notations, Time-Space trade off.
Unit-2.0 7 hrs
Stacks and Queues: ADT Stack and its operations: Algorithms and their
complexity analysis, Applications of Stacks: Expression Conversion and
evaluation – corresponding algorithms and complexity analysis. ADT queue,
Types of Queue: Simple Queue, Circular Queue, Priority Queue; Operations on
each Type of Queues: Algorithms and their analysis.
Unit-3.0 7 hrs
Linked Lists: Singly linked lists: Representation in memory, Algorithms of
several operations: Traversing, Searching, Insertion into, Deletion from linked list;
Linked representation of Stack and Queue, Header nodes, doubly linked list:
operations on it and algorithmic analysis; Circular Linked Lists: all operations
their algorithms and the complexity analysis.
Unit-4.0 7 hrs
Searching, Sorting and Hashing: Linear Search and Binary Search Techniques
and their complexity analysis. Objective and properties of different sorting
algorithms: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort,
Heap Sort; Performance and Comparison among all the methods, Hashing.
Unit-5.0 7 hrs
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded
Binary Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees
and their algorithms with complexity analysis. Applications of Binary Trees. B
Tree, B+ Tree: definitions, algorithms and analysis.
Unit-6.0 7 hrs
Graph: Basic Terminologies and Representations, Graph search and traversal
algorithms and complexity analysis.
Text/ Reference:-
1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated
Edition
2. by Mark Allen Weiss, Addison-Wesley Publishing Company.
3. “How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson
Education.
4. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz,
Sartaj Sahni, Computer Science Press.
B. Tech in Computer Science and Engineering (Session- 2024-28 onwards
Course Code-I 05302P Data Structure & Algorithms Lab 0021
Perform any ten Experiments
List of Experiments:
I. Write a program to read a linear list of items and store it in an array.
2. Write a program to implement binary search.
3. Write a program to implement stack using array.
4. Write a program to implement stack using linked list.
5. Write a program to convert infix expression into postfix expression.
6. Write a program to implement queue using array.
7. Write a program to insert element in a circular queue using array.
8. Write a program to implement queue using Linked List.
9. Implement single linked list:
a. Create a single linked list.
b. Count number of nodes.
c. Traverse the linked list.
10.
a. [Link] node in singly linked list from beginning.
b. Insert a node at certain position
11. Delete a node of singly linked list:
a. from beginning
b. from end
c. at certain position
d. delete entire list
e. Reverse the single linked list
12. Insert a node in the doubly linked list:
a. from beginning
b. from end
c. at a certain position
d. Reverse the list
13. Delete a node of doubly linked list:
a. from beginning
b. from end
c. at certain position
14. Create a node of circular singly linked list and circular doubly linked list.
15. Write a program for tree traversal:
a. Preorder
b. lnorder
c. Postorder