SA-21/06, C-11, Asapur, Varanasi, UP support@kamaldnp.com +91 8318013442
AKTU Syllabus

Essentials of Data Structures (ACS201) — AKTU B.Tech 1st Year Syllabus 2026-27: Units, Exam Pattern & Preparation

KAMALDNP Raj Kamal
November 19, 2026
11 Min Read
Essentials of Data Structures (ACS201) — AKTU B.Tech 1st Year Syllabus 2026-27: Units, Exam Pattern & Preparation

Essentials of Data Structures (ACS201) — What This Subject Covers

Essentials of Data Structures (ACS201) is the data-structures course of the AKTU B.Tech first year (CSE stream) under Course Structure V16, in force from session 2026-27. Its prerequisite is ACS101 Programming Languages (C/C++ + Python), and it builds directly on it: you already know how to write programs; now you learn how to organise data so programs run fast. The five units run from arrays and Big O notation, through linked lists, stacks and queues, into searching and sorting, and finish with trees and graphs at the concept level.

The course's own method is "draw first, code later" — every data structure is shown visually on the board before any code is written, and trace problems are worked on paper before coding. The end-semester paper follows the same mix: theory + trace problems + short code writing. A trace question asks you to show every intermediate step — the array after each pass, the stack after each push — so marks go to students who show their working, not just the final answer.

ACS201 • 3 Credits • 2-1-0 • 45 Hours • 70 End-Semester Marks + 30 Internal • 3 Hours • 5 Units at 20% Each

Essentials of Data Structures ACS201 — AKTU B.Tech 1st Year syllabus 2026-27, arrays, linked lists, trees, graphs
Arrays to graphs — five units, each worth 20%, with trace problems at the centre of the paper.

ACS201 at a Glance

ItemDetail
Course codeACS201 — Essentials of Data Structures
Course categoryEngineering Science Course (ESC)
PrerequisiteACS101 — Programming Languages (C/C++ + Python)
Credits3
L-T-P2-1-0 (2 lecture hours + 1 tutorial hour per week)
Total hours45
Units5 units, 20% weightage each
End-semester theory70 marks, 3 hours (theory + trace problems + short code writing)
Internal assessment30 marks — Class Tests + Assignments / Quiz (Teacher's Assessment)
LanguagesC / Python (Python for quick 5-line demos where it adds clarity)
SchemeAKTU B.Tech First Year CSE Stream Syllabus 2026-27, Course Structure V16 (w.e.f. 2026-27, AICTE Model Curriculum & NEP 2020)

Unit-wise Syllabus

UnitTopicsWeightage
Unit 1 — Introduction and ArraysData structure — definition, need, classification (linear / non-linear, static / dynamic); algorithm efficiency — Big O notation: O(1), O(n), O(log n), O(n²) — concept only; array — insert, delete, search, traverse in C/Python; 2D array — matrix addition and transpose20%
Unit 2 — Linked ListNode — 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 only20%
Unit 3 — Stack and QueueStack — 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 Notation20%
Unit 4 — Searching and SortingLinear 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()20%
Unit 5 — Trees and Graphs (Concept Level)Binary tree — terminology (root, leaf, height, level); properties; binary search tree — insert, search; inorder/preorder traversal trace; graph — vertex, edge, directed/undirected; adjacency list representation, insertion; BFS and DFS — trace on a small graph (5–6 nodes)20%

Real connect, as the syllabus puts it: a NumPy array powers AI/ML and an image is a 2D matrix; browser back/forward behaves like a doubly linked list and a music playlist like a circular one; Ctrl+Z is a stack and WhatsApp delivery is a queue; binary search lives inside database indexes and Python's sort() uses Timsort; a file system is a tree and Google Maps is a weighted graph.

Exam Pattern — What Is Verified and What Is Not

The verified frame, from the V16 scheme: 70 marks end-semester theory in 3 hours, plus 30 internal-assessment marks (Class Tests + Assignments/Quiz). The end-semester paper covers theory + trace problems + short code writing. Each unit carries 20% weightage, so no unit can be skipped safely.

What the scheme does not publish: the AKTU scheme prescribes the 70-mark / 3-hour frame but publishes no section-wise question pattern — no official statement of how many short or long questions the paper will have. Any section split you see in a practice paper (for example, 10 short questions × 2 marks + 5 long questions × 10 marks) is a KAMALDNP practice design inside the verified frame, not the university's published pattern. Prepare for the full syllabus, not for a guessed pattern.

Exam dates: the AKTU theory exam window for this session is 24 November – 27 December 2026 (Academic Calendar Ref. AKTU/RO/2026/12402, 3 July 2026). The subject-wise date sheet has NOT been released as of 18 November 2026, and no exam date for ACS201 exists yet. Do not trust any site that prints a date for this subject — check the university's own date sheet when it is published.

How to Prepare for ACS201

  • Trace on paper before you code. That is the course's own method. Work the syllabus's own trace problems first: insertion at index 2 in [10, 20, 30, 40]; deletion of 30 from the same array; inserting 10, 20, 30 at the head of a list; deleting node 20 from 10 → 20 → 30 → NULL; push(5), push(10), pop(), push(15); enqueue(A, B), dequeue(), enqueue(C); checking '({[]})' for balance; binary search for 35 in [10, 20, 30, 35, 40, 50]; bubble sort on [64, 34, 25, 12]; insertion sort on [5, 3, 8, 1]; BST insert of 50, 30, 70, 20, 40; and BFS from A on A-B, A-C, B-D, C-E.
  • Learn the five trace answers cold. Binary search finds 35 at index 3 in 3 comparisons. Bubble sort on [64, 34, 25, 12] takes 6 swaps over 3 passes. Insertion sort on [5, 3, 8, 1] gives [1, 3, 5, 8]. The BST's inorder traversal is 20, 30, 40, 50, 70. BFS from A visits A, B, C, D, E; DFS visits A, B, D, C, E.
  • Draw every structure before you write about it. A labelled diagram of a node, a stack, a BST or a graph earns marks and prevents mistakes — a wrong pointer in a diagram is easy to spot, a wrong pointer in prose is not.
  • Know the one-line comparisons. Stack is LIFO, queue is FIFO. Binary search needs a sorted array; linear search does not. sort() changes the list; sorted() returns a new one. Inorder of a BST prints sorted values.
  • Use VisuAlgo. The syllabus recommends visualgo.net — free animations of every data structure and algorithm in this course. Watch a sort run once and the trace becomes obvious.

About the Study Material for This Subject

The study material for ACS201 (short revision notes, question bank and practice sets, in English and Hindi) contains practice and guess sets only. No verified previous AKTU paper exists for this subject under the new V16 scheme — the A-series codes start in session 2026-27, so there is no previous paper under code ACS201. Old K-series papers belong to a different syllabus and are not used. Every question in the material is an original practice question written from the syllabus units above; none of it is an AKTU examination paper, and none of it claims to be.

FAQs

What is the ACS201 syllabus for AKTU B.Tech 1st Year 2026-27?

ACS201 Essentials of Data Structures has 5 units at 20% each: Unit 1 — Introduction and Arrays (Big O, array operations, 2D arrays); Unit 2 — Linked List (singly, doubly and circular); Unit 3 — Stack and Queue; Unit 4 — Searching and Sorting; Unit 5 — Trees and Graphs at the concept level. The full unit-wise table is above.

How many marks is the ACS201 paper, and how long is it?

The end-semester theory paper is 70 marks in 3 hours, plus 30 internal-assessment marks (Class Tests + Assignments/Quiz), for a total of 100. The paper covers theory, trace problems and short code writing in C or Python.

Is there a fixed question pattern for the ACS201 paper?

No. The AKTU scheme prescribes 70 marks and 3 hours but publishes no section-wise question pattern. Any Part A / Part B split in a practice paper is a KAMALDNP practice design inside the verified frame, not the university's published pattern.

When is the ACS201 exam in 2026?

The AKTU theory exam window is 24 November – 27 December 2026, but the subject-wise date sheet has NOT been released as of 18 November 2026, so there is no exam date for ACS201 yet. Check the university's own date sheet when it is published.

What is the prerequisite for ACS201?

ACS101 Programming Languages (C/C++ + Python). ACS201 assumes you can already write programs and focuses on how to organise data — arrays, linked lists, stacks, queues, trees and graphs.

Are previous year AKTU papers available for ACS201?

No. The V16 scheme (A-series codes) starts in session 2026-27, so no previous AKTU paper exists under code ACS201. Old K-series papers belong to a different syllabus. The study material for this subject contains original practice questions only.

Related Posts — AKTU B.Tech 1st Year Syllabus 2026-27

Notes, Question Bank & Practice Sets — Essentials of Data Structures

The syllabus PDF on this page stays 100% FREE — no login, no payment, always. The study material below is a paid KAMALDNP product: buy once for just ₹10 and you get both the Hindi and English PDFs. Every PDF is generated with your name and enrolment number and is password-locked, so it remains personal to you. After purchase, the PDF is also sent to your email, and it is always available for download on the My Downloads page.

Short Notes (English + Hindi) — ₹10

Unit-wise short revision notes prepared from the official AKTU B.Tech 1st Year CSE Stream Syllabus 2026-27 (Course Structure V16) of this subject.

Buy / Download — My Downloads
Question Bank (English + Hindi) — ₹10

60 original practice questions (40-question bank + 2 full model papers) with model-answer outlines. This is a KAMALDNP practice paper — NOT an AKTU examination paper, and no question in it is promised to appear in your exam.

Buy / Download — My Downloads
Practice Sets (English + Hindi) — ₹10

1 full practice paper (70 marks, 3 hours) with model answer outlines — practice/guess set only (no verified previous-year AKTU papers exist for this subject under the new V16 scheme)

Buy / Download — My Downloads

Already purchased? You will find the Download button on the same My Downloads page — you will not be charged again.

Sources and Honesty Note

Official syllabus PDF: Download the AKTU B.Tech 1st Year CSE stream syllabus (V16, 2026-27) — aktu-btech-1st-year-cse-stream.pdf (hosted on kamaldnp.com).

All syllabus facts in this post come from the official AKTU B.Tech First Year CSE Stream Syllabus 2026-27, Course Structure V16 (w.e.f. 2026-27), ACS201 section — code, prerequisite, units, topics, objectives, outcomes, evaluation pattern and the unit-wise suggested assignment/trace problems. The exam frame (70 end-semester + 30 internal, 3 hours) and the credits/hours (3 credits, 2-1-0, 45 hours) come from the V16 scheme tables. The theory exam window (24 November – 27 December 2026) comes from the AKTU Academic Calendar Ref. AKTU/RO/2026/12402, 3 July 2026. One discrepancy is on record: the detailed ACS201 syllabus page header lists 2 credits and 30 hours with no tutorial hour, while the V16 scheme tables list 3 credits, 2-1-0 and 45 hours; this post follows the scheme tables. What this post deliberately does not claim: no subject-wise exam date (the date sheet is not released as of 18 November 2026), no official section-wise question pattern (the scheme publishes none), and no previous AKTU paper for ACS201 (none exists under the new V16 scheme).

Comments (0)

Share your question or experience about this syllabus. Your comment will appear after review.

No comments yet — be the first to share your thoughts!

🤖 KAMALDNP AI Assistant

Ask about courses, website & more

Hi! I'm KAMALDNP AI Assistant. Ask me about our courses, website features, or anything else! 😊
Please wait 5s...
🤖 KAMALDNP Assistant ✕

Request human callback:

🔐 Login Required
✕

Please log in to download. You will stay on this page after logging in!

New here? Register now →