GATE Syllabus 2018 for Computer Science & IT- Check details

Maniprabha Singh updated on : 08 Sep 2017
491

GATE Aspirants should be aware of the syllabus in order to make the most of it. GATE Computer Science Syllabus is provided below to help you.

GATE Syllabus 2018 for Computer Science & IT- Aspirants who are appearing in GATE Computer Science & IT paper should know each about all sections and topics in order to crack the examination with good marks. Both GATE exam pattern and syllabus are the base of preparation and candidate who know when to prepare and what to prepare is the one who win the race. So, grab all details from paper patern to the important topics before starting the preparation.  

GATE 2018 is scheduled to be held on February 03, 04, 10 & 11, 2018 to provide admissions into M.Tech./Ph.D. programmes in IITs , IISc, IISERs and other reputed institutions. The Graduate Aptitude Test for Engineering (GATE) is a computer-based test with an allotted time of three hours. It consists of a total of 65 questions summing up to a total of 100 marks. As per the GATE syllabus, all the 23 papers have a section for General Aptitude questions, which will constitute 15% of the total marks. It will consist of two sections, Verbal Ability and Numerical Ability. Check the complete GATE Computer Science Syllabus 2017 here-

GATE Syllabus 2018 for Computer Science & IT

The GATE question paper is divided into two parts:

Part I-

There will be 65 questions carrying 100 marks, out of which 10 questions will be carting 15 marks are in General Aptitude (GA). Questions in GA will be based in A) Verbal Ability and B) Numerical Ability.

Part II-

Syllabus of Engineering Mathematics

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

Syllabus of Computer Science and Information Technology

Section 1- Digital Logic

  • Boolean algebra.
  • Combinational and sequential circuits.
  • Minimization.
  • Number representations and computer arithmetic (fixed and floating point).

Section 2- 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 3- Programming and Data Structures

  • Programming in C.
  • Recursion.
  • Arrays, queues, stacks, trees, linked lists, binary search trees, binary heaps, graphs.

Section 4- Algorithms

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

Section 5- 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 6- Compiler Design

  • Lexical analysis, parsing, syntax-directed translation.
  • Runtime environments. Intermediate code generation.

Section 7- Operating System

  • Processes, threads, inter‐process communication, concurrency and synchronization.
  • Deadlock. CPU scheduling.
  • Memory management and virtual memory.
  • File systems.

Section 8- Databases

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

Section 9- Computer Networks

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

Stay Connected to know more about GATE Syllabus 2018 for Computer Science & IT!

Compare Colleges

Recommended articles

Leave Your Comments Views or Questions here