1. Too many arguments. Write an empty main function. Write a function called simple that takes a single int parameter and prints it. The function simple should not return anything (return type of void). Place this function below main. Above main, add a declaration for simple that does not indicate any arguments, as in void simple(); Add a call to main that calls simple, but with the arguments 1,2,3....12 answer the following questions about this program: . What does this do? . Do the extra arguments break the code? • Which argument(s) gets printed? . Why? 2. Too few parameters Add a second call to printf in simple. Put 20 %d's in the format string, but provide no other arguments. answer the following questions about this program: • What gets printed? . Where do the values come from? • Why? To help figure this out, you can add some random local variables and observe the changes to your results. 3. Too small array Create a new function called arr. In arr, create struct that contains a five element array of int, followed by an int. Add a for loop that uses the int from inside the structure as the loop variable, and within the for loop set the first 10 elements of the array to 0. Call this arr method from simple. . What happens? Why? answer the following questions about this program:
1. Too many arguments. Write an empty main function. Write a function called simple that takes a single int parameter and prints it. The function simple should not return anything (return type of void). Place this function below main. Above main, add a declaration for simple that does not indicate any arguments, as in void simple(); Add a call to main that calls simple, but with the arguments 1,2,3....12 answer the following questions about this program: . What does this do? . Do the extra arguments break the code? • Which argument(s) gets printed? . Why? 2. Too few parameters Add a second call to printf in simple. Put 20 %d's in the format string, but provide no other arguments. answer the following questions about this program: • What gets printed? . Where do the values come from? • Why? To help figure this out, you can add some random local variables and observe the changes to your results. 3. Too small array Create a new function called arr. In arr, create struct that contains a five element array of int, followed by an int. Add a for loop that uses the int from inside the structure as the loop variable, and within the for loop set the first 10 elements of the array to 0. Call this arr method from simple. . What happens? Why? answer the following questions about this program:
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...
Related questions
Question
This is what I have so far
1. Too many arguments.
#include <stdio.h>
Void simple();
Int main()
{
Int n;
simple(1,2,3,4,5,6,7,8,9,10,11,12);
Return0;
}
Void simple(int n){
printf(“%d”,n);
}
What does this do?
This code prints the first argument passed to the simple function called. That is (1).
Does the extra argument break the code?
No, the extra argument does not break the code as the remaining argument are ignored by the function.
Which argument(s) gets printed?
The arguments are printed in the order they are called in the function.
Here, the argument to be passed first is 1 and that is printed.
The first argument is printed.
Why?
This is because the remaining arguments are evaluated by the function and then ignored.
2. Too few parameters
#include <stdio.h>
Void simple();
Int main()
{
Int n;
simple(1,2,3,4,5,6,7,8,9,10,11,12);
Return0;
}
Void simple(int n){
printf(“%d”,n);
printf(%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d)
}
What gets printed?
The values 1 and the garbage values get printed.
Where do the values come from?
The values are some random values generated for the storage part failures like this where we are not allocating values but using them.
Why?
1 is printed as per the statement.
Garbage values are generated because of not having any argument passed to them to locate a specific location.
3. Too small array
Transcribed Image Text:1. Too many arguments.
Write an empty main function.
Write a function called simple that takes a single int parameter and prints it. The function simple should not return anything (return type of void). Place this function below main.
Above main, add a declaration for simple that does not indicate any arguments, as in
void simple();
Add a call to main that calls simple, but with the arguments 1,2,3..12
answer the following questions about this program:
• What does this do?
• Do the extra arguments break the code?
• Which argument(s) gets printed?
Why?
2. Too few parameters
Add a second call to printf in simple. Put 20 %d's in the format string, but provide no other arguments.
answer the following questions about this program:
• What gets printed?
• Where do the values come from?
• Why?
To help figure this out, you can add some random local variables and observe the changes to your results.
3. Too small array
Create a new function called arr. In arr, create struct that contains a five element array of int, followed by an int. Add a for loop that uses the int from inside the structure as the loop
variable, and within the for loop set the first 10 elements of the array to 0.
Call this arr method from simple.
answer the following questions about this program:
• What happens?
• Why?
Transcribed Image Text:All of this code should be in the same .c file. Submit the final version of the C code (the .c file) and a simple text write up of the questions below. The typical answer (per question)
should be a few sentences. You may include the writeup as comments in your source code.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
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