# Ace booklet functions page:152 q.no 44

1 vote
60 views
Let A, B, C are k element sets and let S be an n element set where k<=n. How many triples of functions f:A->S, g:B->S, h:C->S are there such that f, g and h are all injective and f(A) =g(B) =h(C) =?

## Related questions

1
482 views
In a cache organized memory there exist $30$% of compulsory misses, $10$% capacity misses, $12$% conflict misses. If cache is fully associative Find the average access time? ($t_{c} = 10ns$, $t_{m} = 100ns$) a). $10ns$ b). $40ns$ c). $50ns$ d). $62ns$