GNIDOC ROUND 1

What will be the output of the following code snippet?

#include<stdio.h>

int main()

{

int i;

i = (printf("Welcome"), printf(" To Progeni "));

printf("%d", i);

return 0;

}

• a) Welcome To Progeni , error

• b) compilation error

• c) Welcome To Progeni 12

• d) Welcome To Progeni 19

What is the output of below program?

int main()

{

if("0")

{

cout<<"EPUDRAA";

}

else

{

cout<<" THE BOYS";

}

return 0;

}

• a)EPUDRAA

• b) THE BOYS

• c) both a) and b)

• d) none

What is the value of p in the following C++ code snippet?

#include <iostream>

using namespace std;

int main()

{

int p;

bool a = true;

bool b = false;

int x = 8;

int y = 2;

p = ((x | y) + (a + b));

cout << p;

return 0;

}

• 10

• 11

• 8

• 12

What will be the output of the following code snippet?

#include <stdio.h>

int main() {

    printf("%d %d", (032), (27));

    return 0;

}

• 032 27

• 32 27

• 26 27

• 026 27

By assuming size of int = 8 bytes , char = 1 byte for 64-bit compiler, find the output.

#include <iostream>

#include<string.h>

using namespace std;

int main() {

int *pr[10];

const char *ptr="varta maamey durrr";

char p[]="Eppudra";

cout<<sizeof(pr)<<" ";

cout<<sizeof(ptr)<<" ";

cout<<sizeof(p);

}

• a) 80 12 7

• b) 10 8 7

• c) 80 8 8

• d) 80 4 8

What will be the output of the following code snippet? 

#include <stdio.h>

int main() {

bool ok = false;

printf(ok? "YES" : "NO");

return 0;

}

• A)Yes

• B)No

• C)Compilation Error

• D)None of the above

What is the search complexity in direct addressing?

• a) O(n)

• b) O(logn)

• c) O(nlogn)

• d) O(1)

How many times will ‘I LOVE U’ be printed in the above program?

 #include <stdio.h>

int main()

{

    int i = 1024;

    for (; i; i >>= 1)

        printf("I LOVE U");

    return 0;

}

• A) 3000 times

• B) infinite times

• C) 11 times

• D) compile time error 

What will be the output of the following code snippet?

#include <stdio.h>

void solve() {

    int a = 3;

    int res = a++ + ++a + a++ + ++a;

    printf("%d", res);

}

int main() {

solve();

return 0;

}

• 24

• 20

• 18

• 12

#include <iostream>

using namespace std;

int main() 

{

    int a,rem;

    cin>>a;

    while(a!=0)

    {  

       rem=a%10;

       (rem%2==0)?cout<<'L':cout<<'a';

       a/=10;

    }

    return 0;

}

If the input is 1123345678 what is the output?

• a)LaaLaaLaLa

• b)LaLaLaaLaa

• c)aLaLaaLaaL

• d)aaLaaLaLaL