Implement Queue using array Python

PROGRAM TO IMPLEMENT QUEUE USING ARRAY



class Queue:
  
    # To initialize the object.
    def __init__(self, c):
          
        self.queue = []
        self.front = self.rear = 0
        self.capacity = c
  
    # Function to insert an element
    # at the rear of the queue
    def queueEnqueue(self, data):
  
        # Check queue is full or not
        if(self.capacity == self.rear):
            print("\nQueue is full")
  
        # Insert element at the rear
        else:
            self.queue.append(data)
            self.rear += 1
  
    # Function to delete an element
    # from the front of the queue
    def queueDequeue(self):
  
        # If queue is empty
        if(self.front == self.rear):
            print("Queue is empty")
  
        # Pop the front element from list
        else:
            x = self.queue.pop(0)
            self.rear -= 1
  
    # Function to print queue elements
    def queueDisplay(self):
          
        if(self.front == self.rear):
            print("\nQueue is Empty")
  
        # Traverse front to rear to
        # print elements
        for i in self.queue:
            print(i, "<--", end = '')
      
    # Print front of queue
    def queueFront(self):
          
        if(self.front == self.rear):
            print("\nQueue is Empty")
  
        print("\nFront Element is:", 
              self.queue[self.front])
  
# Driver code
if __name__=='__main__':
  
    # Create a new queue of
    # capacity 4
    q = Queue(4)
  
    # Print queue elements
    q.queueDisplay()
  
    # Inserting elements in the queue
    q.queueEnqueue(20)
    q.queueEnqueue(30)
    q.queueEnqueue(40)
    q.queueEnqueue(50)
  
    # Print queue elements
    q.queueDisplay()
  
    # Insert element in queue
    q.queueEnqueue(60)
  
    # Print queue elements
    q.queueDisplay()
  
    q.queueDequeue()
    q.queueDequeue()
    print("\n\nafter two node deletion\n")
  
    # Print queue elements
    q.queueDisplay()
  
    # Print front of queue
    q.queueFront()


OUTPUT:
Queue is Empty
 20 <--  30 <--  40 <--  50 <-- 
Queue is full
 20 <--  30 <--  40 <--  50 <-- 

after two node deletion

 40 <--  50 <-- 
Front Element is: 40

Comments

Post a Comment

Popular posts from this blog

Solve the Sudoku Python

PROGRAM TO SOLVE SUDOKU # A Utility Function to print the Grid def print_grid(arr):      for i in range ( 9 ):          for j in range ( 9 ):              print arr[i][j],          print ( 'n' )              # Function to Find the entry in # the Grid that is still  not used # Searches the grid to find an # entry that is still unassigned. If # found, the reference parameters # row, col will be set the location # that is unassigned, and true is # returned. If no unassigned entries # remains, false is returned. # 'l' is a list  variable that has # been passed from the solve_sudoku function # to keep track of incrementation # of Rows and Columns def find_empty_location(arr, l):      for row in range ( 9 ):       ...
Read more

Solve the Sudoku Java

PROGRAM TO SOLVE SUDOKU class GFG {      public static boolean isSafe( int [][] board,                                   int row, int col,                                   int num)      {          // Row has the unique (row-clash)          for ( int d = 0 ; d < board.length; d++)          {                             // Check if the number we are trying to   ...
Read more

Find Duplicates Java

PROGRAM TO FIND REPEATING NUMBERS IN AN ARRAY class MAIN {           public static void main(String args[]) {          int numRay[] = { 0 , 4 , 3 , 2 , 7 , 8 , 2 , 3 , 1 };               for ( int i = 0 ; i < numRay.length; i++) {              numRay[numRay[i] %  numRay.length] = numRay[numRay[i] %  numRay.length] + numRay.length;          }          System.out.println( "The repeating elements are : " );          for ( int i = 0 ; i < numRay.length; i++) {              if (numRay[i] >= numRay.length* 2 ) {                ...
Read more