Chapter 18, Problem 11PC

Program Plan Intro

File Compare

Program Plan:

Main.cpp:

• Include required header files
• Inside “main ()” function,
  • Create an object “ifile” for input file stream
  • Create an object “ofile” for output file stream.
  • Create two class templates “q1” and “q2” to hold characters
  • Declare variables “char1” and “char2”
  • Till the end of file,
    • Enqueue a character from file1.
  • Till the end of file,
    • Enqueue a character from file2.
  • Close both the files.
  • Assign “true” to a Boolean variable “status”.
  • Do until both the queue becomes empty,
    • Dequeue a character from 1^st queue “q1”.
    • Dequeue a character from 2^nd queue “q2”.
    • Check if both the characters are not equal.
      • If the condition is true then, assign “false” to the Boolean variable.
  • Check if the status is true,
    • If the condition is true then, print “The files are identical”.
    • If the condition is not true then, print “The files are not identical”.

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.