Search Header Logo

GNIDOC ROUND 1

Authored by MEGHA HARTHANA S

Computers

University

Used 7+ times

GNIDOC ROUND 1
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the search complexity in direct addressing?

a) O(n)

b) O(logn)

c) O(nlogn)

d) O(1)

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?