Course module

Section 3 | Data Structures — BPSC TRE 4.0 PGT Computer Science (कक्षा 11–12)

Explore the module outline and lessons below. Enroll free to begin studying here.

Lessons: 255
Duration: 18 hr 58 min
PYQs: 32
Practice: 305

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

Syllabus index

Lessons in this module

255 linked lessons

BPSC TRE 4.0 - Unit Test - Data StructuresTest

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

Advanced & k-ary Trees

Heaps & Priority Queues

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

Growth Rate Comparisons

Time Complexity Analysis

Iterative Loops & Code

Sorting Algorithms

Introduction to Sorting

Selection Sort

Bubble Sort

Insertion Sort

Merge Sort

Heap Sort

Quick Sort

Greedy Algorithms

Greedy Basics & Huffman

Optimal Merge Pattern

Fractional Knapsack

Minimum Spanning Trees

MST & Kruskal's Algo

MST & Prim's Algo

Shortest Path Algos

Dijkstra’s Algorithm

Bellman-Ford Algo

Module lessons

Lessons

Previous-year questions

Explore the course