Register
Filter

Recent activity by Harshitkmr

5 answers
1
ISRO2020-55
If $x+2y=30$, then $\left(\dfrac{2y}{5}+\dfrac{x}{3} \right) + \left (\dfrac{x}{5}+\dfrac{2y}{3} \right)$ will be equal to $8$ $16$ $18$ $20$
If $x+2y=30$, then $\left(\dfrac{2y}{5}+\dfrac{x}{3} \right) + \left (\dfrac{x}{5}+\dfrac{2y}{3} \right)$ will be equal to$8$$16$$18$$20$
1 answer
2
Pipeline
A pipelined Processor contains 5 instructions stages of execution times 120ns, 160ns, 105 ns, 135ns and 155ns with a register delay 10ns on each stage. What is the percentage of performance increased with 1000 instructions instead of 10 instructions
A pipelined Processor contains 5 instructions stages of execution times 120ns, 160ns, 105 ns, 135ns and 155ns with a register delay 10ns on each stage. What is the percen...
4 answers
3
Ace Test Series: Algorithms - Sorting
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n - n + 1 (C) n log n (D) n log n + n
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is(A) (n log n) / 2(B) n ...
2 answers
4
Practice book
Question no 11.
Question no 11.
3 answers
5
Self doubt
Virtual memory increases context switching overhead ? Why why not ?
Virtual memory increases context switching overhead ? Why why not ?
3 answers
7
INTERESTING QUESTION ON ER DIAGRAMS
How many minimum number of tables are required for this ER Diagram?
How many minimum number of tables are required for this ER Diagram?
1 answer
11
Parity Check Self Doubt
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?
10 answers
20
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Consider the following functions$f(n) = 3n^{\sqrt{n}}$$g(n) = 2^{\sqrt{n}{\log_{2}n}}$$h(n) = n!$Which of the following is true?$h(n)$ is $O(f(n))$$h(n)$ is $O(g(n))$$g(n...
1 answer
23
Transaction self doubt
Is it recoverable and why?
Is it recoverable and why?
2 answers
25
Galvin Edition 9 Exercise 4 Question 9 (Page No. 192)
Can a multithreaded solution using multiple user-level threads achieve better performance on a multiprocessor system than on a single processor system ? Explain.
Can a multithreaded solution using multiple user-level threads achieve better performance on a multiprocessor system than on a single processor system ? Explain.
1 answer
26
Galvin Edition 9 Exercise 4 Question 8 (Page No. 192)
Which of the following components of program state are shared across threads in a multithreaded process ? a. Register values b. Heap memory c. Global variables d. Stack memory
Which of the following components of program state are shared across threads in a multithreaded process ?a. Register valuesb. Heap memoryc. Global variablesd. Stack memor...
2 answers
29
Test question
Consider the join of a relation R with a relation S. If R has 100 tuples and S has 9 tuples then the maximum and minimum sizes of the join respectively under referential integrity constraint: 9 and 0 9 and 9 9+100 and 0 9*100 and 9
Consider the join of a relation R with a relation S. If R has 100 tuples and S has 9 tuples then the maximum and minimum sizes of the join respectively under referential ...
2 answers
30
ISRO2016-51
For the real time operating system, which of the following is the most suitable scheduling scheme? Round robin First come first serve Pre-emptive Random scheduling
For the real time operating system, which of the following is the most suitable scheduling scheme?Round robinFirst come first servePre-emptiveRandom scheduling