Semester 44 CreditsReg 2021Code: 21CSC204J
Design and Analysis of Algorithms
Design and Analysis of Algorithms covers algorithm asymptotic analysis, recurrence relations, divide-and-conquer, greedy algorithms, dynamic programming, backtracking, branch-and-bound, and NP-completeness under SRMIST Regulation 2021.
Verified Papers
8
SRMIST Historical Exams
Exam Questions
255
Cataloged & Structured
Syllabus Units
5
Authoritative Taxonomy
Curriculum Scope
Active
SRMIST B.Tech Reg 2021
Assessment Architecture & Syllabus Scope
Cycle Test 1 (Formative Test 1)CT1
Evaluates syllabus Units 1 & 2.
Covers foundational concepts from Units 1 and 2.
Cycle Test 2 (Formative Test 2)CT2
Evaluates syllabus Units 3 & 4.
Covers intermediate applications from Units 3 and 4.
Semester University ExaminationEndSem
Evaluates syllabus Units 1 through 5.
Covers comprehensive syllabus across Units 1 through 5.
Syllabus Units & Topics
Authoritative SRMIST curriculum breakdown organized by unit and topic.
Curriculum Units (5 Units)
•
Algorithm Fundamentals and Correctness
Time and Space Complexity Analysis
PYQs Asymptotic Notations and Growth Functions
PYQs Recurrence Relations and Substitution Method
PYQs Recursion Tree Method and Mathematical Induction
Prepare for your next Design and Analysis of Algorithms exam
Launch MintAI to view probability forecasts, question recurrence matrices, and cycle-specific predictions with verified past paper citations.