Data Structures ( INDEX )

UNIT – 1

INTRODUCTION :

• Basic Terminologies: Concept of Data Structure, 
• Abstract Data Types
• Algorithms: how to design and develop an algorithm, 
• The complexity of algorithms   
• Operations: insertion, deletion, traversal, etc.; 
• Choice of right Data Structure, 
• Different types of data structures,  
• Asymptotic Analysis
• Searching: Linear Search and Binary Search Techniques, and their complexity analysis.

UNIT – 2

STACKS AND QUEUES :

• Stack and its operations: Algorithms and their complexity analysis, 
• Applications of Stacks: Expression Conversion and evaluation - corresponding algorithms and complexity analysis. 
• Queue Illustration,
• Types of Queue: Simple Queue, Circular Queue, Priority Queue;
• Operations on each type of Queues: Algorithms and their analysis.

UNIT – 3

LINKED LISTS :

• Array illustration
• Array Vs Linked List
• Linked Lists and Singly-linked lists
• Representation in memory,
• Algorithms of several operations: Traversing, Searching, Insertion into, Deletion from the linked list; 
• Header nodes,
• Linked representation of Stack and Queue, 
• Doubly linked list: operations on it and algorithmic analysis; 
• Circular Linked Lists: all operations their algorithms and the complexity analysis. 

TREES :

• Basic Tree Terminologies,
• Tree Traversals,
• Different Types of Trees:
  Binary Tree,
  Threaded BinaryTree,
  Binary Search Tree,
  AVL Tree;

[ Tree operations on each of the trees, and their algorithms with complexity analysis has been combined with the posts of respective trees. ]

• B Tree, B+ Tree: definitions, algorithms, and analysis.

UNIT – 4

GRAPH :

• Basic Terminology and Representations, 
• Graph search and traversal algorithms and complexity analysis.

SORTING :

• Sorting basics
• Objective and properties of different sorting algorithms:
  Selection Sort,
  Bubble Sort,
  Insertion Sort,
  Quick Sort,
  Merge Sort,
  Heap Sort; 
• Performance and Comparison of all the sorting methods.

HASHING :

• Hashing essentials