Starting Out with C++ from Control Structures to Objects (9th Edition)
Starting Out with C++ from Control Structures to Objects (9th Edition)
9th Edition
ISBN: 9780134498379
Author: Tony Gaddis
Publisher: PEARSON
Question
Book Icon
Chapter 19, Problem 13PC
Program Plan Intro

Inventory Bin Queue

Program Plan:

InventoryItem.h:

  • Include required header files
  • Declare a class named “InventoryItem”. Inside the class,
    • Inside “private” access specifier,
      • Declare variables “serialNum”, “manufactDate”, and “lotNum”.
    • Inside “public” access specifier,
      • Give definition for default constructor.
      • Give definition for overloaded constructor.
      • Give mutator function “set_SerialNum ()” to set serial number.
      • Give mutator function “set_ManufactDate ()” to set date.
      • Give mutator function “set_LotNum ()” to set lot number.
      • Give accessor function “get_SerialNum ()” that returns serial number.
      • Give accessor function “get_ManufactDate ()” that returns date.
      • Give accessor function “get_LotNum ()” that returns lot number.

Dynqueue.h:

  • Include required header files.
  • Create template class
  • Declare a class named “Dynqueue”. Inside the class,
    • Inside the “private” access specifier,
      • Create a structure named “QueueNode”.
        • Create an object for the template
        • Create a pointer named “next”.
      • Create two pointers named “front” and “rear”.
    • Inside “public” access specifier,
      • Declare constructor and destructor.
      • Declare the functions “enqueue ()”, “dequeue ()”, “isEmpty ()”, “isFull ()”, and “clear ()”.
  • Declare template class.
  • Give definition for the constructor.
    • Assign the values.
  • Declare template class.
  • Give definition for the destructor.
    • Call the function “clear ()”.
  • Declare template class.
  • Give function definition for “enqueue ()”.
    • Make the pointer “newNode” as null.
    • Assign “num” to newNode->value.
    • Make newNode->next as null.
    • Check whether the queue is empty using “isEmpty ()” function.
      • If the condition is true then, assign newNode to “front” and “rear”.
      • If the condition is not true then,
        • Assign newNode to rear->next
        • Assign newNode to “rear”.
      • Increment the variable “numItems”.
  • Declare template class.
  • Give function definition for “dequeue ()”.
    • Assign temp pointer as null.
    • Check if the queue is empty using “isEmpty()” function.
      • If the condition is true then print “The queue is empty”.
      • If the condition is not true then,
        • Assign the value of front to the variable “num”.
        • Make front->next as “temp”.
        • Delete the front value
        • Make temp as front.
        • Decrement the variable “numItems”.
  • Declare template class.
  • Give function definition for “isEmpty ()”.
    • Assign “true” to a Boolean variable
    • Check if “numItems” is true.
      • If the condition is true then assign “false” to the variable.
    • Return the Boolean variable.
  • Declare template class.
  • Give function definition for “clear ()”.
    • Create an object for template.
      • Dequeue values from queue till the queue becomes empty using “while” condition.

Main.cpp:

  • Include required header files
  • Inside “main ()” function,
    • Create a template for queue.
    • Create an object for the class
    • Declare variables “choice”, “serial”, and “mDate”.
    • Print the menu to the user till the user enters corresponding menu number using “while” condition.
    • Switch to case.
      • Case1:
        • Get the serial number and manufacturing date from the user.
        • Push the object into the queue using the function “enqueue ()”.
      • Case 2:
        • Check if the queue is empty using “isEmpty ()” function.
        • If the queue is not empty,
          • Dequeue an element which is inserted first.
          • Print the serial number and date that has been removed.
      • Case 3:
        • Exit

Blurred answer
Students have asked these similar questions
C++ ProgrammingActivity: Queue Linked List Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow.   #include "queue.h" #include "linkedlist.h" class SLLQueue : public Queue {     LinkedList* list;      public:     SLLQueue() {             list = new LinkedList();     }     void enqueue(int e) {         list->addTail(e);         return;     }     int dequeue() {         int elem;         elem = list->removeHead();         return elem;     }     int first() {         int elem;         elem = list->get(1);         return elem;;     }     int size() {         return list->size();     }     bool isEmpty() {         return list->isEmpty();     }     int collect(int max) {         int sum = 0;         while(first() != 0) {             if(sum + first() <= max) {                 sum += first();                 dequeue();             } else {…
C++ Data Structures Write a program to implement two queues using doubly linked lists. User will enqueue values on first queue,when an element is dequeued from first queue it should automatically enqueue to second queue. From secondqueue user will dequeue this element explicitly.
C++ ProgrammingActivity: Queue Linked List   Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow.   SEE ATTACHED PHOTO FOR THE PROBLEM    #include "queue.h" #include "linkedlist.h" class SLLQueue : public Queue {     LinkedList* list;        public:     SLLQueue() {             list = new LinkedList();     }       void enqueue(int e) {         list->addTail(e);         return;     }       int dequeue() {         int elem;         elem = list->removeHead();         return elem;     }       int first() {         int elem;         elem = list->get(1);         return elem;;     }       int size() {         return list->size();     }       bool isEmpty() {         return list->isEmpty();     }       int collect(int max) {         int sum = 0;         while(first() != 0) {             if(sum + first() <= max) {                 sum += first();…

Chapter 19 Solutions

Starting Out with C++ from Control Structures to Objects (9th Edition)

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning