adi-20 / awesome_computer_science

The complete syllabus of Computer Science and Engineering. Roadmap for Beginners.

Computer Science and Engineering Roadmap and Checklist

This is the complete syllabus of Computer Science and Engineering UG.

Do not get overwhelmed by the long list. This is the roadmap for 4 years of degree course.

You could finish this all in just 1 year with continuity

Computer Science is divided in 4 parts

• Computer Science 1 : Hardware and Engineering part.
• Computer Science 2 : Everything that is required to write Programs.
• Computer Science 3 : Trinity of Computer Science.
• Computer Science 4 : Real Life Applications of CS. This is optional

Discrete Mathematics is necessary for understanding Graphs.

Mathematics is not mandatory but will be of good help while programming

• Mathematics Syllabus can be found here
• It includes everything from High school to Secondary Level.

Table of Contents

Computer Science 1

• Digital Electronics
• Computer Organization and Architecture
• Theory of Computation and Automata

Computer Science 2

• Compiler Design
• Programming
• Data Structures
• Algorithms

Computer Science 3

• DBMS and SQL
• Operating Systems
• Computer Networks

Computer Science 4

• Cryptography
• Artificial Intelligence
• Machine Learning
• Computer Graphics
• Web Dev

Computer Science - 1

Digital Electronics

• Boolean Algebra

  • Number System.
  • Addition, Subtraction.
  • Multiplication, Division.
  • 1's, 2's compliments.
  • k-maps.

• Hardware

  • Logic Gates.
  • Flip-Flops and Latches.
  • Adder - Subtractor.
  • Encoder - Decoder.
  • Multiplexer - Demultiplexer.
  • Integrated Circuits.
  • Printed Circuit Boards.

Computer Organization and Architecture

• Computer Organization

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

• Computer Architecture

  • Stack.
  • Registers.
  • Endian_ness.
  • Floating Point Numbers.
  • Addressing Modes.
  • Pipelining.
  • Interrupts.
  • RISC - CISC.
  • aarch64, Intel_x86, MIPS. (Know the Architectures)
  • Assembly Language. (only basic instructions are enough)

Theory of Computation and Automata

• Automata and Languages
  • NFA - DFA - NDFA.
  • Regular Expressions.
  • Context-Free Languages and Grammers.
  • Pushdown Automata.
  • Turing Machines.
  • Decidability of Languages.
  • Reducibility of Languages.
  • Complexity Theory : P vs NP

Computer Science - 2

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.

Programming

• Learn C

  The language every computer knows.

  • Character constants, escape sequences, and string constants
  • Data types
  • Type conversion
  • Precedence and associativity of operators
  • C identifiers
  • Functions
  • Mathematical functions <Math.h>
  • 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

• C++

  Used in almost everything from Games to Browsers to Machine learning and beyond.

  • Everything C
  • Classes and Objects
  • Member Functions
  • Function Overloading
  • Constructor and Destructors
  • Inheritence
  • Access Controls

• Ruby^Optional

  GitHub is made in Ruby.

  • Basics^Video
  • Learn on Codecademy^{Learn By Doing}

• Python^Optional

  Because Tensorflow, Numpy, Pandas and easy syntax.

  • Official Tutorial^{Prefer this}

Data Structures

• Linked Lists
• Skip Lists^PDF
  • Skip-Lists done right^{Must Read}
• Hash Tables
• stack and queues and sets
• 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
• Graph Traversal
  • Minimum Spanning Trees
  • Shortest Paths
• space-time Complexity

Computer Science - 3

DBMS and SQL

• 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

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
  • Belady’s 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

Computer Science - 4

This is what gets you high paycheck

Cryptography

• Encryption Algorithms
  • DES
  • AES
  • Whirlpool
  • One Time Pad
• Hashing Algorithms
  • SHA family
• Key Distribution
  • RSA
• Digital Signatures
  • Message Digest
• Compression
  • History.

Artificial Intelligence

• Knowledge Representation and Reasoning
• State Space search
• Search
  • Hill Climbing.
  • A*.
  • MinMax.
• Neural Networks
  • See more in Machine Learning.

Machine Learning

• Bias and Variance

• Supervised Learning

  • [Classification]
  • [Regression]

• Un-supervised Learning

  • [Clustering]
  • [k-Nearest Neighbours]

Computer Graphics

Not mandatory but just get the overview

• Concepts and principles

  • Pixels
  • Rendering
  • Shading
  • Texturing
  • Ray Tracing
    • The Best Tutorial out there
    • Kevin's Blog^{Worth visiting}
  • Raycasting

• Image Processing^{Worth learning}

  • Tutorial
  • Transformation and [Translation]

Web Dev

It is highly recommended that you study Web Development from Mozilla Developer Network Website.

• MDN Getting Started Guide

• Front-End

  • HTML5
  • CSS3
  • JavaScript
  • Web Forms
  • Accessibility
  • Tools and Testing
  • [DNS and Domain Names]

• Virtual Reality^{Just for fun}

  • A-Frame^{Web VR framework from Mozilla}

LICENSE

Mozilla-Public-License