logo Insalogo Insa

Computer programming - Operating Systems


At the end of this module, the student will have understood and will be able to explain
(main concepts):
- breakdown into functions: designing procedures, passing parameters
- differences between basic data structures: arrays, records, pointers and linked
- recursive algorithms
- basic algorithms for searching, sorting, and merging arrays
The student will be able to:
- analyse an advanced problem
- breakdown it into subprograms
- choose appropriate data structures
- specify (recursive) algorithms
- implement algorithms in ADA language
- specify and develop test cases
Operating system section
At the end of this module, the student will be able to use the UNIX command-line interface
on his own. He will be expected to find and learn how to use
new commands, not covered in lessons.

Needed prerequisite

 1st year algorithm lecture

Form of assessment

The evaluation of outcome prior learning is made as a continuous training during the semester. According ot the teaching, the assessment will be different: as a written exam, an oral exam, a record, a written report, peers review...