Register
Filter

Recent activity by Phlegmatic

3 answers
1
Made easy work book
How to solve T (n)=T (sqrt n)+ n
How to solve T (n)=T (sqrt n)+ n
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++; } }
What will be the time-complexity of the following ? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) { count++; } }
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 ?
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 lin...
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 ?
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 pa...
3 answers
6
Time Complexity
What is the time complexity of the following code? for(i=n;i>=1;) i=i/2;
What is the time complexity of the following code?for(i=n;i>=1;)i=i/2;
1 answer
7
Self-Doubt
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 ?
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 cod...
2 answers
9
Self-Doubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$
What will be the solution of the following recurrence?$$T(n)=3T\sqrt{n}+\log(n)$$
1 answer
10
Self-Doubt
In a circular linked list last node points to the : $Head$ $Tail$ $First Node$
In a circular linked list last node points to the :$Head$$Tail$$First Node$
2 answers
11
Self-Doubt
Convert this infix expression to postfix form ? $3*log(x+1)*\dfrac{a}{2}$
Convert this infix expression to postfix form ?$3*log(x+1)*\dfrac{a}{2}$