GATE Computer Science Overview
Computers have dominated the World since there inception.They will continue to be integral part of new World as well. It is interesting branch of Engineering as well.Candidates having Graduate degree in Computer Science can apply for GATE exams.
GATE exams are their gateway to higher studies and explore more of this dominating force.I have written separate article on GATE Exams. That article provides details on eligibility criteria, exam format and other important details you should know before applying for GATE.
In this article I will cover Computer Science paper. I will provide information which will help you crack this exam with ease.Below are the things I will cover in this article
- Paper Statistics
- Free Online tests
- Recommended Books
- Detailed Syllabus
- Free Android App
GATE Computer Science Statistics
Below are some interesting statistics about GATE Computer Science paper
- Number of candidates registered for the exam – 130,000 (approx)
- Number of candidates appeared for the exam – 1,10,000 (approx)
- Number of qualified candidates – 15,207
- Percentage of candidates qualified – 14% (approx)
- Maximum marks out of 100 – 85.95
- Minimum marks out of 100 – 16.71
- Average marks – 33.59
- Standard Deviation – 10.8
The pass percentage of this paper is one of the lowest compared to other papers of GATE.This makes it one of the most difficult paper to crack the GATE Exams. The core branches of Engineering and Electronics and Communications only have more number of candidates appearing for exams.
The average marks is 33 which is way close to minimum marks. This means majority of candidates lie between 25 to 45 marks range. If you can score anything above 50 then you have good chances of getting decent rank.
You can use these statistics to plan your preparation.Often candidates are not sure about highest and average marks.Knowing this information helps them set a target.This target setting is helpful is selecting topics to focus on and topics to leave. Below are some resources which will help you prepare for this paper.
GATE Computer Science Online tests
Almost all engineering colleges offer Computer Science and Information technology.There are some colleges which do not offer core branches like Mechanical Engineering yet they offer Computer Science and Information Technology.So the number of candidates appearing for GATE Computer Science exams is huge.This increases competition.
We have created this online test series to help students in their preparation.Core subjects of Computer Science are important for GATE exams.As we will see later in the syllabus section.Below are the links to online tests prepared with upcoming exams in mind.
The online tests have previous year GATE questions along with answers. They also have questions important for current year of exams. You should try all the online test for best results. All questions are unique.
GATE Computer Science recommended book
As mentioned above number of candidates graduating with Computer Science and Information Technology is huge.Not only so the number of books are also decent.It was really difficult job to select a book out of so many books.I tried to come up with one book which scores over other books.There are five books which are mostly used by candidates.
Instead of confusing you with five books I would suggest only one book.I would not give you option to browse and get confused with decision making.I took the pain of browsing through the catalog and come up with the best one.
neat compilation of previous years’ questions, subject and chapter wise.Each question solution is explained in details for better understanding and concept clearing.You can buy the book at discounted price from below link.
GATE Computer Science Syllabus
You have covered most of the topics in your Graduate curriculum.But graduate curriculum also has additional topics.You can refer below syllabus to get an idea of topics important for GATE exams.The syllabus presented below is updated one as it is taken from official website of GATE exams.(link)
Section1: Engineering Mathematics
Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
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.
Computer Science and Information Technology resources are abundant in market.But you should select the best one for good preparation.I have tried to present you best resources for preparation.You can also share your thoughts on things you want me to include.Consider sharing this post in case you found it useful.
You can also use below Android App for preparation.The App is free and is available on Google Play.It contains fully solved question for each GATE paper. Below link provides details of the App.