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  

---

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

0 Answers  

---

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

0 Answers  

---

Tell us why is naïve bayes machine learning algorithm naïve?

0 Answers  

---

Draw a flowchart to find the average of four number?

0 Answers  

---

What is local search algorithms?

0 Answers  

---

What is breath-first search algorithm?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

What is greedy best first search algorithm?

0 Answers  

---

Which search algorithm will use a limited amount of memory in an online search?

0 Answers  

---

Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

0 Answers  

---