Scribd
Upload
6K views2 pages

GATE Formula Sheet

This document is a quick reference formula sheet for GATE CSE, covering key concepts in Engineering Mathematics, Operating Systems, Data Structures & Algorithms, Database Management Systems, Computer Networks, Computer Organization & Architecture, and Theory of Computation. It includes essential formulas, definitions, and performance metrics relevant to each topic. The sheet serves as a concise study aid for exam preparation.

Uploaded by

shreyash0225
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6K views2 pages

GATE Formula Sheet

This document is a quick reference formula sheet for GATE CSE, covering key concepts in Engineering Mathematics, Operating Systems, Data Structures & Algorithms, Database Management Systems, Computer Networks, Computer Organization & Architecture, and Theory of Computation. It includes essential formulas, definitions, and performance metrics relevant to each topic. The sheet serves as a concise study aid for exam preparation.

Uploaded by

shreyash0225
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

GATE CSE Quick Formula Sheet

1. Engineering Mathematics
- Matrices: det(A) = 0 implies singular matrix.
- Eigenvalues: |A - lambda*I| = 0.
- Probability: P(A U B) = P(A) + P(B) - P(A intersection B).
- Bayes' Theorem: P(A|B) = P(B|A) * P(A) / P(B).
- Limits: L'Hopital's Rule: If lim f(x)/g(x) -> 0/0, differentiate numerator and denominator.
- Differentiation: d/dx (x^n) = n*x^(n-1).
- Integration: Integral of x^n dx = (x^(n+1))/(n+1) + C.

2. Operating Systems
- CPU Scheduling: SJF is optimal but may cause starvation.
- Page Replacement: Optimal > LRU > FIFO in performance.
- Deadlock Detection: Wait-for Graph (Cycle = Deadlock).
- Disk Scheduling: SSTF selects shortest seek first.

3. Data Structures & Algorithms


- Sorting Complexities: QuickSort: O(n log n) avg, O(n^2) worst.
- Graphs: Dijkstra (Single Source Shortest Path) = O((V+E) log V).
- Trees: AVL height = O(log n).
- Recursion: T(n) = T(n/2) + O(1) -> O(log n).

4. Database Management Systems


- ACID: Atomicity, Consistency, Isolation, Durability.
- Normalization: BCNF = No partial or transitive dependency.
- SQL Joins: INNER JOIN = Matching rows only.
- Indexing: B+ Tree is used in databases for indexing.

5. Computer Networks
- OSI Layers: Physical, Data Link, Network, Transport, Session, Presentation, Application.
- TCP vs UDP: TCP (Reliable, Connection-Oriented), UDP (Fast, No reliability).
- Subnetting: CIDR Notation: /n -> 2^(32-n) hosts.
- Routing: Dijkstra (Shortest Path First) = O(V log V).

6. Computer Organization & Architecture


- Performance: Speedup = 1 / (1 - F + F/S).
- Cache Mapping: Direct, Associative, Set-Associative.
- Pipelining: Speedup approx. No. of pipeline stages.

7. Theory of Computation
- DFA: Deterministic, one transition per input.
- NFA: Multiple transitions allowed.
- Regular Expressions: A U B = {x | x in A or x in B}.
- Pumping Lemma: Used to prove non-regularity.

You might also like