GATE Core Subjects 3. Programming & Data Structures For CSE - PDF Notes & Practice Sets Free Download

GATE Cores Subjects for CSE is an array of fundamental computer science chapters or topics that have to be studied by the GATE CSE Aspirants. In the GATE Entrance Examination the questions are asked from the Core subjects such as Digital Logic, Networking, Database, etc. These are asked to examine the candidate's understanding of the basic and essential subjects.

Those who are from the computer science engineering branch need to study the core subjects 3. Programming & Data Structures to excel in the GATE Examination. Hence here on we are presenting the CSE Core Subjects Notes. The GATE CSE Core Subject Books can be a little lengthy to study. However if you are preparing for the GATE CS engineering then you must use the textbooks for the core topics. 

But if you want to save your time and prepare for the exam. Then you have landed on the right place. Here we have a total of 11 CSE Core Subjects Notes for each topic. GATE 2021 Core Subjects 3. Programming & Data Structures for CSE PDF download for free of cost here. 

GATE 2022 Syllabus for CSE Core Subjects - Check Topics Here

GATE 2022 Syllabus for CSE Core Subjects 3. Programming & Data Structures allow you to explore the topics and subtopics that you have to study. However the GATE entrance Exam is for Higher Engineering Education or to get the job in a PSUs. It means you are already aware of the chapters and topics of CSE Core Subjects. But here we are giving the list of chapters with topics that are part of the GATE CSE Syllabus.

GATE CSE Core Subjects Chapter and Topics Name


Chapter Names



Digital Logic

  1. Boolean algebra
  2. Combinational and sequential circuits
  3. Minimization
  4. Number representations and computer arithmetic (fixed and floating point)


Computer Organization and Architecture

  1. Machine instructions and addressing modes
  2. ALU
  3. data? path and control unit
  4. Instruction pipelining
  5. Memory hierarchy
  6. Cache
  7. Main memory and secondary storage
  8. I/O interface (interrupt and DMA mode)


Programming and Data Structures

  1. Programming in C
  2. Recursion
  3. Arrays
  4. Stacks
  5. Queues
  6. Linked lists
  7. Trees
  8. Binary search trees
  9. Binary heaps
  10. Graphs



  1. Searching
  2. Sorting
  3. Hashing
  4. Asymptotic worst case time and space complexity
  5. Algorithm design techniques
  6. Greedy
  7. Dynamic programming and pide?and?conquer
  8. Graph search
  9. Minimum spanning trees
  10. Shortest paths


Theory of Computation

  1. Regular expressions and finite automata
  2. Context-free grammars and push-down automata
  3. Regular and context-free languages
  4. Pumping lemma
  5. Turing machines and undecidability


Compiler Design

  1. Lexical analysis
  2. Parsing
  3. Syntax-directed translation
  4. Runtime environments
  5. Intermediate code generation


Operating System

  1. Processes
  2. Threads
  3. Inter?process communication
  4. Concurrency and synchronization
  5. Deadlock
  6. CPU scheduling
  7. Memory management and virtual memory
  8. File systems



  1. ER?model
  2. Relational model
  3. Relational algebra
  4. Tuple calculus
  5. SQL
  6. Integrity constraints
  7. Normal forms
  8. File organization
  9. Indexing (e.g., B and B+ trees)
  10. Transactions and concurrency control


Computer Networks

  1. Concept of layering
  2. LAN technologies (Ethernet)
  3. Flow and error control techniques
  4. Switching
  5. IPv4/IPv6
  6. Routers and routing algorithms (distance vector, link state)
  7. TCP/UDP and sockets
  8. congestion control
  9. Application layer protocols (DNS, SMTP, POP, FTP, HTTP)
  10. Basics of Wi-Fi
  11. Network security: authentication
  12. Basics of public key and private key cryptography
  13. Digital signatures and certificates
  14. Firewalls


Software Engineering & Web Technology

  1. HTML
  2. Tags
  3. Attributes
  4. External Linking 
  5. Hyperlinks 
  6. Breaks 
  7. Tables
  8. Images and Color
  9. Frames 
  10. CSS
  11. XML

GATE Core Subjects 3. Programming & Data Structures Practice Sets For Entrance Exam

GATE Core Subjects 3. Programming & Data Structures For CSE Entrance Exam needs to have practice sets for assessing the knowledge gained from the core subjects notes. That is why here selfstudys team has prepared the study Practice sets. 

Up to 4 sets are provided chapter-wise to practice daily. These are completely free to download in PDF version. Each set consists of a total of 35 questions and maximum 30 marks are allotted as a reward for solving the questions. The question format is very similar to the GATE Exam. It has MCQ, MSQ and NAT types of questions. 

Along with the question we have also given the Answer Key and each question has been explained in a very comprehensive manner. is a free educational content provider for helping you to do the study without any hassle. If you are preparing for the GATE CS Entrance Examination. Then we think you might like visiting the GATE CS Previous Year Papers. Click Here to Download PYP
Thank You for visiting Selfstudys. Hopefully you have found something useful for you here. Such as GATE Core Subjects for CSE Entrance Exam Download PDF, Questions with Solutions, Latest Syllabus, etc.

We are providing something unique, useful and most importantly fun. By giving students a tool to find instant solutions to their doubts, we’re trying to make every student self-sufficient in practicing & completing their homework

Follow Us

Copyright ©2021 All Rights Reserved,

Open Now