GATE Syllabus is announced by the organizing authority. This year, Indian Institute of Technology will hold GATE. From Which 72% is of basic CSE Syllabus and 13% Engineering Mathematics. The Syllabus is based on the topics of graduation level. 85% of Exam have Core Engineering Syllabus.
Every year lakhs of students give GATE Computer Science and Engineering exam for studying admission in Postgraduate computer science and engineering program in well-known Engineering Colleges of India. GATE CSE exam is also a gateway for the students to get a job in Public Sector Unit under Information Technology domain.
Graduate Aptitude Test in Engineering (GATE) is a national level online test. The exam is organizeed annually on a rotation basis by IISc Bangalore and seven IITs.
Syllabus of GATE Computer Science and Engineering exam will have General Aptitude, Engineering Mathematics and Main Engineering topics. 85% of Exam have Core Engineering Syllabus. From Which 72% is of basic CSE Syllabus and 13% Engineering Mathematics.
|Main Topics||Sub Topics|
|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, the 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, method and standard deviation. Conditional probability and Bayes theorem|
It deals with the 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).
It deals with a set of rules for microarchitecture of the computer.
The topics are: Machine instructions and addressing modes. Instruction pipelining. ALU, data-path and control unit. Memory hierarchy: cache, main memory and secondary storage; I/O, interface (interrupt and DMA mode).
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.
The algorithms are studied to learn how the problems are solved in computer science.It will teach you formats how can use to solve the problems
The topics are: Searching, sorting, hashing. Graph search, at least spanning trees, shortest paths. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer. Asymptotic worst-case time and space complexity.
Theory of computation (alluded to as TOC here on) founders a solid framework for a lot of dynamic territories of computer science. In the event that you take a gander at it from a separation, the 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 context-free languages, pumping lemma. Turing machines and undecidability.
It is useful for the improvement software by hiding low-level languages and how to detect mistakes in software.
The topics are: Lexical analysis, parsing, syntax-directed translation. Intermediate code generation. Runtime environments.
It deals with the organisational structure of the Operating system, types of operating system and how the operating system works.
The topics are: Procedures, threads, inter-procedure communication, concurrency and synchronization. File systems. CPU scheduling. Deadlock. Memory management and virtual memory.
It deals with how the data is stored, what is a database, types of database and how the database is used.
The topics are: ER-model. Integrity constraints, normal forms. Relational model: relational algebra, tuple calculus, SQL. Transactions and concurrency control. File organization, indexing (e.g., B and B+ trees).
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. TCP/UDP and sockets, congestion control. LAN technologies (Ethernet). IPv4/IPv6, routers and routing algorithms (distance vector, link state). Basics of Wi-Fi. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Network security: authentication, basics of a public key and private key cryptography, digital signatures and certificates, firewalls. Flow and mistake control techniques, switching.
GATE is held for 23 various branches. The paper is held in online mode. Aspirants have to attempt 65 questions in the period of three hours. Questions are of 2 types- Multiple Choice types (MCQ) and Numerical Response Type (NAT).
The total Marks for 65 questions is 100. There is also Negative Marking comprised of giving wrong response. Aspirant has to use Virtual Calculator during the exam as any other physical calculator is debarred in GATE exam centre.
|Exam Dates||February 03, 04, 10 and 11, 2018|
|GATE Computer Science & Information Technology||GKP, G.K. Pub|
|TRB Lecturers ( Computer Science & Engineering ) Exam||A panel of Authors, Sura College of Competition|
|A Handbook for Computer Science /IT Engineering||Made Easy Editorial Board, Made Easy Publications|
|Graph Theory with Applications to Engineering and Computer Science||Deo and Narsingh, Prentice Hall India Learning Private Limited|
|GATE 2017: Computer Science and IT Engineering Solved Papers||ME Team, Made Easy Publications|
|Aerospace Engineering||AE||Mechanical Engineering||ME|
|Agricultural Engineering||AG||Metallurgical Engineering||MT|
|Civil Engineering||CE||Mining Engineering||MN|
|Chemical Engineering||CH||Petroleum Engineering||PE|
|Engineering Sciences||XE||Production and Industrial Engineering||PI|
|Electronics and Communication||EC||Textile Engineering and Fibre Science||TF|
We are providing you earlier year analysis to be familiar with the type of questions and their level. Check the clear analysis of paper from the table given below:
|Topics||Number of Question|
|Computer Architecture and Organisation||1|
|Computer Architecture and Organisation||2|
Thanks for stoping by!
You can style your Ouibounce modal however you see fit. You can also include big buttons, an email capture or just plain text. The sky's the limit!
Close this modal by clicking "No Thanks" below or clicking anywhere outside of the modal.