# CSE202 / DS C++

## Syllabus

{% file src="<https://2980675225-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F7uMP7Ghb8mcjzaqhpGZJ%2Fuploads%2Fwet7C1jRp0I4eFl0vvcF%2FCSE%20202%20DSC%2B%2B%20Syllabus%20BTECH-IT.pdf?alt=media&token=cabf342f-97a6-4cb1-8440-a9ed12d9f993>" %}

## Resources

<details>

<summary>M1: Introduction to C++</summary>

* C++ Programming Concepts
  * Review of C Programming
  * Input and Output in C++
  * Functions in C++
    * Value Parameters
    * Reference Parameters
    * Parameter Passing
    * Function Overloading
    * Function Templates
  * Exceptions in C++
    * Throwing Exceptions
    * Handling Exceptions
  * Arrays in C++
  * Pointers in C++
    * new and delete operators
  * Classes and Objects in C++
    * Access Specifiers
    * Friend Functions
    * Constructors and Destructors
    * Operator Overloading
    * Class Templates
  * Object-Oriented Concepts
    * Encapsulation
    * Abstraction
    * Inheritance
    * Polymorphism
* Basic Concepts and Data Structures
  * Data Objects and Structures
  * Algorithm Specification
    * Introduction to Algorithms
    * Recursive Algorithms
  * Data Abstraction
  * Performance Analysis
    * Time Complexity
    * Space Complexity
  * Asymptotic Notation
    * Big O Notation
    * Omega Notation
    * Theta Notation
  * Complexity Analysis Examples
  * Introduction to Linear and Non-Linear Data Structures

</details>

<details>

<summary>M2: Introduction to DS</summary>

* Arrays and Matrices
  * Representation of Single and Two-Dimensional Arrays
  * Sparse Matrices: Array and Linked Representations
* Linear List ADT
  * Array Representation
  * Linked Representation
* Linked Lists
  * Singly Linked Lists
    * Operations: Insertion, Deletion
  * Circularly Linked Lists
    * Operations for Circularly Linked Lists
  * Doubly Linked Lists
    * Operations: Insertion, Deletion
* Stacks
  * Stack ADT Definition
  * Array and Linked Implementations
  * Applications
    * Infix to Postfix Conversion
    * Postfix Expression Evaluation
    * Recursion Implementation
* Queues
  * Queue ADT Definition
  * Array and Linked Implementations
  * Circular Queues
    * Insertion and Deletion Operations

</details>

<details>

<summary>M3: Trees</summary>

* Introduction to Trees
  * Tree Definition and Terminology
  * Binary Trees
    * Definition
    * Properties of Binary Trees
    * Binary Tree ADT
    * Representation of Binary Trees: Array and Linked Representations
    * Binary Tree Traversals
  * Threaded Binary Trees
  * Priority Queues
    * Definition and Applications
    * Max Priority Queue ADT Implementation
    * Max Heap Definition
    * Insertion into a Max Heap
    * Deletion from a Max Heap
* Minimum Spanning Tree
  * Prim’s Algorithm
  * Kruskal’s Algorithm
* Shortest Path Algorithms

</details>

<details>

<summary>M4: Searching &#x26; Sorting</summary>

* Searching Algorithms
  * Linear Search
  * Binary Search
  * Hashing
    * Introduction to Hashing
    * Hash Tables
    * Hash Functions
    * Overflow Handling
  * Comparison of Searching Methods
* Sorting Algorithms
  * Insertion Sort
  * Selection Sort
  * Radix Sort
  * Quick Sort
  * Heap Sort
  * Merge Sort
  * Comparison of Sorting Methods

</details>

<details>

<summary>M5: Graphs</summary>

* Introduction to Graphs
  * Definitions and Terminology
  * Applications of Graphs
  * Properties of Graphs
  * Graph ADT Definition
  * Graph Representations
    * Adjacency Matrix
    * Adjacency Lists
  * Graph Search Methods
    * Depth-First Search (DFS)
    * Breadth-First Search (BFS)
  * Complexity Analysis of Graph Algorithms
* Search Trees
  * Binary Search Tree (BST) ADT
    * Definition
    * Operations: Searching, Insertion, Deletion
  * Balanced Search Trees
    * AVL Trees (Definition and Examples)
    * B-Trees (Definition and Examples)
    * Red-Black Trees (Definition and Examples)
  * Comparison of Search Trees

</details>

## Notes

\[⤓] [CSE202 DSA C++ Quick Prepare](https://drive.google.com/file/d/1PZYZvV0W4VVLzjKVunTj8-8EYaC_FYio/view?usp=drive_link)

{% embed url="<https://drive.google.com/file/d/1PZYZvV0W4VVLzjKVunTj8-8EYaC_FYio/view?usp=drive_link>" %}

\[⤓] [CSE202 DSA C++ EXTRACTED TOPICS](https://drive.google.com/file/d/1P8cxwqvcMtU0sge5G7wiTgZxAoXXAZMs/view?usp=drive_link)

{% embed url="<https://drive.google.com/file/d/1P8cxwqvcMtU0sge5G7wiTgZxAoXXAZMs/view?usp=drive_link>" %}

## Question Directory

### Previous Year Questions

\[⤓] [Midsem-CSE202-Y2S3-BTECH-CSE-IT-OCT24](https://drive.google.com/file/d/1yCw4WKp7vEINB3FBw8f1mZCoLcUz4Ahd/view?usp=drive_link)

{% embed url="<https://drive.google.com/file/d/1yCw4WKp7vEINB3FBw8f1mZCoLcUz4Ahd/view?usp=drive_link>" %}

\[⤓] [CSE202-PYQ-BTECH-CSE-IT-Sem3Dec23](https://drive.google.com/file/d/11F_vq0E4vtETvjUcUWTsg34kVB6u5yvU/view?usp=drive_link)

{% embed url="<https://drive.google.com/file/d/11F_vq0E4vtETvjUcUWTsg34kVB6u5yvU/view?usp=drive_link>" %}

\[⤓] [CSE202-PYQ-BTECH-CSE-IT-Sem3Dec24](https://drive.google.com/file/d/19EMCKZGRllJPYu0PlSK3APPhC26SyIta/view?usp=drive_link)

{% embed url="<https://drive.google.com/file/d/19EMCKZGRllJPYu0PlSK3APPhC26SyIta/view?usp=drive_link>" %}

### BackPaper

\[⤓] [CSE202-PYQ-BackQPaper-BTECH-CSE-IT-Sem3Dec24](https://drive.google.com/file/d/11cHeDhOPvqqGmMKUBR9S94NKQqu9uM91/view?usp=drive_link)

{% embed url="<https://drive.google.com/file/d/11cHeDhOPvqqGmMKUBR9S94NKQqu9uM91/view?usp=drive_link>" %}

{% embed url="<https://www.wscubetech.com/resources/dsa>" %}

{% embed url="<https://www.youtube.com/@CoderArmy9/videos>" %}

{% embed url="<https://mantavyam.notion.site/18152f7cde8880d699a5f2e65f87374e>" %}
Get Credited for sharing your Knowledge Source with your Peer
{% endembed %}

{% embed url="<https://mantavyam.notion.site/17e52f7cde8880e0987fd06d33ef6019>" %}
Submit Queries/Feedbacks/Suggestions/Complaints using this Form
{% endembed %}