Competitive Exams

Section 1: Engineering Mathematics

Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs: connectivity, matching, colouring. 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 and Statistics: 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, pipeline hazards. 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 traversals, minimum spanning trees, shortest paths.

Section 6: 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.

Section 7: Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimization, Data flow analyses: constant propagation, liveness analysis, common sub expression elimination.

Section 8: Operating System

System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O 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: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit- switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.

The previous year questions with their solutions are a part of our course material. So when you subscribe for the course material, you will get solutions for GATE Computer Science questions from GATE 2011 onwards.

Preparation for GATE Computer Science is a 5-step process.

1. Understand the GATE Computer Science syllabus and make a study plan based on time left for exam. Plan in a way that gives you atleast 2 months just to answer tests and Mocks.
2. GATE requires you to have strong concepts. So get the best books for each subject along with GATE specific study material from Career Avenues.
3. For better clarity, you can also refer to Career Avenues videos for GATE Computer Science, which have been made by some of the best GATE Computer Science faculty.
4. As you study, keep making notes. Also solve previous year questions and master the concepts behind each of the question.
5. Answer a lot of GATE Computer Science Mocks and Section tests. Career Avenues provides a complete series, which includes Mathematics and Aptitude.

Career Avenues can help you in 3 ways.

1. Best study material for GATE Computer Science made specifically for the GATE Computer Science syllabus. The study material can be purchased both in online (read access) or offline (printed) mode)
2. Excellent video lectures for GATE Computer Science that helps in understanding the concepts better and faster.
3. Exhaustive test series with a combination of easy, moderate and difficult questions.

Yes, you can. A trial course is available for Rs. 100 for each of the three courses (study material, video lectures and test series). The trial course will unlock all features and content of the course for a period of 2 days.

Once you are satisfied with the quality of the course, you can then purchase for a duration appropriate to your GATE preparation.

For someone who is serious about his or her GATE preparation, the course is good and sufficient. Since 2011, when we started GATE Computer Science courses, hundreds of our students have made it into top colleges like IISc, IITs and NITs.