ULTRACOLLEGEOFENGINEERING AND TECHNOLOGY

(An Institution Approved by AICTE and Affiliated to Anna University, Chennai)

Madurai - 625 104
[Link]

Course File content

Subject Name: DATA STRUCTURES AND ALGORITHMS Subject Code: CD3291

Regulation : 2021 Academic Year: 2024 -2028

Faculty Name: [Link] Branch: IT

Year/Semester: II/III

Course File must contain the following documents in the given order:

Available
[Link]. Description
(Yes /No)
1. Front page (Authorized by the HoD)
2. Institute -Vision, Mission
3. Department Vision, Mission
4. POs, PSOs, PEOs
5. Academic schedule
6. Class Timetable
7. Faculty Timetable
8. Syllabus
9. Course Plan
10. Course Material ( Hand written / Printed)
11. Assignment details
12. Internal Assessment question papers
13. University question papers
14. Internal Assessment Marks
15. Internal Assessment analysis
16. Remedial Action Planned for Further Improvement
Students Answer Booklets and Assignment
17.
(Samples- Internal Assessment, End semester answer scripts, Assignment )
18. Calculation of CO attainment
19. CO-PO,PSO mapping
20. PO,PSO attainment

Signature of the Faculty HOD

 ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY
ULTRA NAGAR,
Madurai – 625104

PREFACE OF THE COURSE FILE

Staff Name : [Link]

Department : INFORMATION TECHNOLOGY

Subject : Data Structures And Algorithms

Subject Code : CD3291

Year/Sem/Branch : II/III / IT

Batch : 2024-2028

Period : 2025-2026 (Odd Sem)

Regulation : 2021

SIGNATURE OF THE STAFF HOD/IT DEAN/ACADEMIC PRINCIPAL

 ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY
ULTRA NAGAR,
Madurai – 625104

COLLEGE VISION, MISSION

VISION

To contribute the Society and the Nation through excellence in Science and Technology.
To transform the students into skilled professionals who will continue to be a source of pride for
our nation.

MISSION

To develop a high quality educational institution with emphasis on technical and

academic excellence, innovative research and development programmers along with due attention
to core human values.
 To create innovative and vibrant young leaders and entrepreneurs in Engineering and
Technology and blossom into an Institution of excellence recognized globally.
 To improve the human potential, allowing the emergence of scientifically capable and
imaginatively gifted leaders in a range of professions.

ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY

ULTRA NAGAR,
Madurai – 625104
 DEPARTMENT OF INFORMATION TECHNOLOGY

VISION

To equip faculty and students with the resources necessary to study and use the field of
computer science and Engineering to address a wide range of complex scientific, technological,
and social problems by promoting innovative research and education programs in core computer
science and multidisciplinary application areas.

MISSION

 To provide a stellar education to our students and to establish nationally and internationally
known research programs.
 To impart our students with an outstanding education and also to prepare them for
productive careers in industry, academia, and government.
 To equip them with the knowledge and skills necessary to solve the complex technological
problems of modern society by promoting collaborative and multidisciplinary activities.

ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY

ULTRA NAGAR,
Madurai – 625104
PROGRAM EDUCATIONAL OBJECTIVES(PEOs):

To enable graduates to pursue higher education and research, or have a

successful career in industries associated with Computer Science and
Engineering, or as entrepreneurs. To ensure that graduates will have the ability
and attitude to adapt to emerging technological changes.

PROGRAM OUTCOMES POs:

Engineering Graduates will be able to:

1. Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals and an engineering specialization to the solution of
complex engineering problems.

2. Problem analysis: Identify, formulate, review research literature, and analyze

complex engineering problems reaching substantiated conclusion first principles of
mathematics, natural sciences , and engineering sciences.

3. Design/development of solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified needs
with appropriate consideration for the public health and safety, and the cultural,
societal, and environmental considerations.

4. Conduct investigations of complex problems: User search based

Knowledge and research methods including design of experiments, analysis and
interpretation of data, and synthesis of the information to provide valid conclusions.

5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.

6. The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics and

 responsibilities and norms of the engineering practice.

9. Individual and team work: Function effectively as an individual, and as a member

or leader in diverse teams, and in multi disciplinary settings.

10. Communication:Communicateeffectivelyoncomplexengineeringactivitieswiththeen
gineering community and with society at large, such as, being able to comprehend
and write effective reports and design documentation, make effective presentations,
and give and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of

the engineering and management principles and apply these to one’s own work, as a

12. Member and leader in a team, to manage project sand in multi disciplinary
environments.

13. Life long learning: Recognize the need for ,and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.

PROGRAM SPECIFIC OBJECTIVES (PSOs)

To analyze, design and develop computing solutions by applying

foundational concepts of Computer Science and Engineering.

To apply software engineering principles and practices for developing

quality software for scientific and business applications.

To adapt to emerging Information and Communication Technologies

(ICT) to innovate ideas and solutions to existing /novel problems.

ULTRA College of Engineering and Technology

Academic Schedule for the Academic Year 2023 (Odd Semester)
JULY 2024 AUGUST 2024 SEPTEMBER 2024 OCTOBER 2024
1 Saturday (International 1 Tues 1 Fri 1 Sunday
joke day)
2 Sunday 2 Wed 2 Saturday 2 Mon (Gandhi Jeyanthi)
3 Mon 3 Thurs 3 Sunday 3 Tues
4 Tues 4 Fri 4 Mon (Semester exam end 4 Wed
For II sem)
5 Wed 5 Saturday 5 Tues 5 Thurs
6 Thurs 6 Sunday 6 Wed (Gokulaastami ) 6 Fri

7 Fri (World chocolate 7 Mon ( 1st internal test starts 7 Thurs 7 Saturday
day) for V,VII sem/ end for II
sem)
8 Saturday 8 Tues 8 Fri 8 Sunday
9 Sunday 9 Wed (practical exam start for 9 Saturday 9 Mon
the II sem)
10 Mon 10 Thurs 10 Sunday 10 Tues
11 Tues 11 Fri 11 Mon (2 internal test starts for 11 Wed (3rd internal test star
nd

V,VII sem)/(College reopens for for ,V,VII sem)/(I internal

III sem) test starts for III sem)
12 Wed (College reopens 12 Saturday 12 Tues 12 Thurs
for V,VII sem)
13 Thurs 13 Sunday 13 Wed 13 Fri
14 Fri 14 Mon 14 Thurs 14 Saturday
15 Saturday (World youth 15 Tues( Independence day) 15 Fri 15 Sunday
day)
st
16 Sunday 16 Wed (1 Internal Report for 16 Saturday 16 Mon
V,VII sem)
17 Mon (World Emoji 17 Thurs (1st CC Meeting for 17 Sunday 17 Tues
day) CSE,IT,ECE)
18 Tues 18 Fri (1st CC Meeting for 18 Mon (Vinayagar Chadhurthi) 18 Wed
EEE,MECH,CIVIL)
19 Wed 19 Saturday 19 Tues 19 Thurs
nd
20 Thurs (International 20 Sunday 20 Wed (2 Internal Report for 20 Fri (3rd Internal Report fo
chess day and moon V,VII sem) V,VII sem)/ (I Internal
day) Report for III sem)
21 Fri 21 Mon 21 Thurs (2nd CC Meeting for 21 Saturday
CSE,IT,ECE)
22 Saturday 22 Tues (Semester exam start 22 Fri (2nd CC Meeting for 22 Sunday
For II sem) EEE,MECH,CIVIL)
23 Sunday 23 Wed 23 Saturday 23 Mon ( Saraswathi pooja)
24 Mon 24 Thurs 24 Sunday 24 Tues (Vijayathasami)
25 Tues 25 Fri (Department activity 25 Mon 25 Wed (1st CC Meeting for
CSE/IT) CSE,IT,ECE)
26 Wed 26 Saturday 26 Tues 26 Thurs(1st CC Meeting for
EEE,MECH,CIVIL)
27 Thurs (International 27 Sunday 27 Wed ( Department activity 27 Fri (Department activity
conference day) ECE/EEE) MECH/CIVIL)
28 Fri (International 28 Mon 28 Thurs (Miladi nabi) 28 Saturday
conference)
29 Saturday (Moharam) 29 Tues 29 Fri 29 Sunday
30 Sunday (International 30 Wed 30 Saturday 30 Mon
friendship Day)
31 Mon 31 Thurs 31 Tues

NOVEMBER 2023 DECEMBER 2023

1 Wed 1 Fri

2 Thurs 2 Saturday
3 Fri 3 Sunday
4 Saturday 4 Mon
5 Sunday 5 Tues
6 Mon 6 Wed
7 Tues 7 Thurs
8 Wed 8 Fri
9 Thurs 9 Saturday
10 Fri 10 Sunday
11 Saturday 11 Mon
12 Sunday (Deepavali 12 Tues
festival)
13 Mon 13 Wed (3rd internal test
starts for III sem)
14 Tues 14 Thurs
nd
15 Wed (2 internal test 15 Fri
starts for III sem)
16 Thurs 16 Saturday
17 Fri 17 Sunday
18 Saturday 18 Mon

19 Sunday 19 Tues
20 Mon 20 Wed
21 Tues 21 Thurs
22 Wed 22 Fri
23 Thurs 23 Saturday
nd
24 Fri (2 Internal Report 24 Sunday
for III sem)
25 Saturday 25 Mon (Christmas festival)
26 Sunday 26 Tues
nd
27 Mon (2 CC Meeting 27 Wed
for CSE,IT,ECE)
28 Tues(2nd \ 28 Thurs
CC Meeting for
CSE,IT,ECE)
29 Wed 29 Fri
30 Thurs 30 Saturday
31 31 Sunday

Note: Each department will conduct one program in this semester as “Department Association activity”

ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY

ULTRA NAGAR,
Madurai – 625104

Faculty Name :[Link]

Academic year : 2024 -2028
Regulation : 2021
Subject code/Name : CD3291 / DATA STRUCTURES AND ALGORITHMS
Branch/year/semester : IT/II/III

COURSE OUTCOMES

Nomenclature of CO Statement
[Link]
COs
1 C204.1 To understand the concepts of ADTs

2 C204.2 To design linear data structures – lists, stacks, and queues

3 C204.3 To understand sorting, searching, and hashing algorithms

4 C204.4 To understand the tree traversal

5 C204.5 To apply Tree and Graph structures

CO-PO MAPPING

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
C204.1 -
2 2 1 1 1 - - 1 1 1 2
C204.2 -
2 1 - 2 2 - 1 2 1 1 2
C204.3 -
2 2 1 1 2 1 - 1 2 1 3
C204.4 -
3 2 2 2 2 - - 1 1 2 2
C204.5 -
2 2 1 2 2 - - 1 1 1 2
-
Average 2 2 1 2 2 1 1 1 1 1 2

1 – Low; 2 – Medium; 3 – High; “-“ – No correlation

Staff In-charge HOD

ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY

ULTRA NAGAR,
Madurai – 625104

CD3291 DATA STRUCTURES AND ALGORITHMS LTPC3003

UNIT I ABSTRACT DATA TYPES 9

Abstract Data Types (ADTs) – ADTs and classes – introduction to OOP – classes in
Python – inheritance – namespaces – shallow and deep copying
Introduction to analysis of algorithms – asymptotic notations – divide & conquer –
recursion – analyzing recursive algorithms

UNIT II LINEAR STRUCTURES 9

List ADT – array-based implementations – linked list implementations – singly linked lists
– circularly linked lists – doubly linked lists – Stack ADT – Queue ADT – double ended
queues – applications

UNIT III SORTING AND SEARCHING 9

Bubble sort – selection sort – insertion sort – merge sort – quick sort – analysis of sorting
algorithms – linear search – binary search – hashing – hash functions – collision handling –
load factors, rehashing, and efficiency

UNIT IV TREE STRUCTURES 9

Tree ADT – Binary Tree ADT – tree traversals – binary search trees – AVL trees – heaps –
multi-way search trees

UNIT V GRAPH STRUCTURES 9

Graph ADT – representations of graph – graph traversals – DAG – topological ordering –

greedy algorithms – dynamic programming – shortest paths – minimum spanning trees –
introduction to complexity classes and intractability

TEXT BOOK:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &
Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021

REFERENCES:
1. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition
2015
2. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011
3. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to
Algorithms”, Second Edition, McGraw Hill, 2002.
5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson
Education, 2014.

ULTRA COLLEGE OF ENGINEERING AND TECHNOLOGY

ULTRA NAGAR,
Madurai – 625104

COURSE PLAN

Subject : Data Structures and Algorithms

Subject Code : CD3291 Branch : IT

Name of the Staff : [Link] Sem/Year : III/ II

COURSE OBJECTIVES:

 To understand the basics of algorithmic problem solving.

 To learn to solve problems using Python conditionals and loops.
 To define Python functions and use function calls to solve problems.
 To use Python data structures - lists, tuples, dictionaries to represent complex data.
  To do input/output with files in Python.

UNIT I ABSTRACT DATA TYPES

Abstract Data Types (ADTs) – ADTs and classes – introduction to OOP – classes in Python –
inheritance – namespaces – shallow and deep copying
Introduction to analysis of algorithms – asymptotic notations – divide & conquer – recursion –
analyzing recursive algorithms

LECTURES:9
Mode
Reference Book
Date of
Period Name of the topic with Period
Actual teachin
Page No
g
R7- ch1:
1 Abstract Data Types (ADTs) BB
Pg No.1.7 – 1.17
1 ADTs and classes R7- ch1: BB
Pg No.1.20 – 1.25
1 introduction to OOP BB
R7- ch1:
1 – classes in Python Pg No.1.25 – 1.30 BB
1 inheritance R7- ch1: BB
1 Namespaces, shallow and deep copying Pg No.1.31 – 1.39 BB
1 divide & conquer BB
R7- ch1:
Introduction to analysis of algorithms –
1 Pg No.1.46 – 1.55 BB
asymptotic notations
recursion – analyzing recursive algorithms R7- ch1:
1 BB
Pg No.1.55 – 1.59
Assignment – 1: Date of announcement:
Date of submission :
UNIT II LINEAR STRUCTURES
List ADT – array-based implementations – linked list implementations – singly linked lists –
circularly linked lists – doubly linked lists – Stack ADT – Queue ADT – double ended queues –
applications

LECTURES:9
Mode
ReferenceBook
Date of
Period Name of the topic with Period
Actual Teachi
Page No
ng
1 List ADT BB
R7- ch2:
array-based implementations – linked list Pg No.2.3 – 2.7
1 BB
implementations R7- ch2:
1 singly linked lists Pg No.2.8 BB
1 circularly linked lists R7- ch2: BB
1 doubly linked lists Pg No.2.14 – 2.19 BB
R7- ch2:
1 Stack ADT Pg No.2.23 – 2.34 BB
1 Queue ADT BB
R7- ch2:
1 double ended queues BB
Pg No.2.37
R7- ch2:
1 Stack and queue applications BB
Pg No.2.43 – 2.52
Assignment – 2: Date of announcement:
Date of submission :
UNIT III SORTING AND SEARCHING
Bubble sort – selection sort – insertion sort – merge sort – quick sort – analysis of sorting
algorithms – linear search – binary search – hashing – hash functions – collision handling – load
factors, rehashing, and efficiency

LECTURES:9
Mode
Reference
Date of
Period Name of the topic Book with Period
Actual Teachi
Page No
ng
1 Bubble sort R7- ch3: BB
1 selection sort Pg No.3.10 – 3.11 BB
1 insertion sort– merge sort – quick sort R7- ch3: BB
Pg No.3.14 – 3.15
1 analysis of sorting algorithms R7- ch3:
BB
1 linear search– binary search Pg No.3.22 BB
1 hashing – hash functions R7- ch3: BB
Pg No.3.27 – 3.40
1 collision handling BB
R7- ch3:
1 load factors, rehashing, and efficiency BB
Pg No.3.41 – 3.45
1 Revision
Assignment – 3: Date of announcement:
Date of submission :
UNIT IV TREE STRUCTURES
Tree ADT – Binary Tree ADT – tree traversals – binary search trees – AVL trees – heaps – multi-
way search trees

LECTURES:9
Date Mode
Reference Book
Actual of
Period Name of the topic with Period
Teachi
Page No
ng
1 Tree ADT – R7- ch4: BB
1 Binary Tree ADT Pg No.4.4 – 4.16 BB
1 tree traversals R7- ch4: BB
1 – binary search trees Pg No.4.17 – 4.22 BB
1 – AVL trees BB
1 R7- ch4: BB
– heaps Pg No.4.23 – 4.27

1 R7- ch4: BB
multi-way search trees Pg No.4.28 – 4.33

R7- ch4:
1 Tree ADTmerits and demerits BB
Pg No.4.34 – 4.37
1 Revision BB
Assignment – 4: Date of announcement:
Date of submission:
UNIT V GRAPH STRUCTURES
Graph ADT – representations of graph – graph traversals – DAG – topological ordering – greedy
algorithms – dynamic programming – shortest paths – minimum spanning trees – introduction to
complexity classes and intractability
LECTURES:9
Period Name of the topic Reference Book with Date Period Mode
Page No Actual of
 Teachi
ng
1 Graph ADT – representations of graph R7- ch5: BB
1 graph traversals – DAG Pg No.5.1 – 5.2 BB
1 – topological ordering R7- ch5: BB
Pg No.5.3 – 5.6
greedy algorithms – dynamic R7- ch5:
1 BB
programming Pg No.5.9 – 5.21
R7- ch5:
1 shortest paths Pg No.5.23 – 5.27 BB

1 minimum spanning trees BB

R7- ch5:
introduction to complexity classes and Pg No.5.31
1 BB
intractability
R7- ch5:
1 Graph demerits and merits BB
Pg No.5.34
1 Revision BB
Assignment – 5: Date of announcement:
Date of submission :

TEXT BOOK:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &
Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021

REFERENCES:
1. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition
2015
2. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011
3. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to
Algorithms”, Second Edition, McGraw Hill, 2002.
5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson
Education, 2014

Signature of the staff HOD/IT Principal