FREE
AKTU Essentials of Data Structures (ACS201) Syllabus PDF – B.Tech 1st Year
Essentials of Data Structures ACS201
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 2
- 0 downloads
- 0 views
Official AKTU syllabus of Essentials of Data Structures (ACS201) for B.Tech 1st Year – 2 credits, L-T-P 2-1-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
- Mechanical Engineering › 1st Year
- Automobile Engineering › 1st Year
- Aeronautical Engineering › 1st Year
- Industrial Production Engineering › 1st Year
- Manufacturing Technology › 1st Year
- Mining Engineering › 1st Year
- Mechanical Engineering (WP) › 1st Year
- Electrical Engineering › 1st Year
- Electrical & Electronics Engineering › 1st Year
- Electrical & Computer Engineering › 1st Year
- Electrical Engineering (WP) › 1st Year
- Electronics Engineering › 1st Year
- Electronics and Communication Engineering › 1st Year
- Electronics and Communication (Advanced Communication Technology) › 1st Year
- Electronics Engineering (VLSI Design and Technology) › 1st Year
- Electronics and Instrumentation Engineering › 1st Year
- Instrumentation and Control Engineering › 1st Year
- Electronic and Computer Engineering › 1st Year
- Computer Science and Engineering › 1st Year
- Computer Science › 1st Year
- Computer Engineering › 1st Year
- Information Technology › 1st Year
- Computer Science and Information Technology › 1st Year
- Computer Science & Technology › 1st Year
- Computer Science and Design › 1st Year
- Computer Science and Engineering (Hindi) › 1st Year
- Computer Science and Engineering (Artificial Intelligence) › 1st Year
- Computer Science and Engineering (Artificial Intelligence & Machine Learning) › 1st Year
- Artificial Intelligence and Machine Learning › 1st Year
- Artificial Intelligence (AI) and Data Science › 1st Year
- Computer Science and Engineering (Data Science) › 1st Year
- Computer Science & Engineering (Cyber Security) › 1st Year
- Computer Science and Engineering (Internet of Things) › 1st Year
- Cyber Security › 1st Year
- Data Science › 1st Year
- Computer Science and Engineering (WP) › 1st Year
- Textile Technology › 1st Year
- Handloom & Textile Technology › 1st Year
- Carpet & Textile Technology › 1st Year
- Biotechnology › 1st Year
- Biomedical Engineering › 1st Year
- Bioinformatics › 1st Year
- Chemical Engineering › 1st Year
- Plastic Engineering › 1st Year
- Food Technology › 1st Year
- Agricultural Engineering › 1st Year
Syllabus — Essentials of Data Structures
Download PDFACS201 · 2 credits · L-T-P 2-1-0
Course Objectives
- Understand data structures and why choosing the right one affects program performance
- Implement linked list and perform basic insert, delete, and traverse operations
- Implement stack and queue and apply them to simple real-world problems
- Apply searching and sorting algorithms and compare their efficiency
- Understand trees and graphs at a conceptual level with real-world connections
Course Content
| Unit | Language | Topics | Weightage |
|---|---|---|---|
| 1. | C / Python | Introduction and Arrays 1. Data structure — definition, need, classification (linear / non-linear, static / dynamic) 2. Algorithm efficiency — Big O notation: O(1), O(n), O(log n), O(n²) — concept only 3. Array — insert, delete, search, traverse in C/Python 4. 2D array — matrix addition and transpose Real connect:NumPy array (AI/ML), image as 2D matrix, sensor data log as array, spreadsheet rows. | 20% |
| 2. | C/Python | Linked List 1. Node — data + pointer; why linked list over array 2. Singly linked list — insert (head, tail, position), delete, traverse 3. Doubly linked list — concept and structure only 4. Circular linked list — concept only Real connect: Browser back/forward = doubly linked list. Music playlist = circular. Python deque = doubly linked list (used in BFS, LRU cache). | 20% |
| 3. | C/Python | Stack and Queue 1. Stack — LIFO; push, pop, peek; implementation using array in C/Python 2. Application: balanced parentheses check; function call stack (concept) 3. Queue — FIFO; enqueue, dequeue; implementation using array in C/ Python 4. Application: print spooler; task scheduling queue, Polish Notation Real connect: Ctrl+Z = Stack. WhatsApp delivery = Queue. Python error traceback IS a call stack. CPU scheduling = queue. | 20% |
| 4. | C/Python | Searching and Sorting 1. Linear search, binary search, comparison 2. Bubble sort and insertion sort, Quick Sort and Selection Sort — trace + C/ Python 3. Merge sort — concept and trace only 4. Python built-in sort() and sorted() Real connect: Binary search in database index. Python sort() uses Timsort. E-commerce ranking, leaderboard, ML data preprocessing = sorting. | 20% |
| 5. | Trace + Python demo | Trees and Graphs (Concept Level) 1. Binary tree — terminology (root, leaf, height, level); properties 2. Binary Search Tree — insert, search; inorder/preorder traversal trace 3. Graph — vertex, edge, directed/undirected; adjacency list representation, insertion | 20% |
- BFS and DFS — trace on a small graph (5– 6 nodes) Real connect: File system = tree. BST in database indexing. Google Maps = weighted graph. Social network = graph. Decision Tree in ML = binary tree. Suggested Assignment / Practice Problems (Unit-wise) but not limited to No Tutorial hour in ACS201. The following problems are assigned as class assignments and self-practice. 2–3 per unit recommended for internal assessment.
| Unit | Trace on Paper | Code (C/Python) |
| I Arrays | 1. Trace insertion at index 2 in [10,20,30,40] 2. Trace deletion of element 30 from [10,20,30,40] 3. What is O(log n)? Give one example | 1. Input N numbers; find max, min, average 2. Count even and odd in array 3. Remove duplicates from array |
| II Linked List | 1. Draw linked list after inserting 10, 20, 30 at head 2. Trace deletion of node 20 from [10→20→30→NULL] 3. Difference between singly and doubly linked list | 1. Create linked list; insert at head; print 2. Insert node at tail 3. Delete node by value |
| III Stack & Queue | 1. Trace push(5), push(10), pop(), push(15) — what is top? 2. Trace enqueue(A,B), dequeue(), enqueue(C) — what is front? 3. Check '({[]})' balanced — show stack trace | 1. Stack using array — push and pop 5 elements 2. Queue using array — enqueue and dequeue 3. Balanced parentheses checker |
| IV Search& Sort | 1. Binary search for 35 in [10,20,30,35,40,50] — show steps 2. Bubble sort trace on [64,34,25,12] 3. Insertion sort trace on [5,3,8,1] | 1. Linear search and binary search — compare 2. Bubble sort — count swaps 3. Python: sort a list ascending and descending |
| V Tree & Graph | 1. Draw BST after inserting 50,30,70,20,40 2. Write inorder and preorder of above BST 3. BFS from A on: A-B, A-C, B-D, C-E | 1. BST insert and inorder in python 2. Graph as adjacency list in Python dict 3. BFS using queue in Python (10–15 lines) |
Teaching-Learning Methodology
Draw first, code later — every data structure is shown visually on the board before any code is written. Trace problems on paper before coding.
VisuAlgo animations are used in class for sorting and tree/graph traversal.
Python is used for quick 5-line demos where it adds clarity. Assignments include both trace and coding tasks for every unit.
Course Outcomes
| COs | Course Outcome Statement | KL |
|---|---|---|
| CO1 | Explain data structure types and Big O; implement array insert, delete, and search in C/Python | K3 |
| CO2 | Implement singly linked list operations and relate to real-world applications | K3 |
| CO3 | Implement stack and queue using arrays and apply them to solve simple problems | K3 |
| CO4 | Apply linear and binary search; trace and implement bubble and insertion sort | K3 |
| CO5 | Trace BST insert and traversal; trace BFS/DFS on a small graph | K2 |
Evaluation Pattern
| Sr. | Component | Weightage |
|---|---|---|
| 1. | Internal Assessment – Class Tests (CT) + Assignments / Quiz (TA) | 30% |
| 2. | End Semester Examination — theory + trace problems + short code writing | 70% |
Text Books
- Data Structures Using C – ReemaThareja (Oxford University Press)
- Data Structures and Algorithms in Python – Goodrich, Tamassia, Goldwasser(Wiley)
- Problem Solving with Algorithms and Data Structures using Python
- Brad Miller (free: runestone.academy)
Online Resources
- VisuAlgo – visualgo.net (free animations of every DS and algorithm — use in every class)
- HackerRank – Data Structures track, hackerrank.com (C++/Python, free, auto-graded)
- Runestone Academy – runestone.academy (free interactive Python DSA book)
- LeetCode Easy – leetcode.com (start after this course; industry-standard placement prep)
Ratings & Reviews
No reviews yet — share your experience with this item.