BCS301 Data Structure Syllabus
AKTU B.Tech 3rd Semester · Unit-wise syllabus (2023-24 onwards)
BCS301 / KCS301 Data Structure AKTU B.Tech 3rd Semester ka subject hai, jiske 4 credits aur L-T-P 3-1-0 hai. Iske syllabus mein 5 units hain: Introduction · Abstract Data Types (ADT) Arrays · Linked lists, Stacks · Queues, Searching · Sorting, Trees, Graphs · Graph Traversal. Neeche har unit ke complete topics diye gaye hain, jo Dr. A.P.J. Abdul Kalam Technical University ke official syllabus se liye gaye hain.
BCS301 Subject Details
| Subject Code | BCS301 / KCS301 |
|---|---|
| Subject Name | Data Structure |
| Course | AKTU B.Tech |
| Year / Semester | 2nd Year · 3rd Semester |
| Credits | 4 |
| L-T-P | 3-1-0 |
| Total Units | 5 |
| Effective From | 2023-24 |
BCS301 Data Structure Unit-Wise Syllabus
AKTU official syllabus (2023-24 onwards) — 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.
BCS301 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.
BCS301 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
BCS301 Syllabus — FAQs
BCS301 Data Structure syllabus mein kitne units hain?
AKTU BCS301 Data Structure syllabus mein 5 units hain — Unit 1 (Introduction · Abstract Data Types (ADT) Arrays · Linked lists), Unit 2 (Stacks · Queues), Unit 3 (Searching · Sorting), Unit 4 (Trees), Unit 5 (Graphs · Graph Traversal). Poora unit-wise breakdown is page pe upar diya gaya hai.
Is BCS301 the same as KCS301?
Haan. AKTU ne 2022-23 se subject codes ka prefix badla tha, isliye ek hi subject BCS301 aur KCS301 dono codes se jaana jaata hai. Syllabus content wahi hai.
BCS301 ke kitne credits hain?
AKTU evaluation scheme ke hisaab se BCS301 Data Structure ke 4 credits hain, aur L-T-P 3-1-0 hai.
BCS301 ke previous year question papers kahan milenge?
BCS301 Data Structure ke saare AKTU previous year question papers Ryzenstudy pe free download ke liye available hain — bina login ke.
Kya ye official AKTU syllabus hai?
Haan. Is page ka poora content Dr. A.P.J. Abdul Kalam Technical University ke official syllabus PDF (2023-24 se effective) se liya gaya hai. Original PDF ka direct link is page pe sabse upar highlighted hai.
Related AKTU Syllabus
Source: Dr. A.P.J. Abdul Kalam Technical University official syllabus — AKTU B.Tech 2nd Year CSE Syllabus. Ryzenstudy AKTU se affiliated nahi hai. Last verified: 2026-08-14.