Open In App
Related Articles

Important Topics for GATE 2023 Computer Science

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Gate-CS-2023-Test-Series These topics are categorized based on the previous GATE CS Papers:
Regularly covered topics Maximum weightage topics Easy level topics Difficult level topics Other Important topics
    Section: Mathematics
  • Propositional logic and predicate logic
  • Matrix determinant and eigen values
  • Conditional probability
  • Graph connectivity
  • Relations
  • Mathematical logic
  • Linear algebra
  • Propositional logic
  • Linear algebra
  • Graph theory
  • Probability
  • Predicate logic
  • Groups
  • functions
  • Lattice theory
  • Counting
    Section: Algorithms
  • Algorithm Analysis
  • Heap trees
  • Sorting
  • Graph Algorithms
  • Sorting algorithms
  • Searching and sorting algorithms
  • Divide and conquer
  • Greedy algorithms
  • Divide and conquer
  • Dynamic programming algorithms
    Section: Programming and Data Structures
  • Recursive programs
  • Trees and graphs
  • Trees
  • Stacks and Queues
  • Trees
  • Recursive functions, and pointers
    Section: Operating Systems
  • CPU Scheduling Algorithms
  • Paging
  • Semaphores
  • Page replacement algorithms
  • Page replacement algorithms
  • Paging
  • CPU Scheduling
  • Page replacement
  • Semaphore
  • Paging and Segmentation
  • Disk scheduling algorithms
  • Deadlock
    Section: Databases
  • Relational Algebra
  • SQL
  • Serializability
  • Relational
  • Tuple
  • SQL queries
  • Normalization
  • Relational algebra
  • Transactions
  • SQL
  • ER-diagrams
    Section: Computer Networks
  • IP Addressing
  • TCP and UDP
  • Application protocols
  • Congestion control
  • IP Addressing
  • TCP
  • Ethernet
  • IP addressing
  • Routing Algorithms
  • Encryption and Decryption algorithms
    Section: Computer Organization and Architecture
  • Pipelining
  • Cache organization
  • Addressing modes
  • Cache organization
  • Addressing modes and Machine cycles
  • Cache organization
  • Pipelining
  • I/O Data transfer
    Section: Theory of Computation
  • DFA and Regular expression
  • Closure properties and Undecidability
  • Regular languages
  • Undecidability
  • Regular expressions
  • Closure properties
  • Undecidability
  • CFL and DCFL
  • Formal grammars and CNF
    Section: Compiler Design
  • LL(1) and LR parsers
  • Parsing
  • Lexical Analysis and syntax Analysis
  • Intermediate code generation
  • Syntax directed translations(SDTs)
  • Run time environments
    Section: Digital Logic
  • Combinational circuits: Multiplexer, decoder and demultiplexer
  • Minimization
  • Counters
  • Combinational circuits
  • Minimization
  • Combinational circuits
  • Sequential circuits
  • Number system, fixed and floating point numbers
  • Registers
    Section: Numerical and Verbal Ability
  • Numerical computation
  • Data interpretation
  • Sentence completion
  • Word analogies

Last Updated : 18 Mar, 2023
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads