SYLLABUS:
UNIT – I Introduction to Data Structures and Algorithms:
Basic Terminology – Preliminaries of algorithms. Data Structures, Abstract Data Types (ADTs) Algorithms, Time and Space Complexity (worst-case, averagecase, best-case).
CLICK TO VIEW MATERIAL 👉UNIT I
UNIT-II Searching and Sorting :
Introduction to Searching, Linear Search, Binary Search, Fibonacci Search. Introduction to Sorting, Bubble sort, Selection sort, Insertion sort , Merge sort Algorithm, Heap sort, Quick sort Algorithm.
CLICK TO VIEW MATERIAL 👉UNIT II
UNIT – III Stacks:
Definition, Representation of Stack, Stack ADT, Applications, Implementation, Reversing List.
Queues: Definition, Representation of Queue, Queue ADT, Implementation of Queue using two Stacks, Exceptions, Applications, Circular Queues , Priority Queues. Infix to Postfix Conversion, Factorial Calculation.
CLICK TO VIEW MATERIAL 👉UNIT III
UNIT - IV Linked Lists:
Introduction, Singly linked list, Representation of Single Linked List, Operations of SLLInsertion, Deletion, Applications of Single Linked List: Polynomial Expression Representation. Doubly linked list, Representation of Double Linked List, Operations of Double Linked List- Insert, Delete. Circular linked list, Representation of Circular Linked List, Operations of Circular Linked List
CLICK TO VIEW MATERIAL 👉UNIT IV
UNIT – V Trees:
Introduction, Binary Trees, Traversing a Binary Tree. Binary Search Trees, operations on Binary Search Trees (insertions and deletions), AVL Trees.
Graphs: Introduction, Graph Terminology, Directed Graphs, Representations of Graphs, Adjacency Matrix Representation, (Adjacency List Representation), Applications(Minimum Spanning Tree Using Prims & Kruskals Algorithm, Dijkstra’s shortest path)
CLICK TO VIEW MATERIAL 👉UNIT V
