Stack:#ifndef STACKTYPE_H_INCLUDED #define STACKTYPE_H_INCLUDED const int MAX_ITEMS = 5; class FullStack // Exception class thrown // by Push when stack is full. {}; class EmptyStack // Exception class thrown // by Pop and Top when stack is emtpy. {}; template class StackType { public: StackType(); bool IsFull(); bool IsEmpty(); void Push(ItemType); void Pop(); ItemType Top(); private: int top; ItemType items[MAX_ITEMS]; }; #endif // STACKTYPE_H_INCLUDED Queue:#ifndef QUETYPE_H_INCLUDED #define QUETYPE_H_INCLUDED template class QueType { public: QueType(); QueType(int); ~QueType(); void MakeEmpty(); bool IsEmpty(); bool IsFull(); void Enqueue(T); void Dequeue(T&); T Front(); private: int front; int rear; T *info; int maxQue; }; #endif // QUETYPE_H_INCLUDED

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Stack:#ifndef STACKTYPE_H_INCLUDED
#define STACKTYPE_H_INCLUDED
const int MAX_ITEMS = 5;
class FullStack
// Exception class thrown
// by Push when stack is full.
{};
class EmptyStack
// Exception class thrown
// by Pop and Top when stack is emtpy.
{};
template <class ItemType>
class StackType
{
public:
StackType();
bool IsFull();
bool IsEmpty();
void Push(ItemType);
void Pop();
ItemType Top();
private:
int top;
ItemType items[MAX_ITEMS];
};
#endif // STACKTYPE_H_INCLUDED

Queue:#ifndef QUETYPE_H_INCLUDED
#define QUETYPE_H_INCLUDED
template<class T>
class QueType
{
public:
QueType();
QueType(int);
~QueType();
void MakeEmpty();
bool IsEmpty();
bool IsFull();
void Enqueue(T);
void Dequeue(T&);
T Front();
private:
int front;
int rear;
T *info;
int maxQue;
};
#endif // QUETYPE_H_INCLUDED

2. Implement a stack using queue.
That means you have to implement Push and Pop function using queue. This
implementation will be in the driver file. You cannot change the Queue structure.
To verify that your Push and Pop functions are working correctly. Push some value in the
structure and print these values. Then, Pop some items and print rest of those items.
Transcribed Image Text:2. Implement a stack using queue. That means you have to implement Push and Pop function using queue. This implementation will be in the driver file. You cannot change the Queue structure. To verify that your Push and Pop functions are working correctly. Push some value in the structure and print these values. Then, Pop some items and print rest of those items.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY