This handout, a crucial resource, is specifically designed for first-year LMD students in the Mathematics and Computer Science field. It serves as a comprehensive course manual for the subject "Algorithmics and data structure 2", aiming to introduce the fundamental notions of functions and procedures, files, and linked lists. It's important to note that students should have a solid foundation in computer science and mathematics.

Semester: 02

Fundamental teaching unit: UEF22

Subject: Algorithms and data structure 2

Credits: 6

Coefficient: 4

Objectives of the teaching unit: to introduce the fundamental concepts of programming to the study Recommended prior knowledge: Notions of algorithms and data structure.

Assessment method: Exam (60%), continuous assessment (40%)

This handout is structured into three chapters as follows:

First chapter: Subroutines: Functions and Procedures

This chapter will define functions and procedures and then explain local and global variables. I will present the transmission of parameters and then address the concept of recursion.

Second chapter: The files

The fundamentals of files, their kinds, and the different operations will all be covered in this chapter.

Third chapter: Linked lists

This chapter will introduce pointers, dynamic memory management linked lists, operations on linked lists, doubly linked lists, and special linked lists.

A list of bibliographical references is given at the end of this manuscript.

Teacher: Dr. KADDI Mohammed