Dark Mode

Questions by Phlegmatic

0 votes

1 answer

1

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++; } }

asked in Algorithms Jun 21, 2018

223 views

0 votes

1 answer

2

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 ?

asked in DS Jun 21, 2018

934 views

1 vote

1 answer

3

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 ?

asked in Operating System Jun 16, 2018

172 views

0 votes

1 answer

4

asked in Algorithms Jun 9, 2018

123 views

1 vote

2 answers

5

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

asked in Algorithms Jun 8, 2018

417 views

0 votes

3 answers

6

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 ?

asked in Algorithms Jun 8, 2018

264 views

1 vote

1 answer

7

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

asked in Programming May 27, 2018

831 views

0 votes

2 answers

8

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

asked in Programming May 27, 2018

268 views