← GATE DA guide GATE DA · Section 4
Programming, Data Structures and Algorithms
A CS section — only its graph-theory portion overlaps our Discrete Structure titles.
Books that cover Section 4
Looking for the right book for this section? These are the titles from our RGPV AI & Data Science range that cover it — tap through for full contents, price and buy options.
Discrete Structure
B.Tech CS & IT, Semester 3 · Dr. D.C. Agarwal
Covers: The introduction to graph theory — planar and weighted graphs, paths and cycles, Eulerian and Hamiltonian circuits and graph colouring.
View details 
Introduction to Discrete Structure & Linear Algebra
B.Tech AI & Machine Learning, Semester 4 · Dr. D.C. Agarwal, Dr. Pradeep K. Joshi
Covers: The graph-theory portion — paths, cycles, shortest path and graph colouring.
View details Full syllabus — Section 4
- Programming in Python
- Basic data structures: stacks, queues, linked lists, trees, hash tables
- Search algorithms: linear and binary search; basic sorting: selection, bubble and insertion sort; divide and conquer: mergesort, quicksort
- Introduction to graph theory; basic graph algorithms: traversals and shortest path
Not in our range — Programming in Python, the core data structures (stacks, queues, linked lists, trees, hash tables) and the searching/sorting and divide-and-conquer algorithms — CS programming topics outside our mathematics range.