|
Instructor : Tania Khatun
Office : Level-3, Room-704, Academic Building 01, DIU Ashulia Campus
Telephone : 01685069742
Email : tania.cse@diu.edu.bd
Office/Counselling Hour:
|
Welcome Information on Data Structures Course
Online C Compiler for Data Structures Lab
|
Instructions/Guidelines for the course:
- All the students registered for this course have to enroll in BLC
- Students can find all the course materials from BLC
- All the students have to submit the soft copy of their "Assignment" in Moodle under assignment section created here and for this they will be graded here.
- One discussion or feedback forum is created under each of the lecture. Students have to give their feedback on these forum and marks will be given for their feedback
- Announcement regarding the class will be posted on Moodle.
- Quizzes and presentation may be held on face to face class and may be few of the class will be held on online (BLC) and it will be announced before the class
- The question pattern and the syllabus for the quizzes, midterm and final exam is given here under each of the section (quizzes, midterm and final)
- There are midterm and final exam preparation forum under these sections where students can discuss with each other about their midterm and final exam syllabus, any problem regarding the exam etc.
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 a 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
Assessment Instructions
| 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
Student Feedback Form: [Student's are requested to fill up the form]