GATE Computer Science syllabus online tests books

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.

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.

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

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.

Conclusion

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.

Leave a Reply

Your email address will not be published. Required fields are marked *