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.
Lab Performance on linked list(PC-J)(Week-4) Assignment Not available unless: You belong to DSLab-(PC-J)
Topic outline
- Welcome to Data Structures
Welcome to Data Structures
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
Data Structure Simulation
Restricted Not available unless: You belong to DS-(PC-E)
Restricted Not available unless: You belong to DS-(PC-F)
Restricted Not available unless: You belong to DS-(PC-J)
- Week 1: Preparing Background
Week 1: Preparing Background
- 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
Restricted Not available unless: You belong to DSLab-(PC-J)
Restricted Not available unless: You belong to DSLab-(PC-J)
Lab Performance on structure(PC-J)(Week 1) Assignment
Restricted Not available unless: You belong to DSLab-(PC-J)
- Week 2: Exercise and Course Project
Week 2: Exercise and Course Project
- 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
Restricted Not available unless: You belong to DSLab-(PC-J)
- Week 3: Discussion on Link-List
Week 3: Discussion on Link-List
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
Restricted Not available unless: You belong to DSLab-(PC-J)
Lab performance on linked list(PC-J) (Week-3) Assignment
Restricted Not available unless: You belong to DSLab-(PC-J)
Quiz-1(PC-E)
Restricted Not available unless: You belong to DS-(PC-E)
Quiz-1 (PC-F)
Restricted Not available unless: You belong to DS-(PC-F)
Quiz-1 (PC-J)
Restricted Not available unless: You belong to DS-(PC-J)
- Week 4: Adaptive Lesson on Link-List
Week 4: Adaptive Lesson on Link-List
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
Restricted Not available unless: You belong to DSLab-(PC-J)
Lab Performance on linked list(PC-J)(Week-4) Assignment
Restricted Not available unless: You belong to DSLab-(PC-J)
- Week 5: Review discussion on Link-List
Week 5: Review discussion on Link-List
- 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
- 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
Restricted Not available unless: You belong to DSLab-(PC-J)
Quiz-2(PC-E)
Restricted Not available unless: You belong to DS-(PC-E)
Quiz-2 (PC-F)
Restricted Not available unless: You belong to DS-(PC-F)
Quiz-2 (PC-J)
Restricted Not available unless: You belong to DS-(PC-J)
- Week 7: Midterm Exam
Week 7: Midterm Exam
- Link-list and operations
- Stack and application of stack
Dear students,
You need to download (1) QuestionPaper.pdf and (2) AnswerScriptTemplate.doc from the Mid-exam. You will type your answers in the answer script doc file and save as pdf with your ID e.g. CSE134-PC-E-171-15-2345-mid.pdf (Course Code-Section-Student ID) and then upload in the following google form link: https://forms.gle/2uu9eMeJcxGC79KA8
- Week 8: Discussion on Tree Data Structure
Week 8: Discussion on Tree Data Structure
- 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)
- 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
- Week 10: Discussion on Heap
Week 10: Discussion on Heap
- HEAP data structure and applications of Heap
- Exercise on BST and Heap
- Expected Learning Outcome:
- Implementation of Heap and operations
- Problem solving using BST
- Week 11: Discussion on Graph
Week 11: Discussion on Graph
- Graph data structure and applications of graph
- Traversal of Graph
- Expected Learning Outcome:
- Implementation of graph data structure
- Problem solving using Heap
Restricted Not available unless: You belong to DSLab-(PC-J)
- Week 12: Review Discussion
Week 12: Review Discussion
- Review
exercises on Tree, BST, Heap and Graph
- Expected Learning Outcome:
- Problem
solving using Tree, BST, Heap, and Graph
Restricted Not available unless: You belong to DSLab-(PC-J)
- Week 13-14: Final Exam
Week 13-14: Final Exam
- Tree, BST and applications
- Heap and application of Heap
- Basics of Graph data structure
Lab final(PC-J) Assignment
Restricted Not available unless: You belong to DSLab-(PC-J)
Dear students,
You need to download (1) QuestionPaper.pdf and (2) AnswerScriptTemplate.doc from the final-exam. You will type your answers in the answer script doc file and save as pdf with your ID e.g. CSE134-PC-E-111-15-2345-final.pdf (Course Code-Section-Student ID) and then upload in the following google form link:
https://forms.gle/ASvqKpXfYpUP9kk67
- Topic 14
- Topic 15
- Topic 16
- Topic 17
- Topic 18
- Topic 19
- Topic 20
- Topic 21
- Topic 22
- Topic 23
- Topic 24
- Topic 25
- Topic 26
- Topic 27
- Topic 28
- Topic 29
- Topic 30
- Topic 31
- Topic 32
- Topic 33
- Topic 34
- Topic 35
- Topic 36
- Topic 37
- Topic 38
- Topic 39
- Topic 40
- Topic 41
- Topic 42
- Topic 43
- Topic 44
- Topic 45
- Topic 46
- Topic 47
- Topic 48
- Topic 49
- Topic 50