KJ’s Educational Institute

KJ College of Engineering & Management Research, Pune

Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

K J’s Educational Teaching Plan Page 1 of 4

Institutes Complex
KJ College of Engineering and Department of Computer Engineering Prepared on 20/12/2024
Management Research, Pune
CLASS
ACADEMIC YEAR
4
2024-2025 Second Year Engineering
Semester II W.E.F. 01/01/2025
Subject Data Structure and Algorithms Subject Code 210252
Faculty Incharge Dr. U M Mulani No. of Lectures /Week 3

1. Course Objectives:
1 To develop a logic for graphical modeling of the real life problems.
2 To suggest appropriate data structure and algorithm for graphical solutions of the problems
3 To understand advanced data structures to solve complex problems in various domains
4 To operate on the various structured data
5 To build the logic to use appropriate data structure in logical and computational solutions
6 To understand various algorithmic strategies to approach the problem solution

2. Course Outcome: On completion of the course, learner will be able to –

Course Outcome Statements

210252.1 Identify and articulate the complexity goals and benefits of a good hashing
scheme for real-world applications.
210252.2 Apply non-linear data structures for solving problems of various domain.
210252.3 Design and specify the operations of a nonlinear-based abstract data type
and implement them in a high-level programming language.
210252.4 Analyze the algorithmic solutions for resource requirements and optimization
210252.5 Use efficient indexing methods and multiway search techniques to store and
maintain data.
210252.6 Use appropriate modern tools to understand and analyze the functionalities
confined to the secondary storage.
3. Text Books
Sr. Author/s Title of Book Publication House Accession No.
No.
1 1. Horowitz, Sahani, “Fundamentals of Data Galgotia Publisher ISBN:
Dinesh Mehata Structures in C++” 8175152788,
9788175152786
2 M Folk, B Zoellick “File Structures‖, Pearson G. Riccardi ISBN:81-7758-
Education” 37-5
3 Peter Brass “Advanced Data Cambridge University ISBN: 978-1-
Structures” Press 107-43982-5
 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

4. Reference Books
Sr. Author/s Title of Book Publication Accession No
No. House
1 A. Aho, J. Hopcroft, J. “Data Structures and Pearson ISBN-0-201-
Ulman Algorithms Education 43578-0
2 Michael J Folk “File Structures an Object Pearson ISBN: 81-7758-
Oriented Approach with C++‖” Education, 373-5.
3 Sartaj Sahani, “Data Structures, Algorithms Second Edition, ISBN:81-
and Applications in C++”
University Press 7371522 X.
4 G A V Pai “Data Structures and McGraw-Hill ISBN -
Algorithms” Companies 9780070667266
5 Goodrich, Tamassia, “Data Structures and Wiley ISBN:
Goldwasser Algorithms in Java” Publication 9788126551903

5. Detailed Teaching Plan:

Lecture Date of Topics Planned Topics Covered Date of COs POs PSOs Sign of
No. Planning Execution HOD
UNIT I : Hashing (7 Hrs)
Hash Table- Hash Table- Concepts- CO1 PO1,
Concepts-hash table, hash table, hash PO2,
1.
hash function, basic function, basic PO3, PSO1,
operations operations PO4 PSO3
bucket, collision, bucket, collision, probe, CO1 PO1,
probe, synonym, synonym, overflow, PO2,
2.
overflow, open open hashing PO3,
hashing PO4
closed hashing, closed hashing, perfect CO1 PO1,
perfect hash function, hash function, load PO2,
load density, full density, full table, load PO3,
3.
table, load factor, factor, rehashing, issues PO4
rehashing, issues in in hashing
hashing
hash functions- hash functions- CO1 PO1,
properties of good properties of good hash PO2,
4.
hash function, function, PO3,
PO4
5. division, division, multiplication, CO1 PO1,
multiplication, extraction, mid-square PO2,
extraction, mid- folding and universal, PO3,
square folding and PO4
universal,
 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

Lecture Date of Topics Planned Topics Covered Date of COs POs PSOs Sign of
No. Planning Execution HOD
Collision resolution Collision resolution CO1 PO1,
strategies- open strategies- open PO2,
addressing and addressing and chaining PO3,
6. chaining Hash table Hash table overflow- PO4
overflow- open open addressing and
addressing and chaining
chaining
extendible hashing, extendible hashing, CO1 PO1,
closed addressing and closed addressing and PO2,
7.
separate chaining. separate chaining. PO3,
PO4
UNIT II: Trees (8 Hrs)
Tree- basic Tree- basic CO2 PO1,
terminology, General terminology, General PO2
8.
tree and its tree and its PSO1,
representation representation PSO2
representation using representation using CO2 PO1,
9. sequential and linked sequential and linked PO2
organization organization
, Binary tree- , Binary tree- CO2 PO1,
10. properties, converting properties, converting PO2
tree to binary tree tree to binary tree
binary tree binary tree CO2 PO1,
traversals(recursive traversals(recursive and PO2
11. and non-recursive)- non-recursive)- inorder,
inorder, preorder, preorder, post order
post order
depth first and depth first and breadth CO2 PO1,
breadth first, first, Operations on PO2
12.
Operations on binary binary tree
tree
Huffman Tree Huffman Tree (Concept CO2 PO1,
(Concept and Use), and Use), Binary Search PO2
13. Binary Search Tree Tree (BST), BST
(BST), BST operations
operations
Threaded binary Threaded binary search CO2 PO1,
14. search tree- concepts, tree- concepts, PO2
threading threading
15. insertion and deletion insertion and deletion of CO2 PO1,
of nodes in in-order nodes in in-order PO2
 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

Lecture Date of Topics Planned Topics Covered Date of COs POs PSOs Sign of
No. Planning Execution HOD
threaded binary threaded binary search
search tree in order tree in order traversal
traversal of in-order of in-order threaded
threaded binary binary search tree
search tree
UNIT III : Graphs (7 Hrs)
Basic Concepts, Basic Concepts, Storage CO3 PO1 PSO1,
Storage representation,
16. representation, Adjacency matrix, PSO3
Adjacency matrix, adjacency list
adjacency list
adjacency multi list, adjacency multi list, CO3 PO1
17.
inverse adjacency list inverse adjacency list
Traversals-depth first Traversals-depth first CO3 PO1
and breadth first, and breadth first,
18.
Minimum spanning Minimum spanning
Tree Tree
Greedy algorithms Greedy algorithms for CO3 PO1
for computing computing minimum
19. minimum spanning spanning tree- Prims
tree- Prims and and Kruskal Algorithms
Kruskal Algorithms
Dikjtra's Single Dikjtra's Single source CO3 PO1
20.
source shortest path shortest path
All pairs shortest All pairs shortest paths- CO3 PO1
21. paths- Flyod- Flyod-Warshall
Warshall Algorithm Algorithm
22. Topological ordering. Topological ordering. CO3 PO1
UNIT IV : Search Trees (8 Hrs)
Representation of Representation of CO4 PO2, PSO2,
23.
Symbol Tables Symbol Tables PO4
PSO3
Static tree table and Static tree table and CO4 PO2,
24.
Dynamic tree table Dynamic tree table PO4
Weight balanced tree Weight balanced tree - CO4 PO2,
25. - Optimal Binary Optimal Binary Search PO4
Search Tree (OBST), Tree (OBST),
OBST as an example OBST as an example of CO4 PO2,
26. of Dynamic Dynamic Programming PO4
Programming
27. Height Balanced Height Balanced Tree- CO4 PO2, CO3
 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

Lecture Date of Topics Planned Topics Covered Date of COs POs PSOs Sign of
No. Planning Execution HOD
Tree- AVL tree, AA AVL tree, AA tree PO4
tree
Red-Black Tree Red-Black Tree CO4 PO2,
28.
PO4
K-dimensional tree K-dimensional tree CO4 PO2,
29.
PO4
Splay Tree Splay Tree CO4 PO2,
30.
PO4
UNIT V : Indexing and Multiway Trees (7 Hrs)
Indexing and Indexing and Multiway CO5 PO1,
31. Multiway Trees- Trees- Indexing PO3,
Indexing PO4
indexing techniques- indexing techniques- CO5 PO1, PSO1,
32. primary, secondary, primary, secondary, PO3, PSO2
dense, sparse dense, sparse PO4
Multiway search Multiway search trees CO5 PO1,
33. trees PO3,
PO4
B-Tree- insertion, B-Tree- insertion, CO5 PO1,
34. deletion deletion PO3,
PO4
B+Tree - insertion, B+Tree - insertion, CO5 PO1,
35. deletion deletion PO3,
PO4
use of B+ tree in use of B+ tree in CO5 PO1,
36. Indexing Indexing PO3,
PO4
Trie Tree Trie Tree CO5 PO1,
37. PO3,
PO4
UNIT VI : File Organization (7 Hrs)
Files: concept, need, Files: concept, need, CO6 PO1,
primitive operations. primitive operations. PO2,
38.
PO3,
PO4
39. Sequential file Sequential file CO6 PO1,
organization- concept organization- concept PO2,
and primitive and primitive operations PO3, PSO1,
operations PO4
 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

Lecture Date of Topics Planned Topics Covered Date of COs POs PSOs Sign of
No. Planning Execution HOD
Direct Access File- Direct Access File- CO6 PO1, PSO3
Concepts and Concepts and Primitive PO2,
40.
Primitive operations operations PO3,
PO4
Indexed sequential Indexed sequential file CO6 PO1,
file organization- organization-concept, PO2,
41.
concept, types of types of indices PO3,
indices PO4
structure of index structure of index CO6 PO1,
sequential file sequential file PO2,
42.
PO3,
PO4
Linked Organization- Linked Organization- CO6 PO1,
multi list files, coral multi list files, coral PO2,
43.
rings rings PO3,
PO4
inverted files and inverted files and CO6 PO1,
cellular partitions cellular partitions PO2,
44.
PO3,
PO4

* Self-learning $ Content beyond syllabus

6.Mapping of Course Outcomes and Program Outcomes:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
210252.1 2 1 2 1 - - - - - - - - 2 - 1
210252.2 1 2 - - - - - - - - - - 1 1 -
210252.3 2 - - - - - - - - - - - 2 - 2
210252.4 - 2 - 1 - - - - - - - - - 2 1
210252.5 1 - 1 1 - - - - - - - - 1 2 -
210252.6 2 1 1 1 - - - - - - - - 1 - 2
2 2 1 1 - - - - - - - - 1 1 1

Justification of CO/PO and PSO Mapping

 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

PO1 The mapping strength is marked as 2 (Moderate).

Justification: Identifying and articulating the complexity, goals, and benefits of a good hashing
scheme helps students apply their engineering knowledge to solve real-world data management and
CO1 security problems.
PO2 The mapping strength is marked 1 (Low).
Justification: Analyze engineering problems related to data storage, retrieval, and performance,
applying foundational principles to find optimal solutions.
PO3 The mapping strength is 2 (Moderate).
Justification: students to design effective and efficient solutions by selecting the appropriate
hashing technique for different real-world applications, ensuring scalability, performance, and
security.
PO4 The mapping strength is 1 (Low).
Justification: Conduct experiments and investigations to evaluate the effectiveness of different
hashing methods, analyzing performance and optimizing system design (PO4).
PSO1 The mapping strength is 2 (Moderate).
Justification: the analysis of hashing complexities and their applications, students gain critical
professional skills required to design and implement computer-based systems that are both efficient
and scalable, meeting the goals outlined.
PSO3 The mapping strength is 1 (Low).
Justification: understanding hashing and its applications, students not only prepare themselves for
successful careers but also cultivate the skills necessary for entrepreneurial ventures and further
academic exploration in cutting-edge fields of computer science.
PO1 The mapping strength is 1 (Low).
Justification:
PO2 The mapping strength is 2 (Moderate).
CO2 Justification:
PSO1 The mapping strength is 1 (Low).
Justification:
PSO2 The mapping strength is 1 (Low).
Justification:
CO3 PO1 The mapping strength is 2 (Moderate).
Justification:
PSO1 The mapping strength is 2 (Moderate).
Justification:
PSO3 The mapping strength is 2 (Moderate).
Justification:
CO4 PO2 The mapping strength is 2 (Moderate).
Justification:
PO4 The mapping strength is 1 (Low).
Justification:
PSO2 The mapping strength is 2 (Moderate).
Justification:
PSO3 The mapping strength is 1 (Low).
Justification:
CO5 PO1 The mapping strength is 1 (Low).
Justification:
PO3 The mapping strength is 1 (Low).
Justification:
PO4 The mapping strength is 1 (Low).
Justification:
PSO1 The mapping strength is 1 (Low).
Justification:
 KJ’s Educational Institute
KJ College of Engineering & Management Research, Pune
Sr.No.25&27, Kondhwa-Saswad Road, NearBopdevGhat, Pune - 411048

PSO2 The mapping strength is 2 (Moderate).

Justification:
CO6 PO1 The mapping strength is 2 (Moderate).
Justification:
PO2 The mapping strength is 1 (Low).
Justification:
PO3 The mapping strength is 1 (Low).
Justification:
PO4 The mapping strength is 1 (Low).
Justification:
PSO1 The mapping strength is 1 (Low).
Justification:
PSO3 The mapping strength is 2 (Moderate).
Justification:

7. Attainment of Course Outcome:

Prepared by Approved by
Dr. U M Mulani Dr. Nikita Kulkarni
Subjectt In-Charge Head, Computer Engineering dept.