Scribd
Upload
24 views

GATE CS TOPIC

The document outlines important topics for the GATE CS & IT exam, covering areas such as Database Management Systems, Computer Organization, Digital Logic Design, and more. Each section lists key concepts and techniques, including SQL commands, CPU scheduling algorithms, and data structures. Additionally, it includes sections on Engineering Mathematics, General Aptitude, and English preparation strategies.

Uploaded by

karthiyayini191105
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

GATE CS TOPIC

The document outlines important topics for the GATE CS & IT exam, covering areas such as Database Management Systems, Computer Organization, Digital Logic Design, and more. Each section lists key concepts and techniques, including SQL commands, CPU scheduling algorithms, and data structures. Additionally, it includes sections on Engineering Mathematics, General Aptitude, and English preparation strategies.

Uploaded by

karthiyayini191105
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

IMP Topics For GATECS&IT

1. Database Management Systems (DBMS)

 Normal Forms: 1NF to BCNF


 Keys: Super Keys, Candidate Keys (how to find them)
 SQL Commands: ON DELETE, DROP, and other operations
 ACID Properties
 Serializability: Conflict and View
 Locks: Shared and Exclusive

2. Computer Organization

 Addressing Modes
 Associative Memory and Set-Associative Memory
 Pipelining: Problems and Hazards
 Direct Memory Access (DMA)

3. Digital Logic Design


 Number Systems: Binary, Decimal, Octal, Hexadecimal
 Multiplexers and Demultiplexers
 Flip Flops: SR, JK
 Adders: Half Adder and Full Adder
 K-Maps (Karnaugh Maps)

4. Theory of Computation

 DFA (Deterministic Finite Automata), NFA (Nondeterministic Finite Automata)


 Regular Expressions
 Context-Free Grammar (CFG): Union, Intersection, Set Difference…
 Decidability and Undecidability (just problem names)
 Pumping Lemma

5. Compiler Design

 Number of Tokens
 LL(1) Parsing
 Ambiguity in Parse Trees
 Parsing Techniques: CLR and SLR
6. Computer Networks

 Logical Addressing: Classful and Classless, NID and Broadcast ID


 Sliding Window Protocols: Go-Back-N, Selective Repeat
 Routing Algorithms: DVR, OSPF (Convergence Table)
 ICMP (Internet Control Message Protocol)
 Error Detection and Correction: CRC, Hamming Code,Checksum
 IP and TCP Header

7. Operating System

 CPU Scheduling: FIFO, SJF, SRT, RR, Priority (Preemptive and Non-Preemptive)
 Disk Scheduling: SCAN, LOOK, CSCAN, CLOOK
 Page Replacement Algorithms: FIFO, LRU, Optimal
 Finding Effective Memory Access Time

8. Programming and Data Structures

 Pointers
 Strings
 Arrays
 Stack and Queue
 Linked List
 Graphs: DFS (Depth-First Search) and BFS (Breadth-First Search)

9. Algorithms

 Greedy Algorithms
 Dynamic Programming
 Divide and Conquer
 Heap Sort
 Master’s Theorem: Solve Recurrence Relations
 Hashing

10. Engineering Mathematics

 Discrete Mathematics
 Propositional Logic: True/False
 Graphs: Spanning Trees, Eulerian, Hamiltonian, Isomorphic
 Rank of a Matrix
 Eigenvalues and Eigenvectors
11. General Aptitude

 Number Systems: LCM, HCF, Divisibility


 Percentages, Profit & Loss
 Time, Speed, Distance
 Probability, Permutations, Combinations
 Time and Work
 Ratios and Proportions
 Sentence Completion (Numerical and Alphabetical)
 Blood Relations (Direct & Coded)
 Syllogisms (Statements and Conclusions)
 Seating Arrangements: Linear and Circular
 Data Sufficiency
 Spatial Aptitude: Patterns, Paper Folding, Water Images etc.

12. English

 Solve Previous Year Questions (Last 10 Years)

Click here to join: GATE CS/IT Study Material

You might also like