DATA STRUCTURES AND ALGORITHMS 2
Date
2026
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
University of Tindouf
Abstract
....
Description
**Chapter One: Subprograms**
The first chapter focuses on subprograms, which are fundamental building blocks in structured programming. Subprograms (functions and procedures) allow programmers to divide complex problems into smaller, manageable units. This chapter covers the concept of modular programming, parameter passing, scope of variables, recursion, and the benefits of code reusability and maintainability.
**Chapter Two: Files**
The second chapter introduces file handling concepts. Files provide a way to store data permanently outside the main memory, enabling programs to handle large volumes of data efficiently. This chapter discusses file operations such as opening, reading, writing, appending, and closing files, as well as different file modes and basic file organization techniques.
**Chapter Three: Linked List Data Structure **
The third chapter explores dynamic data structures, beginning with linked lists. Linked lists offer flexible memory usage and dynamic storage allocation compared to static data structures. The chapter explains different types of linked lists and their implementation. It further introduces stacks and queues as abstract data types, detailing their operations, applications, and implementations using linked lists.
By the end of these notes, students will understand how to design and implement fundamental data structures and apply structured problem-solving techniques. All algorithms discussed throughout these lecture notes are expressed in the C programming language
Keywords
Subprograms, Files, Linked List Data Structure
Citation
Faculty of Sciences and Technology