Computer Science‎ > ‎

Data Structures: Queues ( with C Program source code)





Introduction to Algorithms 3r...
List Price: Rs.525
Our Price: Rs.357
Buy from FlipKart


   Introduction to Algorithms (CLRS) 



Algorithms 4th Edition
Our Price: Rs.599
Buy from FlipKart


 Algorithms (By Robert Sedgewick) 


An Introduction to the Analys...
List Price: Rs.550
Our Price: Rs.500
Buy from FlipKart


Analysis of Algorithms (By Robert Sedgewick) 





Some Important Linear Data Structures- at a glance

To go through the C program / source-code, scroll down to the end of this page

Queue


Queue is a specialized data storage structure (Abstract data type). Unlike, arrays access of elements in a Queue is restricted. It has two main operations enqueue and dequeue. Insertion in a queue is done using enqueue function and removal from a queue is done using dequeue function. An item can be inserted at the end (‘rear’) of the queue and removed from the front (‘front’) of the queue. It is therefore, also called First-In-First-Out (FIFO) list. Queue has five properties - capacity stands for the maximum number of elements Queue can hold, size stands for the current size of the Queue, elements is the array of elements, front is the index of first element (the index at which we remove the element) and rear is the index of last element (the index at which we insert the element).
 
 
Queues
 
 
 

Algorithm:

Queue structure is defined with fields capacity, size, *elements (pointer to the array of elements), front and rear.

Functions –

1. createQueue function– This function takes the maximum number of elements
(maxElements) the Queue can hold as an argument, creates a Queue according to it
and returns a pointer to the Queue. 
2. enqueue function - This function takes the pointer to the top of the queue Q and the item
(element) to be inserted as arguments. Check for the emptiness of queue
3. dequeue function - This function takes the pointer to the top of the stack S as an
argument and will then dequeue an element.
4. front function – This function takes the pointer to the top of the queue Q as an argument and returns the front element of the queue Q.  

Properties:

1. Each function runs in O(1) time.
2. It has two basic implementations
Array-based implementation – It’s simple and efficient but the maximum size of
the queue is fixed.
Singly Linked List-based implementation – It’s complicated but there is no limit
on the queue size, it is subjected to the available memory.

Complete Tutorial with document :





                                                                                                           

Queues - C Program source code

#include<stdio.h>
#include<stdlib.h>
/*Queue has five properties. capacity stands for the maximum number of elements Queue can hold.
  Size stands for the current size of the Queue and elements is the array of elements. front is the
 index of first element (the index at which we remove the element) and rear is the index of last element
 (the index at which we insert the element) */

typedef struct Queue
{
        int capacity;
        int size;
        int front;
        int rear;
        int *elements;
}Queue;
/* crateQueue function takes argument the maximum number of elements the Queue can hold, creates
   a Queue according to it and returns a pointer to the Queue. */

Queue * createQueue(int maxElements)
{
        /* Create a Queue */
        Queue *Q;
        Q = (Queue *)malloc(sizeof(Queue));
        /* Initialise its properties */
        Q->elements = (int *)malloc(sizeof(int)*maxElements);
        Q->size = 0;
        Q->capacity = maxElements;
        Q->front = 0;
        Q->rear = -1;
        /* Return the pointer */
        return Q;
}
void Dequeue(Queue *Q)
{
        /* If Queue size is zero then it is empty. So we cannot pop */
        if(Q->size==0)
        {
                printf("Queue is Empty\n");
                return;
        }
        /* Removing an element is equivalent to incrementing index of front by one */
        else
        {
                Q->size--;
                Q->front++;
                /* As we fill elements in circular fashion */
                if(Q->front==Q->capacity)
                {
                        Q->front=0;
                }
        }
        return;
}
int front(Queue *Q)
{
        if(Q->size==0)
        {
                printf("Queue is Empty\n");
                exit(0);
        }
        /* Return the element which is at the front*/
        return Q->elements[Q->front];
}
void Enqueue(Queue *Q,int element)
{
        /* If the Queue is full, we cannot push an element into it as there is no space for it.*/
        if(Q->size == Q->capacity)
        {
                printf("Queue is Full\n");
        }
        else
        {
                Q->size++;
                Q->rear = Q->rear + 1;
                /* As we fill the queue in circular fashion */
                if(Q->rear == Q->capacity)
                {
                        Q->rear = 0;
                }
                /* Insert the element in its rear side */
                Q->elements[Q->rear] = element;
        }
        return;
}
int main()
{
        Queue *Q = createQueue(5);
        Enqueue(Q,1);
        Enqueue(Q,2);
        Enqueue(Q,3);
        Enqueue(Q,4);
        printf("Front element is %d\n",front(Q));
        Enqueue(Q,5);
        Dequeue(Q);
        Enqueue(Q,6);
        printf("Front element is %d\n",front(Q));
}


Related Tutorials :

Stacks 

 Last In First Out data structures ( LIFO ). Like a stack of cards from which you pick up the one on the top ( which is the last one to be placed on top of the stack ). Documentation of the various operations and the stages a stack passes through when elements are inserted or deleted. C program to help you get an idea of how a stack is implemented in code.

Queues 

 First in First Out data structure (FIFO). Like people waiting to buy tickets in a queue - the first one to stand in the queue, gets the ticket first and gets to leave the queue first. Documentation of the various operations and the stages a queue passes through as elements are inserted or deleted. C Program source code to help you get an idea of how a queue is implemented in code.




Testing Zone For Programmers- 

 

Try out our online Multiple-Choice-Question tests in Programming and Computer Science!


 

Photo-credits: www.istockphoto.com

 
 Quizzes on Basic Object Oriented Programming with C++   Quizzes on Java Programming
  
 Quizzes on C Programming- Arrays, Strings and Pointers
  1. C Programming MCQ Quiz #1:  Strings- 1
  2. C Programming MCQ Quiz #2: Strings (2)
  3. C Programming MCQ Quiz #3: Strings (3)
  4. C Programming MCQ Quiz #4: Arrays(1)
  5. C Programming MCQ Quiz #5: Arrays (2)
  6. C Programming MCQ Quiz #6: Arrays (3)
  7. C Programming MCQ Quiz #7: Pointers (1)
  8. C Programming MCQ Quiz #8: Pointers (2)
 Quizzes on Data Structures, Algorithms and Complexity
  1. MCQ Quiz #1: The Basics of Sorting Algorithms- Quadratic Sorts
  2. MCQ Quiz #2: Efficient Sorting Algorithms- Quick sort, Merge Sort, Heap Sort
  3. MCQ Quiz #3- The Radix Sort
  4. MCQ Quiz #4: Divide and Conquer Techniques- Binary Search, Quicksort, Merge sort, Complexities
  5. MCQ Quiz #5- Dynamic Programming
  6. MCQ Quiz #6- Complexity of Algorithms
  7. MCQ Quiz #7- Application of Master's Theorem
  8. MCQ Quiz #8: Binary Search Trees
  9. MCQ Quiz #9: B-Trees
  10. 10 MCQ Quiz #9: AVL-Trees
  11. 11 MCQ Quiz #10: Representing Graphs as Data Structures
  12. 12 MCQ Quiz #11: Spanning Trees
  13. 13 MCQ Quiz #12: Algorithms - Graphs: Spanning Trees - Kruskal and Prim Algorithms
  14. 14 MCQ Quiz #13: Algorithms - Graphs: Depth and Breadth First Search


Recommended books for learning Computer Science, learning high quality programming, and preparing for programming interviews:

These are the standard sources of the knowledge expected from candidates interviewing at Google, Microsoft, Facebook, Amazon and other startups and top-tier technology companies. The books by Cormen or Sedgewick (a standard part of the undergraduate curriculum) are sufficient for this part of the preparation. Google specially, loves to focus on algorithmic questions.


 1. A good knowledge of Data Structures, Algorithm Design and Analysis of Complexity
The books by Cormen or Sedgewick (a standard part of the undergraduate curriculum) are sufficient for this part of the preparation. Google specially, loves to focus on algorithmic questions.

Introduction to Algorithms 3r...
List Price: Rs.525
Our Price: Rs.357
Buy from FlipKart


   Introduction to Algorithms (CLRS) 



Algorithms 4th Edition
Our Price: Rs.599
Buy from FlipKart


 Algorithms (By Robert Sedgewick) 


An Introduction to the Analys...
List Price: Rs.550
Our Price: Rs.500
Buy from FlipKart


Analysis of Algorithms (By Robert Sedgewick) 

 
 2. Standard and established sources of Programming Interview Questions
A lot of interview questions are re-used and re-cycled by interviews again and again. Chances are, that question you're going to be asked, has been asked a hundred times during the last week, across a number of companies!
Google, Facebook, Microsoft, Amazon- all of them frequently ask questions on the lines of those in these books.

 
Cracking The Coding Interview...
List Price: Rs.2293
Our Price: Rs.2178
Buy from FlipKart

Cracking the Coding Interview: 150 Programming Questions and Solutions [Paperback] 

 
Programming Interviews Exposed
List Price: Rs.299
Our Price: Rs.284
Buy from FlipKart

Programming Interviews Exposed 
 
 
Ace the Programming Interview
Our Price: Rs.1733
Buy from FlipKart





 
Ace the Programming Interview 
 
 
Ace the IT Interview
Our Price: Rs.1300
Buy from FlipKart

 

Ace the IT Interview 

 3. Puzzles and Brainteasers (often asked, good to be prepared)
Questions from Mount Fuji are specially popular with Microsoft recruiters.

 
How Would You Move Mount Fuji?
List Price: Rs.860
Our Price: Rs.800
Buy from FlipKart


How would you move Mount Fuji? 
 
How to Ace the Brain Teaser Interview 

  
 4. Good Software Engineering practices. 
Writing clean and secure code, an awareness about Design Patterns and Object Oriented Programming techniques. Some of these books are frequently recommended by Microsoft recruiters. Take care of buffer overflows!
Code Complete is a recommended book for Microsoft Interviews.

Code Complete
List Price: Rs.629
Our Price: Rs.611
Buy from FlipKart
 

Code Complete 2 

Writing Secure Code 2nd Edition
Our Price: Rs.699
Buy from FlipKart

 Writing Secure Code

 
Design Patterns
List Price: Rs.499
Our Price: Rs.409
Buy from FlipKart

 

Design Patterns 

 
 In case your primary language is C++, make sure you know its "ins-and-outs". You should know about destructors and constructors, virtual destructors, polymorphism, function overloading. Some of these books might help you revise C++. 
The C++ Programming Language...
List Price: Rs.775
Our Price: Rs.736
Buy from FlipKart

The C++ Programming Language (Bjarne Stroustrup)

Beginning C++ Through Game Pr...
Our Price: Rs.2008
Buy from FlipKart

 Beginning C++ through Game Programming 

 
C++ How to Program
List Price: Rs.695
Our Price: Rs.632
Buy from FlipKart

 
C++: How to Program (Deitel and Deitel)
 
 In case your primary language is C, make sure to be well versed with pointers, system calls and how they work. How does Malloc work, how does calloc work? All of these are questions which some interviewers could potentially ask, to test the depth of your knowledge and your understanding of the system "under the hood". 
The C Programming Language
List Price: Rs.175
Our Price: Rs.137
Buy from FlipKart


The C Programming Language (Kernighan)
 
C How To Program 6th  Edition
List Price: Rs.650
Our Price: Rs.624
Buy from FlipKart


C How to Program (Deitel and Deitel)

  
Here's a great book for the Java lovers as well.
It normally doesn't matter which programming language you know, but make sure to know about it in detail.
Java
List Price: Rs.595
Our Price: Rs.541
Buy from FlipKart

 
Java: A Beginner's Guide (Herb Schildt) 
   

The gadget spec URL could not be found

 

 
INTRODUCTION TO ALGORITHMS 3ED
List Price: Rs.995
Our Price: Rs.800
Buy from FlipKart








 
Algorithm Design
List Price: Rs.785
Our Price: Rs.585
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.550
Our Price: Rs.450
Buy from FlipKart
 
The Art of Computer Programmi...
List Price: Rs.725
Our Price: Rs.625
Buy from FlipKart
 
Data Structures Through C In...
List Price: Rs.297
Our Price: Rs.240
Buy from FlipKart
 
DATA STRUCTURES USING C AND C...
List Price: Rs.425
Our Price: Rs.361
Buy from FlipKart
 
Data Structures Through C
List Price: Rs.248
Our Price: Rs.216
Buy from FlipKart
 
Data Structures
List Price: Rs.460
Our Price: Rs.430
Buy from FlipKart
 
Data Structures & Algorithms...
List Price: Rs.675
Our Price: Rs.520
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.599
Our Price: Rs.456
Buy from FlipKart
  
Java
Our Price: Rs.500
Buy from FlipKart

 
INTRODUCTION TO ALGORITHMS 3ED
List Price: Rs.995
Our Price: Rs.800
Buy from FlipKart








 
Algorithm Design
List Price: Rs.785
Our Price: Rs.585
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.550
Our Price: Rs.450
Buy from FlipKart
 
The Art of Computer Programmi...
List Price: Rs.725
Our Price: Rs.625
Buy from FlipKart
 
Data Structures Through C In...
List Price: Rs.297
Our Price: Rs.240
Buy from FlipKart
 
DATA STRUCTURES USING C AND C...
List Price: Rs.425
Our Price: Rs.361
Buy from FlipKart
 
Data Structures Through C
List Price: Rs.248
Our Price: Rs.216
Buy from FlipKart
 
Data Structures
List Price: Rs.460
Our Price: Rs.430
Buy from FlipKart
 
Data Structures & Algorithms...
List Price: Rs.675
Our Price: Rs.520
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.599
Our Price: Rs.456
Buy from FlipKart
  
Java
Our Price: Rs.500
Buy from FlipKart


 
INTRODUCTION TO ALGORITHMS 3ED
List Price: Rs.995
Our Price: Rs.800
Buy from FlipKart








 
Algorithm Design
List Price: Rs.785
Our Price: Rs.585
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.550
Our Price: Rs.450
Buy from FlipKart
 
The Art of Computer Programmi...
List Price: Rs.725
Our Price: Rs.625
Buy from FlipKart
 
Data Structures Through C In...
List Price: Rs.297
Our Price: Rs.240
Buy from FlipKart
 
DATA STRUCTURES USING C AND C...
List Price: Rs.425
Our Price: Rs.361
Buy from FlipKart
 
Data Structures Through C
List Price: Rs.248
Our Price: Rs.216
Buy from FlipKart
 
Data Structures
List Price: Rs.460
Our Price: Rs.430
Buy from FlipKart
 
Data Structures & Algorithms...
List Price: Rs.675
Our Price: Rs.520
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.599
Our Price: Rs.456
Buy from FlipKart
  
Java
Our Price: Rs.500
Buy from FlipKart


 
INTRODUCTION TO ALGORITHMS 3ED
List Price: Rs.995
Our Price: Rs.800
Buy from FlipKart








 
Algorithm Design
List Price: Rs.785
Our Price: Rs.585
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.550
Our Price: Rs.450
Buy from FlipKart
 
The Art of Computer Programmi...
List Price: Rs.725
Our Price: Rs.625
Buy from FlipKart
 
Data Structures Through C In...
List Price: Rs.297
Our Price: Rs.240
Buy from FlipKart
 
DATA STRUCTURES USING C AND C...
List Price: Rs.425
Our Price: Rs.361
Buy from FlipKart
 
Data Structures Through C
List Price: Rs.248
Our Price: Rs.216
Buy from FlipKart
 
Data Structures
List Price: Rs.460
Our Price: Rs.430
Buy from FlipKart
 
Data Structures & Algorithms...
List Price: Rs.675
Our Price: Rs.520
Buy from FlipKart
 
Data Structures and Algorithm...
List Price: Rs.599
Our Price: Rs.456
Buy from FlipKart
  
Java
Our Price: Rs.500
Buy from FlipKart