Scribd
Upload
4K views2 pages

Dsa Notes Sppu 2024

The document outlines the syllabus for Data Structures and Algorithms (DSA) for Semester 3 at SPPU, covering key topics across six units. It includes concepts such as time and space complexity, linear and non-linear data structures, graph representations, searching and sorting algorithms, and hashing techniques. Each unit provides foundational knowledge essential for understanding DSA principles and applications.

Uploaded by

dhanapunevinod9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4K views2 pages

Dsa Notes Sppu 2024

The document outlines the syllabus for Data Structures and Algorithms (DSA) for Semester 3 at SPPU, covering key topics across six units. It includes concepts such as time and space complexity, linear and non-linear data structures, graph representations, searching and sorting algorithms, and hashing techniques. Each unit provides foundational knowledge essential for understanding DSA principles and applications.

Uploaded by

dhanapunevinod9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DSA Notes - SPPU 2024 Pattern (Semester 3)

Unit 1: Introduction to DSA

- Time and Space Complexity

- Asymptotic Notations: Big-O, Omega, Theta

- Recursion: Tail vs Non-tail recursion

- Iteration vs Recursion

- Examples: Factorial, Fibonacci, Tower of Hanoi

Unit 2: Linear Data Structures

- Arrays: Static & Dynamic

- Linked Lists: Singly, Doubly, Circular

- Stack: Operations, Applications (Infix to Postfix)

- Queue: Linear and Circular Queues, Dequeue

- Applications: Expression evaluation, Memory management

Unit 3: Non-Linear Data Structures

- Trees: Binary Tree, Binary Search Tree (BST)

- Tree Traversals: Inorder, Preorder, Postorder (Recursive & Iterative)

- Heaps: Min-Heap, Max-Heap

- Priority Queue: Applications in Scheduling

Unit 4: Graphs

- Graph Representations: Adjacency Matrix & List

- BFS (Queue), DFS (Stack/Recursion)

- Applications: Connected Components, Topological Sorting, Shortest Path (basic intro)


DSA Notes - SPPU 2024 Pattern (Semester 3)
Unit 5: Searching and Sorting

- Searching: Linear, Binary (Recursive & Iterative)

- Sorting: Bubble, Insertion, Merge Sort, Quick Sort

- Time Complexities: Best, Average, Worst Cases

Unit 6: Hashing and File Structures

- Hash Tables and Functions

- Collision Resolution: Chaining, Linear Probing

- Load Factor and Rehashing

- File Organization Basics (Sequential, Indexed)

You might also like