Answer:
Best Regards to all of the people who have met you in the class
Answer:
void printC()
{
int i, j;
for (i = 0; i < 4; i++) //i indicate row number. Here we have 5 rows
{
printf("C"); //print C for every row
for (j = 0; j < 6; j++) //j indicate column number. Here we have 7 Rows
{
if (i == 0 || i == 4) //For first and last row
printf("C"); //print 'CCCCCCC'
else if (i = 1|| i= 3) //for Second forth row
printf("C + +"); //print 'C + +'
else if (i = 2) For second row
printf("C +++++"); //print 'C +++++'
else
continue; //to jump to next iteration
}
printf("\n"); // print in next line
}
}
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
Answer:
Explanation:
class TimeToSleep() {
main bunch of stuff (string argos) {
int age;
string comedy;
bool guess;
public bool imTheMasterMethod() {
guess = true;
while (guess) {
comedy = "You forgot to put the flowchart, you meathead!";
println(comedy);
scan("%d", &age);
if (age < 18) {
println("Go to sleep kiddo!");
}
}
}
}
}
1.Extended border node (EBN)
2.Central directory server (CDS)
3.Branch extender (BEX or BrEx or BrNN)
