Hash - Statistics

General Stats
  • This quiz has been taken 1 time
  • The average score is 46 of 46
Answer Stats
Hint Answer % Correct
};
100%
}
100%
}
100%
};
100%
}
100%
}
100%
};
100%
}
100%
}
100%
for (int i = 0; i < N; i++) {
100%
if (InvTb[i].pid == pid && InvTb[i].pg == pg)
100%
if (rec->pid == pid && rec->pg == pg)
100%
if (rec->reg == global_reg && rec->pg == pg)
100%
int fr;
100%
int fr;
100%
int global_reg = local_to_global(pid, reg);
100%
hash funkce (pid+pg) int hashPg(int pid, int pg);
100%
hash funkce (reg+pg) int hashPg(int reg, int pg);
100%
local to global int local_to_global(int pid, int local_reg);
100%
int pg;
100%
int pg;
100%
int pg;
100%
pg2fr int pg2fr(int pid, int pg) {
100%
pg2fr int pg2fr(int pid, int reg, int pg) {
100%
pg2fr_inv int pg2fr_inv(int pid, int pg) {
100%
int pid;
100%
int pid;
100%
int reg;
100%
rec = rec->next;
100%
rec = rec->next;
100%
return -1;
100%
return -1;
100%
return -1;
100%
return i;
100%
return rec->fr;
100%
return rec->fr;
100%
HashTBRec struct HashTBRec {
100%
HashTBRec struct HashTBRec {
100%
struct HashTBRec *next;
100%
struct HashTBRec *next;
100%
struct HashTBRec *rec = hashTb[hashPg(global_reg, pg)];
100%
struct HashTBRec *rec = hashTb[hashPg(pid, pg)];
100%
invTBItem deklarace struct InvTBItem {
100%
velikost ramcove pameti struct InvTBItem InvTb[N];
100%
while (rec != NULL) {
100%
while (rec != NULL) {
100%
No matching quizzes found
Score Distribution
Percent of People with Each Score
Percentile by Number Answered
Your Score History
You have not taken this quiz