1.

​Unit 1: Discrete
6. Graph Theory
Structures and
●​ Types of Graphs: Directed,
Optimization Undirected, Weighted, Bipartite
●​ Degree, Path, Cycle, Connectivity
●​ Eulerian & Hamiltonian Graphs
1. Mathematical Logic ●​ Graph Colouring
●​ Trees, Spanning Trees (Prim’s &
●​ Propositional and Predicate Logic
Kruskal’s algorithms)
●​ Logical Equivalences
●​ Normal Forms (CNF, DNF)
●​ Rules of Inference
●​ Validity, Consistency, Soundness 7. Boolean Algebra
●​ Boolean Functions and
Expressions
2. Set Theory ●​ Logic Gates, Truth Tables
●​ Simplification using Laws
●​ Venn Diagrams
●​ Karnaugh Maps (K-Map)
●​ Set Operations
●​ Power Sets, Cartesian Products
●​ Inclusion-Exclusion Principle
8. Group Theory (Basics)
●​ Groups, Rings, Fields (Basic
3. Relations and Functions Properties Only)
●​ Types of Relations (Reflexive,
Symmetric, Transitive)
●​ Equivalence and Partial Order 9. Optimization Techniques
Relations ●​ Linear Programming: Graphical
●​ Closures and Representations & Simplex Method
●​ Types of Functions (Injective, ●​ Integer Linear Programming
Surjective, Bijective) ●​ Duality Concept
●​ Composition and Inverse of ●​ Project Scheduling: PERT &
Functions CPM

4. Counting & Combinatorics

●​ Permutations and Combinations
●​ Pigeonhole Principle
●​ Principle of Inclusion and
Exclusion
●​ Mathematical Induction

5. Probability
●​ Basic Probability Rules
●​ Conditional Probability
●​ Bayes’ Theorem
 Unit 2: Computer System ●​ Instruction Cycle: Fetch, Decode,
Execute
Architecture ●​ Hardwired vs Microprogrammed
Control Unit

1. Digital Logic Circuits

5. Central Processing Unit (CPU)
●​ Logic Gates (AND, OR, NOT,
NAND, NOR, XOR, XNOR) ●​ Stack Organization
●​ Boolean Expressions and ●​ General Register Organization
Simplification ●​ Instruction Pipelining and Hazards
●​ Combinational Circuits: Adders, ●​ RISC vs CISC Architecture
Subtractors, Multiplexers,
Encoders, Decoders
●​ Sequential Circuits: Flip-Flops (SR, 6. Memory Organization
D, JK, T), Counters, Registers
●​ Finite State Machines (Moore and ●​ Memory Hierarchy: Registers,
Mealy) Cache, Main Memory, Secondary
Storage
●​ Cache Memory: Mapping
2. Data Representation Techniques (Direct, Associative,
Set-Associative)
●​ Number Systems: Binary, Octal, ●​ Virtual Memory: Paging,
Decimal, Hexadecimal Segmentation, TLB
●​ Conversion between Number ●​ Memory Management Techniques
Systems
●​ Signed Numbers: 1’s and 2’s
Complement 7. Input-Output Organization
●​ Binary Arithmetic: Addition,
Subtraction, Multiplication, Division ●​ I/O Interface and Modes:
●​ Floating Point Representation Programmed, Interrupt Driven,
(IEEE 754 Standard) DMA
●​ Error Detection and Correction ●​ Interrupt Architecture and Priority
Codes (Parity, Hamming Code) ●​ I/O Processors

3. Register Transfer and

Micro-operations
●​ Register Transfer Language
●​ Bus and Memory Transfers
●​ Arithmetic, Logical, and Shift
Micro-operations

4. Basic Computer Organization

●​ Instruction Formats: Zero, One,
Two, and Three Address
Instructions
●​ Addressing Modes: Immediate,
Direct, Indirect, Indexed
 ●​ Stack and Heap Allocation
●​ Garbage Collection
Unit 3: Programming ●​ Static vs Dynamic Allocation

Languages and 7. Syntax and Semantics

Computer Graphics ●​ Backus-Naur Form (BNF)

●​ Abstract Syntax Trees
●​ Attribute Grammars
Part A: Programming Languages
1. Programming Paradigms Part B: Computer Graphics
●​ Procedural Programming (C, 1. Graphics Basics
Pascal)
●​ Object-Oriented Programming ●​ Applications of Computer Graphics
(Java, C++) ●​ Raster vs Vector Graphics
●​ Functional Programming (LISP, ●​ Resolution and Aspect Ratio
Scheme, Haskell) ●​ Graphics Pipeline
●​ Logic Programming (Prolog) 2. 2D Graphics
2. Language Translators ●​ Line Drawing Algorithms (DDA,
●​ Interpreters’ vs Compilers Bresenham)
●​ Assemblers and Linkers ●​ Circle Drawing Algorithms
●​ Loader Functions (Midpoint)
●​ Lexical Analysis, Syntax Analysis ●​ Transformations: Translation,
Scaling, Rotation, Shearing
3. Data Types and Structures ●​ Matrix Representation of
Transformations
●​ Primitive and Composite Data
●​ Clipping Algorithms
Types
(Cohen–Sutherland, Liang–Barsky)
●​ Static vs Dynamic Typing
●​ Type Checking and Type 3. 3D Graphics
Conversion (implicit/explicit)
●​ Pointers and References ●​ 3D Transformations: Translation,
Rotation, Scaling
4. Control Structures ●​ Projections: Parallel and
Perspective
●​ Sequence, Selection (if/switch),
●​ Viewing Transformations
Iteration (for, while)
●​ Hidden Surface Removal (Z-buffer)
●​ Recursion
●​ Exception Handling 4. Rendering Techniques
5. Procedures and Functions ●​ Shading: Flat, Gouraud, Phong
●​ Ray Tracing Basics
●​ Call by Value vs Call by Reference
●​ Illumination Models (Ambient,
●​ Parameter Passing Mechanisms
Diffuse, Specular)
●​ Scope and Lifetime (Static,
Dynamic Scoping) 5. Color Models
●​ Closures and Lambdas
●​ RGB, CMY, HSI
●​ Color Transformations and
Interpolation
6. Memory Management
 5. Normalization & Design
Unit 4: Database
●​ Functional Dependencies
Management Systems ●​ Normalization: 1NF, 2NF, 3NF,
(DBMS) BCNF, 4NF
●​ Decomposition and Lossless Join
●​ Dependency Preservation
1. Database Concepts
●​ Database vs File Systems 6. Transaction Management
●​ DBMS Architecture: 1-tier, 2-tier,
3-tier ●​ ACID Properties
●​ Data Models: Hierarchical, ●​ Transaction States
Network, Relational, ●​ Serializability: Conflict & View
Object-Oriented Serializability
●​ Schemas and Instances ●​ Schedules: Precedence Graph,
●​ Data Independence: Logical & Cascading Rollback
Physical

7. Concurrency Control
2. Entity-Relationship (ER) Model ●​ Lock-based Protocols: 2PL,
●​ Entities, Attributes, Relationships Timestamp Ordering
●​ Types of Attributes: Simple, ●​ Deadlock Handling: Detection,
Composite, Multivalued, Derived Prevention, Avoidance
●​ ER to Relational Mapping ●​ Wait-Die & Wound-Wait Protocols
●​ Specialization, Generalization,
Aggregation
●​ Weak Entities 8. Recovery Techniques
●​ Log-Based Recovery
●​ Checkpointing
3. Relational Model ●​ Deferred & Immediate Update
●​ Relational Algebra: Selection, ●​ Shadow Paging
Projection, Union, Intersection, 9. Indexing & File Organization
Cartesian Product, Join, Division
●​ Tuple & Domain Relational ●​ Indexing: Single-level, Multi-level,
Calculus B+ Trees, Hash Indexing
●​ Keys: Primary, Candidate, Foreign, ●​ File Organization: Sequential,
Super Keys Hashed, Clustered
●​ Integrity Constraints: Domain,
10. Advanced Topics (Basics Only)
Entity, Referential
●​ Distributed Databases
4. SQL (Structured Query Language)
●​ NoSQL (Key-Value, Document,
●​ DML, DDL, DCL, TCL Graph)
●​ Basic Queries, Subqueries, Joins ●​ Data Warehousing & Mining
●​ Aggregate Functions: COUNT, (Basics)
SUM, AVG, etc.
●​ GROUP BY, HAVING, ORDER BY
●​ Views, Indexes, Triggers
 ●​ PCB (Process Control Block)
Unit 5: System Software ●​ Context Switching
and Operating Systems ●​ Interprocess Communication (IPC):
Shared Memory, Message Passing
3. CPU Scheduling
Part A: System Software
●​ Scheduling Criteria: Throughput,
Turnaround Time, Waiting Time,
etc.
1. Language Processors
●​ Algorithms: FCFS, SJF, Round
●​ Compiler, Assembler, Interpreter: Robin, Priority Scheduling
Differences and Functions ●​ Pre-emptive vs non-pre-emptive
●​ Phases of a Compiler: Lexical,
4. Deadlocks
Syntax, Semantic, Intermediate
Code Generation, Optimization, ●​ Conditions for Deadlock
Code Generation ●​ Resource Allocation Graph
●​ Symbol Table, Error Handling ●​ Deadlock Prevention, Avoidance
(Banker's Algorithm), Detection,
2. Assemblers
and Recovery
●​ Pass-1 and Pass-2 of an
5. Memory Management
Assembler
●​ Intermediate Code Forms ●​ Contiguous Allocation
●​ Forward Referencing ●​ Paging, Segmentation
●​ Virtual Memory: Demand Paging,
3. Loaders and Linkers
Page Faults
●​ Absolute and Relocating Loaders ●​ Page Replacement Algorithms:
●​ Linking and Relocation FIFO, LRU, Optimal
●​ Dynamic Linking ●​ Thrashing
●​ Bootstrap Loader
6. File Systems
4. Macro Processors
●​ File Attributes, Operations, Types
●​ Macro Definition and Expansion ●​ File Allocation Methods:
●​ Nested Macros and Macro Contiguous, Linked, Indexed
Parameters ●​ Directory Structure: Single-Level,
Two-Level, Tree
●​ File Access Permissions
Part B: Operating Systems 7. I/O Systems
●​ I/O Hardware and Software
1. Basics of Operating System ●​ Interrupts, Polling, DMA
●​ Disk Scheduling Algorithms: FCFS,
●​ Functions of OS SSTF, SCAN, C-SCAN
●​ Types: Batch, Time-Sharing,
Real-Time, Distributed, Network, 8. Security & Protection
Mobile OS ●​ Authentication and Authorization
●​ Kernel, Shell, System Calls ●​ Access Control Matrix
2. Process Management ●​ Encryption Basics
●​ Protection Mechanisms
●​ Process vs Thread
●​ Process States and Transitions
 ●​ Unit Testing
Unit 6: Software ●​ Integration Testing
Engineering ●​ System Testing
●​ Acceptance Testing
●​ White-Box (Control Flow, Path
Testing)
1. Software Development Life Cycle
●​ Black-Box (Equivalence Class,
(SDLC)
Boundary Value)
●​ Phases: Requirement Analysis → ●​ Debugging and Fault Classification
Design → Implementation →
Testing → Deployment →
Maintenance 5. Software Quality & Metrics
SDLC Models: ●​ Product and Process Quality
●​ McCall’s Quality Model, ISO 9126
●​ Metrics: LOC (Lines of Code),
●​ Waterfall Model Cyclomatic Complexity, Function
●​ Spiral Model Point Analysis, Halstead Metrics
●​ Incremental & Iterative Models
●​ V‑Model
●​ Agile (Scrum, XP) 6. Project Management
●​ Project Planning
●​ Effort Estimation Models:
2. Software Requirements
●​ COCOMO I & II
●​ Types: Functional vs ●​ Putnam Model
Non-Functional ●​ Work Breakdown Structure (WBS)
●​ Requirement Elicitation ●​ Scheduling: Gantt Chart, PERT,
Techniques: Interviews, Surveys, CPM
Use Cases
●​ SRS (Software Requirements
Specification) 7. Configuration and Risk
●​ Requirements Validation Management
●​ Version Control
●​ Change Management
●​ Risk Identification, Assessment,
3. Software Design Mitigation

●​ Modular Design
●​ Cohesion & Coupling
●​ Function-Oriented Design (DFD,
Structure Charts)
●​ Object-Oriented Design (Class
diagrams, Interaction diagrams –
UML basics)
●​ Design Patterns: Singleton,
Factory, Observer (basic
awareness)
Unit 7: Data Structures
4. Software Testing
and Algorithms
 ●​ Greedy Algorithms
●​ Activity Selection, Huffman Coding,
1. Linear Data Structures
Kruskal, Prim
●​ Arrays: Static vs Dynamic Arrays, ●​ Divide and Conquer
Insertion, Deletion, Traversal ●​ Merge Sort, Quick Sort, Binary
●​ Stacks: Push, Pop, Peek, Search
Applications: Expression ●​ Dynamic Programming
Evaluation (Infix ↔ Postfix), ●​ 0/1 Knapsack, Matrix Chain
Recursion Multiplication, Longest Common
●​ Queues: Simple, Circular, Subsequence (LCS),
Double-Ended (Deque), Priority Floyd-Warshall
Queues ●​ Backtracking
●​ N-Queens, Sudoku Solver

2. Non-Linear Data Structures

4. Complexity Analysis
●​ Linked Lists
●​ Time and Space Complexity
​ Singly, Doubly, Circular ●​ Big O, Ω (Omega), Θ (Theta)
​ Insertion, Deletion, Traversal Notation
●​ Best, Average, Worst Case
●​ Trees ●​ Asymptotic Analysis of Algorithms
​ Binary Trees, Binary Search Trees ●​ Recurrence Relations (T(n))
●​ Master’s Theorem
(BST)
●​ Substitution Method
​ AVL Trees (Rotations, Balance
Factor)
5. Searching and Sorting Algorithms
​ B and B+ Trees (Used in DBMS)
●​ Sorting: Bubble, Insertion,
​ Tree Traversals: Inorder, Preorder, Selection, Merge, Quick, Heap
Postorder ●​ Searching: Linear, Binary
●​ Hashing
​ Heap (Min/Max): Insertion,
●​ Hash Functions
Deletion, Heapify ●​ Collision Resolution: Chaining,
●​ Graphs Open Addressing (Linear,
​ Representations: Adjacency Quadratic, Double Hashing)

Matrix/List
​ Traversal: BFS, DFS

​ Minimum Spanning Trees: Prim’s,

Kruskal’s
​ Shortest Path: Dijkstra,
Bellman-Ford
​ Topological Sorting

3. Algorithm Design Techniques

 ●​ Closure Properties
Unit 8: Theory of ●​ Decidability and Undecidability
Computation (TOC) & Part B: Compiler Design
Compiler Design 1. Phases of Compiler
Part A: Theory of Computation (TOC)
●​ Lexical Analysis: Tokens,
1. Formal Languages Lexemes, Regular Expressions
●​ Syntax Analysis (Parsing): Parse
●​ Alphabet, String, Language
Trees, Derivations
●​ Operations on Languages: Union,
●​ Semantic Analysis: Type Checking,
Concatenation, Kleene Closure
Symbol Table
●​ Grammar Types (Chomsky
●​ Intermediate Code Generation:
Hierarchy):
Three-address code
​ Type 0: Unrestricted ●​ Code Optimization: Peephole,
Loop Optimization
​ Type 1: Context-Sensitive ●​ Code Generation: Target Code,
Register Allocation
​ Type 2: Context-Free
2. Lexical Analysis
​ Type 3: Regular Grammars
●​ Lexical Analyzer (Scanner)
2. Finite Automata ●​ Finite Automata Based Scanning
●​ Token Generation and Patterns
●​ Deterministic Finite Automata ●​ Regular Expressions to DFA
(DFA)
●​ Non-Deterministic Finite Automata 3. Syntax Analysis Parsing Techniques
(NFA)
●​ Top-Down Parsing (Recursive
●​ Conversion between NFA & DFA
Descent, LL(1))
●​ Minimization of DFA
●​ Bottom-Up Parsing (LR(0), SLR,
●​ Regular Expressions ↔ Finite
LALR)
Automata
●​ FIRST and FOLLOW sets
●​ Applications in Lexical Analysis
●​ Parse Trees and Derivations
3. Pushdown Automata (PDA) ●​ Left Recursion and Left Factoring

●​ Design of PDA for Context-Free 4. Syntax-Directed Translation

Languages
●​ SDD & SDT
●​ Deterministic and
●​ Postfix Code Generation
Non-Deterministic PDA
●​ Inherited and Synthesized
4. Turing Machines Attributes

●​ Basic Model and Working 5. Runtime Environment

●​ Variants: Multi-Tape,
●​ Activation Records
Non-Deterministic TM
●​ Call Stack and Recursion
●​ Recursive and Recursively
●​ Static vs Dynamic Scoping
Enumerable Languages
●​ Church-Turing Thesis 6. Code Optimization
5. Language Properties and ●​ Loop Invariant Code Motion
Computability ●​ Dead Code Elimination
●​ Common Subexpression
●​ Pumping Lemma (Regular and
Elimination
Context-Free Languages)
 4. Network Layer
Unit 9: Computer
●​ IP Addressing (IPv4, IPv6)
Networks and Data
Classes, Subnetting, Supernetting
Communication
●​ Routing Algorithms:
1. Basics of Computer Networks
Distance Vector
●​ Types of Networks: LAN, MAN,
WAN Link State (Dijkstra)
●​ Network Topologies: Bus, Star,
RIP, OSPF, BGP
Ring, Mesh, Hybrid
●​ OSI Reference Model (7 layers – ●​ Switching Techniques:
functions and protocols)
●​ TCP/IP Model (4 layers) Circuit Switching
●​ Transmission Media: Wired Packet Switching
(Twisted Pair, Coaxial, Fiber
Optic), Wireless (Radio, Message Switching
Microwave, Satellite) ●​ Protocols:
2. Data Communication IP, ICMP, ARP, RARP
●​ Components: Message, Sender, NAT, DHCP
Receiver, Medium, Protocol
●​ Transmission Modes: Simplex, 5. Transport Layer
Half Duplex, Full Duplex
●​ UDP vs TCP
●​ Analog vs Digital Transmission
●​ Port Addressing
●​ Bandwidth, Data Rate, Baud Rate
●​ Flow and Error Control
●​ Error Detection & Correction
●​ Connection Establishment
​ Parity Bit (Three-way Handshake)
●​ Congestion Control: AIMD, Slow
​ CRC (Cyclic Redundancy Check) Start, Fast Recovery
​ Hamming Code 6. Application Layer Protocols:

3. Data Link Layer ●​ HTTP/HTTPS

●​ FTP, TFTP
●​ Framing ●​ SMTP, POP3, IMAP
●​ Flow Control: Stop-and-Wait, ●​ DNS
Sliding Window ●​ Client-Server and Peer-to-Peer
●​ Error Control: ARQ (Automatic Models
Repeat Request), Stop-and-Wait ●​ Web Services and APIs (basic
ARQ, Go-Back-N, Selective overview)
Repeat
●​ Protocols: HDLC, PPP 7. Network Security
●​ MAC Protocols: ●​ Cryptography Basics: Symmetric
​ ALOHA (Pure, Slotted) vs Asymmetric
●​ Public Key Infrastructure (PKI)
​ CSMA, CSMA/CD (Ethernet) ●​ Authentication Methods
●​ Firewalls, VPNs, IDS/IPS
​ Token Passing ●​ SSL/TLS
●​ Malware, Phishing, DoS/DDoS
Attacks
 ●​ Unsupervised Learning: Clustering
Unit 10: Artificial (K-Means)
Intelligence (AI) ●​ Basic Neural Networks: Perceptron
●​ Overfitting, Underfitting
●​ Cross-validation (basic idea)
1. Introduction to AI
●​ Definition, History, and Evolution of 6. Planning and Expert Systems
AI
●​ Turing Test & Rational Agent ●​ STRIPS, Planning Graphs
●​ Applications: Robotics, NLP, ●​ Expert System Architecture
Vision, Expert Systems, Gaming ●​ Inference Engine and Knowledge
Base

2. Problem Solving
7. Natural Language Processing (NLP)
●​ State Space Search
●​ Uninformed Search: BFS, DFS, ●​ Syntax vs Semantics
Uniform Cost ●​ Tokenization, Stemming,
●​ Informed Search: Best First Lemmatization
Search, A\, Hill Climbing ●​ POS Tagging
●​ Heuristics and Evaluation ●​ Parsing
Functions ●​ Basic Chatbot Design Concepts

3. Knowledge Representation 8. Robotics (Overview)

●​ Propositional Logic ●​ Path Planning

●​ Predicate Logic (FOPL) ●​ Perception and Motion Planning
●​ Unification and Resolution ●​ Sensor Fusion
●​ Semantic Networks
●​ Frames and Ontologies

4. Reasoning
●​ Forward and Backward Chaining
●​ Rule-Based Systems
●​ Probabilistic Reasoning:
​ Bayes Theorem

​ Bayesian Networks

​ Fuzzy Logic and Reasoning

5. Machine Learning (Intro Level)

●​ Supervised Learning: Linear
Regression, Classification