Recent questions in Algorithms

0 votes

1 answer

1

Time complexity
Please help to find the time complexity of this loop. void main() { int n; while(n>=1) { n=n-2; } }

asked 18 hours ago in Algorithms by Devshree Dubey Boss (13.6k points) | 17 views

0 votes

2 answers

2

Self doubt
O(n-1)+O(n)=O(n) O(n/2)+O(n)=O(n) but O(1)+O(2)+O(3)+...+O(n)=O(n(n+1)/2)=O(n^2) why?

asked 1 day ago in Algorithms by Tanuj Guha Thakurta (153 points) | 18 views

0 votes

0 answers

3

Data Structure and Algorithm for Gate by Narasimha Karumanchi# Algorithm Introduction#

asked 1 day ago in Algorithms by Prakhar Garg (49 points) | 34 views

0 votes

0 answers

4

Time complexity
Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) }

asked 4 days ago in Algorithms by syncronizing Junior (945 points) | 55 views

0 votes

2 answers

5

NTA NET DEC 2018
[closed]

asked Mar 12 in Algorithms by Kuljeet Shan Junior (627 points) | 32 views

0 votes

0 answers

6

NTA NET DEC 2018
[closed]

asked Mar 12 in Algorithms by Kuljeet Shan Junior (627 points) | 31 views

0 votes

1 answer

7

Rosen ch.3
Q.1 :Give a big-O estimate for f(n)=3n log(n!) + ($n^2$+3)log n, where n is positive integer Answer is given as O($n^2$ logn), Why it is not O($n^3$)? Q.2: Find the least integer n such that f(x) is O($x^n$) f(x)=2$x^2$ + $x^3$logx here n is given as 4, why it can not be 3??

asked Mar 12 in Algorithms by himgta Active (3.8k points) | 45 views

0 votes

1 answer

8

Made Easy Workbook
Suppose that you are running Dijkstra’s algorithm on the edge-weighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of each vertex after vertex E has been deleted from the priority queue and relaxed. Vertex Distance Parent A 0 Null B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What could be the possible value of expression x+y?

asked Mar 10 in Algorithms by noob_coder (141 points) | 58 views

0 votes

1 answer

9

Internal Path Length of BST
Consider the following binary tree with root at level 0. What is the internal path length for the above tree? 31 14 29 32

asked Mar 10 in Algorithms by s_dr_13 (91 points) | 39 views

+1 vote

1 answer

10

Asymptotic Notations
Q1) f(n) = n^(1-sin n) g(n) = n^(1+cos n) Relation between them ? Q2) f(n) = n^(1-sin n) g(n) = n^(2+cos n ) Relation between them ?

asked Mar 7 in Algorithms by Ashish Roy 1 (143 points) | 39 views

0 votes

0 answers

11

Hashing
Consider an open address hash table with uniform hashing. Out of 10 locations, 8 are occupied. What are the expected number of probes in an unsuccessful and successful search respectively?

asked Mar 6 in Algorithms by s_dr_13 (91 points) | 52 views

0 votes

1 answer

12

JEST 2019
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0 What is the time complexity?

asked Feb 17 in Algorithms by vivek_mishra (401 points) | 109 views

0 votes

0 answers

13

JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)

asked Feb 17 in Algorithms by dan31 Junior (689 points) | 61 views

0 votes

1 answer

14

JEST Sample Question 1-d
T (n) = T (n/2) + 2; T (1) = 1 When n is a power of 2, the correct expression for T (n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D)2 log n + 1

asked Feb 15 in Algorithms by sripo Active (1.5k points) | 96 views

0 votes

1 answer

15

JEST Sample Question-4
A tournament is a directed graph in which there is exactly one directed edge between every pair of vertices. Let Tn be a tournament on n vertices. (a) Use induction to prove the following statement: Tn has a directed hamiltonian path (a directed ... or a simple description of the steps in the algorithm, will suffice. What is the worst case time complexity of your algorithm?

asked Feb 15 in Algorithms by sripo Active (1.5k points) | 50 views

0 votes

1 answer

16

JEST Sample Question-5
Describe two different data structures to represent a graph. For each such representation, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation.

asked Feb 15 in Algorithms by sripo Active (1.5k points) | 25 views

0 votes

0 answers

17

self doubt
https://gateoverflow.in/86225/gate1990-13b for part a i think O(n^2) becz every tym we need to traverse whole chain.. ?

asked Feb 14 in Algorithms by eyeamgj Loyal (6.7k points) | 75 views

0 votes

1 answer

18

self doubt
Can we solve fractional knapsack using dynamic programming?

asked Feb 14 in Algorithms by DIYA BASU (261 points) | 43 views

0 votes

0 answers

19

iit written test

asked Feb 14 in Algorithms by utpal podder (375 points) | 108 views

0 votes

2 answers

20

iit written test
what is the time complexity to find the determinant of a n*n upper triangular matrix in terms of n?

asked Feb 13 in Algorithms by utpal podder (375 points) | 72 views

0 votes

1 answer

21

mid exam
Hi everyone. I’ve gone through this two issues and solved them, please correct me if something looks wrong. thanks. sum1=0 for(k=1; k<=n; k*2) for(j=1; j <= n; j++) sum1++; Sigma from k=1 to n/2 sigma from j=1 to n (1) = Sigma from k=1 to n/2 (n)= n/2 * n = n^2/2 sum2=0; for(k=1;k<=n;k*=2) for(j=1; j<=k; j++) sum2++; (n/2(n/2-1))/2=((n^2/4)-(n/2))/2=(n^2-2n)/n

asked Feb 11 in Algorithms by miller (37 points) | 30 views

0 votes

0 answers

22

Gate 2019: Subsequence Sum
[closed]

asked Feb 8 in Algorithms by HeartBleed (485 points) | 111 views

+2 votes

2 answers

23

GATE2019-20
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to $2$ decimal places) is ________

asked Feb 7 in Algorithms by Arjun Veteran (386k points) | 2.4k views

+2 votes

4 answers

24

GATE2019-25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________

asked Feb 7 in Algorithms by Arjun Veteran (386k points) | 2.3k views

+2 votes

8 answers

25

GATE2019-26
Consider the following C function. void convert (int n ) { if (n<0) printf{ %d , n); else { convert(n/2); printf( %d , n%2); } } Which one of the following will happen when the function convert is called with any positive integer ... reverse order and terminate It will print the binary representation of $n$ but will not terminate It will not print anything and will not terminate

asked Feb 7 in Algorithms by Arjun Veteran (386k points) | 3.6k views

+1 vote

6 answers

26

GATE2019-37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$

asked Feb 7 in Algorithms by Arjun Veteran (386k points) | 3.3k views

0 votes

0 answers

27

textbook
please gie the answer

asked Feb 6 in Algorithms by suneetha Junior (549 points) | 81 views

0 votes

1 answer

28

self doubt
For longest common subsequence the total number of subsequence possible for the word DIYA should be 2^4 or (2^4)-1??Please explain.

asked Feb 6 in Algorithms by DIYA BASU (261 points) | 85 views

0 votes

1 answer

29

textbook
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?

asked Feb 5 in Algorithms by suneetha Junior (549 points) | 81 views

–1 vote

1 answer

30

Gate cse 2019
Ans for median of n arrays qsn? Min no of NOR gates? Ans for predicate logic?

asked Feb 4 in Algorithms by Mounikap (267 points) | 996 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions in Algorithms

Recent Posts

Recent Blog Comments