To operate the Blended Learning Center(BLC) at optimal level, maintenance will be performed every day at 8:30 AM and at 5:00 PM regularly which can take up to 30 minutes. Please consider scheduling your activity in the BLC platform accordingly.
Topic outline
- Welcome to Data Structures
![](https://elearn.daffodilvarsity.edu.bd/theme/image.php/remui/core/1716861392/spacer)
Welcome to Data Structures
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/2173947/course/section/467704/oie_WlV0M3o9JSZg.png)
![me](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/2173947/course/section/467704/T%20faria.jpg)
Instructor : Faria Nishat Khan Office : Room no. 505, AB-04, Daffodil Smart City, Ashulia, Dhaka Email : farianishat.cse@diu.edu.bd
|
![WELCOME](https://images.unsplash.com/photo-1600577916048-804c9191e36c?ixlib=rb-1.2.1&ixid=MnwxMjA3fDB8MHxzZWFyY2h8NHx8d2VsY29tZXxlbnwwfHwwfHw%3D&w=1000&q=80)
|
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% |
|
[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
Data Structure Simulation
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/2173950/mod_label/intro/cseuser1.PNG)
- Week 1: Preparing Background
Week 1: Preparing Background
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124146/image.png)
- 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
- Question: Data structure operations
- Week 2: Exercise and Course Project
Week 2: Exercise and Course Project
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124147/image.png)
- 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
- Discussion on link list
- Write the function of insertion a node after a given node.
- Write the function of insertion a node as Head.
- Week 3: Discussion on Link-List
Week 3: Discussion on Link-List
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124148/image.png)
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
- How does a node link to the next node
- Week 4: Adaptive Lesson on Link-List
Week 4: Adaptive Lesson on Link-List
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124149/image.png)
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.
- Week 5: Review discussion on Link-List
Week 5: Review discussion on Link-List
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124150/image.png)
- 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
- Week 6: Discussion on Stack Applications
Week 6: Discussion on Stack Applications
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124151/image.png)
- 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
Infix-Prefix-Postfix
Infix to Postfix
Infix to Prefix
Postfix to infix
Prefix to infix
Prefix to postfix
Postfix to prefix
- Consider the following arithmetic expression P written in postfix notation, Evaluate P.
- P : 220, 10, 5, /,/ 50,40,+,-,1,*
- Consider the following arithmetic expression P written in infix notation. Evaluate p by using postfix notation.
- p : 5, * , (6+2), - 12, /, 4 (Note: parentheses is not necessary for postfix notation.)
- Course Project
- Week 7: Midterm Exam
Week 7: Midterm Exam
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/2173947/course/section/467712/cseuser1.PNG)
- Link-list and operations
- Stack and application of stack
- Queue
- Week 8: Discussion on Tree Data Structure
Week 8: Discussion on Tree Data Structure
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124154/image.png)
- 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
- Week 9: Discussion on Binary Search Tree (BST)
Week 9: Discussion on Binary Search Tree (BST)
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124155/image.png)
- 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
BST Assignment
Restricted Not available unless: You belong to 61_P
BST Assignment
Restricted Not available unless: You belong to 61_O
- Week 10: Discussion on Heap
Week 10: Discussion on Heap
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124156/image.png)
- HEAP data structure and applications of Heap
- Exercise on BST and Heap
- Expected Learning Outcome:
- Implementation of Heap and operations
- Problem solving using BST
Heap(Introduction, Insertion)
Heap deletion | Heap sort
- Week 14-15: Discussion on Graph
Week 14-15: Discussion on Graph
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124157/image.png)
- Graph data structure and applications of graph
- Traversal of Graph
- Expected Learning Outcome:
- Implementation of graph data structure
- Problem solving using Heap
BFS Traversal
DFS Traversal
Graph Introduction and Representation
- Week 12: Review Discussion
Week 12: Review Discussion
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/771979/course/section/124158/image.png)
- Review
exercises on Tree, BST, Heap and Graph
- Expected Learning Outcome:
- Problem
solving using Tree, BST, Heap, and Graph
- AVL Tree
- Quiz
Quiz
Quiz 3 - 61_O Assignment
Restricted Not available unless: You belong to 61_O
Quiz 3 - 61_P Assignment
Restricted Not available unless: You belong to 61_P
Makeup Quiz - 61_O Assignment
Restricted Not available unless: You belong to 61_O
Makeup Quiz - 61_P Assignment
Restricted Not available unless: You belong to 61_P
- Week 17-18: Final Exam