Welcome Message
Dear Students,
Welcome to the Data Structure theory course. I, Zannatul Mawa Koli will be your guide throughout this journey. This course will help you to understand many form of data and how to manipulate them, and finally how to implement them in real life applications. I care about your success in these course. I'm glad you are here.
![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/948283/course/section/172864/image%20%283%29.png)
Instructor: Zannatul Mawa Koli Lecturer Department of Computer Science and Engineering Office : AB4-Room: 727, DSC, Ashulia, Savar Email : zannatulmawa.cse@diu.edu.bd
| ![](https://elearn.daffodilvarsity.edu.bd/pluginfile.php/2224339/course/section/477429/Zannatul%20Mawa%20Koli.jpg)
|
---|
Course Content (From the Syllabus)
An overview of data structure concepts, arrays, stack, queues, trees, and graphs. Discussion of various implementations of these data objects, programming styles, and run-time representations. Course also examines algorithms for sorting, searching and some graph algorithms.
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 offline situation]
Textbook
a. Data Structures and Algorithm Analysis in C by Mark Allen Weiss
b. Principles of Data Structures
by Pande
Reference Books/Materials