C programming language is a powerful and widely-used language in the field of computer science and software development. Understanding the basic concepts of C programming is essential for anyone interested in data structures and algorithms. In this section, we will provide a detailed overview of C programming concepts as they relate to data structures.

Data and information are fundamental concepts in the field of computer science and are crucial for understanding how data structures work and how they are utilized in various applications. In this section, we will delve into the concepts of data and information, their definitions, differences, and significance in the context of data structures.

Arrays are fundamental data structures in programming that allow storing a collection of elements of the same data type in contiguous memory locations. In the context of the book "DATA STRUCTURE," arrays are introduced as one of the primary data structures and serve as building blocks for more complex data structures and algorithms.

In the realm of data structures, a stack is a fundamental abstract data type (ADT) that follows the Last In, First Out (LIFO) principle. This means that the last element added to the stack is the first one to be removed. Stacks are widely used in various computing applications due to their simplicity and efficiency in managing data.

Queues are a fundamental abstract data type (ADT) that follows the First-In-First-Out (FIFO) principle. In a queue, elements are inserted at the rear end and removed from the front end. This orderly manner of processing elements makes queues suitable for a variety of applications where data needs to be handled in a sequential and organized manner