Recent questions tagged test_1 - GATE Overflow

+1 vote

1 answer

1

IIIT BLR TEST 1 : ALGORITHMS 3
Given an array of ( both positive and negative ) integers, $a_0,a_1,….a_{n-1}$ and $l, 1<l<n$. Design a linear time algorithm to compute the maximum product subarray, whose length is atmost $l$.

asked Aug 27 in Algorithms by Shaik Masthan Veteran (64.8k points) | 206 views

0 votes

1 answer

2

IIIT BLR TEST 1 : ALGORITHMS 2
A 3 way (ternary) min heap is a 3 way ( ternary - each node as atmost three children nodes, left, mid, right ) complete tree with min heap property ( value of the parent is less than the value of the children ) satisfied at every node ... c) In Heapsort, binary heap is preferred over ternary heap. State if this statement is true or false, you must justify your answer.

asked Aug 27 in Algorithms by Shaik Masthan Veteran (64.8k points) | 100 views

0 votes

1 answer

3

IIIT BLR TEST 1 : ALGORITHMS 1
Solve the following recursions ( in terms of Θ ). T(0) = T(1) = Θ(1) in all of the following. $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$ $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$

asked Aug 27 in Algorithms by Shaik Masthan Veteran (64.8k points) | 119 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged test_1

50,645 questions

56,556 answers

195,715 comments

101,582 users