node
| Id | |
| Label | |
| Node Type | |
| Cognitive Level | |
| Description |
Algorithms & Complexity
(Year: 2 Period: 4 Category: Compulsory )
Create
Evaluate
Analyze
Apply
Understand
Remember
Course
Knowledge Unit
Knowledge Point / Sub Knowledge Point
* Please save changes after editing the graph
Node Description:
Click on a node to see its description.
Course Objectives:
- 1. (understand)Student can explain the following concepts: complexity measures, complexity classes, optimization algorithms, dynamic programming, greedy algorithms, reductions, complex problems.
- 2. (understand)The student can determine the time complexity of a given algorithm.
- 3. (understand)The student can design an algorithm with a predetermined upper bound for a given problem.
- 4. (understand)The student can design an algorithm in one of the three optimization strategies discussed.
- 5. (understand)The student can analyze a network problem and translate it from a given problem into a network problem.
- 6. (understand)The student can apply Discrete Fourier Transform to practical examples.
- 7. (understand)The student can translate a problem into another problem through time-bounded reduction.
- 8. (understand)The student can analyze algorithmic properties of a problem (for example: requires exhaustive search over a large domain, or is bounded by constant space) on the basis of which predictions can be made about the (im)possibility of designing efficient algorithms.