Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Phlegmatic
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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++; } }
What will be the time-complexity of the following ? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) { count++; } }
393
views
asked
Jun 21, 2018
Algorithms
time-complexity
+
–
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 ?
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.2k
views
asked
Jun 21, 2018
1
votes
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 ?
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...
264
views
asked
Jun 16, 2018
0
votes
1
answer
4
Self-Doubt
185
views
asked
Jun 9, 2018
Algorithms
algorithms
asymptotic-notation
test-series
+
–
1
votes
2
answers
5
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)$$
660
views
asked
Jun 8, 2018
Algorithms
algorithms
recurrence-relation
+
–
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 ?
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...
494
views
asked
Jun 8, 2018
Algorithms
algorithms
time-complexity
space-complexity
+
–
1
votes
1
answer
7
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$
1.1k
views
asked
May 27, 2018
Programming in C
data-structures
circular-linked-list
linked-list
+
–
0
votes
2
answers
8
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}$
365
views
asked
May 27, 2018
Programming in C
data-structures
compiler-design
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register