Section outline

  • Welcome to Data Structures

    Collapse all Expand all


     

     

    Instructor         : A I Tazib

    Office                : Level-2, Room: 109, DT5, Daffodil Extension Building

    Office Hour      : Email for Appointment

    Mobile              : +8801681983227

    email                : tazib.cse0275.c@diu.edu.bd

    Course Rationale

    This course investigates abstract data types (ADTs), recursion, algorithms for searching and sorting, and basic algorithm analysis. ADTs to be covered include lists, stacks, queues, priority queues, trees, sets, and graphs. The emphasis is on the trade-offs associated with implementing alternative data structures for these ADTs.

    Course Objectives

    • To introduce the fundamental concept of data structures including link-list
    • To emphasize the importance of data structures in implementing the algorithms
    • To develop effective skills in the implementation of data structure


    Course Outcomes (CO’s)

    • CO1 Able to explain implementation and operations of basic data structures: Linked list, stack, queue, tree and graph
    • CO2 Able to apply programming techniques using pointers, dynamic memory allocation and structures to implement data structures: stack, queue, tree and graph
    • CO3 Able to design and implement new abstract data using linked list, stack, queue, tree and graph with the help of programming implementations
    • CO4 Able to apply the knowledge of data structure in problem solving


    Grading Scheme
    Theory Class Lab Class
    Attendance: 7%
    Class Tests/Quizes:  15% 
    Assignment: 5%
    Presentation (using video/ppt): 8%
    Midterm Exam: 25%
    Final Exam: 40%    		 Lab Attendance: 10%
    Problem Solving: 40%
    Lab Performance Test: 25%
    Lab Report: 25%
    [All assessment will be based on onsite/online situation]

    Textbook

    a. Data Structures and Algorithm Analysis in C by Mark Allen Weiss
    b. Principles of Data Structures     by Pande

    Reference Books/Materials

    • Students must
      Mark as done

      Data Structure Simulation 


    • Students must
      Mark as done

      Course Outline 

    • Students must
      Mark as done

      Class discussion material 

    • forum icon
      Course Discussion Forum
      Students must
      Mark as done

      Course Discussion Forum to discuss and share understanding on a topic.

    • survey icon
      Student Interest Discovery Survey
      Students must
      Mark as done
    • url icon
      Telegram Group Link URL
      Students must
      Mark as done

      Telegram: what it is and how to use it - Accurate Reviews

  • Week 1: Preparing Background



    • Topics of discussion

    1. Introduction and importance of Data Structure in computing; Applications
    2. Review discussion on recursion, pointer, structure, self-referential structure; dynamic memory allocation

    • Expected Learning Outcome

    1. Appreciate the needs of data structure
    2. Visualize the applications
    3. Perform exercise on basic self-referential structure

    • Self-Test and Additional Problem Solving

  • Week 2: Exercise and Course Project


    • 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

  • Week 3: Discussion on Link-List


    Topics of discussion:

    1. Link-List and operations on link list
    2. Project Discussion and execution plan
    3. Class Test#1

    Expected Learning Outcome:

    1. Visualization of the link list
    2. Write code for the designed link list
    3. Selection of project topic by team

    • Students must
      Mark as done

      External Video


       

       
    • Students must
      Mark as done

      Discussion on Link-List

    • Students must
      Mark as done

      Lab Session 3: Working with Link-List

    • Students must
      Mark as done

      Class Records


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

      Lecture on Dynamic Memory Allocation

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

      Lecture on Creating a List

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

      Lecture on Creating Linked List

    • page icon
      Quiz 1 Page
      Students must
      Mark as done

      Quiz 1 on Linked List

      Commentary series: What are the different adaptive quizzes? | CanopyLAB

  • Week 4: Adaptive Lesson on Link-List


    Topics of discussion:

    1. Practice lesson on Link-List

    Expected Learning Outcome:

    1. Review of Link-List Knowledge
    2. Self-confidence building on applying the link-list concept

    • Students must
      Mark as done

      Review discussion on Link-List

    • Students must
      Mark as done

      Lab Session 4: Application of Link-List

    • Students must
      Mark as done

      External Video


       

       
    • lesson icon
      Explore Link-List and Self-Test Lesson
      Students must
      Mark as done

      This is an adaptive learning session on Link-List and it is expected that participants will be able to conceptualize the insights of link-list data structure and its beauty.

    • Students must
      Mark as done

      Class Records


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

      Lecture on Creating Insert Functions 

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

      Lecture on Creating Delete Functions 

  • Week 5: Review discussion on Link-List


    • Topics of discussion:

    1. Review operations on Link list and applications
    2. Discussion on Stack data structure
    3. Exercise using Stack data structure

    • Expected Learning Outcome:

    1. Implement link list operations using C programming
    2. Analyzing stack data structure

    • Self-Test Questions

    • Students must
      Mark as done

      External Video


       

       
    • Students must
      Mark as done

      Discussion on Stack Data Structure

    • Students must
      Mark as done

      Lab Session 5: Working with Stack

    • Students must
      Mark as done

      Class Records


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

      Lecture on Creating Functions for Linked List

  • Week 6: Discussion on Stack Applications


    • Topics of discussion:

    1. Application of stack in processing expressions
    2. Discussion on Queue data structure
    3. Class Test# 2

    • Expected Learning Outcome:

    1. Implement processing of expression using stack   
    2. Analyze queue data structure

    • Presentation on Course Project

    • Students must
      Mark as done

      Discussion on Queue Data Structure

    • Students must
      Mark as done

      Lab Session 6: Working with Queue

    • Students must
      Mark as done

      External Video


       

       
    • lesson icon
      Self Test on Link List Lesson
      Students must
      Mark as done

      Self Test on Link List

    • quiz icon
      Quiz 2
      Students must
      Mark as done

      Quiz 2 on Linked List

      Commentary series: What are the different adaptive quizzes? | CanopyLAB

    • url icon
      Stack Simulation URL
      Students must
      Mark as done

  • Week 7: Midterm Exam


    • Topics for Mid Exam:
    1. Link-list and operations
    2. Stack and application of stack

  • Week 8: Discussion on Tree Data Structure


    • Topics of discussion:

    1. Discussion on Tree data structure
    2. Tree traversals and applications

    • Expected Learning Outcome:

    1. Implementation of tree data structure
    2. Problem solving for tree traversal

    • Self-test on Tree Data Structure

  • Week 9: Discussion on Binary Search Tree (BST)


    • Topics of discussion:

    1. BST and operations on BST
    2. Applications of BST

    • Expected Learning Outcome:

    1. Implementation of BST and related operations
    2. Problem solving using BST

    • Presentation on Course Project

  • Week 10: Discussion on Heap


    • Topics of discussion:

    1. HEAP data structure and applications of Heap
    2. Exercise on BST and Heap

    • Expected Learning Outcome:

    1. Implementation of Heap and operations
    2. Problem solving using BST

    • Self-Test on BST

  • Week 11: Discussion on Graph


    • Topics of discussion:

    1. Graph data structure and applications of graph
    2. Traversal of Graph

    • Expected Learning Outcome:

    1. Implementation of graph data structure
    2. Problem solving using Heap

    • Class Test 3

  • Week 12: Review Discussion


    • Topics of discussion:

    1. Review exercises on Tree, BST, Heap and Graph

    • Expected Learning Outcome:

    1. Problem solving using Tree, BST, Heap, and Graph

    • Self-test

    • Students must
      Mark as done

      Review discussion

  • Week 13-14: Final Exam


    • Topics of the final:
    1. Tree, BST and applications
    2. Heap and application of Heap
    3. Basics of Graph data structure