Course module

Data Structure & Algorithms — HPSC PGT Computer Science

Lessons: 300
Duration: 30 hr 37 min
PYQs: 275
Practice: 2108

12% of this course's PYQ weight is covered in this module.

Syllabus index

Lessons in this module

300 linked lessons

HeapDrm Video

DFS AlgoDrm Video

Prim's AlgorithmDrm Video

HPSC - Unit Test - DSATest

Previous-year questions

Explore the course

Lessons in this module

Introduction to DS

DS Basics & Types

Array

Array Basics & Ops

1D & 2D Addressing

3D & Multi-dim Arrays

Stack

Stack Basics & Ops

Infix Postfix Prefix

Eval of Expressions

Recursion & Stack

Queue

Basics & Stack Mix

Circular Queue

Linked List

SLL Basics & Standard Operations

Structure Modification & Pointer Logic

Doubly, Circular & Variants

Tree

Binary Tree Basics & Props

Traversals & Construction

BST Basics & Operations

AVL Trees & Balancing

Complete Binary Trees

Heaps & Priority Queues

Advanced & k-ary Trees

Graphs

Graph Reps & Basics

DFS & Applications

BFS & Applications

Hashing

Hashing Basics & Functions

Open Addressing (Probing)

Chaining & Perf Analysis

Algorithm Analysis

Algo Basics & Analysis

Asymptotic Notations

Sorting Algorithms

Introduction to Sorting

Selection Sort

Bubble Sort

Insertion Sort

Merge Sort

Heap Sort

Quick Sort

Comparisons & Searching

Minimum Spanning Trees

MST & Kruskal's Algo

MST & Prim's Algo

Time Complexity Analysis

Iterative Loops & Code

Substitution Method

Recursion Tree Method

Master Theorem

Graph Theory

Introduction to Graphs – Definitions, Terminology (Loops, Parallel Edges, Adjacent Vertices)

Types of Graphs – Finite, Infinite, Null, Trivial, Complete

Bipartite, Cycle, Regular, and Complement of a Graph

Number of Graphs – Counting of Simple, Undirected, Unlabeled

Degree of Vertex – Isolated and Pendant Vertices, Handshaking Lemma, and Degree Sequence

Minimum and Maximum Degree – Relationships, Degree Constraints, and Havel-Hakimi Theorem

Graph Traversal – Walk, Path, Trail, Circuit, and Connected Graphs

Euler and Hamiltonian Graphs – Definitions, Conditions, and Examples

Planar Graphs – Kuratowski’s Theorems, Homorphism and examples

Euler Formula – Planar Graph Formula, Applications, and Derived Relations

Graph Coloring – Vertex Coloring, Edge Coloring, Chromatic Number, and Coloring Theorems

Trees – Definitions, Properties, Eccentricity, Diameter, Radius, and Center

Spanning Tree and Spanning Forest – Definition, Construction, and Applications

Shortest Path Algos

Dijkstra’s Algorithm

Bellman-Ford Algo

Module lessons

Lessons

Previous-year questions

Explore the course