Computer Science and Information Technology (CS) is a popular branch for all the engineering aspirants. This branch has a wide scope ranging from IT industries to PSUs where students can join as software developer, software engineer, database administrator, etc. Every year lakhs of students give GATE Computer Science and Information Technology exam for pursuing admission in Postgraduate computer science and engineering program in well-known Engineering Colleges of India. GATE 2020 will be conducted in online mode from February 01, 02, 08 and 09, 2020.
In this article, we will look at the syllabus, pattern, previous year paper analysis and important books for GATE CSE paper. Candidates can also check out the CSE cut off score for IITs as well as GATE PSU Recruitment. With just over 3 months left for the exam, candidates must concentrate on the topics that carry most weightage in the exam and create their preparation schedule accordingly.
Syllabus for GATE Computer Science and Information Technology
Syllabus for Computer Science and Information Technology is divided into 10 Section. The basic CS syllabus covers 85% marks of the question paper and rest 15% marks is covered by Engineering Mathematics. The details of GATE syllabus to be followed CS candidates are given below.
Section 1: Engineering Mathematics
This section is based on the syllabus of Engineering Mathematics covering around 4 subsections. The table below specifies the syllabus detail to be followed for Engineering Mathematics.
|Discrete Mathematics||Propositional and first-order logic, relations, Sets, functions, Groups, partial orders and lattices, Graphs ( connectivity, colouring, matching), Combinatory (counting, generating functions, recurrence relations)|
|Linear Algebra||Matrices, system of linear equations, determinants, LU decomposition, eigenvalues and eigenvectors.|
|Calculus||Limits, Maxima and minima, continuity and differentiability, Integration, Mean value theorem.|
|Probability||Conditional probability and Bayes theorem, Random variables, normal, exponential, Uniform, Poisson and binomial distributions, median, mean, mode and standard deviation.|
This section is to test the candidates hold on mathematical methods and techniques used majorly in engineering. This section varies for different branches and weighs around 13% of the total marks.
Computer Science and Information Technology
Section 2: Digital Logic
It deals with logical structure of digital circuits. How the circuits will be made. What the output we will get on joining the circuits.
The Topics are: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
It deals with set of rules for microarchitecture of computer.
The topics are: 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
It is studied to know how the information is stored in the computer and how it will be retrieved back efficiently.
The Topics are: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Section 5: Algorithms
The algorithms are studied to learn how the problems are solved in computer science.It will teach you patterns how can use to solve the problems
The topics are: 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
Theory of computation (alluded to as TOC here on) establishes a solid framework for a great deal of dynamic territories of computer science. In the event that you take a gander at it from a separation, theory of computation is a nearby cousin of Artificial Intelligence than say Probability or Computer vision
The topics are: Regular expressions and finite automata. Context-free grammars and pushdown automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Section 7: Compiler Design
It is useful for the improvement software by hiding low level languages and how to detect errors in softwares.
The topics are: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Section 8: Operating System
It is deals with the organisational structure of Operating system, types of operating system and how the operating system works.
The topics are: Processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
Section 9: Databases
It deals with how the data is stored, what is database, types of database and how database are useful.
The topics are: 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
It deals with types of networks, how the networking is done, how the information is transferred from one point to other.
The topics are: 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.
Also Check GATE Previous Question Papers
Analysis of important topics
There are total 65 questions out of 30 questions carry 1 mark each and 35 questions carry 2-marks each. Based on the last two-year analysis of GATE Papers the following table is prepared:
|Topics||2016 GATE paper||2015 GATE paper|
|No. of questions asked||Marks||No. of questions asked||Marks|
|DS Algorithm and Programming||15||23||10||14|
|Theory of Computation||3||5||3||5|
Analysis based on Previous Year GATE paper
- DS Algorithm and Programming covers 15 questions which counts to be maximum.
- Only 1 question based on Compiler Design topic
- 10 questions asked from the topic Data Structure and Algorithms.
- The highest number of questions i.e. 15 questions are from Engineering Mathematics topic
- Only 2 questions are based Computer Organisation and Architecture topics
- No question from DMGT topic.
Read About More GATE Paper Analysis
Preparation Schedule for GATE 2020
GATE exam is considered as one of the toughest and competitive exams of India. Candidates can prepare for a year or more but you need at least 4 Months for the thorough preparation of the same. Candidate is advised to follow the syllabus, a proper study strategy and schedule to be able to score good the GATE exam.
Given below are the expert highlights for a complete 4-month study schedule according to the estimated weight age for GATE preparation:
|Subjects||Time duration||Estimated weight age|
|Operating System||10 days||5%|
|Information Systems and Software Engineering, Web Technologies||1 day||4%|
|Theory of Computation||9 days||9%|
|Computer Networks||10 days||10-14%|
|Compiler Design||3 days||5%|
|General Aptitude||13 days||10-15%|
|Programming and Data Structures||13 days||9%|
|Computer Organization and Architecture||3 days||9%|
|Engineering Mathematics||13 days||10-15%|
|Digital Logic||3 days||1-5%|
In last one month candidates must go through the revision of all the important formulas revise all the formulas, theorems and tricks covered across all subjects. Candidate must attempt 4 to 5 Mock tests every day in the last month. The mock test will help you in understanding your weaker areas on which you need to focus more.
Also Check GATE Preparation Tips
Important Books for GATE CS 2020
GATE requires qualitative and smart preparation. The candidate should chose the study material based on shortcut techniques and strategies for effective results. Given below are some of the most recommended books for you:
|Name of the subject||Author|
|Theory of Computation||Ullman|
|Computer Organisation||Carl Hamacher|
|Compiler Design||Aho & Ull Man|
|Digital Logic||Morris Mano|
Candidate must go through the latest syllabus and exam pattern before starting the preparation. The study material chosen should cover the previous year’s solved question papers. Candidates can refer to nptel notes and lectures as well.
Top Coaching Centres for GATE CS
There are many institutes in the country that offer GATE coaching and preparation. However, it is quite necessary to choose the right institute for the preparation. Given below are the details of the best Coaching Centres (above the rating of 4) in different states of India for GATE in India
|City||Top Coaching Centre|
|Delhi||THE GATE COACH|
|Chandigarh||New Cambridge College|
|Bangalore||Vani Institute GATE|
|Jaipur||Let’s Talk Academy|
Above mentioned are the best coaching centres with best faculty for the GATE preparation. Most of the successful GATE candidates recommend these institutes for the best results.
Read More About Top Coaching Centers for GATE
GATE CS Cut off trends in IITs
The cut-off for the IIT’S is high ranging generally in the bracket of 650 to 900 cut off ranks. The expected GATE cut-off ranks in different IIT’S are given below:
|Name of the IIT||Cut-Off Rank|
Cut-off is always declared after the result of the GATE. Based on score of the candidate, he/she is assigned a rank. The rank of the candidate determines his/her admission in different IITs.