Data Structures Tutorial

Data Structures & Algorithms

 

  1. Introduction
    1. Introduction to Data structures
    2. What is Algorithm?
    3. What is Flow chart?
  2. Abstract Data Type (ADT)
  3. Array Data structure
    1. Static Array
    2. Processing Array using pointers
    3. Dynamic Array
  4. Dynamic Memory Allocation
    1. Introduction to DMA
    2. malloc() function
    3. calloc() function
    4. realloc() function
    5. free() function
  5. Stack ADT
    1. Introduction to Stack
    2. Operations on Stack
    3. Stack implementation using Array
    4. Dynamic stack implementation
    5. Basic applications of Stack
    6. Towers of Hanoi program
  6. Queue ADT
    1. Introduction to Queue
    2. Operations on Queue
    3. Queue implementation using Arrays
    4. Dynamic Queue implementation
    5. Applications of Queue
  7. Circular Queue
    1. Introduction to circular queue
    2. Operation on Circular queue
    3. Circular Queue Program
  8. Deque
    1. Introduction to Deque
    2. Operations on Deque
    3. Deque program
  9. Priority Queue
  10. Linked Lists
    1. Introduction to Lists
    2. Representation of Lists
  11. Single Linked List
    1. Introduction and Node creation of Single Linked List
    2. Creation of Single linked list with set of nodes
    3. Single Linked List operations program
  12. Double Linked List
  13. Circular Linked List
  14. Expression Evaluation
    1. Introduction to Notations
    2. Infix to Postfix conversion algorithm
    3. Infix to Postfix conversions
    4. Infix to Postfix program
    5. Infix to Prefix conversion algorithm
    6. Infix to Prefix conversions
    7. Infix to Prefix Program
  15. Binary Search Tree
    1. Introduction
    2. Insertions into BST
    3. Deletions of BST
    4. Traversal of BST elements
    5. Prefix to Postfix algorithm
    6. Postfix to Prefix algorithm
    7. Prefix to Postfix program
    8. Postfix to Prefix program
  16. AVL Tree
  17. Red Black Trees
  18. Searching Techniques
    1. Linear Search
    2. Binary Search
    3. Hash Search
  19. Sorting Techniques
    1. Bubble sort
    2. Selection sort
    3. Insertion Sort
    4. Heap Sort
    5. Quick Sort
    6. Merge Sort
  20. Graph Data structure
    1. Introduction to Graph data structure
    2. Graph creation
    3. Graph program
    4. BFS traversal
    5. DFS traversal
  21. B trees
  22. B+ trees
Share this