SSM COLLEGE OF ARTS AND SCIENCE

(Affiliated to Madurai Kamaraj University, Madurai)

Dindigul – Palani Highway, Dindigul-624002

COURSE PLAN - I B.Sc (CS) - DATA STRUCTURES AND ALGORITHMS

Duration of the semester as
Academic Year 2023-2024 (EVEN) From :11-01-2024 to 13-05-2024
per academic calendar

Name of the Department COMPUTER SCIENCE Semester II

CC3 – Total Hours as per

Subject Code & Name Data Structures & Algorithms
75
syllabus

Name of the Faculty with Mrs. S. DHIVYA

Designation &Department Assistant Professor, Computer Science

Regular / Department Parent dept. Other dept.

Core
Elective/Allied COMPUTER SCIENCE COMPUTER SCIENCE -

Prerequisites Knowledge Basic Knowledge of Programming Concepts

Duration One semester Credit Units: 5

Students will able to
 To understand the concepts of ADTs
Course Objectives  To learn linear data structures-lists, stacks, queues
 To learn Tree structures and application of trees
 To learn graph structures and application of graphs
 To understand various sorting and searching

Vision
 To create qualified human potential to cater to the needs of self, family, and society
Mission
 To transform students into self-disciplined and ethical human assets
 To instill in them social, functional, and psychological values that will lead to their development as
responsible individuals and citizens
 To create a conducive environment to enrich and update their skills as required by industry and
society
Books for Study
Text Books:

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson, Education 2014, 4th
Edition.
2. Reema Thareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd Edition

 Chalk and Talk  Internal Assessment Tests

 Hands on training  Assignments, Seminars
Delivery and Assessment
 PowerPoint  Peer Learning
Instruction Methods
 Google Class Room  Madurai Kamaraj University
Methods
 Google Meet Examinations
S. Planned Cumula Text / Pag
tive Topics to be covered Ref e Executed Date Remarks
No. Date Hour Hours Book Nos.

Unit – 1
Abstract Data Types (ADTs) T1/
1 1 1 T2
List ADT T1/
2 2 3 T2
Array-based implementation T1/
3 1 4 T2
Linked list implementation T1/
4 2 6 T2
Linked lists-circular linked lists T1/
5 2 8 T2
 Doubly linked lists T1/
6 2 10 T2
Applications of lists T1/
7 1 11 T2
Polynomial Manipulation T1/
8 2 13 T2
All operations-Insertion-Deletion- T1/
9 2 15 T2
Merge-Traversal
Unit-II
Stack ADT T1/
10 1 16 T2
Operations- Applications T1/
11 2 18 T2
Evaluating arithmetic expressions T1/
12 1 19 T2
Conversion of infix to postfix expression T1/
13 2 21 T2
Queue ADT- - T1/
14 1 22 T2
Operations T1/
15 2 24 T2
Circular Queue T1/
16 1 25 T2
Priority Queue- - T1/
17 2 27 T2
de Queue T1/
18 2 29 T2
applications of queues T1/
19 1 30 T2
Unit-III
Tree ADT T1/
20 2 32 T2
Tree traversals T1/
21 1 33 T2
Binary Tree T1/
22 1 34 T2
ADT-expression tree T1/
23 2 36 T2
24 1 37 Trees – applications of trees T1/
T2
25 1 38 Binary search tree ADT T1/
T2
Threaded Binary Trees- T1/
26 1 39 T2
AVL Trees T1/
27 2 41 T2
B-Tree T1/
28 1 42 T2
B+ Tree T1/
29 2 44 T2
Heap-Applications of heap. T1/
30 1 45 T2
Unit-IV
31 1 46 Definition T1/T2
32 2 48 Representation of Graph T1/T2
33 1 49 Types of graph T1/T2
34 2 51 Breadth first traversal T1/T2
35 2 53 Depth first traversal T1/T2
36 1 54 Topological sort T1/T2
37 1 55 Bi-connectivity T1/T2
38 2 57 Cut vertex T1/T2
39 2 59 Euler circuits T1/T2
40 1 60 Applications of graphs. T1/T2
Unit-V
41 1 61 Searching T1/T2
42 1 62 Linear search T1/T2
43 1 63 Binary search T1/T2
44 1 64 Sorting T1/T2
45 1 65 Bubble sort T1/T2
Selection T1/T2
46 1 66
sort
47 1 67 Insertion sort T1/T2
48 1 68 Shell sort T1/T2
49 1 69 Radix sort T1/T2
50 1 70 Hashing T1/T2
51 1 71 Hash functions T1/T2
52 1 72 Separate chaining T1/T2
53 1 73 Open Addressing T1/T2
54 1 74 Rehashing T1/T2
55 1 75 Extendible Hashing T1/T2

Internal Assessment and Assignment

Unit Test Date Assignment/ Date
Tutorials
I
Internal Assessment Test I
II Assignment 1
III
Internal Assessment Test II
IV
Assignment 2
V Model Examination

Prepared by Checked by Approved by

Signature

Name Mrs . S. Dhivya Mr .R. Sudhanesh Dr. N. Sampathkumar

Designation ASSISTANT PROFESSOR HEAD of CS Principal
Date 12.01.2024 12.01.2024 12.01.2024
Remarks if any

Completion of Completion of
Semester
Unit I Unit II Unit III Unit IV Unit V
Initials of the Head of
the Department
with date

Internal Test-1 Internal Test-2 Model Examination

Signature Mr .R. Sudhanesh Dr. N. Sampathkumar
with Date Mrs . S. Dhivya

Faculty-in-charge Head of the Department Principal