awesome_computer_science

A detailed syllabus of computer science. Roadmap computer science degree.

This syllabus is structured in Top Down approach for maximum productivity. You can start seeing the results of your learning as you progress through the course by building small programs and steadily learning the advanced details.

If you want the bottom up approach (College format), please visit This repository If you have pull requests, please do in This repository

When you are done learning a subject, you can practice the Project Ideas mentioned here

Table of Contents

• Programming

• Data Structures

• Algorithms

• Compiler Design

• Computer Organization and Architecture

• Operating Systems

• Computer Networks

• SQL and DBMS

Remaining syllabus and other applications are here

Programming

• [ ] Learn C
  • [ ] Character constants, escape sequences, string constants
  • [ ] Data types and Type conversion
  • [ ] Precedence and associativity of operators
  • [ ] Functions
  • [ ] storage class and variable scope
  • [ ] if, for, while, switch_case
  • [ ] break, continue, goto
  • [ ] Arrays, Strings, Pointers
  • [ ] Structs, Union, enum, typedef
  • [ ] Header files, #MACROS
  • [ ] malloc, calloc, realloc, argc argv
  • [ ] file iO, streams
  • [ ] <Math.h>

Data Structures

• [ ] Linked Lists
• [ ] Skip Lists^PDF
• [ ] stack and queues and sets
• [ ] Hash Tables
• [ ] Trees and Tries
  • [ ] Self Balancing Trees
  • [ ] n-ary Trees
  • [ ] 2-3 Trees
• [ ] Graphs
  • [ ] Adjacency matrix vs Adjacency list

Algorithms

• [ ] Searching
  • [ ] Breadth First Search
  • [ ] Depth First Search
• [ ] Sorting
  • [ ] Merge Sort
  • [ ] Quick Sort
  • [ ] Insertion Sort
  • [ ] Selection Sort
• [ ] Graph Traversal
  • [ ] Minimum Spanning Trees
  • [ ] Shortest Paths
• [ ] space-time Complexity
• [ ] Computational Geometry
  • [ ] Convex Hull
  • [ ] Concave Hull

Compiler Design

• [ ] Compiler Design
  • [ ] Lexical analysis
  • [ ] Syntax analysis
  • [ ] Type Checking
  • [ ] Intermediate code generation
  • [ ] Machine code generation
  • [ ] Assembly and linking
  • [ ] Analysis and optimisation
  • [ ] Memory management
  • [ ] Interpreters

Computer Organization and Architecture

• [ ] Computer Organization

  • [ ] Address Bus, Data Bus
  • [ ] ROM, EPROM, RAM
  • [ ] Memory Hierarchy, Cache Memory, Virtual Memory
  • [ ] Secondary Storage
  • [ ] Programmable Logic Devices and Controllers
  • [ ] Input - Output Devices

• [ ] Computer Architecture

  • [ ] Stack
  • [ ] Registers
  • [ ] Endian_ness
  • [ ] Floating Point Numbers
  • [ ] Addressing Modes
  • [ ] Pipelining
  • [ ] Interrupts
  • [ ] RISC - CISC
  • [ ] aarch64, Intel_x86 / AMD64, MIPS / RISC-V (learn the differences)
  • [ ] Assembly Language (basic instructions)

Operating Systems

• [ ] The Boot Process
• [ ] Processes and Threads
  • [ ] Process Control Block
  • [ ] Dispatcher and Scheduler
• [ ] Inter Process Communication
  • [ ] Mesage Passing
  • [ ] Shared Memory
• [ ] Scheduling Algorithms
  • [ ] Round Robin.
  • [ ] Shortest Remaining Time First.
  • [ ] Least Recently Used.
• [ ] Deadlocks
  • [ ] MutEx and Locks
  • [ ] Semaphores
  • [ ] Banker's Algorithm
• [ ] Memory Management
  • [ ] Paging and Page tables
  • [ ] Segmentation
  • [ ] First Fit, Next Fit, Best Fit
  • [ ] Non-continuous Allocation
• [ ] Virtual memory
  • [ ] Page Faults
  • [ ] Page Replacement Algorithms
  • [ ] Beladys Anomaly
• [ ] File Systems
  • [ ] File Allocation Tables.
  • [ ] Disk Scheduling Algorithms

Computer Networks

• [ ] Layers of TCP and OSI

  • [ ] Application.
  • [ ] Presentation.
  • [ ] Session.
  • [ ] Transport.
  • [ ] Network.
  • [ ] Data.
  • [ ] Physical.

• [ ] Flow Control

  • [ ] Flow Control
  • [ ] Congestion Control
  • [ ] Error Control

• [ ] Routers and Routing Algorithms

  • [ ] DHCP and static routing
  • [ ] Round Robin and others
  • [ ] DHCP | ICMP

• [ ] UDP and Sockets

• [ ] IPv4 | IPv6

• [ ] Application Layer Protocols

  • [ ] HTTP | FTP
  • [ ] DNS | SMTP
  • [ ] Email MIME Types | POP | IMAP

• [] How routers work

SQL and DBMS

• [ ] SQL

  • [ ] Data Definition Language
    • [ ] CREATE
    • [ ] DROP
    • [ ] ALTER
    • [ ] TRUNCATE
  • [ ] Data Query Language
    • [ ] SELECT
  • [ ] Data Manipulation Language
    • [ ] INSERT
    • [ ] UPDATE
    • [ ] DELETE
  • [ ] Data Control Language
    • [ ] GRANT
    • [ ] REVOKE
  • [ ] Transction Control Language
    • [ ] COMMIT
    • [ ] ROLLBACK
    • [ ] SAVEPOINT
  • [ ] JOINS
    • [ ] FULL OUTER JOIN
    • [ ] LEFT JOIN
    • [ ] RIGHT JOIN
    • [ ] NATURAL JOIN
    • [ ] LEFT OUTER JOIN
    • [ ] RIGHT OUTER JOIN

• DataBase Management Systems

  • Entity-Relationship model.
  • [ ] Integrity Constraints
    • [ ] Primary Key and Foreign key
    • [ ] Composite keys
    • [ ] All other types of keys
  • [ ] Normal Forms : 1NF to 4 NF
  • [ ] File Organization.
  • [ ] Indexing (B- Trees and B+ Trees)
  • [ ] Transactions and Concurrency Control
    • [ ] Conflict Serializability
    • [ ] Locking
    • [ ] ACID | BASE

• [ ] Redis

LICENSE

Mozilla-Public-License