1 ) What is the output for the following:
for (int x = 1; x <= 7; x++)
cout << “GooDByen”;
2 ) What is the output for the following:
for (int x = 1; x <= 7; x++)
cout << “GooDBye”;
3 ) What is the output for the following:
for (int x = 1; x <= 3; x++)
{
for (int y =1; y <= 4; y++)
cout << (( x+y)*2)<<endl;
}
4 ) This is an example of using pointers in code
What is the output for the following:
char x[ ] = {“Have a Nice DAY”};
char *ptr;
ptr = x; OR ptr=&x[0];
while (*ptr != ‘n’)
{
if (*ptr = = ‘a’
cout << “You Have a Hitn”;
ptr++;
}
5 ) This is an example of using pointers in code
What is the output for the following:
int p [ 5 ]= {100,200,300,400,500},*q,x;
q = p[ 4 ];
*q = 250;
p [ 1 ] = *q + 50;
q = p [2 ];
q++;
*q = *(q-1) +50;
q=&p[0];
for (int x = 4; x >= 0; x–)
cout << *(q + x)<<endl;
6 ) This is an example of using pointers in code, HOW WOULD YOU CHANGE THE CODE?
Change Array notation (use of index) to pointer notation:
a) int x;
int arrays [ 5 ]= {100,200,300,400,500};
for (int x = 0; x < 5; x++)
cout << arrays [ x ]<< ‘ ‘;
#include <iostream.h>
void swap(float&, float&); // function receives 2 references
int main()
{
float firstnum = 20.5, secnum = 6.25;
cout << “The value stored in firstnum is: ” << firstnum << endl;
cout << “The value stored in secnum is: “<< secnum << “nn”;
swap(firstnum, secnum); // call the function with references
cout << “The value stored in firstnum is now: “
<< firstnum << endl;
cout << “The value stored in secnum is now: “
<< secnum << endl;
return 0;
}
void swap(float &num1, float &num2)
{
float temp;
temp = num1; // save num1’s value
num1 = num2; // store num2’s value in num1
num2 = temp; // change num2’s value
return;
}
STACK QUEUE REVIEW
Use the Stack and Queue class declaration/implementation as in Programs 15.1 and 15.3 of Bronson or your text. Show what is written/output by the following segments of code.
Show what is written/output by the following segments of code.
Show what is written/output by the following segments of code.
Show what is written/output by the following segments of code.
Recursion Review
cin>> : is input from the key board.
Problem1: Look at the following program, the input will be 19, 23, 55, 88, m one at a time.
Output:
What is the output?
What is the Base Case?
What is the recursive Case?
Using the LINKED LIST do the following:
// This program demonstrates the LINKED LIST member methods/functions
// append; adds a element
// This is a SORTED linked list, insert; puts the element in the location to keep order in // the sort
// delete; removes the element stated.
Leave a reply