CSE202 / DS C++
Syllabus
Resources
Notes
Question Directory
Previous Year Questions
BackPaper
Last updated
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
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
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
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
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
[⤓] CSE202 DSA C++ Quick Prepare
[⤓] CSE202 DSA C++ EXTRACTED TOPICS
[⤓] Midsem-CSE202-Y2S3-BTECH-CSE-IT-OCT24
[⤓] CSE202-PYQ-BTECH-CSE-IT-Sem3Dec23
[⤓] CSE202-PYQ-BTECH-CSE-IT-Sem3Dec24
[⤓] CSE202-PYQ-BackQPaper-BTECH-CSE-IT-Sem3Dec24
Last updated