search
Log In

Recent activity by Lakshman Patel RJIT

3 answers
1
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ then the order of these elements after second pass of the algorithm is: $8, \ 9, \ 15, \ 20, \ 47, \ 4, \ 12, \ 17, \ 30, \ 40$ ... $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
answer edited 1 day ago in Algorithms 13.4k views
5 answers
2
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)
answer edited 1 day ago in Algorithms 8.8k views
3 answers
3
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
edited May 2 in Databases 4.3k views
6 answers
4
Consider numbers represented in 4-bit Gray code. Let $ h_{3}h_{2}h_{1}h_{0}$ be the Gray code representation of a number $n$ and let $ g_{3}g_{2}g_{1}g_{0}$ be the Gray code of $ (n+1)(modulo 16)$ ... $ g_{3}(h_{3}h_{2}h_{1}h_{0})=\sum (0,1,6,7,10,11,12,13) $
answer edited May 2 in Digital Logic 11.2k views
4 answers
5
Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order$P_1, P_2, P_3, P_4$ ... absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to $2$ decimal places is_______
answer edited May 2 in Operating System 3.9k views
2 answers
6
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds to The normalized value $2^{-127}$ The normalized value $2^{-126}$ The normalized value $+0$ The special value $+0$
answer edited May 2 in Digital Logic 8.5k views
3 answers
7
Consider a relational table $R$ that is in $3NF$, but not in BCNF. Which one of the following statements is TRUE? $R$ has a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a prime attribute. $R$ has a nontrivial functional dependency ... $X$ is a proper subset of some key A cell in $R$ holds a set instead of an atomic value.
answer edited May 2 in Databases 2.2k views
5 answers
8
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two insertions made ... Statements (i) and (ii) are true Statements (ii) and (iii) are true Statements (iii) and (i) are true All the statements are false
answer edited May 1 in Databases 7.7k views
3 answers
9
A computer uses $32-bit$ virtual address, and $32-bit$ physical address. The physical memory is byte addressable, and the page size is $4$ $\text{kbytes}$ . It is decided to use two level page tables to translate from virtual address to physical ... entries that can be contained in each page? How many bits are available for storing protection and other information in each page table entry?
answer edited Apr 30 in Operating System 7k views
12 answers
10
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
answer edited Apr 30 in Operating System 13.3k views
4 answers
11
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate? $2$ $4$ $5$ $6$
answer edited Apr 30 in Digital Logic 6.8k views
2 answers
12
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is $101010\ldots1010$ $100000\ldots 0001$ $111111\ldots 1111$ $011111\ldots1110$
edited Apr 30 in Digital Logic 4k views
4 answers
13
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
answer edited Apr 30 in Digital Logic 9k views
5 answers
14
Consider the following relations $A, B$ and $C:$ ... of $A\cup B$ is the same as that of $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$
answer edited Apr 30 in Databases 14.9k views
3 answers
15
6 answers
16
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{- byte}$ ... of $\text{N}$ instructions, each with a floating point register operand $\text{(1F)}.$ The maximum value of $\text{N}$ is _________.
answer edited Apr 29 in CO and Architecture 13.8k views
7 answers
17
A processor has $64$ registers and uses $16$-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a $4$-bit immediate value. Each R-type instruction contains an opcode and two register names. If there are $8$ distinct I-type opcodes, then the maximum number of distinct R-type opcodes is _______.
answer edited Apr 29 in CO and Architecture 11k views
4 answers
18
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write operation with a hit in cache and $10$ nanoseconds for a write operation with a ... operations. The cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.
edited Apr 29 in CO and Architecture 13.5k views
2 answers
19
An $8\text{KB}$ direct-mapped write-back cache is organized as multiple blocks, each size of $32\text{-bytes}$. The processor generates $32\text{-bit}$ addresses. The cache controller contains the tag information for each cache block comprising of the following. $1$ valid ... needed at the cache controller to store meta-data (tags) for the cache? $4864$ bits $6144$ bits $6656$ bits $5376$ bits
edited Apr 29 in CO and Architecture 6.8k views
7 answers
20
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ nanoseconds, $20$ nanoseconds ... $L1$ cache. What is the total time taken for these transfers? $222$ nanoseconds $888$ nanoseconds $902$ nanoseconds $968$ nanoseconds
edited Apr 29 in CO and Architecture 16k views
8 answers
21
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ nanoseconds, $20$ ... from $L2$ cache to $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds
edited Apr 29 in CO and Architecture 21.8k views
1 answer
22
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys: There is a main hash table of size $4$. The $2$ least significant bits of a key is used to index into the main hash table. Initially, the main hash table entries are empty. Thereafter, when more keys are hashed into it, to resolve ... in decimal notation)? $5,9,4,13,10,7$ $9,5,10,6,7,1$ $10,9,6,7,5,13$ $9,5,13,6,10,14$
answer edited Apr 29 in Algorithms 523 views
5 answers
23
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } The space complexity of the above code is? $O(1)$ $O(n)$ $O(n!)$ $n^n$
answer edited Apr 28 in Programming 11.2k views
12 answers
24
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); fun1(++n); printf("%d", n); } The output printed when $\text{fun1}(5)$ is called is $53423122233445$ $53423120112233$ $53423122132435$ $53423120213243$
answer edited Apr 28 in Programming 10.2k views
8 answers
25
4 answers
26
Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram? Diamonds with double/bold border Rectangles with double/bold border Ovals with double/bold border Ovals that contain underlined identifiers
answer edited Apr 27 in Databases 4.5k views
4 answers
27
Consider a relational database containing the following schemas. $\begin{array}{c} \text{Catalogue} \end{array} $ ... (cost) FROM Catalogue WHERE pno = P4' GROUP BY pno) ; The number of rows returned by the above SQL query is $4$ $5$ $0$ $2$
answer edited Apr 27 in Databases 4.3k views
2 answers
28
Choose the word most similar in meaning to the given word: Awkward Inept Graceful Suitable Dreadful
edited Apr 27 in Verbal Aptitude 797 views
2 answers
29
Given below are two statements followed by two conclusions. Assuming these statements to be true, decide which one logically follows. Statements: All film stars are playback singers. All film directors are film stars. Conclusions: All film directors are playback singers ... Only conclusion I follows. Only conclusion II follows. Neither conclusion I nor II follows. Both conclusions I and II follow.
edited Apr 27 in Analytical Aptitude 1.4k views
2 answers
30
Choose the most suitable one word substitute for the following expression: Connotation of a road or way Pertinacious Viaticum Clandestine Ravenous
edited Apr 27 in Verbal Aptitude 2.4k views
...