CareerCup

what is the common type system?

what is the common language runtime?

Write a C++ Program to Find the Number of Digits in a number.

Write a C++ Program to find Factorial of a Number using recursion.

Write a C++ Program to find Addition of Two Numbers.

Write a C++ Program to find Factorial of a Number using for loop.

What will be the output of the following program?

#include<iostream.h>
class TestDrive
{
int x;
public:
TestDrive(int xx)
{
x = xx;
}
int DriveIt(void);
};
int TestDrive::DriveIt(void)
{
static int value = 0;
int m;
m = x % 2;
x = x / 2;
if((x / 2)) DriveIt();
value = value + m * 10;
return value;
}
int main()
{
TestDrive TD(1234);
cout<< TD.DriveIt() * 10 << endl;
return 0;
}

What will be the output of the following program?

#include<iostream.h>
class IndiaBix
{
int K;
public:
void BixFunction(float, int , char);
void BixFunction(float, char, char);

};
int main()
{
IndiaBix objIB;
objIB.BixFunction(15.09, ‘A’, char(‘A’ + ‘A’));
return 0;
}
void IndiaBix::BixFunction(float, char y, char z)
{
K = int(z);
K = int(y);
K = y + z;
cout<< “K = “ << K << endl;
}

What will be the output of the following program?

#include<iostream.h>
class Bix
{
int x, y;
public:
void show(void);
void main(void);
};
void Bix::show(void)
{
Bix b;
b.x = 2;
b.y = 4;
cout<< x << " " << y;
}
void Bix::main(void)
{
Bix b;
b.x = 6;
b.y = 8;
b.show();
}
int main(int argc, char *argv[])
{
Bix run;
run.main();
return 0;
}

What will be the output of the following program?

#include<iostream.h>
int main()
{
float Amount;
float Calculate(float P = 5.0, int N = 2, float R = 2.0);
Amount = Calculate();
cout<< Amount << endl;
return 0;
}

float Calculate(float P, int N, float R)
{
int Year = 1;
float Sum = 1 ;
Sum = Sum * (1 + P * ++N * R);
Year = (int)(Year + Sum);
return Year;
}

What will be the output of the following program?
#include<iostream.h>
class IndiabixSample
{
public:
int a;
float b;
void BixFunction(int a, float b, float c = 100.0f)
{
cout<< a % 20 + c * --b;
}
};
int main()
{ IndiabixSample objBix;
objBix.BixFunction(20, 2.000000f, 5.0f);
return 0;
}

Write a program to print out all Armstrong numbers between 1 and 500. If sum of cubes of each digit of the number is equal to the number itself, then the number is called an Armstrong number.
For example, 153 = ( 1 * 1 * 1 ) + ( 5 * 5 * 5 ) + ( 3 * 3 * 3 )

Write a program to enter the numbers till the user wants and at the end it should display the maximum and minimum number entered

Write a program to enter the numbers till the user wants and at the end it should display the count of positive, negative and zeros entered

Write a program to calculate HCF of Two given number

Write a program to check given number is prime or not

Write a program to sum of digits of given integer number

Write a program to reveres any given integer number

Two numbers are entered through the keyboard. Write a program to find the value of one number raised to the power of another.

Write a program to calculate the sum of first 10 natural number.

Write a program to print number from 1 to 10.

3. What will be the output of the following program?

#include<iostream.h>
double BixFunction(double, double, double = 0, double = 0, double = 0);
int main()
{
double d = 2.3;
cout<< BixFunction(d, 7) << " ";
cout<< BixFunction(d, 7, 6) << endl;
return 0;
}
double BixFunction(double x, double p, double q, double r, double s)
{
return p +(q +(r + s * x)* x) * x;
}

2. What will be the output of the following program?

#include<iostream.h>
void MyFunction(int a, int b = 40)
{
cout<< " a = "<< a << " b = " << b << endl;
}
int main()
{
MyFunction(20, 30);
return 0;
}

1. What will be the output of the following program?

#include<iostream.h>
int BixFunction(int a, int b = 3, int c = 3)
{
cout<< ++a * ++b * --c ;
return 0;
}
int main()
{
BixFunction(5, 0, 0);
return 0;
}

I see that in the book, you mentioned an example under Drop the Constants. The example is calculating Min and Max from an array and one has 1 loop and other has 2 loops. Obviously the one with 1 loop performs a lot faster under large dataset. Just wanted to know what was the point in that example since I am little confused with the example

We are given a graph of N nodes. (1-N), where each node has exactly 1 directed edge to some node (this node can be the same node).

We need to answer the queries of type : A, B, which asks time required when 2 objects collide if one start at A and other start at B. Both moves 1 hop in 1 sec. If it's not possible for them to collide time would be -1.

Time : from X -> to Y : 1 hop = 1 second.

Constraints :

N, Q <= 10^5 (number of nodes, number of queries).
Example : for given graph

A -> B -> C -> D -> E
                       ^      |
                       K <- F

Query(A, E) : 3 seconds, as at time t = 3 secs they both will be on node D.
Query(C, D) : -1 seconds, as they will never collide.
Brute force will take O(Q * N) time. Can we do better than that?

If in a certain language, NOIDA is coded as OPJEB, how is DELHI coded in that language?
A) CDKGH B) EFMIJ C) FGNJK D) IHLED

40) If you are a fitness walker, you don't need to go to a health gym. You also don't need any fitness equipment for workout. All you need is a pair of comfortable athletic shoes.
This paragraph supports which of the following statements;
A) Fitness walking is better than weight lifting
B) Walking outdoors provides more health benefits than walking indoors
C) Fitness walking is an effective and convenient form of exercise
D) Poorly designed shoes can cause foot injuries

The speed of a boat in still water is 5km/hr. If the speed of the boat against the stream is 3 km/hr, what is the speed of the stream?

15) If January 1, 1996, was Monday, what day of the week was January 1, 1997?