GATE-CS

Home / GATE-CS

Exam Description

The Graduate Aptitude Test in Engineering (GATE) is an All-India examination administered and conducted in eight zones across the country by the GATE Committee comprising of Faculty members from IISc, Bangalore and other seven IIT's on behalf of the National Coordinating Board, Department of Education, Ministry of Human Resources Development.

GATE exam will be held on 4, 5, 11 and 12 February 2017 and the pattern of the exam will consists of 65 questions (objective type and numerical answer type (NAT)) in that 65 questions 10 questions will be asked from the general aptitude section and carry 15 marks. The time duration of the exam will be 3 hours. For 1-mark multiple-choice questions, 1/3 marks will be deducted for a wrong answer. Likewise, for 2-marks multiple-choice questions, 2/3 marks will be deducted for a wrong answer. There is no negative marking for numerical answer type questions.

Examination

Name of the sections Number of Questions Marks Per Question Total Marks
Technical Section 25 1 25
General Aptitude 5 1 5
Engineering Mathematics 35 2 70
Total 65 Questions   100 Marks

Fee Details

Category Application Fee
For women/SC/ST/PWD Rs 750/-
Other Candidates Rs 1500/-

CS Computer Science and Information Technology Syllabus

Section1: Engineering Mathematics

Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. 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.

Computer Science and Information Technology

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. 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 search, 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.

Section 8: Operating System

Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU 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. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

  • Exam Name: GATE CS
  • Price: FREE
  • Large Question Bank
  • Free Unlimited Practice