Computer Science
Grade 9
University — Year 1
Operators and Expressions→Conditional Statements (if/else)→Loop Control Structures→Functions and Procedures→Arrays and Lists→String Operations→Pointers and References→Variable Scope and Lifetime→Linked Lists→Stacks→Queues→Trees and Binary Trees→Graphs and Graph Traversal→Hash Tables and Hashing→Sorting Algorithms→Searching Algorithms→Divide and Conquer Strategy→Dynamic Programming→Greedy Algorithms→Binary Representation and Number Systems→Boolean Logic and Truth Tables→Logic Gates→CPU Architecture Basics→Memory Hierarchy→Cache Memory→Set Theory→Relations and Functions in Discrete Math→Propositional Logic→Combinatorics Basics→Graph Theory Fundamentals→Number Systems and Conversions→Regular Expressions→SQL Basics and Queries→Relational Database Design→Database Normalization→Database Queries and Joins→OSI Model→TCP/IP Protocol Suite→HTTP and Web Protocols→IP Addressing and Subnetting→Version Control Systems (Git)→Unit Testing and Test-Driven Development→
University — Year 2
Binary Search Trees→AVL Trees→Red-Black Trees→Graph Representations→Depth-First Search (DFS)→Breadth-First Search (BFS)→Dijkstra's Algorithm→Bellman-Ford Algorithm→Topological Sorting→Minimum Spanning Tree→Kruskal's Algorithm→Prim's Algorithm→Longest Common Subsequence→Matrix Chain Multiplication→Quicksort Algorithm→Merge Sort Algorithm→Heapsort Algorithm→Counting Sort Algorithm→Radix Sort Algorithm→Time Complexity Analysis→Space Complexity Analysis→Binary Heaps→Priority Queues→KMP String Matching Algorithm→Boyer-Moore Algorithm→Rabin-Karp Algorithm→Backtracking Algorithms→NP-Completeness→Computational Complexity Classes→Binary Search Algorithm→Recursion and Tail Recursion→Memoization Techniques→0/1 Knapsack Problem→Unbounded Knapsack Problem→Graph Coloring→Maximum Flow and Min-Cut→Ford-Fulkerson Algorithm→Bipartite Graphs→Strongly Connected Components→Coin Change Problem→
University — Year 3
Advanced Sorting Algorithms→Graph Traversal (BFS, DFS)→Shortest Path Algorithms (Dijkstra, Bellman-Ford)→Balanced Trees (AVL, Red-Black)→Hash Tables and Collision Resolution→Heaps and Priority Queues→B-Trees and Indexing→SQL and Relational Database Design→ACID Properties and Transactions→Query Optimization and Execution Plans→Process Management and Scheduling→Virtual Memory and Paging→Concurrency and Threading→Synchronization and Deadlock Prevention→Network Protocols (TCP/IP Stack)→Routing Algorithms and Algorithms→Network Security and SSL/TLS→Cryptography and Encryption Algorithms→Software Design Patterns→Object-Oriented Design Principles→UML and System Modeling→Software Testing Strategies→Automata Theory and Formal Languages→Turing Machines and Computability→Computational Complexity (P, NP, NP-Complete)→Compiler Design and Parsing→REST API Design Principles→Distributed Systems and Consensus→Parallel Computing and GPU Programming→Machine Learning Fundamentals→Natural Language Processing→Computer Graphics and Rendering→Cloud Computing Architecture→Microservices Architecture→DevOps and CI/CD Pipelines→Blockchain and Cryptocurrency→Introduction to Quantum Computing→Ethical Hacking and Penetration Testing→AI Ethics and Responsible Computing→