Unit-I
Introduction to Data Structures:
Algorithms and Flowcharts, Basics Analysis on Algorithm, Complexity of Algorithm, Introduction and Definition of Data Structure, Classification of Data, Arrays, Various types of Data Structure, Static and Dynamic Memory Allocation, Function, Recursion. [CO5]
Arrays, Pointers and Strings:
Introduction to Arrays, Definition, One Dimensional Array and Multi-Dimensional Arrays, Pointer, Pointer to Structure, various Programs for Array and Pointer. Strings. Introduction to Strings, Definition, Library Functions of Strings. [CO1]
Unit-II
Stacks and Queue
Introduction to Stack, Definition, Stack Implementation, Operations of Stack, Applications of Stack and Multiple Stacks. Implementation of Multiple Stack Queues, Introduction to Queue, Definition, Queue Implementation, Operations of Queue, Circular Queue, De-queue and Priority Queue. [CO2]
Unit-III
Linked Lists and Trees
Introduction, Representation and Operations of Linked Lists, Singly Linked List, Doubly Linked List, Circular Linked List, And Circular Doubly Linked List. [CO3]
Trees
Introduction to Tree, Tree Terminology Binary Tree, Binary Search Tree, Strictly Binary Tree, Complete Binary Tree, Tree Traversal, Threaded Binary Tree, AVL Tree B Tree, B+ Tree. [CO3]
Unit-IV
Graphs, Searching, Sorting and Hashing
Graphs: Introduction, Representation to Graphs, Graph Traversals Shortest Path Algorithms. [CO3]
Searching and Sorting: Searching, Types of Searching, Sorting, Types of sorting like quick sort, bubble sort, merge sort, selection sort. [CO4]