AKTU B.Tech. ACS201 Essentials of Data Structures Solved Question Bank

This EduQuest solved question bank supports exam preparation for Dr. A.P.J. Abdul Kalam Technical University (AKTU) B.Tech. First Year, Engineering Science Course; prerequisite ACS101 Programming Language. It follows the official syllabus of Essentials of Data Structures (course code ACS201) unit by unit.

What is included

• Quick revision sheet of key formulae at the start of every unit.
• 12 short answer questions (2 marks) per unit with exam-ready answers.
• 12 long answer questions (7 marks) per unit with complete step-by-step solutions, diagrams and numericals.
• MOST IMPORTANT and IMPORTANT tags with a summary list for each unit.
• AKTU-format model question papers with complete solutions.

Unit-wise syllabus coverage

1. Unit 1 – Introduction and Arrays: Data structure – definition, need, classification (linear / non-linear, static / dynamic). Algorithm efficiency – Big O notation: O(1), O(n), O(log n), O(n2 ) – concept only. Array – insert, delete, search, traverse in C/Python. 2D array – matrix addition and transpose. Applications: NumPy array (AI/ML), image as 2D matrix, sensor data log as array, spreadsheet rows.
2. Unit 2 – Linked List: Node – data + pointer; why linked list over array. Singly linked list – insert (head, tail, position), delete, traverse. Doubly linked list – concept and structure only. Circular linked list – concept only. Applications: Browser back/forward = doubly linked list. Music playlist = circular. Python deque = doubly linked list (used in BFS, LRU cache).
3. Unit 3 – Stack and Queue: Stack – LIFO; push, pop, peek; implementation using array in C/Python. Application: balanced parentheses check; function call stack (concept). Queue – FIFO; enqueue, dequeue; implementation using array in C/Python. Application: print spooler; task scheduling queue, Polish Notation. Applications: Ctrl+Z = Stack. WhatsApp delivery = Queue. Python error traceback is a call stack. CPU scheduling = queue.
4. Unit 4 – Searching and Sorting: Linear search, binary search, comparison. Bubble sort and insertion sort, Quick Sort and Selection Sort – trace + C/Python. Merge sort – concept and trace only. Python built-in sort() and sorted(). Applications: Binary search in database index. Python sort() uses Timsort. E-commerce ranking, leaderboard, ML data preprocessing = sorting.
5. Unit 5 – Trees and Graphs (Concept Level): Binary tree – terminology (root, leaf, height, level); properties. Binary Search Tree – insert, search; demo inorder/preorder traversal trace. Graph – vertex, edge, directed/undirected; adjacency list representation, insertion. BFS and DFS – trace on a small graph (5–6 nodes). Applications: File system = tree. BST in database indexing. Google Maps = weighted graph. Social network = graph. Decision Tree in ML = binary tree.

Course details

• University: Dr. A.P.J. Abdul Kalam Technical University (AKTU), Lucknow
• Programme: B.Tech. First Year
• Subject: Essentials of Data Structures
• Course code: ACS201
• Stream: Engineering Science Course; prerequisite ACS101 Programming Language
• Credits: 2
• PDF length: 112 pages
• Format: PDF

Use this question bank along with the official syllabus, your class notes and the prescribed text books.

Prepared By

EduQuest by University Academy & ExamCompetition

More study resources at universityacademy.in