BCS301H Data Structure Syllabus
AKTU B.Tech · 3rd Semester · Unit-wise syllabus (effective 2023-24)
BCS301H Data Structure (also written as KCS301H) is a subject in Semester 3 of the AKTU B.Tech programme, prescribed by Dr. A.P.J. Abdul Kalam Technical University. It carries 4 credits with an L-T-P of 3-1-0. The syllabus is divided into 5 units: Introduction and Abstract Data Types (ADT) Arrays and Linked lists, Stacks and Queues, Searching and Sorting, Trees, Graphs and Graph Traversal. The complete unit-wise topic list, course outcomes and reference books are given below, taken from the official AKTU syllabus effective from 2023-24.
BCS301H Subject Details
| Subject Code | BCS301H / KCS301H |
|---|---|
| Subject Name | Data Structure |
| University | Dr. A.P.J. Abdul Kalam Technical University (AKTU) |
| Course | B.Tech (Bachelor of Technology) |
| Year / Semester | 2nd Year · 3rd Semester |
| Credits | 4 |
| L-T-P | 3-1-0 |
| Total Units | 5 |
| Scheme Effective From | 2023-24 |
| Last Verified | 2026-08-15 |
BCS301H Data Structure Unit-Wise Syllabus
Official AKTU syllabus (effective 2023-24) — 5 units.
Unit 1: Introduction · Abstract Data Types (ADT) Arrays · Linked lists
Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C. Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and n-D Array Application of arrays, Sparse Matrices and their representations. Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal, Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two variables Polynomial.
Unit 2: Stacks · Queues
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Removal of recursion Problem solving using iteration and recursion with examples such as binary search, Fibonacci numbers, and Hanoi towers. Tradeoffs between iteration and recursion. Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue.
Unit 3: Searching · Sorting
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.
Unit 4: Trees
Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Array Representation and Pointer(Linked List) Representation, Binary Search Tree, Strictly Binary Tree ,Complete Binary Tree . A Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, Operation of Insertation , Deletion, Searching & Modification of data in Binary Search . Threaded Binary trees, Traversing Threaded Binary trees. Huffman coding using Binary Tree. Concept & Basic Operations for AVL Tree , B Tree & Binary Heaps
Unit 5: Graphs · Graph Traversal
Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm.
BCS301H Course Outcomes
- CO 3 At the end of course , the student will be able to understand K1, K2
- CO 4 K2
- CO 5 Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by K3
- the algorithms and their common applications. K4
- Discuss the computational efficiency of the sorting and searching algorithms.
- K5, K6
- Implementation of Trees and Graphs and perform various operations on these data structure.
- Understanding the concept of recursion, application of recursion and its implementation and removal
- of recursion.
- Identify the alternative implementations of data structures with respect to its performance to solve a
- real world problem.
BCS301H Reference Books
- Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C++”, PHI Learning
- Gilberg ,Forouzan, Data Structures: A Pseudocode Approach with C 3rd edition , Cengage Learning publication.
- Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
- Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
- Thareja, “Data Structure Using C” Oxford Higher Education.
- AK Sharma, “Data Structure Using C”, Pearson Education India.
- Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
- Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and Algorithms in C++”,
- P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
- R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.
- Berztiss, AT: Data structures, Theory and Practice, Academic Press.
- Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”,
- Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning
Frequently Asked Questions about BCS301H
What is the syllabus of BCS301H Data Structure?
The AKTU BCS301H Data Structure syllabus is divided into 5 units: Introduction and Abstract Data Types (ADT) Arrays and Linked lists; Stacks and Queues; Searching and Sorting; Trees; Graphs and Graph Traversal. The complete topic list for each unit is published on this page, taken from the official Dr. A.P.J. Abdul Kalam Technical University syllabus effective from 2023-24.
How many units are there in BCS301H?
BCS301H Data Structure has 5 units in the AKTU syllabus, with an L-T-P (Lecture-Tutorial-Practical) structure of 3-1-0 and 4 credits.
Is BCS301H the same subject as KCS301H?
Yes. AKTU renumbered its B.Tech subject codes from the 2022-23 session onwards, so the same subject appears as BCS301H and KCS301H depending on the scheme year. The syllabus content is the same.
Which semester is BCS301H taught in?
BCS301H Data Structure is taught in Semester 3 of the 2nd year of the AKTU B.Tech programme.
How many credits is BCS301H worth?
BCS301H Data Structure carries 4 credits in the AKTU evaluation scheme, with an L-T-P of 3-1-0.
Where can I download BCS301H previous year question papers?
AKTU B.Tech previous year question papers for every semester are available to download free on Ryzenstudy, with no login or registration required.
Is this the official AKTU syllabus for BCS301H?
Yes. Every topic on this page is taken from the official Dr. A.P.J. Abdul Kalam Technical University syllabus document (AKTU B.Tech 2nd Year Computer Science (Hindi) Syllabus), effective from 2023-24. A direct link to the original AKTU PDF is provided at the top of this page. Last verified on 2026-08-15.
Related AKTU Syllabus
Source: Dr. A.P.J. Abdul Kalam Technical University official syllabus — AKTU B.Tech 2nd Year Computer Science (Hindi) Syllabus, effective from 2023-24. Ryzenstudy is not affiliated with AKTU. Content last verified on 2026-08-15.