NEW DELHI: As the Indian Institute of Technology Delhi
(IIT-Delhi) has released the admit card for the Graduate Aptitude Test in
Engineering (GATE) 2020 on its official website. The candidates who are busy in
preparing for the examinations, can download the admit card for GATE 2020 CS
exam which is scheduled to begin from February 1, 2020.
The GATE 2020 examination will be conducted in two shifts - Forenoon Session (from 09:30 am to 12:30 pm) and Afternoon Session (from 02:30 pm to 05:30 pm) - from February 1 to February 9, 2020.
GATE is considered as one of the most important entrance exam for engineering graduates to pursue further studies and also GATE scores are used by many Public Sector Undertakings (PSUs) for the recruitment. Every year, more than 10 lakh candidates appear for the GATE examination throughout the country.
M.Tech. in Computer Science is one of the most demanding courses at prestigious institutes like IISCs and IITs.
Here in this article we are providing the syllabus and preparation tips for the Computer Science and Information Technology (CS) paper, which will be held in the afternoon session on February 8, 2020.
There is no proper time to prepare for GATE examination then
today. So start preparation from today itself. Candidates are advised to start
preparation from high scoring and easy topics like Digital Logic, Mathematics
and Aptitude. These three subjects cover almost 30% of complete GATE paper.
Mastering these topics not only helps you cover the major part of the syllabus but
also it will help you in improving your GATE AIR.
After that you can pick up the easy topics like - DBMS, Operating Systems or Computer Networks.
Prepare your own study plan and you must stick to that. You must plan study hours in a day and topics to be covered in a particular day. Candidates are advised to prepare a calendar. You must track your preparation periodically, if it is going in the wrong direction then must have to take some harsh steps. Revise your plan and work on that.
Students are advised to avoid social media during your preparation period as it is being noticed that major chunk of time is wasted on mobile phones. Use your mobile phones for study purpose only.
After covering your entire GATE CS 2020 syllabus, candidate must have some time for solving practice papers. Try to solve previous year paper as many as possible. If required, candidates are advised to study in groups. Form small groups not more than four candidates and study together. In group, it is observed that one can study for long hours. But group study not necessarily suits all.
Syllabus for Computer Science and Information Technology
Section 1: 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.
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.
GATE 2020: Examination Schedule
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
