Section outline


    • Topics for discussion:

    1. Computational Complexity and exercises
    2. Self-referential structure application for link list
    3. Exercise on visualization of data node
    4. Course Project Team and discussion on presentation and deliverable

    • Expected Learning Outcome:

    1. Computational Complexity and exercises
    2. Self-referential structure application for link list
    3. Exercise on visualization of data node
    4. Course Project Team and discussion on presentation and deliverable

    • Students must
      Mark as done

      Typical Course Project

    • Students must
      Mark as done

      External Video


       

       
    • Students must
      Mark as done

      Review on self-referential structure

    • Students must
      Mark as done

      Analysis of Complexity

    • Students must
      Mark as done

      Lab Session 2: Working with self-referential structure

    • Students must
      Mark as done

      Class Records


    • url icon
      DS Class Record YouTube Link URL
      Students must
      Mark as done
      Lecture on Structure 
    • url icon
      DS Class Record YouTube Link URL
      Students must
      Mark as done

      C Dynamic Memory Allocation