PSUEDOCODE 2 CAPGEMINI

Front

What is the time complexity of the function int sum (int A[], int n) that sums the elements of an array? Options: 2n+8, 2n+2, 2n+4, 2n

Back

2n+8

Front

Point out the error in the program?
#include<stdio.h>
int main()
{
char ch;
int i;
scanf("%c", &i);
scanf("%d", &ch);
printf("%c %d", ch, i);
return 0;
}

Back

Error: we may not get input for second scanf() statement

Front

Consider the following iterative implementation to find the factorial of a number:
int main()
{
int n = 6, i;
int fact = 1;
for(i=1;i<=n;i++)
_________;
printf("%d",fact);
return 0;
}
Which line should be inserted to complete the above code?

Back

fact = fact * i

Front

What is the output of this C code?
#include <stdio.h>
int main()
{
int i=12;
int *p =&i;
printf(“%d\n”,*p++);
}

Back

12

Front

Convert the following 211 decimal number to 8-bit binary?

Back

11010011

Front

A NAND gate has:

Back

LOW inputs and a HIGH output

Front

Comment on the output of this C code?
#include <stdio.h>
int main()
{
int a = 1;
switch (a)
case 1:
printf("%d", a);
case 2:
printf("%d", a);
case 3:
printf("%d", a);
default:
printf("%d", a);
}

Back

Compile time error, case label outside switch statement

Front

How will you find the maximum element in a binary search tree? Options: a) public void max(Tree root) { while(root.left() != null) { root = root.left(); } System.out.println(root.data()); } b) public void max(Tree root) { while(root != null) { root = root.left(); } System.out.println(root.data()); } c) public void max(Tree root) { while(root.right() != null) { root = root.right(); } System.out.println(root.data()); } d) public void max(Tree root) { while(root != null) { root = root.right(); } System.out.println(root.data()); }

Back

public void max(Tree root) { while(root.right() != null) { root = root.right(); } System.out.println(root.data()); }

Front

What is the output of the following code?
void my_recursive_function(int n)
{
if(n == 0)
return;
printf("%d ",n);
my_recursive_function(n-1);
}
int main()
{
my_recursive_function(10);
return 0;
}

Back

10 9 8 … 1

Front

For input a = 8 & b = 9, what is the output of the function defined as follows: If (a < b) return function (b, a) elseif (b != 0) return (a + function (a, b - 1)) else return 0? Options: 56, 78, 82, 72

Back

72