Data Structures & Algorithms (DSA) Module 21 – Algorithms in practice
How DSA is tested: GATE, assessments, interviews
What GATE, online coding assessments and technical interviews ask about data structures and algorithms, how each is marked, and how to practise for all three.
What you will learn
- Describe GATE's MCQ, MSQ and NAT formats and marking from the official page
- Prepare for online coding assessments without relying on leaked questions
- Plan revision with timed practice and spaced repetition
Before you start
What you’ll learn · Before you start
What you will learn
- Describe GATE's MCQ, MSQ and NAT formats and marking from the official page
- Prepare for online coding assessments without relying on leaked questions
- Plan revision with timed practice and spaced repetition
Before you start
On this page
Data structures and algorithms are tested in three main ways, and each marks a different kind of answer. Written exams such as GATE, India’s Graduate Aptitude Test in Engineering, ask multiple-choice and numerical questions about how algorithms and structures behave, with no program to run. Online coding assessments give a few problems, a time limit and hidden test cases, and score the share of tests a program passes in time. Interviews put a person in front of you who watches you clarify the problem, find a solution, code it and test it, and who judges the reasoning as much as the result. Good preparation practises the kind of answer each one marks, and for all three, practice spread over weeks, with missed problems solved again from scratch, outlasts rereading solutions.
Three tests, three kinds of answer
| Criterion | Written exam, such as GATE | Online coding assessment | Interview |
|---|---|---|---|
| You produce | A choice, several choices or a number | A program that runs | Spoken reasoning, code and tests |
| Marked by | An answer key, with marks lost for wrong single-choice answers | Hidden tests, each with a time limit | A person, against a rubric |
| Practise | Tracing, counting and properties by hand | Reading constraints, choosing a complexity, edge cases | A brute force first, then a better idea, explained aloud |
GATE
GATE 2027 is a computer-based test of 65 questions worth 100 marks in 3 hours, with a virtual scientific calculator on screen. Its questions are multiple-choice (MCQ, one right option), multiple-select (MSQ, one or more right options) or numerical-answer (NAT, you type a number). A wrong 1-mark MCQ costs 1/3 of a mark and a wrong 2-mark MCQ 2/3; MSQ and NAT answers lose nothing, and an MSQ has no partial marks. The Computer Science paper tests DSA in Section 4, Programming and Data Structures, and Section 5, Algorithms; the Data Science and AI paper tests it in Python. One number shows how the marking works: a blind guess on a four-option 1-mark MCQ is worth 1/4 × 1 − 3/4 × 1/3 = 0 marks on average.
Online coding assessments usually run in a browser editor: you read a few problems, write code in a language you choose and submit it against tests you cannot see. A program that is right but too slow passes the small tests and fails the large ones, so the constraints in the statement tell you which complexity you need.
Interviews mark the path as well as the destination. A clear brute force, a named bottleneck and an improvement that you can justify, with its complexity and a test or two, usually count for more than silent, perfect code.
GATE marking, worked: when an attempt is worth it Pro: opens with a Pro, Premium or Ultimate pass
In this part:
- Score an answer sheet with GATE's marking rules
- Online assessments: constraints, partial scores and honest practice
- Interviews: what a strong answer covers, level by level
- A revision plan with spaced practice, with numbers
- Check yourself in the GATE formats
- Check yourself
- Interview questions
- In a coding interview you are given a problem you have never seen. Walk through what you do in the first ten minutes, before writing any code, and what you say out loud.
- In an online assessment your solution passes the sample tests but fails 4 of 10 hidden tests: 2 with a wrong answer and 2 with a time limit. What do you check, and in what order, with 25 minutes left?
- An assessment problem allows n up to 2 × 10⁵ with a 2-second limit. You have an O(n²) solution. Will it pass in C++? In Python? What would you do, and what would you submit, with 20 minutes left?
- Key takeaways
4 runnable examples (Python) · 1 exercise with sample tests · 3 interview answers · about 21 minutes
Opening this part with your pass…
This part opens with any MySmartCoPilot pass.
- Pro pass · 1 week₹79$2.99
- 30 days₹179$5.99
- 1 year₹1,699$45
One payment; a pass never renews. The price shown is the total you pay: no fees or charges are added at checkout.
Passes can’t be bought right now, so this part can’t be opened at the moment. The free part above stands on its own. If you have a pass, enter your licence key.
It also opens every other in-depth part in Learn and every Pro tool. Sales are final, except where the law gives you a right to withdraw, for example in the EU and the UK (refund policy).
References
- GATE 2027 question paper pattern (IIT Madras (GATE 2027 organising institute))
- GATE 2027 syllabus for Computer Science and Information Technology (CS) (IIT Madras (GATE 2027 organising institute))
- GATE 2027 syllabus for Data Science and Artificial Intelligence (DA) (IIT Madras (GATE 2027 organising institute))
- GATE 2027 frequently asked questions (the virtual scientific calculator) (IIT Madras (GATE 2027 organising institute))
- Distributed practice in verbal recall tasks: a review and quantitative synthesis (N. J. Cepeda, H. Pashler, E. Vul, J. T. Wixted and D. Rohrer, Psychological Bulletin, volume 132, number 3) (American Psychological Association)
- Test-enhanced learning: taking memory tests improves long-term retention (H. L. Roediger and J. D. Karpicke, Psychological Science, volume 17, number 3) (Association for Psychological Science)
Related tools
Report a problem with this lesson
Kept only in this browser. Your Learn progress