Scribd
Upload
20 views3 pages

Gate Syllabus

The document outlines 11 topics related to computer science and engineering. These topics include computer networks, organization, digital logic, theory of computation, databases, compilers, operating systems, programming, algorithms, mathematics, and general aptitude. Each topic provides details on key concepts and subtopics to cover.

Uploaded by

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

Gate Syllabus

The document outlines 11 topics related to computer science and engineering. These topics include computer networks, organization, digital logic, theory of computation, databases, compilers, operating systems, programming, algorithms, mathematics, and general aptitude. Each topic provides details on key concepts and subtopics to cover.

Uploaded by

anointlepcha25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

 01

Computer Networks
o Concept of layering: OSI and TCP/IP Protocol Stacks
o Basics of the packet, circuit, and virtual circuit-switching
o Datalink layer: framing, error detection,
o Medium Access Control
o Ethernet bridging; Routing protocols: shortest path, flooding, distance vector, and
link-state routing
o Fragmentation and IP addressing, IPv4, CIDR notation
o Basics of IP support protocols (ARP, DHCP, ICMP)
o Network Address Translation (NAT)
o Transport layer: flow control and congestion control, UDP, TCP, sockets
o Application layer protocols: DNS, SMTP, HTTP, FTP, Email.
o COMPLETE PDF STRUCTURE
 02
Computer Organization and Architecture
o Machine instructions and addressing modes.
o ALU,data‐path, and control unit.
o Instruction pipelining, pipeline hazards.
o Memory hierarchy: cache, main memory, and secondary storage;
o I/O interface
o COMPLETE PDF STRUCTURE
 03
Digital Logic
o Number System
o Boolean algebra. Combinational and sequential circuits.
o Minimization.
o Number representations and computer arithmetic (fixed and floating-point).
o COMPLETE PDF STRUCTURE
 04
Theory of Computation

o Regular expressions and finite automata.

o Context-free grammars and push-down automata.


o Regular and context-free languages, pumping lemma.
o Turing machines and undecidability.
o COMPLETE PDF STRUCTURE
 05
Database Management Systems
o ER ‐ model.
o Relational model: relational algebra, tuple calculus, SQL.
o Integrity constraints, normalization.
o File organization
o Indexing
o Transactions and concurrency control.
o COMPLETE PDF STRUCTURE
 06
Compiler Design
o Lexical analysis, parsing, syntax-directed translation.
o Runtime environments.
o Intermediate code generation.
o Local optimization
o Data flow analyses: constant propagation, liveness analysis
o Common subexpression elimination.
o COMPLETE PDF STRUCTURE
 07
Operating System
o System calls, processes, threads, inter‐process communication
o Concurrency and synchronization.
o Deadlock. CPU and I/O scheduling.
o Memory management and virtual memory.
o File systems.
o COMPLETE PDF STRUCTURE
 08
Programming and Data Structures
o Programming in C.
o Recursion.
o Arrays, stacks, queues, linked lists, trees, binary search trees,binary heaps, graphs.
 09
Algorithms
o Searching, sorting, hashing.
o Asymptotic worst case time and space complexity.
o Algorithm design techniques: greedy, dynamic programming and
divide‐and‐conquer.
o Graph traversals, minimum spanning trees, shortest paths.
 10
Engineering Mathematics
1. Calculus
 Limits, continuity, and differentiability.
 Maxima and minima. Mean value theorem.
 Integration.
2. Linear Algebra
 Matrices & determinants
 system of linear equations
 eigenvalues and eigenvectors
 LU decomposition.
3. Probability and Statistics
 Random variables.
 Uniform, normal, exponential, Poisson, and binomial distributions.
 Mean, median, mode, and standard deviation.
 Conditional probability and Bayes theorem.
4. Discrete Mathematics
 Propositional and first-order logic.
 Sets, relations, functions, partial orders, and lattices
 Monoids, Groups. Graphs: connectivity, matching, coloring.
Combinatorics: counting, recurrence relations, generating functions.
COMPLETE PDF STRUCTURE
 11
General Aptitude

o Numerical Ability

o Verbal Ability

You might also like