Aller au menu Aller au contenu
Academics
Academics
Academics

> Study at Esisar

PAlgorithmic 2 - 2AMCS211

A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail cet article Facebook Twitter Linked In
  • Number of hours

    • Lectures : 19.5
    • Tutorials : -
    • Laboratory works : 12.0
    • Projects : -
    • Internship : -
    • Written tests : -
    ECTS : 6.0
  • Officials : Quentin GIORGI

Goals

At the end of the course, students should be able to address:

  • Simple compilation tools (Makefile, Unix command line, etc...)
  • Program, test and debug algorithms written in C including dynamic data structure (linked lists) or recursive functions.

Content

  • C syntax
  • Memory allocation and pointers
  • linked lists
  • Recursive programming
  • abstract types (stack, fifo, etc...)
  • Unix tools: grep, regular expressions.
  • Unix Development Environment : Makefile compiler, debugger, man pages, etc...

Prerequisites

Algorithimic 1.

Tests

E1: Final Exam.
TP: Labs
CC: Home work or exam.

Calendar

The course exists in the following branches:

  • Curriculum - First cycle - Semester 3
see the course schedule for 2021-2022

Additional Information

Course ID : 2AMCS211
Course language(s): FR

The course is attached to the following structures:

  • Team Computer Science

You can find this course among all other courses.

Bibliography

Le langage C - B. Kernighan, D. Ritchie.
Polycopié de Bernard Cassagne - Ressource Internet.

A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail cet article Facebook Twitter Linked In

Date of update June 25, 2015

Université Grenoble Alpes