Consider a memory system with cache access time of 10 nano sec (nsec) and a memory access time of 200 nano sec (nsec). if the effective access time is 10% more than the cache access time, what is the hit ratio? (access time= h*cache_access_time + (1-h)*mem_access_time)

How do i delete my account on this because i didn't read this agreements and also i put age at xd

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?

Acompany is hiring professionals for web designing. the firm is small with few resources. they want employees who possess problem-solving skills and can independently carry out responsibilities. which kind of employee should they select?