What will be the output of the following C code?

#include <stdio.h>

int main(){
    int a = 11;
    
    while (a < 20) {
        printf("%d  ", a);
        a += 2;
    }
    
    return 0;
}

 What is the output of the C Program.?

int main()
{
    if( 4 > 5 )
    {
        printf("Hurray..\n");
    }
     printf("Yes");

    return 0;

}

int main()
{
    int i=0;
     
    for (i = 1; i <= 10; i++)
    {
        printf( "Hello World\n");   
    }
 
    return 0;
}

Identify the test condition and how mony times the for loop will execute?

Find the output of the given C program.

#include<stdio.h>
int main()
{
  if(-5)
  printf("a");
  printf("b");
  else
  printf("c");
  printf("d");
  return 0;
}

Nested if…else statement can be replaced by the statement of ___

 What will be the output of the following C++ code?

#include <iostream>
using namespace std;
int main() {

    if (0) {
        cout << "Hello" ;
    }
    else 
    {
        cout << "Good Bye" ;
    }
    return 0;
}

for(int i = 0; i < n; i++){

print(i);
}

Identify the initialisation expression in for loop.

The secant method is used to find the root of an equation $f\left(x\right)=0$. It is started from two distinct estimates $x_a$ and $x_b$ for the root. It is an iterative procedure involving linear interpolation to a root. The iteration stops if $f\left(x_b\right)$ is very small and then $x_b$ is the solution. The procedure is given below. Observe that there is an expression which is missing and is marked by ?. Which is the suitable expression that is to be put in place of ? so that it follows all steps of the secant method?

Secant

Initialize: $x_a$, $x_b$, ε, N       // $\text{∈=}$ convergence indicator

                                     // $N=$ maximum no. of iterations

$f_b=f\left(x_b\right)$

$i=0$

while $(i<N$ and $\left|f_b\right|>\in$ do

          $i=i+1$            // update counter

          $x_t=?$               // missing expression for

                                   // intermediate value

            $x_a=x_b$        // reset $x_a$

           $x_b=x_t$           // reset $x_b$

          $f_b=f\left(x_b\right)$       // function value at new $x_b$ end while

      if    $\left|f_b\right|>\in$ then       // loop is terminated with $i=N$

                 write “Non-convergence”

 else

            write “return $x_b$”

     end if