# DATA STRUCTURE – AKTU Syllabus | B.tech Important Syllabus

Hey there, folks. The Data Structure (AKTU) course is covered here, along with all necessary study resources. Providing some important Question like Long Question, Short Questions and So on.

## UNIT- 1: ARRAYS AND LINKED LISTS

• Introduction: Basic Terminology,
• Elementary Data Organization,
• Built-in Data Types in C. Algorithm,
• The 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
• n-D Array.
• Application of arrays,
• Sparse Matrices and their representations.
• Array Implementation & Pointer Implementation of Singly Linked Lists,
• Doubly Linked List,
• Circularly Linked List,
• Operations on Linked List.
• Insertion, Deletion,
• Traversal,
• Polynomial Representation & Addition Subtraction & Multiplications of Single variable & Two variables Polynomial.

## UNIT – 2: STACKS AND QUEUES

• Stacks:
• Abstract Data Type,
• Primitive Stack operations:
• Push & Pop,
• Array & 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,
• Delete,
• Full & Empty,
• Circular queues,
• Array & linked implementation of queues in C, Dequeue & Priority Queue.

## UNIT – 3: SEARCHING & SORTING

• 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

## UNIT – 4: GRAPHS

• The terminology used with Graph,
• Data Structure for Graph Representations:
• Graph Traversal:
• Depth First Search & Breadth First Search,
• Connected Component,
• Spanning Trees,
• Minimum Cost Spanning Trees:
• Prims and Kruskal algorithm.
• Transitive Closure & Shortest Path algorithm: Warshal Algorithm & Dijikstra Algorithm.

## UNIT – 5: TREES

• Basic terminology used with Tree, Binary Trees, and Binary Tree Representation:
• Array Representation and Pointer (Linked List)
• Representation,
• Binary Search Tree,
• Strictly Binary Tree,
• Complete Binary Tree.
• Extended Binary Trees,
• Tree Traversal algorithms:
• In order,
• Preorder and Postorder,
• Constructing Binary Tree from given Tree Traversal,
• Operation of Insertion,
• 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.