Sinhgad Technical Education Society’s
SMT. KASHIBAI NAVALE COLLEGE OF ENGINEERING Pune – 41
DEPARTMENT OF COMPUTER ENGINEERING
TEACHING PLAN
Name of the Teacher: Mrs. S. Y. Kulkarni
Subject: Fundamentals of Data Structure
Class: S.E. DIV: II Year: 2020-2021 Semester: I
No. of Lecturers allotted by university: 3 % of students passed in previous year:
Lect. Topic & Contents Planned Date Date of Lecture
No. Planned
1. Introduction: From Problem to Data Structure
(Problem, Logic, Algorithm, and Data Structure).
Data Structures: Data, Information, Knowledge,
and Data structure, Abstract Data Types (ADT),
2. Structure Classification (Linear and Non-linear,
Static and Dynamic, Persistent and Ephemeral data
structures)
3. binary tree traversals-
inorder, preorder, postorder
4. level wise -depth first Search, Breadth first
Search
5. Operations on binary tree.
Binary Search Tree (BST), BST operations
6. Threaded binary tree- concepts, threading,
insertion and deletion of nodes in in-order
threaded binary tree
7. In order traversal of in-order threaded binary
tree.
8. Case Study- Use of binary tree in expression
tree-evaluation and Huffman's coding,
9. Unit II: Graphs-Basic Concepts, Storage
representation, Adjacency matrix, adjacency list,
adjacency multi list, inverse adjacency list.
10. Traversals-depth first and breadth first
11. Introduction to Greedy Strategy, Minimum
spanning Tree, Greedy algorithms for computing
minimum spanning tree- Prims
12. Minimum spanning Tree-Kruskal Algorithms
13. Dikjtra's Single source shortest path,
14. Topological ordering.
15. Case study- Data structure used in Webgraph and
Google map.
16. Case study- Data structure used in Webgraph and
Google map.
17. Unit III-Hashing-Hash Table- Concepts-hash
table, hash function, bucket, collision, probe,
synonym, overflow
18. Open hashing, closed hashing, perfect hash
function, load density, full table, load factor,
rehashing.
19. Issues in hashing, hash functions- properties of
good hash function, division, multiplication
20. extraction, mid-square, folding and universal,
21. Collision resolution strategies- open addressing
and chaining
22. Collision resolution strategies- open addressing
and chaining
23. Hash table overflow- open addressing and
chaining, extendible hashing.
24. Dictionary- Dictionary as ADT, ordered
dictionaries.
25. Skip List- representation, searching and
operations- insertion, removal.
26. Unit IV: Search Tree-Symbol Table-
Representation of Symbol Tables- Static tree
table and Dynamic tree table
27. Introduction to Dynamic Programming, Weight
balanced tree,
28. Optimal Binary Search Tree
(OBST),
29. OBST as an example of Dynamic Programming
30. Height Balanced Tree- AVL tree.
31. Height Balanced Tree- AVL tree.
32. Unit V:Indexing and Multiway Trees-
Indexing, indexing techniques
33. Types of search tree- Multiway search tree,
34. B-Tree
35. B+Tree
36. Trie Tree, Splay Tree
37. Red-Black Tree, K-dimensional tree, AA tree.
38. Set- Set ADT, realization of Set and operations.
39. Heap-Basic concepts, realization of heap and
operations,
40. Heap as a priority queue, heap sort
41. Unit VI-File Organization- Sequential file
organization- concept and primitive operations
42. Direct Access File- Concepts and
Primitive operations
43. Indexed sequential file organization-concept,
types of indices
44. Structure of index sequential file
45. Linked Organization- multi list files, coral rings
46. Inverted files and cellular
Partitions.
47. External Sort- Consequential processing and
merging two lists, multiday merging- a k way
merge
Algorithm.
48. External Sort- Consequential processing and
merging two lists, multiday merging- a k way
merge
Algorithm.
100 % syllabus is covered.
Signature of the H.O.D Signature of the Staff Member
