Skip to content

Le code des TPs de C proposés à l'INSA Rennes, département 3EII

Notifications You must be signed in to change notification settings

thomas-bouvier/insa-c-3eii

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

41 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

insa-c-3eii

Le code des TPs de C proposés à l'INSA de Rennes, département 3EII

alt tag

1. GCC, Makefile and main argument

Objectives :

  • Discover an Unix-like environment ;
  • Use by yourself the GCC to build a program ;
  • Manipulate them trough a Makefile ;
  • Write a program using the main arguments.

2. Postfix expressions

Objectives :

  • Study a stack of int ;
  • Code a function with an ellipsis ;
  • Use the stack of int to evaluate postfix expressions ;
  • Write a new solution based on pointers of functions.

3. Dynamic memory allocation

Objectives :

  • Practice dynamic memory allocation ;
  • Implement a classical image structure.

4. Binary files

Objectives :

  • Read and write in a binary file ;
  • Discover the Bitmap format for image files.

5. Singly linked list (level 1)

Objectives :

  • Use dynamic allocation ;
  • Implement and use singly linked list.

6. Singly linked list (level 2)

Objectives :

  • Implement more advanced functionalities on linked lists to obtain a better knowledge of their mechanisms ;
  • Create unit tests on these functionalities.

7. Singly linked list (level 3) : code a basic leak memory detector

Objectives :

  • Overload functions using macros ;
  • Manipulate addresses and more particularly void pointers ;
  • Use our linked list interpretation to implement a basic leak memory detector.

8. Balanced trees : AVL trees

Objectives :

  • Manipulate binary trees ;
  • Use recursive programming to implement an AVL tree.

9. Trees : Huffman coding

Objectives :

  • Implement a binary tree ;
  • Use recursive programming in the tree use case ;
  • Build a tree by a bottom-up method ;
  • First approach of a coding method : Huffman tree ;
  • Read image data from binary files.

10. Graphs : Dijkstra's algorithm

Objectives :

  • Implement functionalities for a weighted directed graph implemented using linked lists ;
  • Implement Dijkstra's algorithm to find the shortest path.

About

Le code des TPs de C proposés à l'INSA Rennes, département 3EII

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published