C Review

  • PRACTICE PROGRAMS

  • Handling strings (.pdf) ( .doc)

  • File Handling (.pdf) (.doc)

  • Handling arrays and files (.pdf)

  • Structures (.pdf) ( .doc)

  • Searching sorting algorithms

    Dynamic memory allocation and Linked lists

  • Dynamic memory allocation

  • Linked list intro

  • Linked list 1

  • Linked list- 2

    Recursion

  • recursion 1- arrays,exponentiation,binary search (.pdf) ( .doc)

  • recursion 2 - time complexity using recurrence relations (.pdf) ( .doc)

  • recursion 3A - Decimal Binary, palindrome ( .doc)

  • recursion 3B - Fibonacci sequence ( .doc)

  • recursion 4 - Towers of Hanoi ( .ppt)

  • recursion 5 - Efficient recursion, permutations( .doc)

    Algorithm analysis : Big-O notation

  • time complexity using summations

  • Analysis of Iterative Binary search and sorting algorithms

  • Time complexity using recurrence relations

    Stacks and Queues

  • stack data structure

  • Queue data structure

  • Implementation of stacks and queues

    Binary Trees

  • Tree data structure

  • Binary Search Tree- Searching and insertion

  • Deletions in Binary Search Tree

  • Heap Tree and priority queues

  • Height balanced AVL trees

    Sorting

  • Mergesort and quicksort

  • Selection sort, insertionsort, bubble sort

    Hashing

  • Hash Table data structure

    Final Exam Review

  • Final Exam Review