Algorithms 1

  • ECTS

    5 credits

  • Training structure

    Faculty of Science

Description

In this module, we present the basic concepts of algorithms (notion of a problem, problem instance, instance size, notion of complexity, termination, proof of validity).

The algorithms presented will focus on problems related to sorting, stacks, queues, arrays, etc. 

Read more

Objectives

- algorithms, iterative processing

- proof: validity, termination, complexity

- structures: arrays, linked lists, stacks, queues

- examples of recursive functions: dichotomous search

- sorting: insertion, selection, merge sort, other sorting examples

Read more

Teaching hours

  • Algorithms 1 - Practical WorkPractical Work3 p.m.
  • Algorithms 1 - TutorialTutorial6 p.m.
  • Algorithms 1 - LectureLecture12 hours