Section outline
-
Instructor : Amit Chakraborty Chhoton
Office : Room no: 509 Level 5, AB 04 Daffodil International University Ashulia Campus.
Office Hour : email for appointment
Telephone : 01718384336
Email : amit.cse@diu.edu.bd
Appointment in Google Calendar: Click HereWelcome Information on Data Structures Course
- Welcome Audio
- Listen to Course Objectives
- Listen to Expected Outcomes
- Listen to Course Delivery Plan
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%
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
-
- 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
-
Live Class on Google Meet
-
- 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
-
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
-
Live Class on Google Meet
Data Structure PC_H Live class on google meet!!! (2020-10-11 at 22:55 GMT-7)
-
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
-
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.
-
- 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
-
Live Class on Google Meet
PC_H Data Structure Live Class!! (2020-10-19 at 23:05 GMT-7)
-
- 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
-
-
Live Class on Google Meet
Data Structure PC-H Live classes (2020-10-31 at 02:19 GMT-7)
-
- Topics of discussion:
- Discussion on Tree data structure
- Tree traversals and applications
- Expected Learning Outcome:
- Implementation of tree data structure
- Problem solving for tree traversal
- Self-test on Tree Data Structure
-
Live Class on Google Meet
Data Structure PC_H Live class on google meet!!! (2020-11-15 at 22:00 GMT-8)
-
- Topics of discussion:
- BST and operations on BST
- Applications of BST
- Expected Learning Outcome:
- Implementation of BST and related operations
- Problem solving using BST
- Presentation on Course Project
-
- 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
- Self-Test on BST
-
Live Class on Google Meet
Data Structure PC_H Live class on google meet!!! (2020-11-22 at 21:52 GMT-8)
-
- Topics of discussion:
- Graph data structure and applications of graph
- Traversal of Graph
- Expected Learning Outcome:
- Implementation of graph data structure
- Problem solving using Heap
-
- Topics of discussion:
- Review exercises on Tree, BST, Heap and Graph
- Expected Learning Outcome:
- Problem solving using Tree, BST, Heap, and Graph
- Self-test