Introduction, Growth of Functions, Techniques for analysis of algorithms; Methods for the design of efficient algorithms: divide and conquer, greedy method, dynamic programming, back tracking, branch and bound; basic search and traversal techniques; topological sorting; connected components, spanning trees, shortest paths; Flow algorithms; Approximation algorithms; Parallel algorithms, Lower bound theory; NP-completeness, NP-hard and NP-complete problems.
- Students
- Staff
- Research
- About Us +
- Admissions +
- Academics +
- Degrees Offered
- Academic Calendar
- Faculty
- General Education Department
- Department of Business Administration
- Department of Media Studies and Journalism
- Department of English and Humanities
- Department of Computer Science and Engineering
- Department of Electronics and Telecommunication Engineering
- Department of Electrical & Electronic Engineering
- বাংলা ভাষা ও সাহিত্য বিভাগ / Department of Bangla Language and Literature
- Research & Publications +
+- Administration +
- Library
- Tribute to National Professor Rafiqul Islam
- Convocation
- Contact Us