The title of the course CS502 is Fundamental Of Algorithm. The course level is Undergraduate, Credit hours for theory are 3. CS301 has been defined as a pre requisites of this course.
CS502 Course Outline
The goal of this course is to help students grasp the concepts and methods underlying algorithm design and analysis. Programming is not required for this mostly theoretical course, although comprehending the idea of a mathematical proof and a basic comprehension of discrete mathematics are.
We will discuss and examine a number of data structures and algorithms that have been picked for their significance and their ability to illustrate key ideas. We will place a focus on examining an algorithm’s worst-case running time as a function of input size.
Assuming that viable calculations are those that can be completed in polynomial time, we will also spend some time examining the boundary between feasible and infeasible computations.
CS502 Handouts
CS502 handouts are available on link CS502 Handouts
CS502 Past Papers
CS502 Midterm Past Papers
CS502 midterm past papers are available on CS502 Handouts
CS502 Final Term Past Papers
CS502 final term past papers are available on CS502 Handouts
CS502 Assignments & Solutions
CS502 Assignment 1 Solution
CS502 assignment are available on the link “CS502 Assignment“.
CS502 Assignment 2 Solution
CS502 assignment 2 solution will be available soon.
Telegram Link
Join us for more updates : Telegram Link
You can also view other handouts too:
- MCM101 Handouts
- BIF602 Handouts
- MCM301 Handouts
- MGT711 Handouts
- BIF401 Handouts
- ACC311 Handouts
- ACC501 Handouts
- BIO301 Handouts
- CS101 Handouts
- CS201 Handouts
- CS301 Handouts
- CS302 Handouts
- CS304 Handouts
- CS401 Handouts
- CS402 Handouts
- CS403 Handouts
- CS408 Handouts
- CS410 Handouts
- CS501 Handouts
Apart from handouts you can also view past papers from here: