REGULATION 2023
B.E / B.TECH
COMPUTER SCIENCE AND BUSINESS SYSTEMS
&
ARTIFICIAL INTELLIGENCE AND DATA SCIENCE
L T P C
Course Code Course Name Data Structures and Algorithms Course Category PC
3 0 0 3
Foundations of Data Science and
Artificial Intelligence and Data Science
Pre-requisite Programming Progressive Analytics (Sem III) Course Offering
&
Courses in C Courses Database Design and Management (Sem Department
Computer Science and Business Systems
IV)
Course Learning Objectives (CLO): The objective of learning this course is to:
CLO-1: To recall the concepts of ADTs
CLO-2: To interpret the linear data structures – lists, stacks, and queues
CLO-3: To practice non-linear data structures – trees and graphs
CLO-4: To analyze sorting, searching and hashing algorithms
CLO-5: To apply Tree and Graph structures
Program Outcomes (PO) Program
Specific
1 2 3 4 5 6 7 8 9 10 11 12 outcomes
Project Management.
Design/development
Modern Tool Usage
Life Long Learning
Individual & Team
Problem Analysis
The engineer and
investigations of
Communication
Environment &
Sustainability
Engineering
of solutions
Knowledge
& Finance
Effective
Conduct
society
PSO-1
PSO-2
PSO-3
Ethics
Work
Course Outcomes (CO): At the end of this course, learners will be able to:
CO-1: Define linear and non-linear data structures 3 3 3 - 2 - - - - - - 1 2 2 1
CO-2: Implement linear and non–linear data structure operations 3 3 3 - 2 - - - - - - 1 2 2 1
Use appropriate linear/non–linear data structure operations for solving
CO-3: 2 2 2 - 2 - - - - - - 1 2 1 1
a given problem
CO-4: Apply appropriate graph algorithms for graph applications 2 2 2 - 1 - - - - - - 1 2 2 1
CO-5: Analyze the various searching and sorting algorithms 2 2 1 1 2 - - - - - - 1 3 2 1
Unit-1 - LISTS 9 Hour
Abstract Data Types (ADTs) – Introduction to analysis of algorithms – asymptotic notations– recursion – analyzing recursive algorithms-.List ADT – Array-based
implementation – Linked list implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists.
Unit-2 - STACKS AND QUEUES 9 Hour
Stack ADT –LIFO Principle- Operations – Applications – Balancing Symbols – Evaluating arithmetic expressions- Infix to Postfix conversion – Function
Calls – Queue ADT – FIFO Principle-Operations – Circular Queue – DeQueue -Applications of Queues
Unit-3 - TREES 9 Hour
Tree ADT – Terminologies- Tree Traversals - Binary Tree ADT – Expression trees – Binary Search Tree ADT – AVL Trees – Priority Queue (Heaps) – Binary Heap
Unit-4 - MULTIWAY SEARCH TREES AND GRAPHS 9 Hour
B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph - Breadth-first traversal – Depth-first traversal –– Bi-connectivity –
Euler circuits – Topological Sort – Dijkstra's algorithm – Minimum Spanning Tree – Prim's algorithm – Kruskal's algorithm
Unit-5 - SEARCHING, SORTING AND HASHING TECHNIQUES 9 Hour
Searching – Linear Search – Binary Search. Sorting-Internal Vs External – Bubble sort – Selection sort – Insertion sort – Shell sort –. Merge Sort – Hashing – Hash
Functions – Separate Chaining – Open Addressing –Rehashing – Extendible Hashing
TEXT BOOKS REFERENCE BOOK
1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C+
+, 2nd Edition, Pearson Education, 2015.
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein,
2nd Edition, Pearson Education, 2005. Introduction to Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
Learning
Resources 3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and
2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson
Algorithms, 1st edition, Pearson, 2002.
Education, 2007
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson
Education, 2006.
Bloom’s Cognitive Level of Thinking
Learning Assessment
Continuous Assessment Test (CAT) (40% weightage)
Final Semester Examination
CAT-1 CAT-2 CAT-3 (60% weightage)
Bloom’s Cognitive Level of Thinking
Supporting Supporting Supporting
Test Test
Activity Activity Test (60%) Activity Test (100%)
(60%) (60%)
(40%) (40%) (40%)
CLT 1 Remember 10% 10% 10% 10% 10% 10% 20%
CLT 2 Understand 20% 10% 20% 10% 20% 10% 30%
CLT 3 Apply 20% 10% 20% 10% 20% 10% 30%
CLT 4 Analyze 10% 10% 10% 10% 10% 10% 20%
CLT 5 Evaluate -
CLT 6 Create - - - - - - -
Total 100 % 100 % 100% 100 %
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Dr Ka.Selvaradjou , Professor, Pondicherry University
Mr Keerthivasan 1. Dr.S.Palanikumar, Professor /CSBS/VTMT
Dr Madhu Mutyam, Professor, IIT Madras
Global Campus Head, Virtusa Polarisis 2.Mrs.K.Haritha Asst. Professor /AI&DS/VTMT
Dr C.Mala, Professor, NIT Trichy
Approval 9th Board of Studies Meeting for Department of Computer Science and Engineering held on 02.09.2023.
Data Structures and Algorithms L T P C
Course Code Course Name Course Category PC
Laboratory 0 0 2 1
Data Science and Analytics Laboratory
Artificial Intelligence and Data Science
Pre-requisite Programming in C Progressive (Sem III) Course Offering
&
Courses Laboratory Courses Database Design and Management Department
Computer Science and Business Systems
Laboratory (Sem IV)
Course Learning Objectives (CLO): The objective of learning this course is to:
CLO-1: To demonstrate and implementation of various linear data structure algorithms
CLO-2: To implement non-linear data structure algorithms
CLO-3: To use Sorting, Searching and other algorithms.
Program Outcome (PO) Program
Specific
1 2 3 4 5 6 7 8 9 10 11 12 outcomes
Project Management.
Design/development
Modern Tool Usage
Life Long Learning
Individual & Team
Problem Analysis
The engineer and
investigations of
Communication
Environment &
Sustainability
Engineering
of solutions
Knowledge
& Finance
Effective
Conduct
society
PSO-1
PSO-2
PSO-3
Ethics
Work
Course Outcomes
At the end of this course, learners will be able to:
(CO):
Implement Linear data structure algorithms including Queues and - 2 - 2 -
CO-1: 3 3 2 2 2 - - 3 2 2
lists
CO-2: Apply various types of tree based non-linear data structures 3 3 2 2 2 - - - 2 - 1 - 3 2 2
CO-3: Implement various searching and sorting algorithms 3 3 2 2 2 - - - 2 - 2 - 3 2 2
LIST OF EXERCISES:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs CO1
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Circular Queue
6. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
7. Implementation of Binary Search Trees
CO2
8. Implementation of AVL Trees
9. Implementation of Heaps using Priority Queues
10. Implementation of Dijkstra’s Algorithm
11. Implementation of Prim’s Algorithm
12. Implementation of Linear Search and Binary Search
CO3
13. Implementation of Insertion Sort and Selection Sort
14. Implementation of Merge Sort
15. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
Total Periods : 30
TEXTBOOKS REFERENCE BOOK
1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C+
+, 2nd Edition, Pearson Education, 2015.
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein,
Learning 2nd Edition, Pearson Education, 2005. Introduction to Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
Resources 2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson 3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and
Education, 2007 Algorithms, 1st edition, Pearson, 2002.
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson
Education, 2006.
Bloom’s Cognitive Level of Thinking
Internal End Semester Examination
Bloom’s Cognitive Level of Thinking (60% weightage) (40% weightage)
Evaluation (75%) Model (25%) Test (100%)
CLT 1 Remember - - -
CLT 2 Understand - - -
CLT 3 Apply 30% 10% 35%
CLT 4 Analyze 25% 10% 35%
CLT 5 Evaluate 20% 5% 30%
CLT 6 Create - - -
Total 100% 100 %
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Dr Ka.Selvaradjou , Professor, Pondicherry University
Mr Keerthivasan 1. Dr.S.Palanikumar, Professor / CSBS / VTMT
Dr Madhu Mutyam, Professor, IIT Madras
Global Campus Head, Virtusa Polarisis 2. Mrs.K.Haritha Asst. Professor / AI&DS / VTMT
Dr C.Mala, Professor, NIT Trichy
Approval 9th Board of Studies Meeting for Department of Computer Science and Engineering held on 02.09.2023.
