Register
Filter

Questions by $ourav

1 votes
2 answers
1
#Recursion Tree
Solve using Recursion Tree method. $T(n) = T(n-1) \ + \ T(\frac n 2) \ + \ n$
Solve using Recursion Tree method.$T(n) = T(n-1) \ + \ T(\frac n 2) \ + \ n$
6 votes
2 answers
3
T(n) = T(n-1) + T(n/2) + n
Consider the recurrence relation T(n) = T(n-1) + T(n/2) + n Which of the following is a good tight upper bound on T(n) (a) $\Theta (n^{2})$ (b) $\Theta (n^{2}\log n)$ (c) $\Theta (2^{(\log n)^{2}})$ (d) $\Theta (n^{(\log n)^{2}})$
Consider the recurrence relation T(n) = T(n-1) + T(n/2) + nWhich of the following is a good tight upper bound on T(n)(a) $\Theta (n^{2})$(b) $\Theta (n^{2}\log n)$(c) $\T...
1 votes
1 answer
5
Cache Capacity
Consider a 8 million word physical memory and 256 block cache, both partitioned into 64 word blocks. Find the tag memory required for cache memory for the following mapping techniques: a) Direct b) Associative c) 4-way Set Associative
Consider a 8 million word physical memory and 256 block cache, both partitioned into 64 word blocks.Find the tag memory required for cache memory for the following mappin...
0 votes
0 answers
6
Banker's Algorithm
Suppose a system has m resources and n processes. The Banker's algorithm was used to check the state for safety, which was found to be proportional to $m^{a}n^{b}$ for sufficiently large values of m and n. What is a and b ?
Suppose a system has m resources and n processes. The Banker's algorithm was used to check the state for safety, which was found to be proportional to $m^{a}n^{b}$ for su...
0 votes
2 answers
7
Avg. disk access time.
What is the average access time for transferring 512 bytes of data with the following specification : Avg. seek time = 5ms Disk Rotation = 6000rpm, 40kbps Controller Overhead = 0.1ms
What is the average access time for transferring 512 bytes of data with the following specification :Avg. seek time = 5msDisk Rotation = 6000rpm, 40kbpsController Overhea...
2 votes
1 answer
8
Cache Hit Ratio
A processor refers to the cache memory 1000 times. Out of which 150 references are resulting in misses due to conflicts, 100 of them are due to capacity limitations and 100 of them are due to compulsory page faults. Calculate the hit ratio for direct mapping and associative mapping.
A processor refers to the cache memory 1000 times. Out of which 150 references are resulting in misses due to conflicts, 100 of them are due to capacity limitations and 1...
0 votes
1 answer
9
Multilevel Cache
A system is employing 3 level cache memory. The access time of L1, L2, L3 memories is 100 ns/word, 150 ns/word, 500 ns/word. The L2 and L3 memories are divided into a block of 5 words. When a page fault occurs in L1 or L2, the processor must read from L3 memory only. The hit ratio H1, H2 are 80%, 90%. What is Tavg?
A system is employing 3 level cache memory. The access time of L1, L2, L3 memories is 100 ns/word, 150 ns/word, 500 ns/word. The L2 and L3 memories are divided into a blo...
0 votes
2 answers
10
Cache
Consider a system with 2 level cache. The access times of L1-Cache, L2-Cache and Main Memory are 1ns, 10ns and 500ns. The hit rate of L1 and L2 caches are 0.8 and 0.9 respectively. What is the average access time ?
Consider a system with 2 level cache. The access times of L1-Cache, L2-Cache and Main Memory are 1ns, 10ns and 500ns. The hit rate of L1 and L2 caches are 0.8 and 0.9 res...
0 votes
0 answers
11
Find complement of the languages ?
Find the complements of these languages : 1. $ww^{R}$ {w | w ∈ $(0,1)^{*}$ } 2. $wcw^{R}$ {w | w ∈ $(0,1)^{*}$ } 3. ww {w | w ∈ $(0,1)^{*}$ }
Find the complements of these languages :1. $ww^{R}$ {w | w ∈ $(0,1)^{*}$ }2. $wcw^{R}$ {w | w ∈ $(0,1)^{*}$ }3. ww {w | w ∈ $(0,1)^{*}$ }
0 votes
1 answer
12
Construct a grammar for the language ?
${ 0^{n}1^{m} | n \leq m \leq 2n }$
${ 0^{n}1^{m} | n \leq m \leq 2n }$
0 votes
1 answer
13
What is the language accepted by the Grammar ?
S → S0S1S0S | S0S0S1S | S1S0S0S | ϵ
S → S0S1S0S | S0S0S1S | S1S0S0S | ϵ
0 votes
1 answer
14
Postal Correspondence GATE 2017
I want to enroll for a postal correspondence to prepare for GATE-2017. I am a bit confused, should i go for 'Made Easy' or 'ACE Academy'. Which one is the best among the 2 in terms of: - Quality of Material - Error Percentage - GATE Syllabus Coverage A sincere suggestion will be appreciated.
I want to enroll for a postal correspondence to prepare for GATE-2017.I am a bit confused, should i go for 'Made Easy' or 'ACE Academy'.Which one is the best among the 2 ...
2 votes
3 answers
15
Doubt on logarithms
What is the difference among the following: $\log^²n , \log n^², \log\log n, (\log n)^²$
What is the difference among the following:$\log^²n , \log n^², \log\log n, (\log n)^²$
0 votes
0 answers
16
How to propose a recurrence equation for a given DFA over a set of q states?