Professional Documents
Culture Documents
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:
Project Management.
Design/development
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
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:
Project Management.
Design/development
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
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Approval 9th Board of Studies Meeting for Department of Computer Science and Engineering held on 02.09.2023.