Scribd
Upload
233 views2 pages

GATE CSE Syllabus Overview

The document outlines the syllabus for the GATE exam in computer science engineering (CSE). It lists important topics in several core CSE areas that may be covered in the exam, including programming and data structures, algorithms, operating systems, digital logic, computer organization and architecture, databases, computer networks, and theory of computation. Specific topics mentioned include recursive programs, trees and graphs, sorting algorithms, paging, deadlocks, relational algebra, SQL queries, IP addressing, routing algorithms, and finite state automata.

Uploaded by

Saket Zode
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
233 views2 pages

GATE CSE Syllabus Overview

The document outlines the syllabus for the GATE exam in computer science engineering (CSE). It lists important topics in several core CSE areas that may be covered in the exam, including programming and data structures, algorithms, operating systems, digital logic, computer organization and architecture, databases, computer networks, and theory of computation. Specific topics mentioned include recursive programs, trees and graphs, sorting algorithms, paging, deadlocks, relational algebra, SQL queries, IP addressing, routing algorithms, and finite state automata.

Uploaded by

Saket Zode
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.

GATE Syllabus – Computer Science Engineering

(CSE)
CSE stands for Computer Science Engineering. This field deals with
implementation, designing and management of information system of both
software and hardware processes. GATE Syllabus for CSE with important
topics is tabulated below:

Programming and Data Structures Algorithms


 Recursive Programs  Algorithm Analysis
 Trees and Graphs  Heap Trees
 Trees  Sorting and Graph Algorithm
 Stacks  Searching and Sorting Algorithm
 Queues Trees  Dynamic Programming Algorithm
 Recursive Functions  Divide and Conquer
 Pointers  Greedy Algorithm

Operating Systems Digital Logic


 Combinational Circuits:
 CPU Scheduling Algorithms
Multiplexer, Decoder and De-
 Paging
Multiplexer
 Semaphores
 Combinational Circuits
 Page Replacement Algorithm
 Minimizational Circuits
 Deadlock
 Sequential Circuits
 Disk Scheduling Algorithm
 Minimization and Counters
 Page Replacement
 Number System
 Segmentation
 Fixed and Floating Point Registers

Computer Organization & Architecture Databases


 Relational Algebra
 Pipelining  Relational Algebra
 Cache Organization  Normalization
 Addressing Modes  SQL/ SQL Queries
 Machine Cycles  Tuple Calculus
 I/O Data Transfer  Transactions
 Serializability

Computer Network Theory of Computation


 IP Addressing  DFA
 Routing Algorithms  CFL and DCFL
 TCP and UDP  Regular Languages
 Application Protocols  Regular Expressions
 Ethernet  Undecidability
 Congestion Control  Closure Properties
 Encyption and Decryption  Formal Grammars
Algorithms  CNF

You might also like