0% found this document useful (0 votes)
46 views3 pages

GATE CSE Exam Syllabus Overview

The GATE Computer Science syllabus covers various topics including Engineering Mathematics, Digital Logic, Computer Organization, Programming, Algorithms, Theory of Computation, Compiler Design, Operating Systems, Databases, and Computer Networks. It also includes a General Aptitude section with quantitative, analytical, verbal, and spatial aptitude. The exam pattern consists of 65 questions, with a mix of MCQs, MSQs, and NATs, and a marking scheme that includes negative marking for certain question types.

Uploaded by

21681a0510
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
0% found this document useful (0 votes)
46 views3 pages

GATE CSE Exam Syllabus Overview

The GATE Computer Science syllabus covers various topics including Engineering Mathematics, Digital Logic, Computer Organization, Programming, Algorithms, Theory of Computation, Compiler Design, Operating Systems, Databases, and Computer Networks. It also includes a General Aptitude section with quantitative, analytical, verbal, and spatial aptitude. The exam pattern consists of 65 questions, with a mix of MCQs, MSQs, and NATs, and a marking scheme that includes negative marking for certain question types.

Uploaded by

21681a0510
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 COMPUTER SCIENCE SYLLABUS

Section 1: Engineering Mathematics


Discrete Mathematics: Propositional and first order logic. Sets, relations, functions,
partial orders and lattices. Monoids, Groups. Graphs: connectivity, matching, colouring.
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 and Statistics: 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, pipeline hazards. 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
traversals, minimum spanning trees, shortest paths.
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata.
Regular and context-free languages, pumping lemma. Turing machines and undecidability.
Section 7: Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate
code generation. Local optimisation, Data flow analyses: constant propagation, liveness
analysis, common sub expression elimination.
Section 8: Operating System
System calls, processes, threads, inter‐process communication, concurrency and
synchronization. Deadlock. CPU and I/O 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: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual
circuit switching; Data link layer: framing, error detection, Medium Access Control,
Ethernet bridging;
Routing protocols: shortest path, flooding, distance vector and link state routing;
Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols
(ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control
and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP,
HTTP, FTP, Email.
Section 11: General Aptitude
Quantitative Aptitude: Data interpretation: data graphs (bar graphs, pie charts, and other
graphs representing the data), 2- and 3-dimensional plots, maps, and tables Numerical
computation and estimation: ratios, percentages, powers, exponents, and logarithms,
permutations, and combinations, and series Mensuration and geometry Elementary
statistics and probability.
Analytical Aptitude: Logic: deduction and induction, Analogy, Numerical relations, and
reasoning
Verbal Aptitude: Basic English grammar: tenses, articles, adjectives, prepositions,
conjunctions, verb-noun agreement, and other parts of speech Basic vocabulary: words,
idioms, and phrases in context Reading and comprehension Narrative sequencing
Spatial Aptitude:
Transformation of shapes: translation, rotation, scaling, mirroring, assembling, and
grouping Paper folding, cutting, and patterns in 2 and 3 dimensions.

General Aptitude (GA) - 15 Marks


Computer Science and Information Technology (CS/IT) - 85 Marks

GATE 2025 Exam Pattern


Marking Scheme: There are a total of 65 questions in the paper, out of them 10 questions
are from Section A, i.e. from General Aptitude and the other 55 questions are from Section
B or of core disciplined.
Questions are of three types:

1 and 2 mark questions along with 1/3 and


2/3 negative marking for wrong answers
MCQ (Multiple Choice Questions) respectively.

1 and 2 mark questions with no negative


marking for the wrong answers and no
MSQ (Multiple Select Questions) partial marking.

1 and 2 mark questions with no negative


NAT (Numerical Ability Type) marking.

The General Aptitude section has 10 questions out of which 5 questions are of 1 mark and
the other 5 are of two marks making a total of 15 marks. All these questions can be a
combination of MCQ, MSQ and NAT.

Common questions

Powered by AI

Calculus, specifically limits and continuity, helps analyze algorithm performance by describing the efficiency of algorithms when inputs approach large sizes. It determines the asymptotic behavior of time or space complexity, allowing us to predict performance limits and understand growth rates of algorithmic functions, crucial for optimizing algorithms .

TCP (Transmission Control Protocol) is connection-oriented, providing reliable data transmission with error checking and recovery features, making it suitable for applications requiring high reliability like web browsing and email. UDP (User Datagram Protocol) is connectionless, offering faster data transfer without error checking, suitable for applications where speed is critical, such as streaming or online gaming. The fundamental difference impacts their use based on the need for data integrity versus speed .

The primary challenges with instruction pipelining are managing pipeline hazards, which include data hazards, control hazards, and structural hazards. These hazards can cause data dependencies, incorrect instruction execution order, and resource conflicts, leading to stalled pipelines and decreased performance. Effective pipeline management is crucial to mitigate these challenges and maintain optimal operation .

Lexical analysis is the initial phase of compiler design, responsible for converting source code into tokens. Its importance lies in error detection early in the compilation process and simplifying syntax analysis by organizing code into meaningful symbols, which impacts the efficiency and correctness of parsing and further compiling stages .

Relational algebra is a procedural query language providing a theoretical foundation for manipulating database relations through operators (such as selection and projection). SQL, on the other hand, is a declarative language used for writing database queries. Understanding both is crucial because relational algebra underpins the operations and transformations possible within SQL, influencing efficient query design and optimization .

Eigenvalues and eigenvectors provide insight into the properties of a transformation matrix by revealing the axes of stretching and the factor by which a transformation scales vectors along these axes. They are crucial in simplifying matrix operations, decomposing matrices, and solving systems of linear equations, impacting fields like computer graphics, stability analysis, and more .

A deadlock occurs when a set of processes become stuck, each waiting for a resource held by another, thus preventing all from proceeding. One strategy to handle deadlock is deadlock detection and recovery, where the system periodically checks for deadlocks and, upon detection, takes corrective action such as pre-empting resources or terminating processes .

Monotonicity in calculus indicates that a function is either entirely non-increasing or non-decreasing. This concept is important in optimization problems as it helps identify intervals where functions reach local maxima or minima, simplifying the process of finding optimal solutions by narrowing down potential solution spaces .

Memory hierarchy improves efficiency by allowing faster access to frequently used data through a layered approach. The hierarchy consists of different storage types with varying speeds and sizes—such as cache, main memory, and secondary storage. Cache memory is faster but smaller, allowing quick access to recent data, while larger storage accommodates less frequently accessed data, optimizing overall system performance .

Graph connectivity refers to the minimum number of elements (nodes or edges) that need to be removed to disconnect the remaining nodes from each other. It is significant for network design as it determines network robustness and reliability. A highly connected graph indicates redundancy in paths, enhancing fault tolerance and reducing the risk of isolation if part of the network fails .

You might also like