Course curriculum

  • 1

    Module 1

    • Algorithm efficiency and analysis, time and space analysis of algorithms – order notations.
    • "Array: Different representations – row major, column major. "
    • Sparse matrix - its implementation and usage. Array representation of polynomials.
    • "Linked List: Singly linked list."
    • Circular linked list.
    • Doubly linked list.
    • Linked list representation of polynomial and applications.
  • 2

    Module 2

    • Q1
    • Q2
    • Q3
    • Q4
    • Q5
    • Eight queens puzzle_Day 15_Mod 2
    • Tower of Hanoi_Day 15_Mod 2
  • 3

    Module 3

    • SCH_Tree_Days16_Mod3
    • SCH_Tree_Days17_Mod3
    • SCH_AVL Tree_Day22_Mod3