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.

Question

Want to see the full answer?

Answer 1

Question

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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

The next problem concerns the following C code: /copy input string x to buf */ void foo (char *x) { char buf [8]; strcpy((char *) buf, x); } void callfoo() { } foo("ZYXWVUTSRQPONMLKJIHGFEDCBA"); Here is the corresponding machine code on a Linux/x86 machine: 0000000000400530 : 400530: 48 83 ec 18 sub $0x18,%rsp 400534: 48 89 fe mov %rdi, %rsi 400537: 48 89 e7 mov %rsp,%rdi 40053a: e8 d1 fe ff ff 40053f: 48 83 c4 18 add callq 400410 $0x18,%rsp 400543: c3 retq 0000000000400544 : 400544: 48 83 ec 08 sub $0x8,%rsp 400548: bf 00 06 40 00 mov $0x400600,%edi 40054d: e8 de ff ff ff callq 400530 400552: 48 83 c4 08 add $0x8,%rsp 400556: c3 This problem tests your understanding of the program stack. Here are some notes to help you work the problem: • strcpy(char *dst, char *src) copies the string at address src (including the terminating '\0' character) to address dst. It does not check the size of the destination buffer. You will need to know the hex values of the following characters:

A ROP (Return-Oriented Programming) attack can be used to execute arbitrary instructions by chaining together small pieces of code called "gadgets." Your goal is to create a stack layout for a ROP attack that calls a function located at '0x4018bd3'. Below is the assembly code for the function 'getbuf', which allocates 8 bytes of stack space for a 'char' array. This array is then passed to the 'gets' function. Additionally, you are provided with five useful gadgets and their addresses. Use these gadgets to construct the stack layout. Assembly for getbuf 1 getbuf: 2 sub $8, %rsp 3 mov %rsp, %rdi 4 call gets 56 add $8, %rsp ret #Allocate 8 bytes for buffer #Load buffer address into %rdi #Call gets with buffer #Restore the stack pointer #Return to caller. Stack Layout (fill in Gadgets each 8-byte section) Address Gadget Address Value (8 bytes) 0x4006a7 pop %rdi; ret 0x7fffffffdfc0 Ox4006a9 pop %rsi; ret 0x7fffffffdfb8 0x4006ab pop %rax; ret 0x7fffffffdfb0 0x7fffffffdfa8 Ox4006ad mov %rax,…

In each of the following C code snippets, there are issues that can prevent the compilerfrom applying certain optimizations. For each snippet:• Circle the line number that contains compiler optimization blocker.• Select the best modification to improve optimization.1. Which line prevents compiler optimization? Circle one: 2 3 4 5 6Suggested solution:• Remove printf or move it outside the loop.• Remove the loop.• Replace arr[i] with a constant value.1 int sum( int ∗ ar r , int n) {2 int s = 0 ;3 for ( int i = 0 ; i < n ; i++) {4 s += a r r [ i ] ;5 p r i n t f ( ”%d\n” , s ) ;6 }7 return s ;8 }2. Which line prevents compiler optimization? Circle one: 2 3 4 5 6Suggested solution:• Move or eliminate do extra work() if it’s not necessary inside the loop.• Remove the loop (but what about scaling?).• Replace arr[i] *= factor; with arr[i] = 0; (why would that help?).1 void s c a l e ( int ∗ ar r , int n , int f a c t o r ) {2 for ( int i = 0 ; i < n ; i++) {3 a r r [ i ] ∗= f a c t o r…