[go: up one dir, main page]
Scribd
Upload
189 views3 pages

Dsa Notes Ccs University

Uploaded by

arpitansh2716
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
189 views3 pages

Dsa Notes Ccs University

Uploaded by

arpitansh2716
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/ 3

Data Structures and Algorithms (DSA) Notes Using C

1. Introduction to DSA

- Importance of Data Structures and Algorithms.

- Time Complexity: Big O Notation (Important for Exams).

- Space Complexity.

Previous Year Topic: Definitions of Time and Space Complexity.

2. Arrays

- Types: 1D, 2D, and Multidimensional Arrays.

- Operations: Insertion, Deletion, Traversal, Searching (Linear and Binary Search).

Mark as Important: Binary Search Algorithm.

Previous Year Topic: Linear and Binary Search implementation.

3. Linked Lists

- Types: Singly, Doubly, and Circular Linked Lists.

- Operations: Insertion, Deletion, Traversal (Singly Linked List is Important).

Mark as Important: Singly Linked List Operations.

Previous Year Topic: Difference between Singly and Doubly Linked Lists.

4. Stacks and Queues

- Stack: Implementation using Arrays and Linked Lists, Operations (Push, Pop).

- Queue: Types (Simple, Circular, Priority), Operations (Enqueue, Dequeue).

Mark as Important: Stack using Arrays.

Previous Year Topic: Stack and Queue Differences.

5. Trees

- Binary Trees: Traversal Techniques (Inorder, Preorder, Postorder).

- Binary Search Trees (BST): Insertion, Deletion, and Searching.


Mark as Important: Binary Tree Traversal Methods.

Previous Year Topic: Constructing a Binary Search Tree (BST).

6. Graphs

- Representation: Adjacency Matrix, Adjacency List.

- Traversal Algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS).

Mark as Important: BFS and DFS Algorithms.

Previous Year Topic: Difference between BFS and DFS.

7. Sorting Algorithms

- Bubble Sort, Selection Sort, Insertion Sort (Basic).

- Quick Sort, Merge Sort, Heap Sort (Advanced).

Mark as Important: Quick Sort and Merge Sort.

Previous Year Topic: Explain Merge Sort with Example.

8. Searching Algorithms

- Linear Search, Binary Search.

Mark as Important: Differences between Linear and Binary Search.

Previous Year Topic: Binary Search Implementation.

9. Hashing

- Hash Tables and Collision Handling Methods.

Mark as Important: Open Addressing Techniques.

Previous Year Topic: Hashing and its Applications.

10. Advanced Data Structures

- Heaps: Min Heap, Max Heap.

- Tries: Applications and Implementation.

Mark as Important: Min and Max Heap.


Previous Year Topic: Applications of Heap Data Structure.

You might also like