0 votes
1 answer
1
What will be the time-complexity of the following ? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) { count++; } }
0 votes
1 answer
2
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 votes
1 answer
3
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...
0 votes
1 answer
4
1 votes
2 answers
5
What will be the solution of the following recurrence?$$T(n)=3T\sqrt{n}+\log(n)$$
0 votes
3 answers
6
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...
1 votes
1 answer
7
In a circular linked list last node points to the :$Head$$Tail$$First Node$
0 votes
2 answers
8
Convert this infix expression to postfix form ?$3*log(x+1)*\dfrac{a}{2}$