This document provides information on queues and examples of functions to implement insertion and deletion in queues. It defines queues as a linked list with FIFO restrictions. Sample structures for a student queue and book queue are given. Functions QINSERT() and QDELETE() are demonstrated to perform insertion and deletion in queues. Key points like checking for underflow, taking user input, and displaying deleted node information are highlighted. Practice questions are provided to write QINSERT() and QDELETE() functions for a book queue.

2. GET 100% MARKS IN
COMPUTER SCIENCE
STACK FUNCTION WRITING
EXAM POINT OF VIEW
EXAM WEIGHTAGE-3/4MARKS

3. QUEUE INTRODUCTION
• QUEUE IS AN APPLICATION OF LINKED
LIST.
• QUEUE IS A LINK LIST WITH SOME
RESTRICTION ON INSERTION AND
DELETION.
• QUEUE FOLLOWS FIFO
ARCHITECTURE
• (FIFO) FIRST IN FIRST OUT (ELEMENT
WHICH IS INSERTED AT FIRST WILL BE
DELETED FIRST FROM QUEUE)
• INSERTION AND DELETION WILL TAKE
PLACE FROM THE DIFFERENT ENDS.

4. QUEUE TERMINOLOGIES
*front/*f = a pointer named front/f which is used to point the first
element of queue
*rear/*r=a pointer named rear/r which is used to point the last element of
queue
QINSERT() = Insertion function of queue
QDELETE()= Deletion function of queue

5. WRITE QINSERT() FUNCTION OF
QUEUE
Q.) WRITE A FUNCTION QINSERT() TO PERFORM INSERTION IN A
DYNAMIC QUEUE. CONSIDERING THE FOLLOWING STACK
struct QUEUE
{
int stu_no;
char stu_name[20];
float perc;
QUEUE *next;
} *front=NULL,*rear=NULL;
EXAM QUESTION TYPE 1

6. SOLUTION
void QINSERT()
{
QUEUE *temp=new QUEUE;
cout<<"Enter Details of new studentnn";
cout<<"Enter Student No.t:t";
cin>>temp->stu_no;
cout<<"Enter Student Namet:t";
gets(temp->stu_name);
cout<<"Enter Percentage";
cin>>temp->perc;
temp->next=NULL;
if(front ==NULL&&rear==NULL)
{
front=rear =temp;
}
else
{
rear->next=temp;
rear=temp;
}
}

7. WRITE QDELETE() FUNCTION OF STACK
Q.) WRITE A FUNCTION QDELETE() TO PERFORM DELETION IN A
DYNAMIC QUEUE. CONSIDERING THE FOLLOWING STACK
struct QUEUE
{
int stu_no;
char stu_name[20];
float perc;
Stack *next;
} *front=NULL,*rear=NULL;
EXAM QUESTION TYPE
2

8. SOLUTION
void QDELETE()
{
if(front ==NULL&& rear==NULL)
{
cout<<"Underflow !!!n";
}
else
{
QUEUE *temp = front;
cout<<“Deleted Node Infon”;
cout<<"Student No.t:t“<<temp->stu_no;
cout<<“Student Namet:t<<temp->stu_name;
cout<<"Enter Percentage“<<temp->perc;
if(front==rear)
{
front=rear=NULL;
}
else
{
front=front->next;
}
delete temp;
}
}

9. THINGS TO REMEMBER
1.) CHECK UNDERFLOW BEFORE DELETION .
2.) TAKE INPUT OF ALL ELEMENTS OF NODE WHILE INSERTION BY USER.
3.) DISPLAY ALL ELEMENT/INFORMATION OF DELETING NODE INFO
BEFORE DELETION.
4.) CHECK THE NAME OF POINTER LINK/NEXT AND USE THE SAME IN
YOUR SOLUTION.
5.) NAME OF QUEUE(STRUCTURE) FOR CREATING NEW NODE.

10. QUESTION FOR PRACTICE
Q.1) Write function QINSERT() in C++ to insert a book information in a dynamically
allocated QUEUE of books. Considering the following Structure book.
struct book
{
int bookid;
char bookname[20];
book *next;
};

11. QUESTION FOR PRACTICE
Q.2) Write function QDELETE() in C++ to perform deletion of a book information in
a dynamically allocated QUEUE of books. Considering the following Structure book.
struct book
{
int bookid;
char bookname[20];
book *next;
};

12. •SOLVE THE PRACTICE QUESTION AND
PASTE THE ANSWER AS COMMENT IN
COMMENT BOX.

13. THANKS FOR WATCHING MY VIDEO
EMAIL : theaakashkumar@gmail.com