HH PDF

9/11/2019 Important Questions for Class 12 Computer Science (C++) - Linked List, Stack and Queue - Learn CBSE
HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9
Hi there! Click one of our representatives

CBSE SAMPLE PAPERS LAKHMIR SINGH below and we will get back to you as soon as
possible.
Learn CBSE
CBSE Class 12 Support only
IIT JEE Coaching in Kolkata

Top JEE Institute in Kolkata

Get upto 100% scholarship for JEE and NEET preparation. Register
today for VMC NAT 1.0
vidyamandir.com OPEN
Important Questions for Class 12 Computer

Science (C++) – Linked List, Stack and Queue Chat with us on WhatsApp
January 3, 2018 by Sastry CBSE
IIT JEE Coaching in Kolkata

Top JEE Institute in Kolkata
Get upto 100% scholarship for JEE and NEET preparation. Register
today for VMC NAT 1.0
vidyamandir.com OPEN
https://www.learncbse.in/important-questions-class-12-computer-science-c-linked-list-stack-queue/ 1/37
ImportantCLASSQuestions
6 7 8 9 for11Class
10 12 HOW
12 NOTES Computer
ON PC OR LAPTOP Science
TO PLAY PUBG MOBILE
(C++) – Linked List, Stack and Queue

Topic – 1
CBSE SAMPLE PAPERS Linked
LAKHMIR SINGH List and below
Stack
and we will get back to you as soon as
Previous years Examination Questions
possible.
2 Marks Questions
Question 1: CBSE Class 12 Support only
Convert the following in x expression to its equivalent post x expression, showing the stack contents for
each step of conversion: CBSE Class 11 Support only
P/(Q-R)*S + T All India 2016
Аnswer:
Chat with us on WhatsApp
Question 2:
each step of conversion.
A/(B + Q*D-E Delhi 2016
Аnswer:

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Tata Sky Special Offer

Ad CBSE
Hurry Now! Class 8 Support
Subscribe only
to Unlimited
Entertainment with Tata Sky @1499 Only
Tata Sky CBSE Class 7 Support only
Buy Now CBSE Class 6 Support only
Question 3:
P/(Q+(R-T)*U All India (C) 2016
Аnswer:

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.

Ad Hurry Now! Subscribe
CBSE to Unlimited
Class 6 Support only
Tata Sky
Buy Now
Question 4:
each step of conversion:
(U* V+ R/ (S-T)) All India 2015
Аnswer: HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Question 5:
(X/Y+U*(V-W)) Delhi 2015 CBSE Class 7 Support only
Аnswer:
CLASS 6 7 8 9 10 11 Tata Sky HOW

12 NOTES Special Offer
TO PLAY PUBG MOBILE
ON PC OR LAPTOP
Ad Hurry Now! Subscribe to Unlimited

NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11
Entertainment CLASS
with 10 Sky @1499
Tata CLASS 9Only
Tata Sky
Buypossible.
Now
Question 6:
CBSE
Evaluate the following post x expression. Show the. status of stack after Class 12 of
execution Support
each only
operation
separately:
F, T, NOT, AND, F, OR, T, AND Delhi 2014 CBSE Class 11 Support only
Аnswer:
Question 7:
Evaluate the following post x expression. Show the status of stack after execution of each operation
separately:
T, F, NOT, AND, T, OR, F, AND All India 2014

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.


Tata Sky
Buy Now
Question 8:
Evaluate the following post x expression: (show status of stack after each operation)
100,40,8,/,20,10,-,+,* All India (C) 2014

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.

Evaluate the following post x expression. Show the status of stack after execution of each operation:
5, 2, *, 50, 5, /, 5, -, + All India 2013 CBSE Class 9 Support only
Аnswer:
Question 10:
Evaluate the following post x expression. Show the status of stack after execution of each operation:
60, 6, /, 5, 2, *, 5, -, + Delhi 2013

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.


EntertainmentCBSE
withClass
Tata9 Sky @1499
Support only Only
Tata Sky
Buy Now
Question 11:
Evaluate the following post x expression using a stack and show the contents of stack after execution of
each operation: CBSE Class 6 Support only
5, 3, 2, *, 4, 2, /, -, * Delhi 2013C

Аnswer:
Question 12: HOW TO PLAY PUBG MOBILE

7
CLASS 6 8 9 10 11 12 NOTES ON PC OR LAPTOP
Evaluate the following post x notation. Show status of stack after every step of evaluation (i.e. after each
operator):
False, NOT, True, AND, True, False, OR, AND Delhi 2012
Аnswer: Hi there! Click one of our representatives
possible.
Question 13:
Evaluate the following post x notation. Show status of stack after every step of evaluation (i.e. after each
operator): Chat with us on WhatsApp
True, False, NOT, AND, False, True, OR, AND All India 2012

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Question 14:
Evaluate the following post x notation of expression: CBSE Class 7 Support only
50, 60, +, 20, 10, – ,* Delhi 2011

Аnswer: CBSE Class 6 Support only
Question 15:
Evaluate the following post x notation of expression:
True, False, NOT, AND, True, True, AND, OR All india 2011

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Question 16:
Evaluate the following post x notation of expression:
False, True, NOT, OR, True, False, AND, OR Delhi 2010
Аnswer:

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Question 17:
Evaluate the following post x notation of expression. Show the status of stack after each operation:
True, False, NOT, OR, False, True, OR, AND All India 2010

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Question 18:
Convert the following in x expression to its equivalent post x expression. Chat with us on WhatsApp
Showing stack contents for the conversion:

(X – Y/(Z+U)*V) Delhi 2009

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.

Question 19:
Convert the following in x expression to its equivalent post x expression.
Showing stack contents for the conversion:
(A + B* (C-D) IE) All India 2009
4 Marks Questions
Question 20:
Write the de nition of a member function PUSH( ) in C++, to add a new book in a dynamic stack of BOOKS
considering the following code is already included in the program: All India 2015
struct BOOKS HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
{
char ISBN[20], TITLE[80];
BOOKS *Link;
}; Hi there! Click one of our representatives
CBSESTACK
class SAMPLE PAPERS LAKHMIR SINGH below and we will get back to you as soon as
possible.
{
BOOKS *Top;
public:
STACK() {Top=NULL;}
void PUSH();
void POP();
∼STACK();
}; CBSE Class 10 Support only
Аnswer:
void STACK::PUSH()
{ CBSE Class 8 Support only
BOOKS *b = new BOOKS;

cout<<"Enter ISBN number"; CBSE Class 7 Support only
cin>>b->ISBN;
cout<<"Enter TITLE";
gets(b—>TITLE);
if(TOP == NULL)
{
TOP = b;
}
else
{
b->Link = TOP;
TOP = b;
}
}
Question 21:
Write the de nition of a member function Pop( ) in C++, to delete a book from a dynamic stack of
TEXTBOOKS considering the following code is already included in the program. Delhi 2015
struct TEXTBOOKS
{
char ISBN[20];
char TITLE[80]; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
TEXTBOOKS *Link;
};
class STACK
{ Hi there! Click one of our representatives
CBSE SAMPLE
TEXTBOOKS PAPERS
*Top; LAKHMIR SINGH below and we will get back to you as soon as
possible.
public:
STACK(){Top=NULL;}
void Push();
void Pop();
∼STACKC);
};
void STACK::Pop()
{
if(Top! = NULL)
TEXTBOOKS *Temp = Top;

Top = Top->Link; CBSE Class 7 Support only
delete Temp;
}
else
cout<<"Stack empty";
}
Question 22:
Write a function POPBOOK( ) in C++ to perform delete operation from a dynamic stack, which contains Bno
and Title. Consider the following de nition of NODE, while writing your C++ code. Delhi 2014
struct NODE
{
int Bno;
char Title[20];
NODE *Link;
};
Аnswer:
void P0PB00K(N0DE *top)

{
cout<<:Deleting the top element from stack\n";
cout<<"Book No:"<<top->Bno<<endl; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
cout<<"BookTitle:"<<top->Title<<endl;
NODE *temp = top;
top = top->Link;
delete(temp); Hi there! Click one of our representatives
} CBSE SAMPLE PAPERS LAKHMIR SINGH below and we will get back to you as soon as
possible.
Question 23:
Write a function PUSHBOOK( ) in C++ to perform insert operation on a dynamic stack, which contains
Book_no and Book_Title. Consider the following de nition of NODE, while writing your C++ code. All India
2014
struct NODE
char Book_No;
char Book_Title[20]:
NODE *Next:
};
Аnswer:

void PUSHBOOK(NODE *top)
{
NODE *NEW = new NODE;
cout<<"Enter the Book Number:";
cin>>NEW->Book_No;
cout<<"Enter the Book Title:";
gets(NEW->Book_Titie);
NEW->Next = NULL;
if(top == NULL)
top = NEW;
else
{
NEW->Next = top;
top = NEW;
}
}
Question 24:
Write a complete program in C++ to implement a dynamically allocated stack containing names of
Countries. Delhi 2010
Аnswer:
The program is: HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
#include<iostream.h>
#include<stdio.h>
struct Node
{ Hi there! Click one of our representatives
CBSE
char SAMPLE PAPERS
Country[30]; LAKHMIR SINGH below and we will get back to you as soon as
possible.
Node *Link;
};
class Stack
{
Node *Top;
public:
Stack(){Top = NULL;}
void Push(); CBSE Class 10 Support only
void Pop();
void Display(); CBSE Class 9 Support only
∼Stack();
};
void Stack :: Push()
{
Node *Temp = new Node;
gets(Temp->Country);
Temp->Link = Top; CBSE Class 6 Support only
Top = Temp;
}
void Stack :: Pop() Chat with us on WhatsApp
{
if(Top!=NULL)
{
Node *Temp = Top;
Top = Top->Link;
delete Temp;
}
else
cout<<"Stack empty";
}
void Stack :: Display()
{
Node *Temp = Top;
while(Temp!= NULL)
cout<<Temp->Country<<endl;
Temp = Temp->Link;
Stack :: ∼Stack() HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
{
while(Top!=NULL)
{
Node *Temp = Top; Hi there! Click one of our representatives
TopCBSE SAMPLE PAPERS
= Top->Link; LAKHMIR SINGH below and we will get back to you as soon as
possible.
delete Temp;
}
}
void main()
{
Stack ST;
char ch;
do CBSE Class 10 Support only
{
cout<<"Choose any one P/O/D/Q"; /* displaying choices P CBSE
- Push,0
Class 9 -Support
Pop, only
D-Display, Q-
Exit */
cin>>ch;
switch(ch)
{
case 'P':ST.Push();
break;
case '0':ST.Pop(); CBSE Class 6 Support only
break;
case 'D':ST.Display();
} Chat with us on WhatsApp
}
while(ch!='Q');
}
Topic – 2
Queue
Previous years Examination Questions
4 Marks Questions
Question 1:
Write the de nition of a member function DELETE( ) for a class QUEUE in C++, to remove a product from a
dynamically allocated Queue of products considering the following code is already written as a part of the
program. All India 2016
struct PRODUCT
{
int PID; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
char PNAME[20];
PRODUCT *Next;
};
class QUEUE Hi there! Click one of our representatives
{ CBSE SAMPLE PAPERS LAKHMIR SINGH below and we will get back to you as soon as
possible.
PRODUCT *R,*F;
public:
QUEUE(){R=NULL;F=NULL;}
void INSERT();
void DELETE();
∼QUEUE();
};
Аnswer:

void QUEUE :: DELETE()
{
if(F!=NULL) CBSE Class 8 Support only
{
PRODUCT *Temp=F; CBSE Class 7 Support only
cout<<F->data<<"deleted\n";
F=F->Next;
delete Temp;
if(F==NULL)
R=NULL;
}
else
cout<<"\n Queue is Empty":
}
Question 2:
Write the de nition of a member function INSERT( ) for a class QUEUE in C++, to insert an ITEM in a
dynamically allocated Queue of items considering the following code is already written as a part of the
program. Delhi 2016
struct ITEM
{
int INO;
char INAME[20];
ITEM *Link;
};
class QUEUE HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
{
ITEM *R, *F;
public:
QUEUE() {R=NULL; F=NULL;} Hi there! Click one of our representatives
CBSE
void SAMPLE PAPERS
INSERT(); LAKHMIR SINGH below and we will get back to you as soon as
possible.
void DELETE();
∼QUEUE();
};
Аnswer:
void QUEUE :: INSERT!)

ITEM *temp=new ITEM;
cout<<"\n Enter Item no & Item name:";
cin>>temp->INO;
gets(temp->IName);
temp->Next = Null; CBSE Class 8 Support only
if(R==Null)
R = temp;
F = temp;
}
else
{
R->Next = temp;
R = temp;
}
}
Question 3:
Write the de nition of a member function INSERT! ) in C++, to add a new passenger detail in a dynamic
queue of PASSENGERS considering the following code is already existing in the program. All India 2015
struct PASSENGERS
{
char PID[20]; NAME[80];
PASSENGERS *Next;
};
class QUEUE
{
PASSENGERS *Rear, *Front; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
public:
QUEUE() {Rear=NULL; Front=NULL}
void INSERT();
void DELETE(); Hi there! Click one of our representatives
CBSE SAMPLE PAPERS
∼QUEUE(); LAKHMIR SINGH below and we will get back to you as soon as
possible.
};
Аnswer:
void QUEUE ::INSERT()

PASSENGERS * P = new PASSENGERS;

cout<<"Enter PID"; CBSE Class 10 Support only
cin>>P->PID;
cout<<"Enter Name”;
gets(p->Name);
P->Next = NULL;
if(Rear == NULL) CBSE Class 8 Support only
{
Front = Rear = P; CBSE Class 7 Support only
}
else
{
Rear->Next = P;
Rear = P;
}
}
Question 4:
Write a function QDELETE( ) in C++ to perform delete operation in a Linked Queue, which contains
Passenger number and Passenger name. Consider the following de nition of node in the code. All India
2013
struct node
{
long int Pno;
char Pname[20];
node *Link;
};
Аnswer:
void QDELETE() HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
{
if(Front == NULL)
{
cout<<"Queue is empty"; Hi there! Click one of our representatives
CBSE SAMPLE PAPERS
exit(0); LAKHMIR SINGH below and we will get back to you as soon as
possible.
}
else
{
node *temp = front;
cout<<"Passenger Information";
cout<<Front->Pno;
cout<<Front->Pname;
Front=Front->Link; CBSE Class 10 Support only
delete temp;
} CBSE Class 9 Support only
}
Write a function QINSERT( ) in C++ to perform insert operation on a linked queue, which contains client
number and client name. Consider the following de nition of NODE in the
CBSEcode of7QINSERT
Class ( ). Delhi 2013
Support only
struct NODE
{
long int Cno; //Client number
char Cname[20]; //Client name
NODE *Next;
};
Аnswer:
void QINSERT()
{
NODE *P = new Node;
cout<<"Enter the Client Number and Name:";
cin>>P- Cno;
gets(P->Cname) ;
P->Next=NULL;
if((front ~ NULL)&&(rear == NULL))
{
front=rear=P;
}
else HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
{
rear->Next = P;
rear = P;
} Hi there! Click one of our representatives
possible.
Question 6:
Given the necessary declaration of linked implemented Queue containing players information (as de ned in
the following de nition of Node). Also, write a user de ned function in C++ to delete one Player’s
information from the Queue.
Delhi 2013C CBSE Class 11 Support only
struct Node CBSE Class 10 Support only

{
int PlayerNo;
char PIayerName[20];
Node *Link;
}; CBSE Class 8 Support only
Аnswer:
void Delete_NODE()
{
NODE *P;
if(front == Null)
cout<<”Queue is empty";
else if(front == rear)
{
P = front;
cout<<"Deleted Node information is";
cout<<P->PlayerNo;
puts(p->PlayerName);
front = rear = NULL;
delete P;
}
else
{
P = front;
cout<<"Deleted Node information is";
cout<<P->PlayerNo;
puts(P->PlayerName);
front = front->Link; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
delete P;
}
}

Question 7:
Write a function in C++ to perform insert operation in a dynamic queue containing DVD’s information
possible.
(represented with the help of an array of structure DVD). Delhi 2012

struct DVD
{
long No; CBSE Class 11 Support only
char title[20];
DVD *Link; CBSE Class 10 Support only
};
void Insert() CBSE Class 8 Support only

{
DVD *p = new DVD;
cout<<"Enter the DVD number and Title";
cin<<p->No;
gets(p->title);
p->Link = NULL;
if((front — NULL) && (rear == NULL))
{
front - rear = p;
}
else
{
rear->Link = p;
rear = p;
}
}
Question 8:
Write a function in C++ to perform insert operation in a static circular queue containing book’s information
(represented with the help of an array of structure BOOK). All India 2012
struct BOOK
{
long AccNo; //Book account number
char Title[20]; //Book Title HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
};
NCERT SOLUTIONS
Аnswer: RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9

void circularQueInsert(BOOK
CBSE SAMPLE PAPERS B[],SINGH
LAKHMIR int Front, int Rear, int Max)
below and we will get back to you as soon as
{ possible.
if((Rear=Max-l && Front ==0)||(Front == Rear +1))
{
cout<<"Circular Queue is full";
exit(O);
else if(Front == -1 && Rear == -1)

Front = Rear = 0;
}
else if(Rear = Max -1 && Front >0)
{
Rear = 0; CBSE Class 8 Support only
}
else CBSE Class 7 Support only
Rear = Rear+1;
cout<<"Enter book account number and title";
cin>>B[Rear].AccNo;
gets(B[Rear].Title);
}
Question 9:
Write a function in C++ to perform insert operation on a dynamically allocated queue containing passenger
details as given in the following de nition of NODE; Delhi 2011
struct NODE
{
long Pno; //Passenger Number
char Pname[20]; //Passenger Name
NODE *Link;
};
Аnswer:
void Enter()
{
NODE *nptr=new NODE;
nptr->Link = NULL; HOW TO PLAY PUBG MOBILE

7 8
CLASS 69 10 11 12 NOTES ON PC OR LAPTOP
cout<<"Enter name and number for new passenger";
gets(nptr->Pname);
cin>>nptr->Pno;
if(rear == NULL) Hi there! Click one of our representatives
{ CBSE SAMPLE PAPERS LAKHMIR SINGH below and we will get back to you as soon as
possible.
front = rear = nptr;
}
else
{
rear->Link = nptr;
rear = nptr;
}
Question 10:
Write a function in C++ to perform delete operation on a dynamically allocated queue containing passenger
details as given in the following de nition of NODE: All India 2011
struct NODE
long Mno; //Member Number
char Mname[20]; //Member Name
NODE *Link;
};

Аnswer:
void remove(NODE *front)

{
NODE *nptr;
if(front == NULL)
{
cout<<"Queue is empty";
}
else
{
nptr = front;
front = front->Link;
if(front == NULL)
rear = NULL;
delete nptr; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
}
NCERT 11:
Question SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9
Write a complete program in C++ to implement a dynamically allocated queue containing names of cities.
All CBSE
India SAMPLE
2010 PAPERS LAKHMIR SINGH below and we will get back to you as soon as
Аnswer: possible.
#include<iostream.h>
#include<string.h>
struct Node
char city[30];
Node *link; CBSE Class 10 Support only
};
class queue
{
Node *front, *rear;
public: CBSE Class 8 Support only
queue() {front=rear=NULL;}
void add_Q(); //add queue CBSE Class 7 Support only
void del_Q(); //delete queue
void show_Q(); //show queue
};
void queue :: add_Q()
{
Node *temp = new Node;
char ct[30];
cout<<"Enter city";
gets(ct);
strcpy(temp->city,ct);
temp->link = NULL;
if(rear == NULL)
front = rear = temp;
else
{
rear->link = temp;
rear = temp;
}
}
void queue :: del_Q()
{
Node *temp; CLASS 6 HOW TO PLAY PUBG MOBILE

7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
char ct[20];
if(front == NULL)
{
cout<<”queue is empty"; Hi there! Click one of our representatives
possible.
else
{
temp = front; CBSE Class 12 Support only
front = front->link;
strcpy(ct, temp->city);
cout<<"Deleted values are"<<ct;
delete temp;
if(front == NULL)
rear = front; CBSE Class 9 Support only
}
void queue :: show_Q()
{
Node *temp = front;
cout<<"The queue elements are";
while(temp!=NULL)
cout<<"\n"<<temp->city;
temp = temp->l ink;
}
void main()
{
int choice;
queue QUEUE;
char opt='Y';
do
{
cout<<"\nMain Menu";
cout<<"\nl.Insertion in queue";
cout<<"\n2.Deletion from queue";
cout<<"\n3.Traversal of queue";
cout<<"\n4.Exit from queue";
cout<<"\nEnter your choice from above(1,2,3,4)";
cin<<choice;
switch(choice)
{ HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
case 1:
do
{
QUEUE.add_Q(); Hi there! Click one of our representatives
CBSE SAMPLE
cout<<"\ndo PAPERS
you want to LAKHMIR
add moreSINGH
elements<Y/N>?";below and we will get back to you as soon as
possible.
cin>>opt;
}
while(toupper(opt)=='Y'); CBSE Class 12 Support only
break;
case 2:
do
{
QUEUE.del_Q(); CBSE Class 10 Support only
cout<<"\ndo you want to delete more elements<Y/N>?";

cin>>opt; CBSE Class 9 Support only
}
whi1e(toupper(opt)== 'Y');
break;
case 3:
QUEUE.show_Q();
break;
case 4; CBSE Class 6 Support only
exit(0);
}
while(choice!=4);
}
Question 12:
Write a function QUEINS( ) in C++ to insert an element in a dynamically allocated queue containing nodes of
the following given structure: Delhi 2009
struct Node
{
int Pid; //Product Id
char Pname[20]; //Product Name
Node *Next;
};
Аnswer:
void QUEINS(Node *rear, int val, char valid) HOW TO PLAY PUBG MOBILE
CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
{
Node *temp=new Node;
temp->Pid = val;
strcpy(temp->Pname,val1); Hi there! Click one of our representatives
CBSE SAMPLE
temp->Next PAPERS
= NULL; LAKHMIR SINGH below and we will get back to you as soon as
possible.
if(rear == NULL)
rear = front = temp;
else CBSE Class 12 Support only
{
rear->Next = temp;
rear = temp;
}
Question 13:
Write a function QUEDEL( ) in C++ to display and delete an element in a dynamically allocated queue
containing nodes of the following given structure: All India 2009
struct Node
int Itemno;
char Itemname[30]; CBSE Class 6 Support only
Node *Link;
};

Аnswer:
void QUEDEL(Node *front)

{
Node *temp;
if(front == NULL)
cout<<"Queue is Empty";
else
{
temp = front;
cout<<"deleted item=";
cout<<front->Itemno;
cout<<front->Itemname;
front = front->Link;
if(front == NULL)
rear = NULL;
delete temp; HOW TO PLAY PUBG MOBILE

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
}
}
Computer Science Important Questions for Computer Science NCERT Solutions

possible.
Filed Under: CBSE

NCERT Solutions for Class 10 Chapte…

Chapte… CBSE Class 6 Support only
Search the site ...

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
Class 12 Maths NCERT Solutions

Class 11 Maths NCERT Solutions
NCERT Solutions for Class 10 Maths




NCERT Solutions for Class 6 Science

NCERT Solutions for Class 11 Physics
NCERT Solutions for Class 11 Chemistry
NCERT Solutions for Class 12 Physics
NCERT Solutions for Class 12 Chemistry

CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP

possible.
NCERT Solutions for Class 10 Science Chapter 1

CBSE ClassClass
Metals and Nonmetals 9 Support
10 only
carbon and its compounds class 10

Periodic Classi cation of Elements Class 10
CBSE 10
Life Process Class Class 7 Support only


FREE RESOURCES NCERT SOLUTIONS
RD Sharma Class 12 RD Sharma Class 11 NCERT Solutions

HOW TO forPLAY
ClassPUBG
10 MOBILE
CLASS 6 7 8 9 10 11 12 NOTES
ON PC OR LAPTOP
Solutions
NCERT Solutions for Class 9
RD Sharma Class 10 RD Sharma Class 9
RD Sharma Class 8 RD Sharma Class 7
possible.
CBSE Previous Year CBSE Previous Year
Question Papers Class 12 Question Papers Class 10
NCERT Solutions for Class

CBSE Class 4
11 Support only


QUICK RESOURCES
English Grammar Hindi Grammar
Textbook Solutions Maths NCERT Solutions
Science NCERT Social Science NCERT
Solutions Solutions
English Solutions Hindi NCERT Solutions
NCERT Exemplar Engineering Entrance Exams
Problems

CLASS 6 7 8 9 10 11 12LikeNOTES
us on Facebook Follow us on Twitter
ON PC OR LAPTOP
NCERT SOLUTIONS RD SHARMA CLASS 12 Watch

CLASSYoutube
11 Videos NCERT Solutions
CLASS 10 CLASS 9 App

possible.

HH PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

HH PDF

Uploaded by

Copyright:

Available Formats

9/11/2019 Important Questions for Class 12 Computer Science (C++) - Linked List, Stack and Queue - Learn CBSE

HOW TO PLAY PUBG MOBILE

NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9

Hi there! Click one of our representatives

IIT JEE Coaching in Kolkata

Top JEE Institute in Kolkata

CBSE Class 7 Support only

CBSE Class 6 Support only

Important Questions for Class 12 Computer

January 3, 2018 by Sastry CBSE

IIT JEE Coaching in Kolkata

(C++) – Linked List, Stack and Queue

CBSE Class 9 Support only

CBSE Class 8 Support only

CBSE Class 7 Support only

CBSE Class 6 Support only

Chat with us on WhatsApp

HOW TO PLAY PUBG MOBILE

NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9

Hi there! Click one of our representatives

CBSE Class 12 Support only

CBSE Class 11 Support only

CBSE Class 10 Support only

CBSE Class 9 Support only

Tata Sky Special Offer

Buy Now CBSE Class 6 Support only

HOW TO PLAY PUBG MOBILE

NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9

Hi there! Click one of our representatives

CBSE Class 12 Support only

CBSE Class 11 Support only

CBSE Class 10 Support only

CBSE Class 9 Support only

CBSE Class 8 Support only

CBSE Class 7 Support only

Аnswer: HOW TO PLAY PUBG MOBILE

NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9

Hi there! Click one of our representatives

CBSE Class 12 Support only

CBSE Class 11 Support only

CBSE Class 10 Support only

CBSE Class 9 Support only

Chat with us on WhatsApp

CLASS 6 7 8 9 10 11 Tata Sky HOW

Ad Hurry Now! Subscribe to Unlimited

CBSE Class 10 Support only

CBSE Class 9 Support only

CBSE Class 8 Support only

CBSE Class 7 Support only

CBSE Class 6 Support only

Chat with us on WhatsApp

Аnswer: HOW TO PLAY PUBG MOBILE

NCERT SOLUTIONS RD SHARMA CLASS 12 CLASS 11 CLASS 10 CLASS 9

Hi there! Click one of our representatives

CBSE Class 12 Support only

CBSE Class 11 Support only

CBSE Class 10 Support only

CBSE Class 9 Support only

CBSE Class 8 Support only

CBSE Class 7 Support only

Tata Sky Special Offer

Ad Hurry Now! Subscribe to Unlimited

Аnswer: HOW TO PLAY PUBG MOBILE

5, 3, 2, , 4, 2, /, -, Delhi 2013C