Course Syllabus
C2310C5 - Data Structures and Algorithms
| Program | Bachelor of Technology (BTech) | Semester - 3 |
|---|---|---|
| Type of Course | Core Course | |
| Prerequisite | ||
| Rationale | - | |
| Effective From A.Y. | 2025-26 |
| Teaching Scheme (Contact Hours) | Examination Scheme | |||||||
|---|---|---|---|---|---|---|---|---|
| Lecture | Tutorial | Practical | Credit | Theory Marks | Practical Marks | Total Marks | ||
| T | T | P | P | |||||
| 3 | - | 2 | 4 | 100 | 60 | - | 50 | 210 |
SEE - Semester End Examination, T - Internal Theory, P - Internal Practical
| Course Content | T - Teaching Hours | W - Weightage | |||
|---|---|---|---|---|
| Sr. | Topics | T | W | |
| 1 | Introduction 6 10 Pseudocode, Abstract Data Type, Data types – Primitive and non-primitive, Types of Data Structures- Linear & Non Linear Data Structures, ADT model and ADT implementation,Algorithm efficiency-Asymptotic Notations: Big O, Big Omega and Big Theta; Properties of Asymptotic Notations | 6 | 10 | |
| 2 | Recursion 4 5 designing recursive algorithms,defining recursive algorithms,examples-factorial of a number, tower of hanoi , fibonacci series | 4 | 5 | |
| 3 | Linear Lists 10 20 Array: Representation of arrays, Operations on Arrays, Applications of arrays Stack: Stack-Definitions & Concepts, Operations On Stacks, Applications of Stacks-Polish Expression, Reverse Polish Expression. Queue: Representation Of Queue, Operations On Queue, Circular Queue, Priority Queue, Array representation of Priority Queue, Double Ended Queue, Applications of Queue Linked List: Singly Linked List, Doubly Linked list,Circular linked list ,Linked implementation of Stack, Linked implementation of Queue, Applications of linked list | 10 | 20 | |
| 4 | Non-linear Lists 8 20 Tree-Definitions,Representation of binary tree, Tree traversal -Inorder, postorder, preorder, Threaded binary tree, Binary search trees, Conversion of General Trees To Binary Trees. | 8 | 20 | |
| 5 | Graph 6 20 Graph Terminologies, Adjacency Matrices and List Representations of Graphs; Elementary Graph Operations: Depth First Search & Breadth first | 6 | 20 | |
| 6 | Searching & Sorting 8 15 basics, selection, insertion, exchange, bubble, QuickSort, external sort Linear search, Binary search,list, hashed lists | 8 | 15 | |
| Total | 42 | 90 |
| Suggested Distribution Of Theory Marks Using Bloom's Taxonomy | ||||||
|---|---|---|---|---|---|---|
| Level | Remembrance | Understanding | Application | Analyze | Evaluate | |
| Weightage | 15 | 15 | 20 | 30 | 20 |
NOTE : This specification table shall be treated as a general guideline for the students and the teachers. The actual distribution of marks in the question paper may vary slightly from above table.
Printed on : 09-11-2026 01:44 PM Page 1 of 3
Course Syllabus
C2310C5 - Data Structures and Algorithms
| Course Outcomes | ||
|---|---|---|
| At the end of this course, students will be able to: | ||
| CO1 | Understand Primitive and Non Primitive Data Structure | |
| CO2 | Implement Linear Data Structures (Stacks & Queues &Linked List | |
| CO3 | Implement Non Linear Data Structures (Tree & Graph) | |
| CO4 | Evaluate Sorting and Searching Algorithms | |
| CO5 | Evalute the time complexity of algorithm. |
| CO PO Mapping | ||||||
|---|---|---|---|---|---|---|
| CO | CO - 1 | CO - 2 | CO - 3 | CO - 4 | CO - 5 | |
| PO - 1 | ||||||
| PO - 2 | ||||||
| PO - 3 | ||||||
| PO - 4 | ||||||
| PO - 5 | ||||||
| PO - 6 | ||||||
| PO - 7 | ||||||
| PO - 8 | ||||||
| PO - 9 | ||||||
| PO - 10 | ||||||
| PO - 11 | ||||||
| PO - 12 |
Reference Books
-
An Introduction to Data Structures with Applications By Jean-Paul Tremblay & Paul G. Sorenson | Tata McGraw Hill
-
Data Structures and Algorithms Made Easy By Narasimha Karumanchi
Printed on : 09-11-2026 01:44 PM Page 2 of 3
Course Syllabus
C2310C5 - Data Structures and Algorithms
List of Practical
- Introduction to Dynamic Memory Allocation. DMA functions malloc(), calloc(), free() etc.
Implement a program for stack that performs following operations using array. (a) PUSH (b) POP (c) PEEP (d) CHANGE (e)
-
DISPLAY
-
Implement a program to convert infix notation to postfix notation using stack.
-
Write a program to implement QUEUE using arrays that performs following operations (a)INSERT (b) DELETE (c) DISPLAY
Write a program to implement Circular Queue using arrays that performs following operations. (a) INSERT (b) DELETE (c)
- DISPLAY
Write a menu driven program to implement following operations on the singly linked list. (a) Insert a node at the front of the linked list. (b) Insert a node at the end of the linked list. (c) Insert a node such that linked list is in ascending order.
-
(according to info. Field) (d) Delete a first node of the linked list. (e) Delete a node before specified position. (f) Delete a node after specified position.
-
Write a program to implement stack using linked list. Write a program to implement queue using linked list.
Design, Develop and Implement a menu driven Program for the following operations on Doubly Linked List (DLL) a. Create
- a DLL. b. Print all the elements in DLL in forward traversal order c. Print all elements in DLL in reverse traversal order d. Exit
Write a program to implement following operations on the circular linked list. (a) Insert a node at the end of the linked
- list. (b) Insert a node before specified position. (c) Delete a first node of the linked list. (d) Delete a node after specified position.
a.Write a program which create binary search tree b.Implement recursive and non-recursive tree traversing methods
-
inorder, preorder and postorder traversal.
-
Write a program to implement Linear and Binary Search.
-
Write a program to implement Merge Sort Write a program to implement Bubble Sort
Design, Develop and Implement a Program for the following operations on Graph(G) a. Create a Graph N using Adjacency
- Matrix. b. Print all the nodes reachable from a given starting node in a digraph using BFS method c. Print all the nodes reachable from a given starting node in a digraph using DFS method
Printed on : 09-11-2026 01:44 PM Page 3 of 3