This course introduces key programming concepts through three main chapters. Chapter 1 covers subprograms, focusing on functions and procedures, their definitions, differences, and use of parameters, variables, and recursion to write modular code. Chapter 2 explores file handling, including file types, reading, writing, and managing data storage within programs. Chapter 3 presents linked lists as dynamic data structures, explaining their structure, memory management, and operations, along with variants like doubly linked lists, stacks (LIFO), and queues (FIFO), essential for algorithm implementation.
- Enseignant: Deloula MANSOURI