Problem Solving with C++ (10th Edition)
Problem Solving with C++ (10th Edition)
10th Edition
ISBN: 9780134448282
Author: Walter Savitch, Kenrick Mock
Publisher: PEARSON
Question
Book Icon
Chapter 9, Problem 5PP
Program Plan Intro

Computer Lab Logging

Program Plan:

  • Include the necessary libraries.
  • Use namespace.
  • Define the constants and type definition.
  • Define the function prototypes.
  • Define the function “createArrays()” to create the dynamic array for the lab.
    • Declare the variables.
    • Define the first array which is the array of labs.
    • Define the second array which defines the size of the lab.
  • Define the function “freeArrays()” to release the allocated memory.
  • Define the function “showLabs()” to display the status of all labs.
  • Define the function “login()” to simulate the user login.
    • Declare the required variables.
    • Get input from the keyboard, validating data ranges.
    • Use a while loop to repeat operation until user requires.
    • Store the value and display the message.
    • Finally, assign that station to the user.
  • Define the function logoff() to logoff that user.
    • Declare the required variables.
    • Get input from keyboard, validating data ranges.
    • Use a while loop to repeat operation until user requires.
    • Store the value and display the message.
    • Use a for loop to repeat operation until user requires.
    • Display the message of the user logged in.
    • Otherwise display that user is not logged in.
  • Define the function “search()” to search that user.
    • Declare the required variables.
    • Get input from keyboard, validating data ranges.
    • Use a while loop to repeat operation until user requires.
    • Store the value and display the message.
    • Use a for loop to repeat operation until the user is found out.
    • Otherwise display that user is not logged in.
  • Define the main method.
    • Declare the variables that are required for program.
    • Initialize lab sizes to those given in the problem.
    • Create a ragged array structure.
    • Use a while loop to repeat operation until user requires.
    • Perform login, logoff or search function.
    • Free memory before exiting.

Blurred answer
Students have asked these similar questions
Just wanted to know, if you had a scene graph, how do you get multiple components from a specific scene node within a scene graph? Like if I wanted to get a component from wheel from the scene graph, does that require traversing still?   Like if a physics component requires a transform component and these two component are part of the same scene node. How does the physics component knows how to get the scene object's transform it is attached to, this being in a scene graph?
How to develop a C program that receives the message sent by the provided program and displays the name and email included in the message on the screen?Here is the code of the program that sends the message for reference: typedef struct {    long tipo;    struct {        char nome[50];        char email[40];    } dados;} MsgStruct; int main() {    int msg_id, status;    msg_id = msgget(1000, 0600 | IPC_CREAT);    exit_on_error(msg_id, "Creation/Connection");    MsgStruct msg;    msg.tipo = 5;    strcpy(msg.dados.nome, "Pedro Silva");    strcpy(msg.dados.email, "pedro@sapo.pt");    status = msgsnd(msg_id, &msg, sizeof(msg.dados), 0);    exit_on_error(status, "Send");    printf("Message sent!\n");}
9. Let L₁=L(ab*aa), L₂=L(a*bba*). Find a regular expression for (L₁ UL2)*L2. 10. Show that the language is not regular. L= {a":n≥1} 11. Show a derivation tree for the string aabbbb with the grammar S→ABλ, A→aB, B→Sb. Give a verbal description of the language generated by this grammar.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT