Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Related questions
Question
Transcribed Image Text:Here function f returns the results through address passing. Assuming c is a global complex number defined in main.c, please implement f.h by selecting line numbers from the following lines in
correct order. Remember each blank can hold just one line number.
1 #include <stdio.h>
2 #include <math.h>
3 #include "g.h"
4 #include "f.h"
5 extern c_t c;
6 c tc;
7 c_t g(c_t, c_t):
8 c_t g(c_t a, c_t b){
9 c_tre,
10 c_t re1, re2;
11 else { f(&re1, n-1); f(&re2, n-2); *re = g(re1, re2); }
12 f.o: f.h g.h
13 f(&re, 10);
14 f: main.o f.o g.o
дсс -c f.c
gcc -c g.c
gcc -c main.c
gcc -o f main.o f.o g.o -Im
15
16
17
18
19 g.o: g.h
20 if (n <= 1) *re = c;
21 int main(void)
22 main.o: f.h g.h
23 printf("%f\n", sqrt(re.x - re.y));
24. rox
24 re.x = a.x"b.x - a.y*b.y;
25 re.y = a.x*b.y + b.x*a.y;
26 return 1-
27 return re:
13;
28 scanf("%lf%lf", &c.x, &c.y):
29 typedef struct { double x, y; } c_t;
30 void f(c_t *, int);
31 void f(c_t *re, int n) {
32 }
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 2 images
Knowledge Booster
Similar questions
- Write a menu-driven C++ program to manage your college course history and plans, named as you wish. It should work something like this: Array size: 0, capacity: 2MENUA Add a courseL List all coursesC Arrange by courseY arrange by YearU arrange by UnitsG arrange by GradeQ Quit...your choice: a[ENTER]Enter a courses' name: Comsc-165[ENTER]Enter the year for Comsc-165 [like 2020]: 2016[ENTER]Enter the units for Comsc-165 [0, 1, 2,...]: 4[ENTER]Enter the grade for Comsc-165 [A, B,..., X if still in progress or planned]: x[ENTER]Array size: 1, capacity: 2MENUA Add a courseL List all coursesC Arrange by courseY arrange by YearU arrange by UnitsG arrange by GradeQ Quit...your choice: a[ENTER]Enter a courses' name: Comsc-110[ENTER]Enter the year for Comsc-110 [like 2020]: 2015[ENTER]Enter the units for Comsc-110 [0, 1, 2,...]: 4[ENTER]Enter the grade for Comsc-110 [A, B,..., X if still in progress or planned]: A[ENTER]Array size: 2, capacity: 2MENUA Add a courseL List all coursesC Arrange by…arrow_forwardLab 09 Understanding C++ pointers Assume p1, p2, and p3 are pointers to integer numbers. As an example, consider int n1 = 33; int n2 = 11; int n3 = 22; You are asked to implement the function void arrangelnOrder(int* p1, int* p2, int* p3) The function's goal is to order the data referenced by the pointers in such a way that after the function is called, p1 points to the smallest and p3 points to the largest of the three values. Test your function using the following main() method. Make sure your app works for all possible combinations of integer values referenced by the pointers. int main() { int n1 = 33; int n2 = 11; int n3 = 22; cout << "Before the call. n1=" << n1<< ", n2="<< n2 << ", n3=" << n3 << endl; arrangelnOrder(&n1, &n2, &n3); cout << "After the call. n1=" << n1 << ", n2=" << n2 << ", n3=" << n3 << endl; } It should produce the following output. Before the call. n1=33, n2=11, n3=22 After the call. n1=11, n2=22, n3=33 NOTE. Do not copy the data value into an array/vector and…arrow_forwardWould it be possible to use unique, shared or weak pointers in the code?arrow_forward
- Create a flowchart for this program in c++, #include <iostream>#include <vector> // for vectors#include <algorithm>#include <cmath> // math for function like pow ,sin, log#include <numeric>using std::vector;using namespace std;int main(){ vector <float> x, y;//vector x for x and y for y float x_tmp = -2.5; // initial value of x float my_function(float x); while (x_tmp <= 2.5) // the last value of x { x.push_back(x_tmp); y.push_back(my_function(x_tmp)); // calculate function's value for given x x_tmp += 1;// add step } cout << "my name's khaled , my variant is 21 ," << " my function is y = 0.05 * x^3 + 6sin(3x) + 4 " << endl; cout << "x\t"; for (auto x_tmp1 : x) cout << '\t' << x_tmp1;//printing x values with tops cout << endl; cout << "y\t"; for (auto y_tmp1 : y) cout << '\t' << y_tmp1;//printing y values with tops…arrow_forwardIn C programming. How do I find the max and min values of the corressponding columns. #include <stdio.h>#include <math.h>#include <stdlib.h>#define NROWS 5#define NCOLS 5 int main(void){ int i,j, max, min, m, n; float M[NROWS][NCOLS], Mt[NROWS][NCOLS]; char key_hit; //Input the sizes printf("ROW size(1-5) : ");scanf("%d",&m); printf("Column size(1-5): ");scanf("%d",&n); //Size Check while(m>NROWS || n>NCOLS) { printf("Please re-enter the sizes. \n"); printf("Row size(1-5) : ");scanf("%d", &m); printf("Column size(1-5) : ");scanf("%d", &n); } //Input the Matrix Data for(i=0; i<m; i++) for(j=0; j<n; j++) { printf("M[%d][%d] = ", i,j); scanf("%f", &M[i][j]); } //Print the Matrix Data for(i=0; i<m; i++) { for(j=0; j<n; j++) { printf("%1.2f\t", M[i][j]); }…arrow_forwardIn C++ Declare a Character Pointer and allocate a dynamic array of 22 characters.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSON
Computer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier Science
Network+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning 
Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage Learning
Prelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson Education
Sc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY
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