Terminus

Roles / Exams

GATE computer science

The CS paper of GATE, used for M.Tech admissions and some PSU jobs. Mapped from the GATE 2027 syllabus (IIT Madras), engineering maths included.

Draft. Based on the published syllabus as we read it. How roles get checked

28 stops to go, about 709 hours of study.

Open a stop to see the book, the video course and the practice for it. Tick its circle when you've finished.

  1. 20 h

    Maths foundations. Ready to start.

  2. 40 h

    Maths foundations. After Mathematical proof.

  3. 40 h

    Maths foundations. Ready to start.

  4. 40 h

    Programming. Ready to start.

  5. 25 h

    Programming. After Programming in Python.

  6. 8 h

    Programming. After Programming in Python.

  7. 15 h

    Systems. Ready to start.

  8. 30 h

    Systems. After Digital logic and Programming in Python.

  9. 30 h

    Systems. After C and memory and How a computer runs a program.

  10. 6 h

    Algorithms and data structures. After Discrete maths.

  11. 10 h

    Algorithms and data structures. After Programming in Python.

  12. 8 h

    Algorithms and data structures. After Arrays, lists, stacks and queues.

  13. 15 h

    Algorithms and data structures. After Arrays, lists, stacks and queues and Recursion.

  14. 20 h

    Theory and languages. After Discrete maths.

  15. 50 h

    Theory and languages. After Recursion and Hash tables.

  16. 50 h

    Theory and languages. After Building an interpreter and C and memory.

  17. 30 h

    Theory and languages. After Automata and formal languages and Big-O and running time.

  18. 20 h

    Systems. After Processes and virtual memory.

  19. 20 h

    Systems. After Processes and virtual memory.

  20. 35 h

    Systems. After Programming in Python.

  21. 10 h

    Data. Ready to start.

  22. 40 h

    Data. After SQL, Trees and heaps and Hash tables.

  23. 40 h

    Maths foundations. Ready to start.

  24. 40 h

    Maths foundations. Ready to start.

  25. 25 h

    Algorithms and data structures. After Arrays, lists, stacks and queues and Big-O and running time.

  26. 12 h

    Algorithms and data structures. After Arrays, lists, stacks and queues and Recursion.

  27. 20 h

    Algorithms and data structures. After Recursion and Big-O and running time.

  28. 10 h

    Algorithms and data structures. After Sorting and searching.

That's everything for to get hired.