Chapter 18, Problem 10PC

Program Plan Intro

File Filter

Program Plan:

Main.cpp:

• Include required header files.
• Inside “main ()” function,
  • Create an object “file1” for input file stream.
  • Create an object “ofile” for output file stream.
  • Declare a class template
  • Declare character variables named “popChar”, and “ch”.
  • Till the end of file,
    • Convert each character and Enqueue the character using the function “enqueue ()”.
  • Close “file1”.
  • Until the stack gets empty,
    • Pop the character stack and write it on output file “ofile” using the function “dequeue ()”.
  • Close the output file“ofile”.
  • Open the output file “ofile”.
  • Till the end of file,
    • Get a character from queue and print it on the console screen.

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”.
    • Declare a variable.
  • 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.