Recent questions tagged time-complexity
Register

Recent questions tagged time-complexity

Recent questions tagged time-complexity
0 votes
0 answers 13 views
#algorithms #timecomplexity
There a confusion about what should be the time complexity of the code... Involving modulo operator
Palash yadav asked in Algorithms Nov 12
by Palash yadav
135 points
13 views
0 votes
0 answers 98 views
Gate CSE 2012
The worst case running time to search for an element in a balanced binary search tree with n2^n elements is A. Theta (nlogn) B. Theta (n2^n) C. Theta (n) D. Theta (logn) I am confused about the term balanced here because though we know about AVL ... AVL tree here? And ofcourse I am also curious to know how to solve this question. I will be grateful for your opinions. Regards, Ananya
Ananya Nayak asked in DS Jul 3
by Ananya Nayak
5 points
98 views
0 votes
0 answers 38 views
Time and space complexity
There is an algorithm that took array of strings, sorted each string and then sorted the entire array.What would be the runtime?
SaileeDas asked in Algorithms Jun 28
by SaileeDas
5 points
38 views
0 votes
0 answers 21 views
#Algo_Coremen
In Master’s theorem T(n) = aT(n/b) + f(n), ‘a’ : Number of subproblems and ‘n/b’ : Size of the subproblem. Now, size of the subproblem can be expressed as ‘n/a’. Why do we need to use ‘b’?
Palash Nandi 1 asked in Algorithms Jun 23
by Palash Nandi 1
13 points
21 views
1 vote
0 answers 26 views
#self doubt #Time complexity #tree
1) Time complexity to construct a Binary tree when inorder and preorder/postorder traversal of the tree is given. a) if inorder sorted b) if inorder is not sorted. 2) If construct Binary tree when pre-order and postorder to the tree is given. .....… My answer: 1 a) O( nlogn) 1 b) O(nlogn) 2) O(2^n) Please check and correct Thanks
Hradesh patel asked in Algorithms Feb 27
by Hradesh patel
9 points
26 views
0 votes
0 answers 28 views
Time Complexity
What is the time complexity of the following code? #include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct{ char data; unsigned int freq; unsigned int parent, leftChild, rightChild; }HTNode, *HuffmanTree; typedef char** HuffmanCode; void ... HC; HuffmanTree HT; HuffmanCoding(HT, HC, word, c, len); PrintHuffmanCode(HC, word, c, len); return 0; }
byebey asked in Algorithms Feb 12
by byebey
5 points
28 views
0 votes
0 answers 57 views
GATE TIME COMPLEXITY
How to analyse the complexity for – for(i=2;i*i<=n;i++) like i know for i=2 it’ll run $\sqrt{n} $ times how to process further. sir zxy123, also which book i should refer for these as cormen or narsimha are not detailed for this topic.
donniedarko asked in Algorithms Jan 23
by donniedarko
39 points
57 views
2 votes
0 answers 60 views
GateBook Full Length Test
Which of the following statements is/are true/correct ? A) Professor Ram gives a comparison-based sorting algorithm that runs in T(n) = 2T(n-1)+ 1. There is not enough information to know whether Ram's algorithm is correct. B) Professor ... base 6) so this also should not be the time complexity of a comparison based sorting algorithm. Can anyone confirm?.Thanks in advance
Deterministic asked in Algorithms Dec 28, 2020
by Deterministic
31 points
60 views
0 votes
0 answers 18 views
Self_doubt, Code sample from Galvin:Implicit Threading (with few modifications)
Nikhil_dhama asked in Algorithms Aug 31, 2020
by Nikhil_dhama
227 points
18 views
0 votes
0 answers 48 views
Geekforgeeks Contest - Algorithms
Huffman coding is a lossless data compression algorithm. The most frequent character gets the smallest code and the least frequent character gets the largest code. Consider the following statements regarding Huffman coding algorithm? S1 : The time ... statements S1, S2, and S3 are correct. I am not getting proper explanation on Geekforgeeks for this question.
anurag_yo asked in Algorithms Aug 1, 2020
by anurag_yo
5 points
48 views
0 votes
1 answer 37 views
Time Complexity - Self Doubt Question
2207akash asked in Algorithms Jun 13, 2020
by 2207akash
5 points
37 views
0 votes
0 answers 73 views
https://www.youtube.com/watch?time_continue=1&v=mZjkxOknmhU&feature=emb_logo
Deb Prakash asked in Algorithms May 7, 2020
by Deb Prakash
5 points
73 views
0 votes
1 answer 61 views
Clrs book,mit Assignment
$T(n) =2^{n}T(n/2) +n^{n}$
Palash yadav asked in Algorithms May 5, 2020
by Palash yadav
135 points
61 views
0 votes
0 answers 17 views
GATE2007-15,ISRO2016-26 Video Solution
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
admin asked in Algorithms Apr 18, 2020
by admin
581 points
17 views
0 votes
0 answers 12 views
GATE2014-1-42 Video Solution
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.
admin asked in Algorithms Apr 18, 2020
by admin
581 points
12 views
0 votes
0 answers 23 views
GATE2008-40 Video Solution
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
admin asked in Algorithms Apr 18, 2020
by admin
581 points
23 views
0 votes
0 answers 24 views
GATE2003-66 Video Solution
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
admin asked in Algorithms Apr 18, 2020
by admin
581 points
24 views
0 votes
0 answers 15 views
GATE2007-45 Video Solution
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
admin asked in Algorithms Apr 18, 2020
by admin
581 points
15 views
Page:
Ask
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun