## GATE Important Topics for CSE Students-

In this article, all the topics of the following subjects which are extremely important from the GATE examination point of view for computer science students have been brought out.

1. C, Data Structure and Algorithms
2. Theory of Automata and Computation
3. Compiler Design
4. Digital Logic
5. Database Management System
6. Computer Organization and Architecture
7. Operating System
8. Computer Networks

Based on the analysis of previous years GATE exam papers, important topics from these subjects are-

## C, Data Structure and Algorithms-

• These are the most important subjects from the GATE examination point of view.
• About 25% of the complete paper is from these subjects.
• If you are good in these subjects, it will surely provide a boost to your preparation and will increase your chances of cracking the exam.

### C Programming-

• C programming questions are mostly based on finding the output of programs consisting of some pointers, static variables, arrays, strings, functions etc.
• So, you must practice solving different kinds of questions.
• It is highly recommended to start practicing now if you are not good at programming.

### Data Structure-

Practice problems related to-

• Tree like finding number of leaf nodes, number of non leaf nodes, total number of nodes, height of the tree etc
• Binary trees
• Binary Search trees
• Preorder, Inorder and Postorder Traversal
• Spanning trees and minimum spanning tree
• AVL trees and balancing them after insertion and deletion
• Properties of Heap
• Deletion and Insertion of items in heap
• Different problems on stack, queue and linked list (Understand their concepts very well)

### Algorithms-

Practice problems related to-

• Finding time complexity of given code (Very-very Important)
• Properties of Complexity and relation between them
• Searching and Sorting
• Dynamic Programming Approach
• Divide and Conquer Approach
• Greedy Approach
• Basic problems like knapsack problem, matrix chain multiplication, Longest Common Sub sequence, Job Sequence and Compressing mechanism
• Basic Theory of P-NP problems

## Theory of Automata and Computation-

Practice questions related to-

• Finding minimum number of states in DFA
• NFA to DFA Conversion
• Closure properties of Finite Automata
• Finding regular expressions
• Mealy Moore Machine
• Simplification of Context Free Grammar
• Pushdown Automata
• Closure Properties of Pushdown Automata
• Finding category of any language or grammar
• Concepts related to expressive power of different languages
• Basic Problems related to NP Completeness
• Properties of Recursive and Recursive Enumerable Languages
• Turing Machine making and expressive power of different types of Turing Machine

Finite Automata covers approximately 50% questions from Theory of Automata and Computation. So, give it more time than others.

## Compiler Design-

Practice questions related to-

• Parsing and all its techniques (You will always find at least one question from this topic LL(1), LR(1), SLR, LALR, CLR)
• Finding First and Follow
• Precedence and Associativity of operators
• Finding value from expression tree
• Ambiguous Grammar

## Digital Logic-

Practice questions related to-

• K-Maps (Very high chances of very simple question)
• Multiplexers
• Demultiplexers
• Encoder
• Decoder
• Flip Flops
• Finding modulus of counters
• Floating point representation
• Integer representation
• IEEE Format, Range and Precision

Digital logic contains very simple questions. If you practice them, you can solve all the questions very easily. So, don’t lose your marks here.

## Database Management System (DBMS)-

Practice questions related to-

• Normalization (No GATE paper is completed without Normalization)
• Finding normal form (comes 70% times in GATE paper)
• Finding candidate keys
• Decomposition of Relation (Lossless Join and Dependency preservation have more chances to appear)
• SQL Queries (Select clause with properties of having, group by, any, all, exits)
• Relational Algebra
• Joins (High probability of tricky questions from Joins)
• Finding view serializability and conflict serializability
• Finding Recoverable and Cascade Schedule
• Lock based, Two phase, Time Stamp and Graph based protocol with their properties like deadlock freedom and starvation freedom
• Formation and structure of B and B+ Trees
• Primary and Clustering Index
• Number of blocks required in indexing of different type
• Collision Resolution
• Minimum and Maximum number of nodes in B and B+ Trees

## Computer Organization and Architecture-

Practice questions related to-

• Addressing Modes (Theory as well as Numerical Problems)
• Program counter after some instruction
• Values after shift and rotate instructions
• Horizontal and vertical programming
• Pipelining (Speed up of pipeline, Time taken to complete instruction in pipeline and non-pipeline architectures, Hazards in pipeline, Hazards removal, Branch penalty etc)
• Cache memory organization
• Mapping Techniques
• Multilevel caches
• Write through and write back technique

Questions are more tricky in this subject. So, you need to practice more on different types of questions.

## Operating System-

Practice questions related to-

• Finding turn around time and waiting time of different scheduling policies. There are more chances for numerical questions to appear from this topic.
• Banker’s Algorithm to check whether given sequence is safe or not.
• Synchronization (Very high chances for questions from this topic)
• Semaphores and classical problems of synchronization (this will help you to solve other questions)
• Memory Management (page table size, number of pages, logical address, physical address, page size, inverted page table, virtual memory, TLB etc.)

## Computer Networks-

Practice questions related to-

• Flow Control and Error Control Policies (Window Size, Number of Sequence bits, Frame size, Bandwidth, Round trip time, Utilization)
• Properties of Circuit Switching and Packet Switching
• Routing Protocols
• Hamming distance and CRC
• Congestion control policies like slow start, congestion avoidance, congestion detection
• TCP and UDP Header Format
• Theory related to Ethernet and token ring
• Basics of different types of protocols like FTP, HTTP, DHCP, ARP, RARP, SMTP, ICMP, POP
• Basic concepts of cryptography and firewalls

# Best of luck for your preparation!

## GATE Exam | GATE 2019 | Important Notifications

• The Graduate Aptitude Test in Engineering popularly called as GATE is an All-India examination.
• It is administered by the GATE Committee consisting of Faculty members from IISc, Bangalore and other seven IITâ€™s and the exam is conducted in eight zones across the country.

The score or rank obtained in GATE exam is mainly used for the following purposes-

• Used for admissions to Post Graduate Programmes (ME, M.Tech, MS, Direct Ph.D.) in institutes like IITs and IISc etc with financial assistance offered by Ministry of Human Resource and Development (MHRD).
• Used by PSUs for recruiting candidates for various prestigious jobs with attractive remuneration.

## Conducting Authority for GATE 2019-

 IIT Madras is the conducting authority of GATE 2019 examination.

## Important Dates for GATE 2019-

 GATE Online Application Processing System (GOAPS) Website Opens Saturday 01st September 2018 Closing Date for Submission of Application (Online through website) Friday 21st September 2018 Extended Closing Date for Submission of Application (Online through website) Monday 01st October 2018 Last Date for Requesting Change of Examination City (An additional fee applicable) Friday 16th November 2018 Admit Card will be available on the portal for printing Friday 04th January 2018 GATE 2019 Examination Forenoon: 9:00 AM to 12:00 Noon (Tentative) Afternoon: 2:00 PM to 5:00 PM (Tentative) Saturday Sunday Saturday Sunday 02nd February 2019 03rd February 2019 09th February 2019 10th February 2019 Release of GATE 2019 Response Sheets – 2nd Week of February 2019 Release of GATE 2019 Answer Key – 3rd Week of February 2019 Announcement of the Results on the portal Saturday 16th March 2019

## Eligibility Criteria for GATE 2019-

There are certain criteria that a candidate must fulfill to appear for GATE exam. Candidates must fulfill the following criteria-

• There is no age limit for GATE aspirants.
• Indian and Foreign National candidates are eligible to apply.
• It is compulsory for all the candidates to have completed or be in their final year of B.E./B.Tech or Post-Graduate (M.Sc) degree in the relevant subject.
• There is no minimum pass percentage in the qualifying degree.

## Application Fee for GATE 2019-

The application fee is different for different candidates based on their category and location of examination center-

### For examination centers in India-

 On or Before 21st September 2018 During the extended period Female Candidates Rs. 750/- Rs. 1250/- SC / ST / Person with Disability Category Students Rs. 750/- Rs. 1250/- All other candidates Rs. 1500/- Rs. 2000/-

### For examination centers Outside India (All Candidates)-

 On or Before 21st September 2018 During the extended period Addis Ababa, Colombo, Dhaka and Kathmandu US\$ 50 US\$ 70 Dubai and Singapore US\$ 100 US\$ 120

### Note-

It is important to note that the above mentioned application fee DOES NOT INCLUDE processing fees, service charges or any other charges that the bank may impose.

## Exam Pattern for GATE 2019-

• Online Computer Based Test
• 3 hours to complete the exam
• MCQ and Numerical Type Questions
• 65 Questions, 100 marks
• One-third negative mark in MCQ for wrong answers
• No negative marking for Numerical Type Questions

## Division of Questions and Marks-

As mentioned above, there will be total 65 question carrying 100 marks. The paper will be divided into 2 sections- General Aptitude and Technical.

• General Aptitude Section will consist of 10 Questions carrying 15 marks.
• Technical Section will consist of 55 Questions carrying 85 marks. Out of these, Engineering Mathematics will comprise of 15 marks.

 Section Question No. No. of Questions Marks per Question Total Marks General Aptitude 1 to 5 5 1 5 6 to 10 5 2 10 Technical + Engineering Mathematics 1 to 25 25 1 25 26 to 55 30 2 60 Total Questions: 65 Total Marks: 100

## Syllabus for GATE 2019-

Candidates from CS/IT branch may download the GATE 2019 syllabus from here-

GATE 2019 syllabus (Technical) for Computer Science Students

GATE 2019 syllabus (General Aptitude) common for all branches