bartleby

Concept explainers

Question
Book Icon
Chapter 21, Problem 7PC
Program Plan Intro

Queue Converter

Program Plan:

DynIntQueue.h:

  • Include required header files.
  • Declare a class named “DynIntQueue”; inside the class,
    • Inside the “private” access specifier,
      • Create a structure named “QueueNode”.
        • Declare a variable “value”.
        • Create a pointer named “next”.
      • Create two pointers named “front” and “rear”.
      • Declare a variable “numItems”.
    • Inside “public” access specifier,
      • Declare constructor and destructor.
      • Declare the functions “enqueue()”, “dequeue()”, “isEmpty()”, “isFull()”, and “clear()”.

DynIntQueue.cpp:

  • Include required header files.
  • Give definition for the constructor.
    • Assign the values.
  • Give definition for the destructor.
    • Call the function “clear()”.
  • 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”.
  • 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”.
  • 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.
  • Give function definition for “clear()”.
    • Declare a variable.
      • Dequeue values from queue till the queue becomes empty using “while” condition.

IntBinaryTree.h:

  • Include required header files.
  • Declare a class named “IntBinaryTree”. Inside the class,
    • Inside the “private” access specifier,
      • Give the structure declaration for the creation of node.
        • Declare a variable
        • Create two pointers named “left” and “right” to access the value left and right nodes respectively.
      • Create a pointer named “root” to access the value of root node.
      • Give function declaration for “insert ()”, “destroy_SubTree ()”, “delete_Node ()”, “make_Deletion ()”, “display_InOrder ()”, “display_PreOrder ()”, “display_PostOrder ()”, “copyTree ()”, and “setQueue ()”.
    • Inside “public” access specifier,
      • Give the definition for constructor and destructor.
      • Give function declaration for binary tree operations.

IntBinaryTree.cpp:

  • Include required header files.
  • Give definition for copy constructor.
  • Give function definition for “insert()”.
    • Check if “nodePtr” is null.
      • If the condition is true then, insert node.
    • Check if value of new node is less than the value of node pointer
      • If the condition is true then, Insert node to the left branch by calling the function “insert()” recursively.
    • Else,
      • Insert node to the right branch by calling the function “insert()” recursively.
  • Give function definition for “insert_Node ()”.
    • Create a pointer for new node.
    • Assign the value to the new node.
    • Make left and right node as null.
    • Call the function “insert()” by passing parameters “root” and “newNode”.
  • Give function definition for “destroy_SubTree()”.
    • Check if the node pointer points to left node
      • Call the function recursively to delete the left sub tree.
    • Check if the node pointer points to the right node
      • Call the function recursively to delete the right sub tree.
    • Delete the node pointer.
  • Give function definition for “search_Node()”.
    • Assign false to the Boolean variable “status”.
    • Assign root pointer to the “nodePtr”.
    • Do until “nodePtr” exists.
      • Check if the value of node pointer is equal to “num”.
        • Assign true to the Boolean variable “status”
      • Check if the number is less than the value of node pointer.
        • Assign left node pointer to the node pointer.
      • Else,
        • Assign right node pointer to the node pointer.
    • Return the Boolean variable.
  • Give function definition for “remove()”.
    • Call the function “delete_Node()”
  • Give function definition for “delete_Node()”
    • Check if the number is less than the node pointer value.
      • Call the function “delete_Node()” recursively.
    • Check if the number is greater than the node pointer value.
      • Call the function “delete_Node()” recursively.
    • Else,
      • Call the function “make_Deletion()”.
  • Give function definition for “make_Deletion()”
    • Create pointer named “tempPtr”.
    • Check if the “nodePtr” is null.
      • If the condition is true then, print “Cannot delete empty node.”
    • Check if right node pointer is null.
      • If the condition is true then,
        • Make the node pointer as the temporary pointer.
        • Reattach the left node child.
        • Delete temporary pointer.
    • Check is left node pointer is null
      • If the condition is true then,
        • Make the node pointer as the temporary pointer.
        • Reattach the right node child.
        • Delete temporary pointer.
    • Else,
      • Move right node to temporary pointer
      • Reach to the end of left-Node using “while” condition.
        • Assign left node pointer to temporary pointer.
      • Reattach left node sub tree.
      • Make node pointer as the temporary pointer.
      • Reattach right node sub tree
      • Delete temporary pointer.
  • Give function definition for “display_InOrder()”.
    • Check if the node pointer exists.
      • Call the function “display_InOrder()” recursively.
      • Print the value
      • Call the function “display_InOrder()” recursively.
  • Give function definition for “display_PreOrder()”.
    • Print the value.
    • Call the function “display_PreOrder()” recursively.
    • Call the function “display_PreOrder()” recursively.
  • Give function definition for “display_PostOrder()”.
    • Call the function “display_PostOrder()” recursively.
    • Call the function “display_PostOrder()” recursively.
    • Print value.
  • Give function definition for assignment operator.
    • Call the function “destroy_SubTree()”
    • Call the copy constructor.
    • Return the pointer.
  • Copy tree function is called by copy constructor and assignment operator function
    • Create a pointer named “newNode”.
    • Check if “nPtr” is not equal to null
      • Allocate memory dynamically.
      • Assign pointer value to the new node.
      • Call the function “copyTree()” by passing “nPtr” of left.
      • Call the function “copyTree()” by passing “nPtr” of right
    • Return the new node.
  • Function definition for “setQueue()”.
    • Check if the pointer “nodePtr” exists.
    • Call the function “setQueue()” recursively by passing the left node.
    • Call the function “setQueue()” recursively by passing the right node.
    • Call the function “enqueue()” recursively by passing the left node.

Main.cpp:

  • Include required header files.
  • Inside “main()” function,
    • Declare a variable “value” and assign it to 0.
    • Create an object “intBT” for “IntBinaryTree” class.
    • Insert 5 values using “insert_Node()” function.
    • Display all the values by using the function “display_InOrder()”.
    • Create an object “iqueue” for “DynIntQueue” class.
    • Load the address to the pointer “qPtr”.
    • Pass this pointer to the function “treeToQueue ()”.
    • Do until the queue is not empty.
      • Declare a variable.
      • Call the function “dequeue()”.
      • Display the value.

Blurred answer
Students have asked these similar questions
A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…
2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…
8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
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
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT