Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Infosys C++ Code Interview Questions
Questions Answers Views Company eMail

What is the time complexity T(n) of the following program? a) int n, d, i, j; cin >> n; for (d=1; d<=n; d++) for (i=1; i<=d; i++) for (j=1; j<=n; j += n/10) cout << d << " " << i << " " << j << endl; b) void main() { int n, s, t; cin >> n; for (s = 1; s <= n/4; s++) {t = s; while (t >= 1) { cout << s << " " << t << endl; t--; } } } c) void main() { int n, r, s, t; cin >> n; for (r = 2; r <= n; r = r * 2) for (s = 1; s <= n/4; s++) { t = s; while (t >= 1) { cout << s << " " << t << endl; t--; } } }

3 8950

Min-Max Write an algorithm that finds both the smallest and largest numbers in a list of n numbers and calculate its complexity T(n).

1 6228

write a c program, using for loop, that accepts and odds two numbers. The output must be the sum and the addens. This should be repeated 5 times while the first number is decremented by one and the second number is incremented by 1.

2 8061

Write a program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or if it is not prime find out its factors.

5 14940

Post New Infosys C++ Code Interview Questions


Infosys C++ Code Interview Questions


Un-Answered Questions

What is the difference between search engine marketing and internet marketing?

425

Explain the typeof operator?

533

What is Session variable?

116

What is jrmp?

537

What do you mean by early binding?

585




How to delete the repeated records from a table?

492

What are the three build life cycles of maven? Mention them.

124

What are the types of database model?

527

Describe various versions of magento.

3

Explain the 4 way handshake in wlan?

645

How can I connect mysql database?

468

Is python the future of programming?

435

What is the default value of "vbroker.agent.localfile" property?

419

How would you activate animation control?

1442

What are the advantages of maven?

139