Presentation
This course introduces the basic notions of computer algorithms definition and analysis, including structure, modularity, control, complexity, sorting, top-down analysis, and randomness. It intends to develop skills permitting to think in terms of efficient solutions both at abstract and practical levels to solve problems.
Objectives
The main objectives of the course are to:
- Understand the concept of algorithm
- Get familiar with practical aspects related to the solution of problems using algorithms
- Write, analyze, and define algorithms
- Be prepared to handle more advanced concepts
Duration:
20h
Content
C1: Introduction to algorithms, structure, and implementation
C2: Basic tools and modularity
C3: Complexity analysis
C4: Sorting algorithms
Tutorial 1-2: Control structures and arrays
Tutorial 3-4: Application of top-down analysis
Laboratory 1: Randomness in algorithms
Laboratory 2: Complexity evaluation of sorting algorithms
Organization
Examination
Multiple choice quiz (10%)
Laboratory 1 (20%)
Laboratory 2 (20%)
Final exam (50%)
Scheduled activities
- C1 (1h30) C1
- C2 (1h30) C2
- C3 (1h30) C3
- C4 (1h30) C4
- PC1 (1h30) PC1
- PC2 (1h30) PC2
- PC3 (1h30) PC3
- PC4 (1h30) PC4
- TP1 (3h) TP1
- TP2 (3h) TP2
Team
|
