# Recent posts tagged iisc-csa-research

1
@Arjun Sir query is correlated.. For each Professor P it checks inner query. If it is nested then NOT EXISTS always return false but here inner query relates outer query by correlated variable P.. Is it not so ??
2
Yeah why not you have found a solution it cab be one of the option but always choose the best one
3
A only. B is false as for a single tuple, dname cannot be both 'shoe' as well as 'toy' and hence this query returns {}.
4
Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order? SLR, LALR Canonical LR, LALR SLR, canonical LR LALR, canonical LR
5
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
7
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
8
B. Worst case for quick sort happens when $1$ element is on one list and $n-1$ elements on another list.
9
Sir , I still have 2 doubts regarding this.. 1)If semaphore mutex is binary semaphore and its initial value is 1....then what would be the value of mutex after executing signal(mutex)( bcoz if it do 1+1 then it would become 0 with a carry of 1)? ... by critical section followed by signal(mutex) or signal(mutex) occurs first by followed by critical section followed by wait(mutex)...in process Pn?
10
A computer has a $256\text{-KByte}$, 4-way set associative, write back data cache with block size of $32\text{-Bytes}$. The processor sends $32\text{-bit}$ addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, $2$ valid bits, $1$ modified bit and $1$ replacement bit. The number of bits in the tag field of an address is $11$ $14$ $16$ $27$
11
First we need to find different number of inputs for $f$ given that permutations are equivalent. Now given two binary string $x,y$: $x$ is a permutation of $y$ iff $x$ has same number of ones and zeros as $y$. So the total number of different inputs is n+1 ( namely input with ... $2^{n + 1}.$
To see more, click for the full list of questions or popular tags.