UNIQUE SERIES AKTU Syllabus
BOE306BOE406

Basics Data Structure & Algorithms

L-T-P3-1-0 Credits4 Session2023-24 TypeTheory
Appears in 78 semesters · 39 branches

B.Tech Civil Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Civil Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Mechanical Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Mechanical Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Computer Science & Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Computer Science & Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Information Technology · Sem 3 (Open Elective, code BOE306) · B.Tech Information Technology · Sem 4 (Open Elective, code BOE406) · B.Tech Artificial Intelligence & Machine Learning · Sem 3 (Open Elective, code BOE306) · B.Tech Artificial Intelligence & Machine Learning · Sem 4 (Open Elective, code BOE406) · B.Tech Artificial Intelligence & Data Science · Sem 3 (Open Elective, code BOE306) · B.Tech Artificial Intelligence & Data Science · Sem 4 (Open Elective, code BOE406) · B.Tech CSE (Artificial Intelligence) · Sem 3 (Open Elective, code BOE306) · B.Tech CSE (Artificial Intelligence) · Sem 4 (Open Elective, code BOE406) · B.Tech CSE (AI & ML) · Sem 3 (Open Elective, code BOE306) · B.Tech CSE (AI & ML) · Sem 4 (Open Elective, code BOE406) · B.Tech CSE (Data Science) · Sem 3 (Open Elective, code BOE306) · B.Tech CSE (Data Science) · Sem 4 (Open Elective, code BOE406) · B.Tech CSE (Cyber Security) · Sem 3 (Open Elective, code BOE306) · B.Tech CSE (Cyber Security) · Sem 4 (Open Elective, code BOE406) · B.Tech CSE (Internet of Things) · Sem 3 (Open Elective, code BOE306) · B.Tech CSE (Internet of Things) · Sem 4 (Open Elective, code BOE406) · B.Tech Computer Science & Design · Sem 3 (Open Elective, code BOE306) · B.Tech Computer Science & Design · Sem 4 (Open Elective, code BOE406) · B.Tech Computer Science (Hindi) · Sem 3 (Open Elective, code BOE306) · B.Tech Computer Science (Hindi) · Sem 4 (Open Elective, code BOE406) · B.Tech Computer Science & Business Systems · Sem 3 (Open Elective, code BOE306) · B.Tech Computer Science & Business Systems · Sem 4 (Open Elective, code BOE406) · B.Tech Cyber Security · Sem 3 (Open Elective, code BOE306) · B.Tech Cyber Security · Sem 4 (Open Elective, code BOE406) · B.Tech Data Science · Sem 3 (Open Elective, code BOE306) · B.Tech Data Science · Sem 4 (Open Elective, code BOE406) · B.Tech Electrical Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Electrical Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Electrical & Electronics Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Electrical & Electronics Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Electrical & Computer Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Electrical & Computer Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Electronics & Communication Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Electronics & Communication Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Electronics & Instrumentation / Instrumentation & Control · Sem 3 (Open Elective, code BOE306) · B.Tech Electronics & Instrumentation / Instrumentation & Control · Sem 4 (Open Elective, code BOE406) · B.Tech Electronics & Computer Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Electronics & Computer Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech ECE (Advanced Communication Technology) · Sem 3 (Open Elective, code BOE306) · B.Tech ECE (Advanced Communication Technology) · Sem 4 (Open Elective, code BOE406) · B.Tech Electronics Engineering (VLSI Design & Technology) · Sem 3 (Open Elective, code BOE306) · B.Tech Electronics Engineering (VLSI Design & Technology) · Sem 4 (Open Elective, code BOE406) · B.Tech Automobile Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Automobile Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Aeronautical Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Aeronautical Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Mechanical & Industrial Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Mechanical & Industrial Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Production & Industrial Production Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Production & Industrial Production Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Manufacturing Technology · Sem 3 (Open Elective, code BOE306) · B.Tech Manufacturing Technology · Sem 4 (Open Elective, code BOE406) · B.Tech Mining Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Mining Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Chemical Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Chemical Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Plastic Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Plastic Engineering · Sem 4 (Open Elective, code BOE406) · B.Tech Food Technology · Sem 3 (Open Elective, code BOE306) · B.Tech Food Technology · Sem 4 (Open Elective, code BOE406) · B.Tech Textile Technology · Sem 3 (Open Elective, code BOE306) · B.Tech Textile Technology · Sem 4 (Open Elective, code BOE406) · B.Tech Handloom & Textile Technology · Sem 3 (Open Elective, code BOE306) · B.Tech Handloom & Textile Technology · Sem 4 (Open Elective, code BOE406) · B.Tech Carpet & Textile Technology · Sem 3 (Open Elective, code BOE306) · B.Tech Carpet & Textile Technology · Sem 4 (Open Elective, code BOE406) · B.Tech Biotechnology · Sem 3 (Open Elective, code BOE306) · B.Tech Biotechnology · Sem 4 (Open Elective, code BOE406) · B.Tech Bioinformatics · Sem 3 (Open Elective, code BOE306) · B.Tech Bioinformatics · Sem 4 (Open Elective, code BOE406) · B.Tech Agricultural Engineering · Sem 3 (Open Elective, code BOE306) · B.Tech Agricultural Engineering · Sem 4 (Open Elective, code BOE406)

Download PDF

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: Introduction

8 hrs

Basic Terminology, Elementary Data Organization, Built in Data Types in C, Efficiency of an Algorithm, Asymptotic notations, Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column Major Order. 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.

Unit2

Unit 2: Stacks

8 hrs

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, 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.

Unit3

Unit 3: Searching

8 hrs

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.

Unit4

Unit 4: Trees

8 hrs

Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Binary Search Tree, Strictly Binary Tree, Complete Binary Tree, Extended Binary Trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal, Insertion , Deletion, Searching & Modification of data in Binary Search tree.

Unit5

Unit 5: Graphs

8 hrs

Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency List, Graph Traversal: Depth First Search and Breadth First Search, Minimum Spanning Trees, Prims and Kruskal algorithm.

Course Outcomes (COs)5 outcomes

After completion of the course student will be able to:

  1. CO1Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by the algorithms and their common applications.K1, K2
  2. CO2Discuss the computational efficiency of the sorting and searching algorithms.K2
  3. CO3Implementation of Trees and Graphs and perform various operations on these data structure.K3
  4. CO4Understanding the concept of recursion, application of recursion and its implementation and removal of recursion.K4
  5. CO5Identify the alternative implementations of data structures with respect to its performance to solve a real world problem.K5, K6

Text books

  1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C++”, PHI Learning Private Limited, Delhi India
  2. Gilberg ,Forouzan, Data Structures: A Pseudocode Approach with C 3rd edition , Cengage Learning publication
  3. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
  4. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
  5. Thareja, “Data Structure Using C” Oxford Higher Education.
  6. AK Sharma, “Data Structure Using C”, Pearson Education India.
  7. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.
  8. Michael T. Goodrich, Roberto Tamassia, David M. Mount “Data Structures and Algorithms in C++”, Wiley India.
  9. P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication.
  10. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education.
  11. Berztiss, AT: Data structures, Theory and Practice, Academic Press.
  12. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”, McGraw Hill.
  13. Adam Drozdek “Data Structures and Algorithm in Java”, Cengage Learning

Official AKTU syllabus

This subject is on page 8, 9 of the original AKTU PDF.

Official AKTU syllabus PDF ↗