Section outline
-
Join Online Class
Instructor : Amatul Bushra Akhi, Assistant Professor, Department of CSE
Office : Room-317, AB-4, Daffodil Smart City Campus
Telephone : 01733481053
Email : akhi.cse@diu.edu.bdWelcome Information on Data Structures Course
- Welcome Audio
- Listen to Course Objectives
- Listen to Expected Outcomes
- Listen to Course Delivery Plan
- Some Successful Projects
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
[All assessment will be based on onsite/online situation]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 PandeReference Books/Materials
- Google drive repository
- Other online resources
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
Course Discussion Forum to discuss and share understanding on a topic.
-
Opened: Wednesday, 13 March 2024, 1:00 AMDue: Thursday, 14 March 2024, 11:59 PMStudents mustMark as done
-
Opened: Sunday, 28 April 2024, 1:30 PMDue: Sunday, 28 April 2024, 9:30 PMStudents mustMark as done
-
- Topics of discussion
- Introduction and importance of Data Structure in computing; Applications
- Review discussion on recursion, pointer, structure, self-referential structure; dynamic memory allocation
- Expected Learning Outcome
- Appreciate the needs of data structure
- Visualize the applications
- Perform exercise on basic self-referential structure
- Self-Test and Additional Problem Solving
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
Class Discussion:
-
- Topics for discussion:
- Computational Complexity and exercises
- Self-referential structure application for link list
- Exercise on visualization of data node
- Course Project Team and discussion on presentation and deliverable
- Expected Learning Outcome:
- Computational Complexity and exercises
- Self-referential structure application for link list
- Exercise on visualization of data node
- Course Project Team and discussion on presentation and deliverable
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
-
Topics of discussion:
- Link-List and operations on link list
- Project Discussion and execution plan
- Class Test#1
Expected Learning Outcome:
- Visualization of the link list
- Write code for the designed link list
- Selection of project topic by team
-
Students mustMark as done
-
Students mustMark as done
Class Recordings:
-
Topics of discussion:
- Practice lesson on Link-List
Expected Learning Outcome:
- Review of Link-List Knowledge
- Self-confidence building on applying the link-list concept
-
- Topics of discussion:
- Review operations on Link list and applications
- Discussion on Stack data structure
- Exercise using Stack data structure
- Expected Learning Outcome:
- Implement link list operations using C programming
- Analyzing stack data structure
- Self-Test Questions
-
- Topics of discussion:
- Application of stack in processing expressions
- Discussion on Queue data structure
- Class Test# 2
- Expected Learning Outcome:
- Implement processing of expression using stack
- Analyze queue data structure
- Presentation on Course Project
-
-
Students mustMark as done
-
- Topics for Mid Exam:
- Link-list and operations
- Stack and application of stack
-
- Topics of discussion:
- Discussion on Tree data structure and Tree Terminologies
- Tree traversals and applications
- Expected Learning Outcome:
- Implementation of tree data structure
- Problem solving for tree traversal
Online Class Recording:Click to get Lecture Materials
-
- Topics of discussion:
- BST and operations on BST
- Applications of BST
- Expected Learning Outcome:
- Implementation of BST and related operations
- Problem solving using BST
-
- Topics of discussion:
- HEAP data structure and applications of Heap
- Exercise on BST and Heap
- Expected Learning Outcome:
- Implementation of Heap and operations
- Problem solving using BST
- Lecture Materials
Array Representation of Bianry Tree:
https://www.geeksforgeeks.org/array-representation-of-binary-heap/
Insertion and Deletion of Heap:
https://www.geeksforgeeks.org/insertion-and-deletion-in-heaps/
-
- Topics of discussion:
- AVL tree discussion
- AVL tree Rotations
- AVL Tree construction, insertion
- AVL Tree VS BST
-
Students mustMark as done
-
Students mustMark as done
-
Students mustMark as done
-
- Topics of discussion:
- Review exercises on Tree, BST, Heap and Graph
- Expected Learning Outcome:
- Problem solving using Tree, BST, Heap, and Graph
- Self-test
-
- Topics of the final:
- Tree, BST and applications
- Heap and application of Heap
- Basics of Graph data structure