Comprehensive Cheat Sheet for Entrance Exam (Layman's Guide)
SECTION 1: MATHEMATICS
1. Determinants & Matrices
• Matrix = Rectangular grid of numbers.
• Determinant (for square matrix): A value you compute (e.g. 2x2: ad - bc)
• Rank = Number of non-zero rows in a matrix after row-reduction (indicates number of independent
equations).
• Inverse exists only if determinant != 0.
• Diagonalizable: A matrix is diagonalizable if it has enough linearly independent eigenvectors.
2. Differential Calculus
• Derivative = Instantaneous rate of change (slope).
• Euler's Theorem: For homogeneous functions (f(tx, ty) = t^n f(x, y)), then: x(df/dx) + y(df/dy) =
n*f(x,y)
3. Multiple Integrals & ODE
• Double Integral: Used to find area/volume in 2D.
• ODE: Equation involving function and its derivatives. Solve using methods like separation of
variables.
4. Complex/Analytic Functions
• Analytic Function: A complex function that’s differentiable.
• Cauchy-Riemann Equations: Used to check if a function is analytic.
5. Numerical Methods
• Newton-Raphson: x1 = x0 - f(x0)/f'(x0)
• Used for approximating roots.
6. Probability & Statistics
• Probability: Chances of an event happening.
• Mean = Average, Median = Middle, Mode = Most frequent
7. Vector Calculus
• Gradient (\u2207f): Shows direction of greatest increase.
1
• If \u2207\u03d5 is given, integrate to find \u03d5 (potential).
SECTION 2: Programming Methodology & SWE
Basic Concepts
• Modular programming: Break into smaller functions/modules.
• Debugging: Finding and fixing errors (syntax, logical, runtime).
Software Engineering
• SDLC models: Waterfall, Agile, Spiral.
• UML: Diagrams for software design (e.g. class diagram).
• Testing: Unit -> Integration -> System
• Design Patterns: Solutions to common coding problems (Singleton, Observer, etc.)
SECTION 3: Data Structures & Algorithms
Arrays, Linked Lists
• Array: Fixed size, fast access.
• Linked List: Dynamic, slow access.
Stack & Queue
• Stack: LIFO (Last In First Out)
• Used for recursion, backtracking.
• Queue: FIFO (First In First Out)
Trees
• Binary Tree: Each node has at most 2 children.
• Traversal: Inorder, Preorder, Postorder.
• BST: Left < Root < Right
• AVL Tree: Self-balancing BST.
Algorithms
• Sorting:
• Bubble: O(n^2)
• Insertion: O(n^2)
• Merge/Quick: O(n log n)
2
• Searching:
• Linear: O(n), Binary: O(log n)
Recurrence & Complexity
• Master Theorem: For T(n) = aT(n/b) + f(n)
• Time Complexity: How time grows with input size.
Graph Algorithms
• Shortest Path: Dijkstra
• MST: Prim's, Kruskal
Hashing
• Hash Table: Fast data access (average O(1))
SECTION 4: Database Systems
Basics
• DBMS: Manages data.
• Data Models: ER, Relational
ER Diagram
• Entity: Object
• Attribute: Property
• Relationship: Connection between entities
SQL
• DDL: CREATE, DROP
• DML: SELECT, INSERT, UPDATE
• Joins: Combine tables
• Subqueries: Queries within queries
Normalization
• Remove redundancy.
• 1NF: Atomic values
• 2NF: No partial dependency
• 3NF: No transitive dependency
• BCNF > 3NF
3
Transactions
• ACID properties
• Concurrency: Locking, Timestamp
• Recovery: Logs, checkpoints
SECTION 5: Operating Systems
Process & Threads
• Process: Running program
• Thread: Lightweight process
Scheduling
• FCFS, SJF, RR, Priority
• Dispatcher: Assigns CPU
Deadlock
• Circular wait, hold & wait, mutual exclusion, no preemption
• Avoidance: Banker's algorithm
Memory Management
• Paging, segmentation
• Virtual Memory: Uses disk
• Page Fault: Page not in memory
File System
• Fragmentation, directories
SECTION 6: Computer Networks
OSI Layers
1. Physical
2. Data Link (Framing, MAC)
3. Network (IP, Routing)
4. Transport (TCP/UDP)
5. Session
4
6. Presentation
7. Application (HTTP, FTP)
IP Addressing
• IPv4: 32-bit
• Subnetting: Dividing network
Protocols
• TCP: Reliable
• UDP: Fast, no guarantee
• HTTP/FTP/DNS/SMTP: Application layer
Routing
• Static vs Dynamic
• RIP, BGP, OSPF
SECTION 7: Computer Architecture
Number Systems
• Binary, Decimal, Hex
• Conversion between them
Boolean Algebra
• AND, OR, NOT, NAND, NOR
• Minimization using K-maps
Circuits
• Combinational: Output only current input
• Sequential: Depends on past (Flip Flops)
Instruction Set
• MOV, ADD, SUB, JMP
Pipelining
• Stages: IF, ID, EX, MEM, WB
• Hazards: Structural, Data, Control
5
Memory Hierarchy
• Registers > Cache > RAM > Disk
I/O
• Interrupt, DMA (Direct Memory Access)
This cheat sheet gives you key concepts, terms, formulas and common-sense explanations to solve most
MCQs. Use logic + elimination when confused. Good luck!
