Dark Mode

Recent activity by Phlegmatic

3 answers

1

Made easy work book
How to solve T (n)=T (sqrt n)+ n

answered in Algorithms Jun 22, 2018

343 views

15 answers

2

GATE CSE 2007 | Question: 15, ISRO2016-26
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$

answer selected in Algorithms Jun 22, 2018

26.4k views

1 answer

3

Self-Doubt
What will be the time-complexity of the following ? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) { count++; } }

commented in Algorithms Jun 21, 2018

223 views

1 answer

4

Self-Doubt
What is the time-complexity of Enqueue and Dequeue operations when Queue is implemented using linked list? What is the time complexity of inserting a element in single linked list ?

commented in DS Jun 21, 2018

935 views

1 answer

5

Virtual Memory
A demand paging system takes 250 time units to service a page fault and 450 time units to replace a dirty page. Memory access time is 10 time units. The probability of page faults is 0.3. In case of a page fault, the probability of page being dirty is 0.06. The average access time is ?

commented in Operating System Jun 16, 2018

172 views

3 answers

6

Time Complexity
What is the time complexity of the following code? for(i=n;i>=1;) i=i/2;

answered in Algorithms Jun 11, 2018

264 views

1 answer

7

asked in Algorithms Jun 9, 2018

123 views

3 answers

8

Self-Doubt
int main() { int i; for(i=1;i<=n;i++) f(i); } void f(int n) { int A[n]; int j; for(j=1;j<=n;j++) cout<<j; } What will be the time and space complexity of the following code snippet ?

answer selected in Algorithms Jun 8, 2018

264 views

2 answers

9

Self-Doubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$

commented in Algorithms Jun 8, 2018

417 views

1 answer

10

Self-Doubt
In a circular linked list last node points to the : $Head$ $Tail$ $First Node$

answer selected in Programming May 28, 2018

832 views

2 answers

11

Self-Doubt
Convert this infix expression to postfix form ? $3*log(x+1)*\dfrac{a}{2}$

commented in Programming May 28, 2018

268 views