Algorithms∗ and Data Structures 1 is a practical work for the first semester of the first year. It provides a fundamental introduction to the basic concepts of algorithms and data structures, which are essential for any computer science ∗learner. This practical work focuses on understanding and applying algorithms as well as designing and manipulating basic data structures. Its aim is to familiarize you with the fundamental principles of algorithms and data structures and to equip you with the skills needed to solve computer science problems effectively. The Algorithms and Data Structures 01 practical work is divided into learning units designed six to reinforce theoretical understanding through practical activities and projects: The first chapter explores the Code::Blocks programming tool, providing details on its download and installation. The second chapter addresses the design of algorithms and programs in the C language to solve various problems. It covers the use of basic instructions such as assignment, reading, writing, and discusses the concepts of variables, constants, and data types. The third chapter covers the manipulation of simple, compound, and multiple-choice conditional structures, as well as branching. The fourth chapter focuses on practicing different control structures (loops) used in algorithms or programs (e.g., for, while, repeat, nested loops, etc.). The fifth chapter is devoted to the creation and manipulation of arrays and character strings, illustrating their uses. The sixth chapter examines custom types, allowing learners to construct enums and records. This practical work serves as a fundamental basis for computer science learners, enabling them to acquire solid skills in algorithms and data structures. These skills are essential for progressing in computer science studies in the coming semesters and for succeeding in professional fields requiring expertise in designing and optimizing software solutions. By completing this practical work, you will develop a deep understanding of algorithms and data structures and will be well-prepared to tackle more advanced topics.