Graduate Aptitude Test in Engineering (GATE)
is an examination conducted jointly by the Indian
Institute of Science (IISc), Bangalore and the seven Indian Institutes of Technology (at Bombay,
Delhi, Guwahati, Kanpur, Kharagpur, Madras and Roorkee) on behalf of the National Coordination
Board (NCB)-GATE, Department of Higher Education, Ministry of Human Resource Development
(MHRD), Government of India.
Qualifying in GATE is a mandatory requirement for seeking admission and/or financial assistance
to: (i) Master’s programs and direct Doctoral programs in Engineering/Technology/Architecture and
(ii) Doctoral programs in relevant branches of Science, in the institutions supported by the MHRD
and other Government agencies. Even in some colleges and institutions, which admit students without
scholarship/assistantship, the GATE qualification is mandatory. Further, many (PSUs) have been
using the GATE score in their recruitment process.
Institute of Science (IISc), Bangalore and the seven Indian Institutes of Technology (at Bombay,
Delhi, Guwahati, Kanpur, Kharagpur, Madras and Roorkee) on behalf of the National Coordination
Board (NCB)-GATE, Department of Higher Education, Ministry of Human Resource Development
(MHRD), Government of India.
Qualifying in GATE is a mandatory requirement for seeking admission and/or financial assistance
to: (i) Master’s programs and direct Doctoral programs in Engineering/Technology/Architecture and
(ii) Doctoral programs in relevant branches of Science, in the institutions supported by the MHRD
and other Government agencies. Even in some colleges and institutions, which admit students without
scholarship/assistantship, the GATE qualification is mandatory. Further, many (PSUs) have been
using the GATE score in their recruitment process.
Graduate Aptitude Test in Engineering (GATE) is basically an examination on the comprehensive understanding of the candidates in various undergraduate subjects in Engineering/Technology/ Architecture and post-graduate level subjects in Science. GATE 2021 Information Brochure has been released by the IIT Bombay. The application form for the exam will be available from September 14 onwards. The last date to apply for the GATE 2021 is September 30 without a late fee and October 7 with a late fee.
The GATE score would reflect the relative performance level of the candidate in a particular subject, which is quantified based on the several years of examination data. Note that the GATE 2020 score is valid for THREE YEARS from the date of announcement of the results
GATE 2021 Important Dates:
Events
|
Dates
|
Release of GATE 2020 application form
|
September 14, 2020
|
GATE 2020 Exam
|
February 1, 2, 8 and 9, 2021
|
Result of GATE 2020 | Not Decleared |
GATE 2020 CS and IT Syllabus for Computer Science and Information Technology (CS & IT):
Students will be provided the GATE 2020 CS and IT syllabus here onceit is released by the exam
conducting authority. GATE 2020 syllabus for computer science and information technology will
contain all the topics which are asked in the exam.
Till the time, students can find the syllabus of GATE 2019 for CS and IT.
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.
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.
Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
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).
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).
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, stacks,
queues, linked lists, trees, binary search trees, binary heaps, graphs.
queues, linked lists, trees, binary search trees, binary heaps, graphs.
Section 4- 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.
Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer 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 context-free languages, pumping lemma. Turing machines
and undecidability.
and push-down automata. Regular and context-free languages, pumping lemma. Turing machines
and undecidability.
Section 6- Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments.
Intermediate code generation.
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.
synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
8- 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.
constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and
concurrency 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)
.Firewal.
Gate Computer science 2020 study materials
useful links for gate resources
https://mega.nz/#F!aPpjmQRb!AZ-K3q5i5wzrlLtxl3FEJQ
Notes Subject Wise
https://drive.google.com/drive/mobile/folders/0B3WNbMhebkLHMTl3YzM3N0hLQ0U
useful links for gate resources
https://mega.nz/#F!aPpjmQRb!AZ-K3q5i5wzrlLtxl3FEJQ
Notes Subject Wise
https://drive.google.com/drive/mobile/folders/0B3WNbMhebkLHMTl3YzM3N0hLQ0U
Ravindrababu sir notes
https://drive.google.com/folderview?id=0B9plbqnFJ54daGlIeWdfZEdvcUE
Made Easy Worksheet Module
https://drive.google.com/folderview?id=1CVBxy6e9VFAjILVO0CtW7U2EKzuY8T_i
Book for gate
https://drive.google.com/folderview?id=1Cf0pXjjVIMPxtr3l7kon0vb0ahnYeHXY
Aptitude For GATE
https://drive.google.com/file/d/0B3uQrcG1won1dWJFVEJYSjRMWkE/view?usp=drivesdk
https://drive.google.com/folderview?id=0B6VHGaRnO17Sd1hBeDlfalpkeXM
Made Easy Test Series
https://drive.google.com/folderview?id=1ajZ2Tm4dVa3to-qOsEQHtSUooECSMt0k
https://drive.google.com/folderview?id=0B9plbqnFJ54daGlIeWdfZEdvcUE
Made Easy Worksheet Module
https://drive.google.com/folderview?id=1CVBxy6e9VFAjILVO0CtW7U2EKzuY8T_i
Book for gate
https://drive.google.com/folderview?id=1Cf0pXjjVIMPxtr3l7kon0vb0ahnYeHXY
Aptitude For GATE
https://drive.google.com/file/d/0B3uQrcG1won1dWJFVEJYSjRMWkE/view?usp=drivesdk
https://drive.google.com/folderview?id=0B6VHGaRnO17Sd1hBeDlfalpkeXM
Made Easy Test Series
https://drive.google.com/folderview?id=1ajZ2Tm4dVa3to-qOsEQHtSUooECSMt0k
go to drive and download
ReplyDeleteravibabu sir notes link is not working.
ReplyDelete