Timetable : 56 hours (16h C, 16h TD, 24h TP)

Teachers: Samia Boukir, El Hadi Zahzah, Valérie Cros-Camps

Requisites : C language.

Purposes : This course aims at giving the students the main steps to be followed

for solving a problem before writing the corresponding program.

Contents : Algorithmic part : Recursive concepts. Algorithmic complexity. Linear data structures (lists, stacks, queues). Tree structures.

Analysis part : Introduction to object-modeling with UML. Needs analysis : use cases, sequence diagrams, collaboration diagrams. Object analysis : class description, relationships between classes, levels of abstraction of classes, class diagrams, state diagrams.

Assessment : One term exam (E) and a continuous assessment (CA) - U.E. assessment = (E+CA)/2

References :

1. Types de données et algorithmes. C.Foidevaux, M.C.Gaudel, M.Soria, Ediscience international, 1993
2. Algorithms. R.Sedgewick, Addison-Wesley Publishing Company, 1988
3. Modélisation objet avec UML. P.A.Muller, Eyrolles 1999