Home / Semester 4 / CSE408
Back to Subjects

CSE408 — Design And Analysis Of Algorithms

Practice

Course Overview

CSE408 3 Credits L:3 T:0 P:0

This course covers the basic techniques of analyzing algorithms using space and time complexity, asymptotic notations, and various algorithm design techniques such as brute force, divide and conquer, dynamic programming, and greedy algorithms. Students will also learn string matching algorithms, backtracking, branch and bound techniques, and basic concepts of complexity classes.

Study Units

Unit 1

Foundations of Algorithm

Notes MCQ Subjective
Unit 2

String Matching Algorithms and Computational Geometry

Notes MCQ Subjective
Unit 3

Divide and Conquer and Order Statistics

Notes MCQ
Unit 4

Dynamic Programming and Greedy Techniques

Notes MCQ
Unit 5

Backtracking and Approximation Algorithms

Notes MCQ
Unit 6

Number-Theoretic Algorithms and Complexity Classes

Notes MCQ Subjective

Continuous Assessment

1 component

NA 0%

NA

Week NA

Exams & Practice

Mid Term Examination

Mid-semester comprehensive evaluation

20%

All MCQ

End Term Examination

Final semester comprehensive evaluation

50%

Type: Examination

All MCQ

CSE408 - FAQs

How many units are in CSE408?

CSE408 has 6 units. Each unit includes detailed notes and MCQ practice questions.

What exam resources are available for CSE408?

Unit-wise notes and MCQ practice are available. Exam resources coming soon.

How to prepare for CSE408 exams?

Study each unit's notes thoroughly, practice MCQs to test understanding, and attempt mock tests before exams. Focus on important topics and previous year questions.