KEMBAR78
Class Notes | PDF
Scribd
Upload
24 views2 pages

Class Notes

This document provides quick notes on Data Structures and Algorithms (DSA), covering key concepts such as arrays, linked lists, stacks, queues, trees, graphs, sorting algorithms, dynamic programming, and complexity analysis. It outlines the characteristics, operations, and common algorithms associated with each data structure. Additionally, it includes a brief overview of time and space complexity considerations.

Uploaded by

Disha
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
24 views2 pages

Class Notes

This document provides quick notes on Data Structures and Algorithms (DSA), covering key concepts such as arrays, linked lists, stacks, queues, trees, graphs, sorting algorithms, dynamic programming, and complexity analysis. It outlines the characteristics, operations, and common algorithms associated with each data structure. Additionally, it includes a brief overview of time and space complexity considerations.

Uploaded by

Disha
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

■ Data Structures & Algorithms (DSA) - Quick

Notes

1. Arrays
• Fixed-size data structure.
• Operations: Traversal, Insertion, Deletion, Searching, Sorting.
• Common algorithms: Binary Search, Two-pointer technique, Kadane’s Algorithm.

2. Linked List
• Dynamic size, nodes connected with pointers.
• Types: Singly, Doubly, Circular.
• Operations: Insertion, Deletion, Reversal, Middle element.

3. Stacks
• LIFO (Last In First Out).
• Applications: Expression evaluation, Backtracking, Function calls.

4. Queues
• FIFO (First In First Out).
• Types: Simple, Circular, Priority Queue, Deque.
• Applications: Scheduling, Buffer management.

5. Trees
• Hierarchical structure with root, children.
• Binary Tree, BST, AVL, Heap, Trie.
• Traversals: Inorder, Preorder, Postorder, Level order.

6. Graphs
• Set of nodes (vertices) and edges.
• Representations: Adjacency Matrix, Adjacency List.
• Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal, Prim.

7. Sorting Algorithms
• Bubble, Selection, Insertion → O(n²).
• Merge Sort, Quick Sort → O(n log n).
• Counting, Radix, Bucket → Non-comparison sorts.

8. Dynamic Programming
• Break problems into subproblems, store results.
• Examples: Fibonacci, Knapsack, LCS, Matrix Chain Multiplication.
9. Complexity Analysis
• Time Complexity: O(1), O(log n), O(n), O(n log n), O(n²).
• Space Complexity: Memory usage of algorithm.
• Best, Worst, Average cases.

You might also like