DSA · Syllabus

Syllabus DSA C2310C5

Course Syllabus

C2310C5 - Data Structures and Algorithms

ProgramBachelor of Technology (BTech)Semester - 3
Type of CourseCore Course
Prerequisite
Rationale-
Effective From A.Y.2025-26
Teaching Scheme (Contact Hours)Examination Scheme
LectureTutorialPracticalCreditTheory MarksPractical MarksTotal Marks
TTPP
3-2410060-50210

SEE - Semester End Examination, T - Internal Theory, P - Internal Practical

Course ContentT - Teaching Hours | W - Weightage
Sr.TopicsTW
1Introduction 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 Notations610
2Recursion 4 5 designing recursive algorithms,defining recursive algorithms,examples-factorial of a number, tower of hanoi , fibonacci series45
3Linear 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 list1020
4Non-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.820
5Graph 6 20 Graph Terminologies, Adjacency Matrices and List Representations of Graphs; Elementary Graph Operations: Depth First Search & Breadth first620
6Searching & Sorting 8 15 basics, selection, insertion, exchange, bubble, QuickSort, external sort Linear search, Binary search,list, hashed lists815
Total4290
Suggested Distribution Of Theory Marks Using Bloom's Taxonomy
LevelRemembranceUnderstandingApplicationAnalyzeEvaluate
Weightage1515203020

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:
CO1Understand Primitive and Non Primitive Data Structure
CO2Implement Linear Data Structures (Stacks & Queues &Linked List
CO3Implement Non Linear Data Structures (Tree & Graph)
CO4Evaluate Sorting and Searching Algorithms
CO5Evalute the time complexity of algorithm.
CO PO Mapping
COCO - 1CO - 2CO - 3CO - 4CO - 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

  1. An Introduction to Data Structures with Applications By Jean-Paul Tremblay & Paul G. Sorenson | Tata McGraw Hill

  2. 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

  1. 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)

  1. DISPLAY

  2. Implement a program to convert infix notation to postfix notation using stack.

  3. 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)

  1. 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.

  1. (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.

  2. 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

  1. 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

  1. 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

  1. inorder, preorder and postorder traversal.

  2. Write a program to implement Linear and Binary Search.

  3. 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

  1. 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