What is the asymptotic worst case complexity of the given pseudo code
for(i=0;i {
for(j=0;j {
c[i][j]=0;
for(k=0;k {
c[i][j]=c[i][j]+a[i][k]*b[k][j];
}
}
}
O(n)
O(1)
O(n^2
O(n^3)
Answer: Option D.
The least frequently used (LFU) page replacement algorithm requires_________
the page with the smallest count to be replaced.
the page with the longest count to be replaced.
the page with the smallest count was brought in, yet to be used.
the page with the longest count was brought in, yet to be used.
Answer: Option A.
Choose the valid statement
All variables are initialized to 0 after declaration
Only local and static variables have junk values
Static and global variables are automatically initialized to zero at the time of declaration
.jpg?null)
.jpg?null)
.jpg?null)
