Algorithmics I

Quadrimestre 1 -

72 hours

Coordinator : CLR

Teaching staff : CLR, CUV, ELV, HAL, MCD, NPX

General course description

Programming techniques and design of algorithms. Theoretical approach + exercises.

Learning basic skills

None

Course Aims

  • Learning to construct coherent algorithms (logical structures of programming)
  • Studying several methods in representing algorithms
  • Programming paradigms
  • Working on some data structures

Course Outline

Chapter 1: Fundamental topics

  • Steps in solving a problem
  • Resolution procedures: guidelines
  • Computer: running a programme

Chapter 2: Sequential algorithms

  • Algorithmic description language
  • Variables and types
  • Operators and expressions
  • Basic algorithms

Chapter 3 : Alternatives

  • if - then - else
  • select case

Chapter 4 : Sub algorithms

  • Parameters
  • Local variables

Chapter 5 : Structured types

Chapter 6 : Loops

  • for...
  • do while...

Chapter 7 : Strings

Chapter 8: Tables

  • Subscripted variable
  • Basic algorithms: path, research

Chapter 9 : Sorting algorithms

Bibliography

  • ESI course book