Question 3 he C program on the following page was written to provic unction calculate_primes which calculates and returns the UM_PRIMES prime numbers (in this case the first 10 prime ni ers). To test the function, the programmer has printed out umbers returned by the function. However, the program o ot work - there are TEN mistakes in the source code wl revent the program from working correctly. Find the ten r akes, and for each mistake identify the line number contain he mistake. Answers: Mistake 1 line number: listake 2 line number: listake 3 line number: listake 4 line number: listake 5 line number: listake 6 line number: listake 7 line number: listake 8 line number: listake 9 line number: Mistake 10 line number:

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
Question 3
The C program on the following page was written to provide a
function calculate_primes which calculates and returns the first
NUM_PRIMES prime numbers (in this case the first 10 prime num-
bers). To test the function, the programmer has printed out the
numbers returned by the function. However, the program does
not work - there are TEN mistakes in the source code which
prevent the program from working correctly. Find the ten mis-
takes, and for each mistake identify the line number containing
the mistake.
Answers:
Mistake 1 line number:
Mistake 2 line number:
Mistake 3 line number:
Mistake 4 line number:
Mistake 5 line number:
Mistake 6 line number:
Mistake 7 line number:
Mistake 8 line number:
Mistake 9 line number:
Mistake 10 line number:
Transcribed Image Text:Question 3 The C program on the following page was written to provide a function calculate_primes which calculates and returns the first NUM_PRIMES prime numbers (in this case the first 10 prime num- bers). To test the function, the programmer has printed out the numbers returned by the function. However, the program does not work - there are TEN mistakes in the source code which prevent the program from working correctly. Find the ten mis- takes, and for each mistake identify the line number containing the mistake. Answers: Mistake 1 line number: Mistake 2 line number: Mistake 3 line number: Mistake 4 line number: Mistake 5 line number: Mistake 6 line number: Mistake 7 line number: Mistake 8 line number: Mistake 9 line number: Mistake 10 line number:
1
1• cal culate and print the first NUM PRIMES prime aumbers •/
2
3 *include <stdio.h>
4 *include <stdlib.h>
6 *define NUM PRIHES -
10
7
8.
void calculate prime s ( int aum.prime s, int prime s)
9.
10
int i, j. prime, count :
11
12
Count - 0:
13
i - 2
vhile (count
14
< aum.prime s);
15
16
prime -
13;
2; i<i j ++)
if (i % j --
17
for (j -
18
0)
19
20
prime - 0;
bre ak;
21
22
23
if (prime)
24
25
prime s (++ cOuntl
- i;
26
27
i ++ i
28
29 }
30
int main ( int argc, char **argr)
32 {
31
33
int i, pri me s;
34
if (! (prime s - (int) calloc (NUM PR IMES, size of ( int )))) {
fprintf (st de rr, 'error: unable to allocate memory \a'):
retura (1);
35
36
37
38
}
39
40
41
42
43
44
calculate pr ime s (NUM PRI ME S, & prime s):
for (i - 1; i ( NUM PRIMES; i++)
printf ('Xf \a', prime s [il) ;
45
retura 0:
46 }
Transcribed Image Text:1 1• cal culate and print the first NUM PRIMES prime aumbers •/ 2 3 *include <stdio.h> 4 *include <stdlib.h> 6 *define NUM PRIHES - 10 7 8. void calculate prime s ( int aum.prime s, int prime s) 9. 10 int i, j. prime, count : 11 12 Count - 0: 13 i - 2 vhile (count 14 < aum.prime s); 15 16 prime - 13; 2; i<i j ++) if (i % j -- 17 for (j - 18 0) 19 20 prime - 0; bre ak; 21 22 23 if (prime) 24 25 prime s (++ cOuntl - i; 26 27 i ++ i 28 29 } 30 int main ( int argc, char **argr) 32 { 31 33 int i, pri me s; 34 if (! (prime s - (int) calloc (NUM PR IMES, size of ( int )))) { fprintf (st de rr, 'error: unable to allocate memory \a'): retura (1); 35 36 37 38 } 39 40 41 42 43 44 calculate pr ime s (NUM PRI ME S, & prime s): for (i - 1; i ( NUM PRIMES; i++) printf ('Xf \a', prime s [il) ; 45 retura 0: 46 }
Expert Solution
steps

Step by step

Solved in 2 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