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
- 2182 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is iterative deepening depth-first search algorithm?
Define Routing Algorithm?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
What is bidirectional search algorithm?
Which algorithm is used for solving temporal probabilistic reasoning?
What is Back propagation in Neural Networks?
Tell me how do you choose an algorithm for a classification problem?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
Name search algorithm technology?
Which language is used for artificial intelligence?
What is meant by uniform cost search algorithm?
What are disadvantages uniform cost search algorithm?
-
AI Algorithms (74) - AI Language Processing (96)
- AI Knowledge Representation (12)
- AI Robotics (183)
- AI Recognition (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- TensorFlow (197)
- AI Deep Learning (111)
- AI General (197)
- AI AllOther (6)
