Apeman Awesome Computer Science Save

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

Project README

Computer Science and Engineering Roadmap and Checklist

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

Computer Science is divided in 4 parts

Discrete MathematicsPDF is necessary for understanding Graphs.

Table of Contents

Computer Science 1

Computer Science 2

Computer Science 3

Computer Science 4

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 and Controllers
    • Input - Output Devices
  • Computer Architecture

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

Theory of Computation and Automata

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
    • Golang reference specificationsIf you want to read an easy specification

Programming

Data Structures

Algorithms

  • Searching
    • Breadth First Search
    • Depth First Search
    • BDFS == BFS + DFS Move in both directions
  • Sorting
    • Merge Sort
    • Quick Sort
    • Insertion Sort
    • Selection Sort
  • Graph Traversal
    • Minimum Spanning Trees
    • Shortest Paths
  • space-time Complexity

Design and Analysis of AlgorithmsOpens in new tab

Artificial Intelligence

Computer Science - 3

DBMS and SQL

FCC quick commands | Graphical view

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
  • IO Scheduling
    • Shortest Seek Time First
    • Disk Scheduling Algorithms
  • File Systems
    • File Allocation Tables.
  • OS Security
    • Firewall
    • Malware and Antiviruses
  • Unix commands

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

Software Engineering

  • Software development models

    • Waterfall
    • Spiral
    • Iterative
    • Agile
  • Software Cost Estimation

  • COCOMO Model

  • Risk Management

  • Software Requirement

    • Software Requirement Specifications
    • Data Flow Diagrams
  • Software Quality

    • ISO standards 9001, 14001
    • SEICMM
    • Six Sigma
  • Software Design

    • Software Design Principles
    • Coupling and Cohesion
    • Object-Oriented Design
    • User Interface Design
  • Testing

Computer Science - 4

You will need these when you make projects

Cryptography and Network Security

Data Science and Machine Learning

Web Development

You can study Web Development from Mozilla Developer Network Website.

Computer Graphics

Not mandatory, just get the overview

After you are done with all this and want to make projects, check out Projects you can make

LICENSE

Mozilla-Public-License

Open Source Agenda is not affiliated with "Apeman Awesome Computer Science" Project. README Source: apeman/awesome_computer_science

Open Source Agenda Badge

Open Source Agenda Rating