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  

---

Name search algorithm technology?

0 Answers  

---

What was deep learning, & how does it contrast with other machine learning algorithms?

0 Answers  

---

What is greedy best first search algorithm?

0 Answers  

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

A* algorithm is based on which search method?

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

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

0 Answers  

---

Why size of integer depends on the machine architecture then what the best sorting algorithm and why?

0 Answers   HPCL, Hughes Systique Corporation,

---

What are the disadvantages of breadth-first search algorithm?

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,

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

0 Answers  

---