Q: Choose the statements to generate 4x4 A array [10 10 10 10] 10 10 10 10 10 10 l10 10 10 10] 10 11

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...
icon
Related questions
Question
Quickly please
Q: Choose the statements to
generate 4x4 A array
[10
10
10
10]
|10
10
10
10
10
11
10
10
l10
10
10 10]
# include <iostream.h>
main ()
{int i, j;
int A[4][4];
for (i=0; i<=3; i++)
for (j=0; j<=3; j++)
{-
for (i=0; i<=3; į++)
for (j=0; j<=3;j++)
cout<<A[i][j];
return 0;
}
if (i= = 2) && (j= = 1) A[i][i] =10 else A[i]
G) =11;
%3:
if (i! = 2)|| (j! = 1) A[i][] =10 else A[i][]
%3D
=11;
if (i! = 2) && (j! = 1) A[i][j] =10 else A[i]
G) =11;
%3D
if (i= = 3) && (j= = 2) A[i][i] =10 else A[i]
(i] =11;
%3:
if (i! = 2) && (j! = 1) A[i][j] =11 else A[i]
G) =10;
Transcribed Image Text:Q: Choose the statements to generate 4x4 A array [10 10 10 10] |10 10 10 10 10 11 10 10 l10 10 10 10] # include <iostream.h> main () {int i, j; int A[4][4]; for (i=0; i<=3; i++) for (j=0; j<=3; j++) {- for (i=0; i<=3; į++) for (j=0; j<=3;j++) cout<<A[i][j]; return 0; } if (i= = 2) && (j= = 1) A[i][i] =10 else A[i] G) =11; %3: if (i! = 2)|| (j! = 1) A[i][] =10 else A[i][] %3D =11; if (i! = 2) && (j! = 1) A[i][j] =10 else A[i] G) =11; %3D if (i= = 3) && (j= = 2) A[i][i] =10 else A[i] (i] =11; %3: if (i! = 2) && (j! = 1) A[i][j] =11 else A[i] G) =10;
Q: Choose the missing statements
* to find f for n terms
z+ 2
f = 82.5 –
10!
z+ 3
z + 4
z + 5
20!
30!
40!
# include <iostream.h>
#include<math.h>
int fact (int num)
{int j; int F=1;
for (j=1; j<=num; j++)
F=F*j;
return F;}
main ()
{int i, n, z; float f=82.5;
cin>>z>>n;
for (i=1;i<=n;i++)
cout<<f;
}
non of mentioned
f=f+pow (-1, i) *(z+ (i+1))/fact(i*10); O
f=f+pow (-1, i+1) *(z+ (i+1))/fact(i*10);
f=f+pow (-1, i) *(z- (i+1))/fact(i*10); O
f=f - pow (-1, i) *(z+ (i+1))/fact(i*10); O
f=f+pow (-1, i) *(z+
(i+1))/fact((i+1)*10);
Transcribed Image Text:Q: Choose the missing statements * to find f for n terms z+ 2 f = 82.5 – 10! z+ 3 z + 4 z + 5 20! 30! 40! # include <iostream.h> #include<math.h> int fact (int num) {int j; int F=1; for (j=1; j<=num; j++) F=F*j; return F;} main () {int i, n, z; float f=82.5; cin>>z>>n; for (i=1;i<=n;i++) cout<<f; } non of mentioned f=f+pow (-1, i) *(z+ (i+1))/fact(i*10); O f=f+pow (-1, i+1) *(z+ (i+1))/fact(i*10); f=f+pow (-1, i) *(z- (i+1))/fact(i*10); O f=f - pow (-1, i) *(z+ (i+1))/fact(i*10); O f=f+pow (-1, i) *(z+ (i+1))/fact((i+1)*10);
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY