# Recent activity by nilamd

1
2
total possible 4 digit numbers from 2,3,5,6,7,9 without repetition? total numbers possible less than 500? 360, 130 360, 100 240, 120 none
3
Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can store $512$ bytes of data. Consider a file stored in the disk. The file ... accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________________
4
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
5
#include<stdio.h> int main(){ int test=0; float a = 3424.34; printf("hello \n %d",(test? a: 3)); return 0; } It is giving output as hello 0 ,I am unable to understand the logic for this so plz clarify this .
6
1.Following key values are inserted into B+ tree where each node have 2 key values .The sum of keys present at height 1 (height is at 0) is 8,5,1,7,3,12,9,6 . 2.In a database field the search key field is 9 bytes long the block size is 512 bytes ... is 7 bytes .The largest possible order of a non leaf node in B+ Tree implementing this file structure{order defines max no. of keys present} is
7
The number of nodes of height $h$ in any $n$-element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.
8
9
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... that the memory is word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$
10
Consider a machine with a $2$-way set associative data cache of size $64$ $Kbytes$ and block size $16$ $bytes$. The cache is managed using $32$ $bi$t virtual addresses and the page size is $4$ $Kbytes$. A program to be run on this machine begins as follows: double ARR[ ... array $ARR$. The total size of the tags in the cache directory is: $32$ $Kbits$ $34$ $Kbits$ $64$ $Kbits$ $68$ $Kbits$
11
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above
12
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not possible but multiple ... interrupts and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible
13
Please provide codes for 0-9 decimal using 4311 code..i am little bit confused in it..I know the property that addition 9 makes it self complemetory..but how m nt understanding..plz help..
14
15
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S $\to$ {True, False} be a predicate defined on S. Suppose that P(a) = True, P(b) = False and P(x) $\implies$ P(y) for all $x, y \in S$ satisfying $x \leq y$, where $\implies$ ... = False for all x $\in$ S such that b ≤ x and x ≠ c P(x) = False for all x $\in$ S such that a ≤ x and b ≤ x
16
The only even prime is 2.
17
For a length of string n,how many transactions will be there for acceptance of the string? O(n) O(n^2) O(nlogn) O(n^3)
18
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a $\textit{write}$ operation by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... the names of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.