Data-Structure

Reference Book

• Data Structure using C by Reema Theraja
• Data Structure with C by Seymour Lipschutz

Topics covered

Serial	Topic
1	Array
2	Linked List
3	Stack
4	Queue
5	Recursion
6	Hashing
7	Sorting
8	Searching
9	Tree
10	Graph

Array

• Traversing

• Second Largest Element

• Find Duplicate value

• Insert an element to a sorted array

• Insert an element to a unsorted array in any position

• Delete an existing element from an array

• Delete middle value of an array

• Merge two Unsorted Array

• Merge two sorted Array

• Sorting an array using Bubble Sort

• Searching an element Using Binary Search

• Copy 2D array to 1D array

• Matrix

  • Addition
  • Subtraction
  • Inverse
  • Transpose
  • Multiplication

Searching

• Linear Search
• Binary Search

Sorting

• Insertion Sort
• Bubble Sort
• Quick Sort

LinkedList

• Singly Linked List

  • Singly Linked List - All
  • Linked List traversing
  • Inserting at last
  • Insert at first
  • Insert at Kth position
  • Deleting last element
  • Deleting first element
  • Deleting specific Data
  • Deletig Nth node

• Doubly Linked List

  • Create Doubly Linked List
  • Insert at beginning
  • Insert at end
  • Insert at Nth node

• Circular Linked List

  • Insert at First

Stack

• Basic stack operations program implemented using array in C
• Stack using Linked List
• Infix to Postfix Conversion
• Postfix Expression Evaluation
• Infix Expression Evaluation

Queue

• Basic Queue Implementation Using Array
• Queue using Linked List
• Circular Queue using array
• Circular Queue Using LinkedList

Recursion

• Factorial
• Fibonacci
• Towe of Hanoi

Hashing

• Simple Hash map table
• Hashing using Linear Probing
• Hashing using Quadratic Probing
• Hashing using separate chaining
• Hashing using Plus-3 Probing

Tree

• Binary Tree

  • First Tree Program (Creating)
  • Implementation in java creating, inserting, searching
  • Level Order Traversing in a Binary Tree
  • Binary Tree Using C++ (Traversing Preorder, Postorder, Inorder)
  • Iterative Pre Order Traversing
  • Iterative In Order Traversing
  • Iterative Post Order Traversing

• Binary Search Tree

  • Insertion in a BST
  • BST insertion deletion

Heap

• Heap implementation (insertion, deletion)
• Heapify Algorithm

Graph

• Adjacency Matrix Representation
• Path Matrix - Find connectivity
• Power Matrix
• LinkedList Representation of graph with BFS and DFS
• Adjacency List Representation in C++
• Adjacency List Representation in C
• shortest path matrix (weighted graph) warshall
• BFS C++
• DFS C++
• Java Implementation
  • Simple Graph
  • Breadth First Search
  • Depth First Search