Syllabus - Computer Science and Information Technology, GATE Computer Science Engineering (CSE) Notes | EduRev

GATE Past Year Papers for Practice (All Branches)

Computer Science Engineering (CSE) : Syllabus - Computer Science and Information Technology, GATE Computer Science Engineering (CSE) Notes | EduRev

The document Syllabus - Computer Science and Information Technology, GATE Computer Science Engineering (CSE) Notes | EduRev is a part of the Computer Science Engineering (CSE) Course GATE Past Year Papers for Practice (All Branches).
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)

Syllabus - Computer Science and Information Technology, GATE Computer Science Engineering (CSE) Notes | EduRev

Latest Exam Pattern 

Students who would appeared in the exam understood the GATE exam pattern. The exam was held as a single paper of 3 hours duration consisting of questions from aptitude and the respective subject. 

The detailed latest exam pattern of GATE CS and IT is given below:

Syllabus - Computer Science and Information Technology, GATE Computer Science Engineering (CSE) Notes | EduRev

➢ Computer Science and Information Technology 

  • It is one of the popular streams among engineering aspirants. It focuses on the basic elements of computer programming and networking. 
  • Before appearing in the exam, candidates must be well aware of the syllabus and GATE Exam Pattern. As per GATE latest pattern, 70% of Exam have Core Engineering Syllabus or subject syllabus, 15% of Engineering Mathematics, and 15% of General Aptitude
  • Candidates can go through the syllabus given below to get an idea about GATE syllabus.

➢ Syllabus for General Aptitude (Ga) (Common to All Papers)

  • Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.
  • Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation.

Computer Science and Information Technology

➢ Section 1: Engineering Mathematics 

  • 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.
  • 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, 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 Contex-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 subexpression

    elimination.

➢ Section 8: Operating System 

  • System calls
  • Processes.
  • Threads.
  • Inter‐Process Communication. 
  • Concurrency and Synchronization. 
  • Deadlock. 
  • CPU Scheduling. 
  • Memory Management
  • 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.
Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!

Related Searches

pdf

,

study material

,

Semester Notes

,

Important questions

,

Extra Questions

,

Free

,

ppt

,

Summary

,

Syllabus - Computer Science and Information Technology

,

Exam

,

Syllabus - Computer Science and Information Technology

,

mock tests for examination

,

GATE Computer Science Engineering (CSE) Notes | EduRev

,

Sample Paper

,

Syllabus - Computer Science and Information Technology

,

Viva Questions

,

practice quizzes

,

GATE Computer Science Engineering (CSE) Notes | EduRev

,

Objective type Questions

,

Previous Year Questions with Solutions

,

MCQs

,

GATE Computer Science Engineering (CSE) Notes | EduRev

,

shortcuts and tricks

,

video lectures

,

past year papers

;