GATE CSE
First time here? Checkout the FAQ!
x
1,531 views

CS  Computer Science and Information Technology



Section1: Engineering Mathematics   
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial
orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:
counting, recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues  and
eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value
theorem. Integration.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial
distributions. Mean, median, mode and standard deviation. Conditional probability and
Bayes theorem.



Section 2: Digital Logic
Boolean  algebra. Combinational and sequential circuits. Minimization. Number
representations and computer arithmetic (fixed and floating point).



Section 3: Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction
pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O
interface (interrupt and DMA mode).



Section 4: Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search
trees, binary heaps, graphs.  



Section 5: Algorithms
Searching, sorting, hashing. Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
Graph search, minimum spanning trees, shortest paths.



Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down
automata. Regular and contex-free languages, pumping lemma. Turing machines and
undecidability.  



Section 7: Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate
code generation.



Section 8: Operating System
Processes, threads, inter‐process communication, concurrency and synchronization.
Deadlock. CPU scheduling. Memory management and virtual memory. File systems.


Section 9: Databases
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,
normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and
concurrency control.



Section 10: Computer Networks
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,
switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP
and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
Basics of Wi-Fi. Network security: authentication, basics of public key and private key
cryptography, digital signatures and certificates, firewalls.

posted Dec 27, 2016 in Preparation Advice by Veteran (18,255 points)  
edited Dec 27, 2016 by | 1,531 views

6 Comments

Thank you sir.
Sir where are habib's sir notes?

Plz give the link.

Sir in network I was solving Tannenbaum. It is okay? Sir especially in cryptography it's given too much and it's hard to memorize all that. Facing difficulties
I also want Habib sirs notes. He is great
Thank you..I have posted some of them in gate computer science group of fb
send the link please
Top Users Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,033 answers
52,725 comments
20,276 users