Explore: All GATE DA topics · GATE DA Data Science and Artificial Intelligence PYQs · GATE DA hub · Syllabus & pattern · GATE DA 2026
How often Programming, Data Structures and Algorithms is asked
In the 3 official GATE DA papers we tagged (2024–2026), Programming, Data Structures and Algorithms (Data Science and Artificial Intelligence) had 31 questions, appearing in 3 of them. Asked in 3 of 3 years. Weightage: 16 marks a year on average (14–20), about 16% of a 100-mark paper. The concepts asked in the most papers: Python Programming, Sorting, Graph Algorithms.
Year-wise question count
Asked in 3 of 3 years.
| Year | Questions | Marks |
|---|---|---|
| GATE DA 2026 | 9 | 14 |
| GATE DA 2025 | 9 | 14 |
| GATE DA 2024 | 13 | 20 |
Most-asked concepts
Sorted by the number of papers a concept appeared in.
| Concept | Questions | Papers | Years |
|---|---|---|---|
| Python Programming | 6 | 3 | 2026, 2025, 2024 |
| Sorting | 5 | 3 | 2026, 2025, 2024 |
| Graph Algorithms | 4 | 3 | 2026, 2025, 2024 |
| Recursion | 3 | 3 | 2026, 2025, 2024 |
| Searching | 3 | 3 | 2026, 2025, 2024 |
| Stacks and Queues | 3 | 2 | 2025, 2024 |
| Trees | 3 | 2 | 2026, 2024 |
| Hash Tables | 2 | 2 | 2025, 2024 |
| Shortest Paths | 1 | 1 | 2025 |
| Time Complexity | 1 | 1 | 2026 |
How to practise Programming, Data Structures and Algorithms PYQs
- Start with the concepts at the top of the table. They have come back the most.
- Solve one year’s Programming, Data Structures and Algorithms questions from the official PDF against the clock, then check the answer listed below.
- For each mistake, note whether you didn’t know the concept, slipped on a calculation or misread the question. Each needs a different fix.
- Once a concept is clean in two papers, move to the next. Then sit a full paper from the year pages.
Questions by year
Each line gives the question number, type, concept, our one-line summary and the official answer, with a link to the official PDF.
GATE DA 2026
- Q.15 · MCQ · 1 mark · Time Complexity: Recurrence for expected quicksort time with first-element pivot (official answer: D) PDF
- Q.16 · MCQ · 1 mark · Python Programming: Output of a Python function with a mutable default list argument (official answer: B) PDF
- Q.25 · MSQ · 1 mark · Trees: Binary tree facts from its preorder and inorder traversals (official answer: A, B) PDF
- Q.31 · NAT · 1 mark · Searching: Maximum comparisons in an unsuccessful binary search on 1000 elements (official answer: 10) PDF
- Q.39 · MCQ · 2 marks · Recursion: Total recursive calls made to compute a Fibonacci-like Python function (official answer: C) PDF
- Q.40 · MCQ · 2 marks · Graph Algorithms: Reachability in BFS and DFS on a graph and its reverse (official answer: D) PDF
- Q.49 · MSQ · 2 marks · Sorting: Comparisons and swaps by bubble and insertion sort on a nearly sorted array (official answer: B, C, D) PDF
- Q.50 · MSQ · 2 marks · Python Programming: Outputs of Python closures that append to an enclosed list (official answer: B, D) PDF
- Q.58 · NAT · 2 marks · Sorting: Swap count printed by a recursive bubble pass in Python (official answer: 8) PDF
GATE DA 2025
- Q.18 · MCQ · 1 mark · Hash Tables: Slots of keys inserted with linear probing into a hash table (official answer: D) PDF
- Q.23 · MCQ · 1 mark · Python Programming: Python list method that joins one list onto another (official answer: A) PDF
- Q.27 · MSQ · 1 mark · Searching: Inputs on which binary search runs in logarithmic worst-case time (official answer: C) PDF
- Q.29 · MSQ · 1 mark · Sorting: Values allowing insertion sort to finish an array with two swaps (official answer: A, C) PDF
- Q.47 · MCQ · 2 marks · Python Programming: Which sets contain a string after a Python loop of set operations (official answer: B) PDF
- Q.58 · MSQ · 2 marks · Shortest Paths: Edges that cannot exist given several shortest paths in a graph (official answer: A, C, D) PDF
- Q.63 · NAT · 2 marks · Recursion: Value printed by a recursive Python function on two integers (official answer: 160) PDF
- Q.64 · NAT · 2 marks · Stacks and Queues: Sum output by a pseudocode program using push and pop on a stack (official answer: 24) PDF
- Q.65 · NAT · 2 marks · Graph Algorithms: Vertices discovered after a given vertex in DFS on a directed graph (official answer: 75) PDF
GATE DA 2024
- Q.14 · MCQ · 1 mark · Graph Algorithms: Edge type of an edge explored first during depth-first search (official answer: A) PDF
- Q.16 · MCQ · 1 mark · Stacks and Queues: Match FIFO, LIFO and lookup with stacks, queues, hash tables (official answer: A) PDF
- Q.21 · MCQ · 1 mark · Hash Tables: Expected probes to insert into an open-addressing hash table (official answer: B) PDF
- Q.28 · MSQ · 1 mark · Trees: Traversal pairs sufficient to rebuild a full binary tree (official answer: A, B, C) PDF
- Q.30 · NAT · 1 mark · Sorting: Minimum swaps by last-pivot quicksort on a sorted array (official answer: 0) PDF
- Q.32 · NAT · 1 mark · Stacks and Queues: Value removed after a sequence of double-ended queue operations (official answer: 17) PDF
- Q.38 · MCQ · 2 marks · Python Programming: Output of a recursive Python function counting tree nodes (official answer: D) PDF
- Q.39 · MCQ · 2 marks · Python Programming: Array returned by a pseudocode loop on a given list (official answer: C) PDF
- Q.40 · MCQ · 2 marks · Searching: Recurrence for worst-case comparisons in binary search (official answer: A) PDF
- Q.41 · MCQ · 2 marks · Recursion: Effect of a recursive Python function swapping list elements (official answer: C) PDF
- Q.45 · MCQ · 2 marks · Sorting: Sorting algorithms that sort a given array after two passes (official answer: B) PDF
- Q.51 · MSQ · 2 marks · Graph Algorithms: Valid topological orderings of a directed acyclic graph (official answer: B, D) PDF
- Q.52 · MSQ · 2 marks · Trees: Inequalities between height, internal nodes and leaves of a binary tree (official answer: A, B, C) PDF
Other Data Science and Artificial Intelligence topics
- Probability and Statistics PYQs
- Linear Algebra PYQs
- Calculus and Optimization PYQs
- Database Management and Warehousing PYQs
- Machine Learning PYQs
- Artificial Intelligence PYQs
FAQ
How many Programming, Data Structures and Algorithms questions come in GATE DA?
In the official papers we tagged: 9 in 2026, 9 in 2025 and 13 in 2024. That is 31 questions in all, about 19% of Data Science and Artificial Intelligence. Weightage: 16 marks a year on average (14–20), about 16% of a 100-mark paper.
Which Programming, Data Structures and Algorithms topics repeat in GATE DA?
Asked in the most papers: Python Programming, Sorting, Graph Algorithms. The concept table lists every one with its count.
Are these official GATE DA questions?
Yes. Every question is from an official GATE DA paper hosted on our year pages. The one-line summaries are ours; open the PDF linked beside each question for the full text.