MAKAUT Data Structures & Algorithms Previous Year Question Papers (2021-2024)
Data Structures & Algorithms (PCC-CS301) is a 3rd semester subject in Computer Science & Engineering. This page has 4 previous year question papers, 2021-2024, to open or download as PDF. For 2 years the questions are also written out below, so you can read them by module.
SAMPLE DATA, replace with real questions. This page is hidden from search engines until the sample flag is removed from its content file.
Question papers
- 2024 paper, opens in a new tabRead questions from 2024
- 2023 paper, opens in a new tabRead questions from 2023
- 2022 paper, opens in a new tab
- 2021 paper, opens in a new tab
Tap a year to open the paper in your browser, or the arrow to download it.
Questions by year
- Q1
SAMPLE DATA, replace with real questions. Define time complexity.
2 marksModule 1Group A
- Q2
SAMPLE DATA, replace with real questions. What is a circular queue?
2 marksModule 2Group A
- Q3
SAMPLE DATA, replace with real questions. Explain inorder traversal of a binary tree.
5 marksModule 3Group B
- Q4
SAMPLE DATA, replace with real questions. Compare BFS and DFS.
5 marksModule 4Group B
- Q5
SAMPLE DATA, replace with real questions. Describe quick sort and its worst case.
15 marksModule 5Group C
- Q1
SAMPLE DATA, replace with real questions. State the difference between an array and a linked list.
2 marksModule 1
- Q2
SAMPLE DATA, replace with real questions. Insert a node into a binary search tree.
5 marksModule 3
Study Data Structures & Algorithms with unit-wise notes
See the syllabus, then unlock the notes written for the MAKAUT paper.
Related subjects
Papers are collected from publicly available MAKAUT question papers and may not be exhaustive.