Computer Science

Grade 9

Grade 11

University — Year 1

Operators and Expressionssoon
Conditional Statements (if/else)soon
Loop Control Structuressoon
Functions and Proceduressoon
Arrays and Listssoon
String Operationssoon
Pointers and Referencessoon
Variable Scope and Lifetimesoon
Linked Listssoon
Stackssoon
Queuessoon
Trees and Binary Treessoon
Graphs and Graph Traversalsoon
Hash Tables and Hashingsoon
Sorting Algorithmssoon
Searching Algorithmssoon
Divide and Conquer Strategysoon
Dynamic Programmingsoon
Greedy Algorithmssoon
Binary Representation and Number Systemssoon
Boolean Logic and Truth Tablessoon
Logic Gatessoon
CPU Architecture Basicssoon
Memory Hierarchysoon
Cache Memorysoon
Set Theorysoon
Relations and Functions in Discrete Mathsoon
Propositional Logicsoon
Combinatorics Basicssoon
Graph Theory Fundamentalssoon
Number Systems and Conversionssoon
Regular Expressionssoon
SQL Basics and Queriessoon
Relational Database Designsoon
Database Normalizationsoon
Database Queries and Joinssoon
OSI Modelsoon
TCP/IP Protocol Suitesoon
HTTP and Web Protocolssoon
IP Addressing and Subnettingsoon
Version Control Systems (Git)soon
Unit Testing and Test-Driven Developmentsoon

University — Year 2

Binary Search Treessoon
AVL Treessoon
Red-Black Treessoon
Graph Representationssoon
Depth-First Search (DFS)soon
Breadth-First Search (BFS)soon
Dijkstra's Algorithmsoon
Bellman-Ford Algorithmsoon
Topological Sortingsoon
Minimum Spanning Treesoon
Kruskal's Algorithmsoon
Prim's Algorithmsoon
Longest Common Subsequencesoon
Matrix Chain Multiplicationsoon
Quicksort Algorithmsoon
Merge Sort Algorithmsoon
Heapsort Algorithmsoon
Counting Sort Algorithmsoon
Radix Sort Algorithmsoon
Time Complexity Analysissoon
Space Complexity Analysissoon
Binary Heapssoon
Priority Queuessoon
KMP String Matching Algorithmsoon
Boyer-Moore Algorithmsoon
Rabin-Karp Algorithmsoon
Backtracking Algorithmssoon
NP-Completenesssoon
Computational Complexity Classessoon
Binary Search Algorithmsoon
Recursion and Tail Recursionsoon
Memoization Techniquessoon
0/1 Knapsack Problemsoon
Unbounded Knapsack Problemsoon
Graph Coloringsoon
Maximum Flow and Min-Cutsoon
Ford-Fulkerson Algorithmsoon
Bipartite Graphssoon
Strongly Connected Componentssoon
Coin Change Problemsoon

University — Year 3

Advanced Sorting Algorithmssoon
Graph Traversal (BFS, DFS)soon
Shortest Path Algorithms (Dijkstra, Bellman-Ford)soon
Balanced Trees (AVL, Red-Black)soon
Hash Tables and Collision Resolutionsoon
Heaps and Priority Queuessoon
B-Trees and Indexingsoon
SQL and Relational Database Designsoon
ACID Properties and Transactionssoon
Query Optimization and Execution Planssoon
Process Management and Schedulingsoon
Virtual Memory and Pagingsoon
Concurrency and Threadingsoon
Synchronization and Deadlock Preventionsoon
Network Protocols (TCP/IP Stack)soon
Routing Algorithms and Algorithmssoon
Network Security and SSL/TLSsoon
Cryptography and Encryption Algorithmssoon
Software Design Patternssoon
Object-Oriented Design Principlessoon
UML and System Modelingsoon
Software Testing Strategiessoon
Automata Theory and Formal Languagessoon
Turing Machines and Computabilitysoon
Computational Complexity (P, NP, NP-Complete)soon
Compiler Design and Parsingsoon
REST API Design Principlessoon
Distributed Systems and Consensussoon
Parallel Computing and GPU Programmingsoon
Machine Learning Fundamentalssoon
Natural Language Processingsoon
Computer Graphics and Renderingsoon
Cloud Computing Architecturesoon
Microservices Architecturesoon
DevOps and CI/CD Pipelinessoon
Blockchain and Cryptocurrencysoon
Introduction to Quantum Computingsoon
Ethical Hacking and Penetration Testingsoon
AI Ethics and Responsible Computingsoon

University