Introduction to Data Structures in C

Chapter 5

Queues

Chapter Outline

5.1 Introduction

5.2 Various Positions of Queue

5.3 Queue Implementation

5.4 Operations on Queue

5.5 Disadvantages of Simple Queues

5.6 Dynamic Implementation (Pointers)

5.7 Insertion and Deletion Operation

5.8 Types of Queues

5.9 Applications of Queues

5.10 Types of Systems

5.1 INTRODUCTION

A queue is one of the simplest data structures and can be implemented with different methods on a computer. Queue of tasks to be executed in a computer is analogous to the queue that we see in our daily life at various places. The theory of a queue is common to all. Queue of people in a bank, students queue in school, a travellers' queue for tickets at railway station are few examples of queue. It is necessary to wait ...