Data Structure & Algorithms 2025 — MAKAUT · PCC-CS301 · Mid Sem PYQ with solutions

  • With solutions
  • Verified

Maulana Abul Kalam Azad University of Technology

Solutions

27 answers across 3 groups

Try each question first, then open it to check your answer.

Group AVery Short Answer Type Question · answer any 10 · 1 mark each

  1. I

    What is the disadvantage of array data structure?a) The amount of memory to be allocated should be known beforehand. b) Elements of an array can be accessed in constant time. c) Elements are stored in contiguous memory blocks. d) Multiple other data structures can be implemented using arrays.

    Answer: a) The amount of memory to be allocated should be known beforehand.

    Explanation

    Arrays have a static size, meaning their memory allocation is fixed at compile-time (or creation time) and cannot be dynamically resized during runtime.

  2. II

    Which of the following data structures allow insertion and deletion from both ends?a) Stack b) Deque c) Queue d) Strings

  3. III

    Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?a) Merge Sort b) Quick Sort c) Bubble Sort d) Selection Sort

  4. IV

    Worst case time complexity to access an element in a BST can be?a) O(n) b) O(n * logn) c) O(1) d) O(logn)

  5. V

    How are String represented in memory in C?a) An array of characters. b) The object of some class. c) Same as other primitive data types. d) LinkedList of characters.

  6. VI

    Which of the following data structures can be used to implement queues?a) Stack b) Arrays c) Linked List d) Both b and c

  7. VII

    Which of the following is a Divide and Conquer algorithm?a) Bubble Sort b) Selection Sort c) Heap Sort d) Merge Sort

  8. VIII

    What is the best case time complexity of the binary search algorithm?a) O(1) b) O(n) c) O(log2n) d) O(n^2)

  9. IX

    What is the time complexity to insert an element to the front of a LinkedList (head pointer given)?a) O(n) b) O(1) c) O(logn) d) O(n * logn)

  10. X

    In a B+ tree, both the internal nodes and the leaves have keys.a) True b) False

  11. XI

    What is the time complexity of an infix to postfix conversion algorithm?a) O(N log N) b) O(N) c) O(N2) d) O(M log N)

  12. XII

    What is a hash table?a) A structure that maps values to keys. b) A structure that maps keys to values. c) A structure used for storage. d) A structure used to implement stack and queue.

Group BShort Answer Type Question · answer any 3 · 5 marks each

  1. 2

    Write an algorithm to create linear linked list with n nodes.

  2. 3

    Write an algorithm to insert an element in Circular Queue.

  3. 4

    Justify the statement with proper example: All Binary Search Trees are Binary Tree but All Binary Trees are not Binary Search Tree.

  4. 5

    Find the time complexity of recursive algorithm of Tower of Hanoi.

  5. 6

    Convert the given infix expression to postfix expression A+B*C-D$F/H

Group CLong Answer Type Question · answer any 3 · 15 marks each

  1. 7

    Create a AVL tree by inserting the following numbers in the order in which they are given: 17, 25, 19, 23, 75, 6. Explain it step wise with suitable diagram. What is Threaded Binary Tree? What are its advantages?

  2. 8

    Define queue and its applications. Write an algorithm for insertion and deletion from queue.

  3. 9(a)

    Define Circular Linked List and Double Linked List.

  4. 9(b)

    Write an algorithm to delete an element from Double Linked List. [Consider three cases: 1st node deletion, last node deletion and any intermediate node deletion]

  5. 10(a)

    Write a quick sort algorithm to sort a list. Explain with an example.

  6. 10(b)

    Prove that the best case time complexity for quick sort is O (n log n) for input size of n.

  7. 11(a)

    AVL Tree

  8. 11(b)

    Dequeue and Priority Queue

  9. 11(c)

    Collison Resolution Techniques in Hashing

  10. 11(d)

    BFS

About this paper

The MAKAUT Data Structure & Algorithms (PCC-CS301) 2025 Mid Sem previous year question paper, set in semester 3. Download the verified PDF or read it online, then check your answers against the worked solutions above.

Common paper for 4 branches

Every branch listed gets the same questions. Pick a branch to see its other papers.

Why solve Data Structure & Algorithms PYQs?

Frequently asked questions

5 questions

What is the subject code for Data Structure & Algorithms?

PCC-CS301 is the MAKAUT subject code for Data Structure & Algorithms.

Which exam is this Data Structure & Algorithms question paper from?

The MAKAUT 2025 Mid Sem exam, semester 3. A student shared it, and it was checked before publishing.

Which branches is this Data Structure & Algorithms paper for?

It's a common paper for 4 B.Tech branches: Computer Science and Engineering, Computer Science and Engineering (Data Science), Information Technology and Computer Science and Engineering (Artificial Intelligence and Machine Learning). Every branch gets the same questions.

Where can I find more PCC-CS301 question papers?

On the Data Structure & Algorithms subject page, which collects every year's papers along with notes and the syllabus.

Are there solutions for this paper?

Yes. Every question has a worked answer on this page, grouped like the paper. The first answer is free to read; sign in (it's free) to unlock the rest.

Have notes or the answer key for Data Structure & Algorithms?

Share it and help the next batch of students.

Related question papers

Data Structure & AlgorithmsPCC-CS301 · 2024 · Mid SemData Structure & AlgorithmsPCC-CS301 · 2025 · Mid SemData Structure & AlgorithmsPCC-CS301 · 2023 · Mid SemData Structure & AlgorithmsPCC-CS301 · 2023 · Mid Sem

Explore more MAKAUT resources