Answer:
Written in C++
void number(int n){
if(n%2 == 0)
cout<<2 * n;
else
cout<<5 * n;
}
Explanation:
The programming language is not stated.
However, I answered using C++
This line defines the function as void
void number(int n){
This line checks if the number is even
if(n%2 == 0)
If yes, it doubles the number and prints the output
cout<<2 * n;
If otherwise,
else
It multiplies the number by 5 and prints the output
cout<<5 * n;
}
To call the function from main, use:
number(n);
Note than n must be declared as integer
See attachment
Answer:
Option 1: May crash at runtime because it can input more elements than the array can hold
Explanation:
Given the code as follows:
- int[] a = {1, 3, 7, 0, 0, 0};
- int size = 3, capacity = 6;
- int value = cin.nextInt();
- while (value > 0)
- {
- a[size] = value;
- size++;
- value = cin.nextInt();
- }
From the code above, we know the <em>a</em> is an array with six elements (Line 1). Since the array has been initialized with six elements, the capacity of the array cannot be altered in later stage.
However, a while loop is created to keep prompting for user input an integer and overwrite the value in the array started from index 3 (Line 4- 9). In every round of loop, the index is incremented by 1 (Line 7). If the user input for variable <em>value</em> is always above zero, the while loop will persist. This may reach a point where the index value is out of bound and crash the program. Please note the maximum index value for the array is supposedly be 5.
Answer:
The node of the 2-4 tree can have at most three values.
There are basically 3 types of nodes in the 2-4 tree which are as following:-
- 2-Node.
- 3-Node.
- 4-Node.
2-Node:-It contains 1 data element and two child pointers.
3-Node:-It has 2 data elements and three child pointers.
4-Node:-It has 3 data elements and four child pointers.
There is also leaf node which can contain 2,3 or 4 data elements but has no child pointers.
