ICT 5102: Data Structure and Algorithms

Announcement

Please check latest announcments at learning.iict.buet.ac.bd

Course Synopsis

This course introduces the student to the concept of data structures through abstract data structures including lists, sorted lists, stacks, queues, and graphs; and implementations including the use of linked lists, arrays, binary search trees, hash tables, trees, and adjacency matrices. It also introduces the student to algorithm design including greedy, divide-and-conquer, random and backtracking algorithms and dynamic programming; and specific algorithms including, for example, resizing arrays, balancing search trees, shortest path, and spanning trees. The course includes continuous assessment in the form of Mid Term examinations, assignments and term papers.

Reference Book

• Vinu V Das. Principles of Data Structures using C and C++.
• Nell B. Dale. C++ Plus Data Structures. 3rd Edition
• Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. Data Structures and Algorithms.

Assessment

• Midterm Exam 1: 20%
• Midterm Exam 2: 20%
• Assignment: 20%
• Final Exam: 40%

Class Lectures

All the lectures will be available at learning.iict.buet.ac.bd