Forum Replies Created
-
-
I think the answer to your 2nd question should be A.
And i think there is some mistyping in the line of ques 3 “there are 100 refreshes per 1 ns and eash refresh takes 100 ns”, due to which m unable to understand the question. And since ques 4 is linked to ques 3, i wont be able to try that as well.
-
The answer to your first question is D. Since inclusion property says that the higher levels of memory should have all the data of all the lower levels. Its doesnt talk about the consistency of the data. Thus, for all the data to be present in the higher level of cache, the higher level should be atleast as big as the lower level.
-
Super key is super set of attributes forming a key, primary key is the exact set of attributes which serve the purpose of identifying any tuple in a relation while a candidate key is any set of attributes which has the unique property, and they can be a primary key. Basically a primary key is also first a candidate key, there can be several candidate keys in a relation, among which one primary key can be choosen to identify the tuples in the relation… while taking super set of any of the candidate key makes it a super key.
-
Bt the question is, do we have sufficient time to learn english or vocab now???
I have been trying to improve my speaking and vocab knowledge since my childhood, but have always failed in it… may be i never tried that seriously because, there was no such urgent need of it.. or because language literature is something, i have always been bad it. So should i try to prepare vocab for GATE??? i mean it seems kind of impossible to me to memorize innumerous english word and their meanings?? i can understand how can someone prepare vocab?? and if the GATE ppl are testing the vocab knowledge,arent they jst testing the memorizing skill of the student???I hate VOcab 🙁 why do one have to prove his ability by showing his memorizing skills…? 🙁
-
global int i=100, j=5;
void P(x){
int i=10;
print(x+10);
i=200;
j=20;
print(x);
}
main(){
P(i+j);
}
If the programming language uses dynamic scoping and call by name parameter passing mechanism, the values printed by the above program are
(A) 115, 220
(B) 25,220
(C) 25,15
(D) 115,105