ECTS
5 credits
Training Structure
College of Sciences
Description
In this module, we introduce the basic concepts of algorithms (the concept of a problem, a problem instance, instance size, the concept of complexity, termination, and proof of correctness).
The algorithms presented will address problems related to sorting, stacks, queues, arrays, and more.
Objectives
- algorithms, iterative processing
- proof: validity, termination, complexity
- data structures: arrays, linked lists, stacks, queues
- Examples of recursive functions: binary search
- Sorting: insertion sort, selection sort, merge sort, other examples of sorting
Class Hours
- Algorithms 1 - LabLab Sessions15 hours
- Algorithms 1 - TutorialTutorials6:00 p.m.
- Algorithms 1 - LectureLecture12 hours