Required time to prepare for GATE Exam

Tell me how many months, Hours, days are required for GATE preparation for an Average Student of Computer Science???

[Arun Vats]

The Graduate Admission Test in Engineering (GATE) is an All-India level examination for aspirants who are interested to get admission in Masters/Direct PhD in India or Abroad.

This is difficult to give suggestion that how much you should study to clear GATE examination.
It will totally depend on the person.
It is completely depend on personal capability.

As according to me Recommended a dedicated preparation time of minimum 5-6 months.

That you complete your syllabus at least 45 days before
Start solving sample papers and appearing in Mock Examination frequently in this period
Ensure you revise all your topics in the first 30 days of this 45 Day timeline.

In the last 15 days solve GATE previous year questions and attempt more mock papers.

Here i am giving GATE CSE Syllabus;

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point). Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage. Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps. Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete. Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability. Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.