Savitribai Phule Pune University, Maharashtra, Computer Engineering Semester 4, Data Structures & Algorithms Syllabus

Data Structures & Algorithms Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus

Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Hashing

1.1 Concepts – Hash Tables
1.2 Hash Function
1.3 Basic Operations Bucket Collision Probe Synonym Overflow Open Hashing Closed Hashing Perfect Hash Function Load Density Full Table Load Factor Rehashing Issues in Hashing
1.4 Hash Functions Properties of good Hash Function Division Multiplication Extraction Midsquare Folding and Universal
1.5 Collision Resolution Strategies – Open Addressing and Chaining
1.6 Hash Table Overflow – Open Addressing and Chaining Extendible Hashing Closed Addressing and Separate Chaining
1.7 Skip List – Representation Searching and Operations – Insertion Removal

Unit - 2 Graphs

2.1 Basic Concepts
2.2 Storage Representation
2.3 Adjacency Matrix Adjacency List Adjacency Multi List Inverse Adjacency List
2.4 Traversals – Depth First and Breadth First
2.5 Minimum Spanning Tree Prims and Kruskal Algorithm
2.6 Greedy Algorithms for computing Minimum Spanning Tree
2.7 Dikjtras Single Source Shortest Path
2.8 All Pairs Shortest Paths – FlyodWarshall Algorithm Topological Ordering

Unit - 3 Trees

3.1 Tree – Basic Terminology General Tree and its Representation
3.2 Representation using Sequential and Linked Organization
3.3 Binary tree – Properties Converting Tree to Binary Tree Binary Tree Traversals recursive and nonrecursive Inorder Preorder Post Order Depth First and Breadth First Operations on Binary Tree
3.4 Huffman Tree Concept and Use
3.5 Binary Search Tree BST BST operations
3.6 Threaded Binary Search Tree – Concepts Threading Insertion and Deletion of Nodes in Inorder Threaded Binary Search Tree In Order Traversal of Inorder Threaded Binary Search Tree

Unit - 4 Search Trees

4.1 Symbol Table – Representation of Symbol Tables
4.2 Static Tree Table and Dynamic Tree Table
4.3 Weight Balanced Tree
4.4 Optimal Binary Search Tree OBST OBST as an Example of Dynamic Programming
4.5 Height Balanced Tree – AVL Tree RedBlack Tree AA Tree Kdimensional Tree Splay Tree

Unit - 5 Indexing and Multiway Trees

5.1 Indexing and Multiway Trees – Indexing Indexing Techniques Primary Secondary Dense Sparse
5.2 Multiway search trees
5.3 BTree – Insertion Deletion
5.4 BTree – Insertion Deletion Use of B Tree in Indexing
5.5 Trie Tree

Unit - 6 File Organization

6.1 Files Concept Need Primitive Operations
6.2 Sequential File Organization – Concept and Primitive Operations
6.3 Direct Access File – Concepts and Primitive Operations
6.4 Indexed Sequential File Organization – Concept Types of Indices Structure of Index Sequential File
6.5 Linked Organization Multi List Files Coral Rings Inverted Files and Cellular Partitions

Download CSE Sem 4 syllabus pdf

Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Other Subjects of Semester-2

Microprocessor

Mathematics iii

Software engineering

Principles of programming languages

What is machine learning

What is cloud computing

What is DBMS architecture

Sorting algorithm overview

Link Copied

More than 1 Million students use Goseeko! Join them to feel the power of smart learning.

Spot anything incorrect? Contact us

Goseeko covers the entire spectrum of student’s journey from Academics to Career. From helping them to ace their academics with our personalized study material to providing them with career development resources, our students meet their academic and professional goals.