Printed on 7/4/2022 1:35:26 PM

LECTURE PLAN

Institute/Department UNIVERSITY INSTITUTE Program Bachelor of Engineering -

OF ENGINEERING (UIE) Computer Science & Engineering
(CS201)
Master Subject Coordinator Vatika Jalali Master Subject Coordinator E- E11440
Name: Code:
Course Name Data Structures and Course Code 20CSY-251
Algorithm Analysis

Lecture Tutorial Practical Self Study Credit Subject Type

1 0 0 0 1.0 T

Course Type Course Category Mode of Assessment Mode of Delivery

Employability Enhancement Mandatory Non-Graded MCQ Based (MCQB) Theory (TH)

Course (MNG)

Program Educational Objectives(PEOs)

PEO1 To produce computer science graduate engineers with an ability to comprehend, understand and analyze real life problems for
providing sustainable solutions teams in the light of disruptive technologies.
PEO2 To inculcate life-long learning skills in graduates preparing them for work in changing environments and multidisciplinary teams in
order to enhance their capability being globally employable.
PEO3 To instill leadership qualities in graduates with a sense of confidence, professionalism and ethical attitude to produce professional
leaders for serving the society.
PEO4 To make the graduates adaptable to changing career opportunities who have the potential to excel in industry/ public sector/
higher studies or entrepreneurship exhibiting global competitiveness.

Program Specific OutComes(PSOs)

PSO1 To acquire proficiency in developing and implementing efficient solutions using emerging technologies, platforms and Free and
Open-Source Software (FOSS).
PSO2 To gain critical understanding of hardware and software tools catering to the contemporary needs of IT industry.

Program OutComes(POs)
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals and an engineering
specialization to the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature and analyze complex engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex engineering problems and design system components, processes
to meet the specifications with consideration for the public health and safety, and the cultural, societal, and environmental
considerations
PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods including design of
experiments, analysis and interpretation of data and synthesis of the information to provide valid conclusions.
PO5 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.
PO6 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.
PO7 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.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.

PO9 Individual and teamwork: Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.

University Information System - By - ERP Division Page 1 of 5

 Printed on 7/4/2022 1:35:26 PM
LECTURE PLAN

PO10 Communication: Communicate effectively on complex engineering activities with the engineering 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.
PO11 Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and
apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.
PO12 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 to technological change.

Text Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Data Structures Seymour Lipschutz 2nd edition Tata McGraw Hill 2014

2 Introduction to Algorithms Cormen, Leiserson, Rivest, 3rd edition Prentice Hall of 2009
Stein India
3 Introduction to the design and Levitin 2nd edition Pearson 2014
analysis of algorithms

Reference Books
Sr No Title of the Book Author Name Volume/Edition Publish Hours Years
1 Computer Algorithms: Introduction Baase, Van Gerder 3rd edition Pearson 2002
to Design Analysis
2 Fundamental of Computer, Horowitz, Sahni and 2nd edition University Press 2008
Algorithms Rajasekaran (India)
3 The Design and analysis of Aho, Haperoft and Ullman 2nd edition Pearson Education 2004
Computer Algorithms India

Course OutCome
SrNo OutCome
CO1 Recall the concept of data structures and their algorithms.
CO2 Determine the complexity of an algorithm using asymptotic notations.
CO3 Exemplify the sorting techniques.
CO4 Compute the basic operations like insertion, deletion and traversing on data structures.
CO5 Solve the problems of greedy algorithms and dynamic programming.

Lecture Plan Preview-Theory

Mapped with
Pedagogical
Unit No LectureNo ChapterName Topic Text/ Reference Books CO Numer
Tool**
(s)
1 1 Introduction to Need for Data Structures, Arrays, Link ,T-Data Structures,T-Introduction to PPT,Video CO1
Data Structures List, queues Algorithm for various Algorithms,T-Introduction to the Lecture
operations on basic Data Structures design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
1 2 Introduction to Recursion, Algorithm: Time & Space ,T-Data Structures,T-Introduction to PPT,Video CO2
Data Structures Complexity, Asymptotic Notation Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com

University Information System - By - ERP Division Page 2 of 5

 Printed on 7/4/2022 1:35:26 PM
LECTURE PLAN

1 3 Introduction to Master Theorem, Recurrence Relation ,T-Data Structures,T-Introduction to PPT,Video CO2

Data Structures Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
1 4 Sorting Time & space complexity Analysis of ,T-Data Structures,T-Introduction to PPT,Video CO3
Algorithms various Sorting techniques (Bubble Algorithms,T-Introduction to the Lecture
Sort, Selection Sort, Insertion Sort, design and,R-Computer Algorithms:
Counting Sort Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
1 5 Sorting Radix Sort, Heap Sort, Quick Sort. ,T-Data Structures,T-Introduction to PPT,Video CO3
Algorithms Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
2 6 Tree Data Binary Search tree, Searching in BST, ,T-Data Structures,T-Introduction to PPT,Video CO4
Structure Insertion in BST, Deletion in BST , Algorithms,T-Introduction to the Lecture
height balanced AVL trees design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
2 7 Tree Data Red black trees, B trees, B+ trees. ,T-Data Structures,T-Introduction to PPT,Video CO4
Structure Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
2 8 Graph Data Need for Graphs, Graph Traversals ,T-Data Structures,T-Introduction to PPT,Video CO4
Structure Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
2 9 Graph Data Minimum Spanning Trees- Prim’s ,T-Data Structures,T-Introduction to PPT,Video CO4
Structure Algorithm & Kruskal Algorithm, Floyd Algorithms,T-Introduction to the Lecture
Warshall Algorithm design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
2 10 Graph Data Single Source Shortest Paths - ,T-Data Structures,T-Introduction to PPT,Video CO4
Structure Dijkstra’s and Bellman Ford Algorithms. Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
3 11 Greedy Greedy Approach: Huffman Algorithm, ,T-Data Structures,T-Introduction to PPT,Video CO5
algorithms Dijkastra Algorithm Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
3 12 Greedy Knapsack Problem. ,T-Data Structures,T-Introduction to PPT,Video CO5
algorithms Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
3 13 Dynamic Dynamic Approach &Branch and Bound ,T-Data Structures,T-Introduction to PPT,Video CO5
programming with Examples Such as Travelling Algorithms,T-Introduction to the Lecture
Salesman Problem, Graph Coloring design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com

University Information System - By - ERP Division Page 3 of 5

 Printed on 7/4/2022 1:35:26 PM
LECTURE PLAN

3 14 Dynamic n-Queen Problem, Hamiltonian Cycles, ,T-Data Structures,T-Introduction to PPT,Video CO5

programming Resource Allocation Problem Algorithms,T-Introduction to the Lecture
design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com
3 15 Dynamic Longest Common Subsequence ,T-Data Structures,T-Introduction to PPT,Video CO5
programming problem , Matrix Chain multiplication Algorithms,T-Introduction to the Lecture
Problem. design and,R-Computer Algorithms:
Introduct,R-Fundamental of
Computer, Algor,R-The Design and
analysis of Com

Assessment Model
Sr No Assessment Name Exam Name Max Marks
1 20EU01 Assignment 10
2 20EU01 Attendance and 2
Engagement Score on BB
3 20EU01 Mid-Semester Test-1 40
4 20EU01 External Theory 80
5 20EU01 Quiz 4
6 20EU01 Surprise Test 12
7 20EU01 Mid-Semester Test-2 40

CO vs PO/PSO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 NA NA NA NA NA NA NA NA NA NA NA NA NA

CO2 3 3 NA NA NA NA NA NA NA NA NA NA 2 NA

CO3 2 NA 3 NA NA NA NA NA NA NA NA NA NA NA

CO4 NA NA 3 NA NA NA NA NA NA NA NA NA 3 NA

CO5 NA 2 3 NA NA NA NA NA NA NA NA NA 2 NA

Target 2.67 2.5 3 NA NA NA NA NA NA NA NA NA 2.33 NA

University Information System - By - ERP Division Page 4 of 5

 Printed on 7/4/2022 1:35:26 PM
LECTURE PLAN

University Information System - By - ERP Division Page 5 of 5