Section outline

  • Welcome to Data Structures

    Collapse all Expand all





    Instructor:


    Tanvirul Islam
    Lecturer, Department of Computer Science & Engineering
    Daffodil International University(DIU)
    Dhaka, Bangladesh
    Contact: +8801636458757
    Email: tanvirulislam.cse@diu.edu.bd
    Room: 723, AB-4, Daffodil Smart City

    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
    Attendance: 7%
    Class Tests/Quizes:  15% 
    Assignment: 5%
    Presentation (using video/ppt): 8%
    Midterm Exam: 25%
    Final Exam: 40%

    Textbook

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

    Reference Books/Materials

  • Topic 1

    All the submission (Section V)

    • assign icon
      Linked List Implementation: Complete all the function given in last lab Assignment
      Opened: Tuesday, 8 August 2023, 12:00 AM
      Due: Tuesday, 15 August 2023, 11:59 PM
      Not available unless: You belong to Section-V
    • assign icon
      Presentation slide submission - Section V Assignment
      Opened: Monday, 18 September 2023, 12:00 AM
      Due: Tuesday, 19 September 2023, 11:59 PM
      Students must
      Mark as done

  • Topic 2

    All the submission (Section W)

    • assign icon
      Linked List Implementation: Complete all the function given in last lab Assignment
      Opened: Tuesday, 8 August 2023, 12:00 AM
      Due: Friday, 11 August 2023, 11:59 PM
    • assign icon
      Complete the Mini Project- Phonebook Application Assignment
      Opened: Saturday, 23 September 2023, 12:00 AM
      Due: Saturday, 30 September 2023, 12:00 AM
      Not available unless: You belong to Section-W

  • 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

  • Topic 4


    • 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

  • 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

  • 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

    • 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.

    • assign icon
      Lab Assignment
      Opened: Saturday, 19 August 2023, 12:00 AM
      Due: Wednesday, 23 August 2023, 12:00 AM
      Students must
      Mark as done

  • 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

  • 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

  • Course Project

    List of Projects (DS) 

    1. Build a Spell checker to mark the spelling errors from a file.
    2. Create a Phonebook.
    3. Build a 0248 game.
    4. Build a Sudoku game
    5. Build a snake and ladder game
    6. Build a game of tic tac toe
    7. Build a game of connect four

    Instruction:

    1. Make a team of 3 people
    2. Book a topic (1 project can not be booked by more than 3 teams)
    3. make a project with output on console
    4. No interface is needed (You can make it if you want)
    5. Project display date May 30 to June 1.

  • 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 14-15: 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 17-18: Final Exam


    • Topics of the final:


  • Topic 17

    Final Syllabus 


    • resource icon
      Introduction to Graph Theory File
      Students must
      Mark as done
    • resource icon
      Heap Data Structure File
      Students must
      Mark as done
    • quiz icon
      Data Structure-Quiz (Section V)
      Opened: Monday, 27 November 2023, 2:30 PM
      Closed: Monday, 27 November 2023, 2:45 PM
      Not available unless: You belong to Section-V
    • quiz icon
      Data Structure-Quiz (Section W)
      Opened: Monday, 27 November 2023, 2:30 PM
      Closed: Monday, 27 November 2023, 2:45 PM
      Not available unless: You belong to Section-W
    • assign icon
      Data Structure Lab Final- Section V Assignment
      Opened: Monday, 11 December 2023, 2:30 PM
      Due: Monday, 11 December 2023, 3:50 PM
    • assign icon
      Data Structure Lab Final- Section W Assignment
      Opened: Monday, 11 December 2023, 2:30 PM
      Due: Monday, 11 December 2023, 3:50 PM