Register
Filter

Questions by pC

0 votes
0 answers
1
Predict the output and give explanation
#include <stdio.h> int main(void) { int i=10; printf(" %d %d %d",i==10,i=40,i>15 ); } Concepts undefined behavior floating point representation
#include <stdio.h>int main(void) { int i=10; printf(" %d %d %d",i==10,i=40,i>15 );} Conceptsundefined behaviorfloating point representation
3 votes
1 answer
3
Analysis Of Prims Algorithm Time Complexity
Explain Prims Algorithm Analysis Of Time Complexity How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
1 votes
0 answers
6
Recurrence Realtion Soution and Time Complexity
$T(n)= \begin{Bmatrix} 2^{n}T(n-1)+c& n>0\\ 1 & n=0 \end{Bmatrix}$
$T(n)= \begin{Bmatrix} 2^{n}T(n-1)+c& n>0\\ 1 & n=0 \end{Bmatrix}$
5 votes
3 answers
14
B Tree and B+ Tree
Consider a DBMS that has the following characteristics: 2KB fixed-size blocks 12-byte pointers 56-byte block headers We want to build an index on a search key that is 8 bytes long. Calculate the maximum number of records we can index with a) a 3-level B+ tree (2 levels plus the root) b) a 3-level B tree
Consider a DBMS that has the following characteristics:2KB fixed-size blocks12-byte pointers56-byte block headersWe want to build an index on a search key that is 8 bytes...
0 votes
0 answers
15
Merge Sort - Miximum Input Size
Assume that a merge sort algorithm in worst case takes30s for an input of size 64. Which of the following closely approximate maximum input size of a problem that can be solved in 6min. 128 256 512 1024
Assume that a merge sort algorithm in worst case takes30s for an input of size 64. Which of the following closely approximate maximum input size of a problem that can be ...
2 votes
2 answers
16
Cache Memory Performance Gain
Suppose the cache memory is 100 times faster than main memory and it is used 50% of the time. The performance is gained by introducing this cache is __________.
Suppose the cache memory is 100 times faster than main memory and it is used 50% of thetime. The performance is gained by introducing this cache is __________.
0 votes
0 answers
20
Interrupts Mode Shifting
When compiler finds there is a System Call then what are the activitites taking place ? Activities involved in Mode shifting process from user to kernal mode and back.
When compiler finds there is a System Call then what are the activitites taking place ?Activities involved in Mode shifting process from user to kernal mode and back.
Page: