1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout

1. Consider the following algorithm:
for ( i = 1 ; i <= 1 . 5 n ; i++)
cout << i ;
for ( i = n ; i >= 1 ; i - - )
cout << i ;
(a) What is the output when n = 2, n = 4, and n = 6?
(b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

Question Posted / john

0 Answers
2588 Views
I also Faced
E-Mail Answers

No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Algorithms Interview Questions

What do you mean by overfitting and underfitting algorithms?

0 Answers

What is the iterative deepening depth-first search algorithm?

0 Answers

What is Back propagation in Neural Networks?

1 Answers

List the different algorithm techniques in machine learning?

0 Answers

1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

0 Answers

What are the disadvantages of breadth-first search algorithm?

0 Answers

Can you list some use cases where classification machine learning algorithms can be used?

0 Answers

What is simulated annealing algorithm?

0 Answers

What is breadth-first search algorithm?

0 Answers

There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?

1 Answers IBM, TCS,

Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?

0 Answers

A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.

0 Answers DELL,

For more AI Algorithms Interview Questions Click Here