logo Insalogo Insa

Computer programming - Operating Systems

Presentation

Programme (detailed contents):

Algorithms and Programming section

v  breakdown into sub-programs

v  constrained and unconstrained arrays

v  recursive algorithms: principle, examples

v  pointers and linked lists

 

 

Operating system section

v  The shell command interpreter, the variables, iterative and control structures

v  Shell programming (mainly bash)

v  File system commands ,particularly the permissions (read, write,

v  execute)

v  Management of users (uid, gid, home directory, etc)

v  input/output redirections and pipes

v  Some basic information about documentation, compression and some network commands

 

 

Organisation:

Algorithms and Programming section

For each main concept:

a) one or two tutorials in small working groups

b) one lecture with all the class

c) one or two lab-works in computer rooms

Given documents: handouts of lecture notes, tutorial exercises and practical studies

Operating system section

The concepts are presented during the lectures and are gone into more deeply during 9 tutorials.

Given documents: handouts of lecture notes, tutorial exercises and practical studies

 

 

Main difficulties for students:

v  insufficient design phase: choosing sub-programs, data structures, special cases lack of method and rigour during coding and debug phases v  shell programming, in particular using shell variables, is difficult for the students lack of autonomy in understanding the documented commands (with the 'man' command), partially due to the fact that this documentation is in English

Objectives


A

At the end of this module, the student will have understood and be able to explain (main concepts):

 

v  breakdown into functions: designing procedures, passing parameters

v  differences between basic data structures: arrays, records, pointers and linked lists

v  recursive algorithms

v  basic algorithms for searching, sorting, and merging arrays

The student will be able to:

 

v  analyse an advanced problem

v  breakdown it into subprograms

v  choose appropriate data structures

v  specify (recursive) algorithms

v  implement algorithms in ADA language

v  specify and develop test cases

Operating system section

v  At the end of this module, the student will be able to use the UNIX command-line interface

v  on his own. He will be expected to find and learn how to use

v  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...

Benefits

P. Breguet L. Zaffalon « Programmation Séquentielle avec Ada95 », PPUR, 1999, 2880744040.

Programmation sous UNIX, J.M. Riflet.