4. What does the following program do?I // Ex. 8.13: ex08 13.cpp2 // What does this program do?3 #include 4 using namespace std;56 void mystery1( char *, const char * ); // prototypeint main(){char stringl[ 80 ];char string2[ 80 ];1012

Given code is #include <iostream>using namespace std;void mystery1(char *,const char*);int…

Answered: 4. What does the following program do?…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Java script
Zybooks C++ 1.7 LAB: Introduction to data structures labs Step 1: Producing correct output Three commented-out lines of code exist in main(). Uncomment the lines and click the "Run program" button. Verify that the program's output is: 2 + 2 = 4 Unknown function: PrintPlus2 Secret string: "abc" Submit your code for grading. Your submission will pass the "Compare output" test only, achieving 1 of the possible 10 points. Step 2: Inspecting the LabPrinter class Inspect the LabPrinter class implemented in the LabPrinter.h file. Access LabPrinter.h by clicking on the orange arrow next to main.cpp at the top of the coding window. Member functions Print2Plus2() and PrintSecret() print strings using std::cout. Step 3: Implementing CallFunctionNamed() Remove the three uncommented lines from main(). Then implement the CallFunctionNamed() function in main.cpp to handle three cases: If functionName is "Print2Plus2", call printer's Print2Plus2() member function. If functionName is "PrintSecret",…
C Programming What does the below code segment do? #define RECORD_LENGTH 60 /* PORTFOLIO.DAT looks like the below: ibm 108.77 27.98 att 111.43 50 acdc 100 30 */ void main(void) { FILE *fptr; char stock_price_shares[RECORD_LENGTH + 1]; int i=0, count=0; // attempt to open PORTFOLIO.DAT for reading if ((fptr = fopen("PORTFOLIO.DAT", "r")) == NULL) printf("\nCannot open the file: PORTFOLIO.DAT\n"); else { while ( fgets(stock_price_shares, RECORD_LENGTH + 1, fptr) != NULL ) printf("\n%s", stock_price_shares); fclose(fptr); //close the file } printf("\nHow many new records for PORTFOLIO.DAT?"); scanf("%d ", &count); fptr = fopen("PORTFOLIO. DAT", "w"); /* writing */ for (i = 0; i < count; ++i) { gets(stock_price_shares); fputs(stock_price_shares, fptr); fclose(fptr); } }
6.9 LAB: All permutations of names Write a program that lists all ways people can line up for a photo (all permutations of a list of Strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia import java.util.Scanner;import java.util.ArrayList; public class PhotoLineups { // TODO: Write method to create and output all permutations of the list of names.public static void allPermutations(ArrayList<String> permList, ArrayList<String> nameList) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in);ArrayList<String> nameList = new ArrayList<String>();ArrayList<String> permList = new ArrayList<String>();String name;//…
* AHPA #19: Bowling Balls * * They need you to create a Rust program with data structures that will * allow them to keep track of their bowling balls. * * The number of children's balls is fixed: they have red, green, yellow, * blue, and purple balls. * * The number of adult balls is variable because people walk off with * them. They currently have: gold, black, silver, aqua, pink, and brown. * * Create an array data structure for the children's balls and a vector * data structure for the adult balls. * * Add a lavender ball to the adult vector. * * Print out the contents of both data structures. * * Student Name: * */ fn main() { }
task7.c Compare 2 strings function cmp will print out > if s1 is "bigger" than s2, < if s1 is "smaller than s2, = if s1 is "equal" to s2. */ #include <stdio.h> #include <string.h> void cmp(char *s1, char *s2){ return; } int main() { char *string1 = "UNIX rules!"; char *string2 = "Windows drools!"; cmp(string1,string2); return 0; } Start with task7.c, implement the cmp() function. The goal of this function is to compare two strings using the sum of the ASCII value of all the characters in each string. Output of your program should look like this: UNIX rules! is smaller than Windows drools!
Take Test: Final Exam Theory 202 A Question Completion Status: 1. 2 4. 6. 9. 10 11 12 13 21 QUESTION 17 Determine the output generated by the partial C code given. #include #include void main() { int a=9, b=4,c=0; c= pow(sqrt(b)+sqrt(a),2); printf("%d, %d and %d", a, b, c ); For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).
** in java language **
R7.30Assuming the following declarations, find the mistakes in the statements below. struct A { int m1[2]; int m2; } struct B { A a1; A* a2; int m3; } A a; B b[2]; a.b[0].a2 = a; b.b[1].m2 = 42; c.b[2].a2 = new A; d.b[0].a1.m1 = 42; e.b[1].a2->m2 = 42;
C programming fill in the following code #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…
9.4: ==== Write a function that takes a C-string as a parameter and reverses the string. The function will use two pointers to char, front and rear. The front pointer will initially reference the first character in the string, and the rear pointer will initially reference the last character in the string. Reverse the string by swapping the characters referenced by front and rear pointers, then increment the front pointer and decrement the rear pointer, and so on, until the entire string is reversed. Write a main program that would let the user input a string and then print out the reversed version of the string. For this exercise, you may assume the maximum length of a string is 100 characters. SAMPLE RUN #1: ./reverse_string Interactive Session Hide Invisibles Enter:0123456789 a.string:9876543210 SUBMIT

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS

4. What does the following program do? I // Ex. 8.13: ex08 13.cpp 2 // What does this program do? 3 #include 4 using namespace std; 6 void mystery1( char *, const char * ); // prototype 8 int main() 9 { char stringl[ 80 ]: char string2[ 80 ]; 10 12

4. What does the following program do? I // Ex. 8.13: ex08 13.cpp 2 // What does this program do? 3 #include 4 using namespace std; 6 void mystery1( char , const char ); // prototype 8 int main() 9 { char stringl[ 80 ]: char string2[ 80 ]; 10 12