CSC325
This course introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, divide and conquer strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness, and approximation algorithms. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed.
Design and Analysis of Algorithms for TU BSc CSIT is covered here in full, from syllabus notes to solved past questions. This subject has 8 chapters mapped to the official syllabus, and 72 past exam questions with written model answers. You can read the notes and answers for free, and a free account adds flashcards and progress tracking so weak topics come back before the exam.
This TU BSc CSIT Design and Analysis of Algorithms guide covers Foundation of Algorithm Analysis, Iterative Algorithms, Divide and Conquer Algorithms, Greedy Algorithms, Dynamic Programming, Backtracking, Number Theoretic Algorithms, NP Completeness, across 8 chapters. It includes model answers to 72 past exam questions, plus flashcards for quick revision.
Share of marks across past TU exams.
In this chapter. Tap one to practise its questions.
Design and Analysis of Algorithms has 8 chapters mapped to the official syllabus.
Yes. Each of the 72 past questions comes with a written model answer you can read for free.
Yes, the notes and model answers are free to read. A free account adds flashcards and progress tracking.
Based on the official syllabus.