Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Harshitkmr
0
votes
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$
3.0k
views
answered
Jun 17, 2020
Quantitative Aptitude
isro-2020
quantitative-aptitude
easy
lcm-hcf
+
–
0
votes
2
Self doubt
Virtual memory increases context switching overhead ? Why why not ?
Virtual memory increases context switching overhead ? Why why not ?
715
views
answered
May 11, 2020
Operating System
operating-system
virtual-memory
context
context-switch
+
–
1
votes
3
Round Robin Scheduling
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request consumes 20 ms of CPU time after which it spends 10 ms of time on I/O,thereafter ... ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request co...
2.7k
views
answered
May 10, 2020
Operating System
round-robin-scheduling
process-scheduling
operating-system
+
–
0
votes
4
Made Easy Subject Test 2019: Computer Networks - Congestion Control
I thought 2600 cause after 34, it takes one RTT and size becomes 36 before sending the 14th segment(i.e., segment with window size = 36KB). Questions based on this are confusing. Please clarify.
I thought 2600 cause after 34, it takes one RTT and size becomes 36 before sending the 14th segment(i.e., segment with window size = 36KB). Questions based on this are c...
688
views
answered
Apr 12, 2020
Computer Networks
computer-networks
congestion-control
made-easy-test-series
+
–
0
votes
5
GATE CSE 2015 Set 1 | Question: 19
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is $m,$ then the sequence number of the subsequent segment is always ... always less than or equal to the advertised window. III only I and III only I and IV only II and IV only
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?If the sequence number ...
19.0k
views
answered
Apr 12, 2020
Computer Networks
gatecse-2015-set1
computer-networks
tcp
normal
+
–
0
votes
6
what is the throughput of channel
A broadcast channel has 10 nodes and total capacity of 10 Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 80 μs to poll the next node. Whenever a node is polled, it is allowed to ... The maximum throughput of the broadcast channel is A) 1 Mbps B) 100/11 Mbps C) 10 Mbps D) 100 Mbps please explain
A broadcast channel has 10 nodes and total capacity of 10 Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 80 μs...
3.1k
views
answered
Apr 10, 2020
Computer Networks
lan-technologies
mac-protocol
+
–
0
votes
7
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?
1.7k
views
answered
Apr 10, 2020
Computer Networks
computer-networks
error-detection
error-correction
+
–
0
votes
8
Self Doubt - Quick Sort
Consider the following inputs: 1) 2 2 2 2 2 2 2 2) 1 2 3 4 5 6 7 3) 7 6 5 4 3 2 1 In all three cases, the worst-case time complexity of quicksort is O(n2) My doubt is if I am taking the middle element as a pivot, ... ), right? Can someone explain how we are saying worst-case time complexity for these three cases is O(n2) irrespective of the selection of the pivot element?
Consider the following inputs:1) 2 2 2 2 2 2 22) 1 2 3 4 5 6 73) 7 6 5 4 3 2 1In all three cases, the worst-case time complexity of quicksort is O(n2) My doubt is if I am...
917
views
answered
Mar 28, 2020
Algorithms
algorithms
quick-sort
time-complexity
+
–
1
votes
9
Hashing
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3? 3/m 2/m2 3/m2 2/m Please explain the solution.
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is ...
3.3k
views
answered
Mar 28, 2020
Algorithms
hashing
data-structures
algorithms
uniform-hashing
+
–
0
votes
10
#doubt on heaps and binary search
Consider the process of inserting an element into a max heap, where the max heap is represented by an array.Suppose we perform a binary search on the path from the new leaf to the root to find the position for newly inserted element, the ... logn) as upon applying binary search we wud compare O(logn) elements(neighbours and its own root only) plz clr my confusion
Consider the process of inserting an element into a max heap, where the max heap is represented by an array.Suppose we perform a binary search on the path from the new le...
843
views
answered
Mar 23, 2020
Algorithms
algorithms
data-structures
binary-search
+
–
0
votes
11
GATE Overflow | Mock GATE | Test 1 | Question: 45
Consider the following modified Heapify and Build_heap procedure. void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right <=n) { if ((A[left] > A[right] && A[left]< A[i]) || A[left]<A[right] & ... $6 \: 8 \: 1 \: 9 \: 4$ $9 \: 6 \: 1 \: 8 \: 4$ $6 \: 9 \: 1 \: 8 \: 4$
Consider the following modified Heapify and Build_heap procedure.void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right...
1.1k
views
answered
Mar 23, 2020
Algorithms
go-mockgate-1
algorithms
data-structures
binary-heap
+
–
0
votes
12
Counting No of Trees - College Exam
Want help with part (a). Other parts can be done accordingly. According to the solution, I understand how to find the limits of the sum, but why is there a factor of 2 with T(k) * T(n-k-1), according to my understanding it should not be there ... ) is the count of right sub-trees, so there are only T(k)*T(n-k-1) possibilities for each k, sum over the limits
Want help with part (a). Other parts can be done accordingly. According to the solution,I understand how to find the limits of the sum, but why is there a factor of 2 wit...
445
views
answered
Mar 18, 2020
Algorithms
binary-tree
algorithms
dynamic-programming
combinatory
test-series
+
–
0
votes
13
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...
23.0k
views
answered
Jan 10, 2020
Algorithms
gatecse-2000
algorithms
asymptotic-notation
normal
+
–
0
votes
14
Two phase locking and time stamp
Which of the following is correct ? I.Two phase locking is an optimistic protocol. II. Two phase locking is pessimistic protocol III. Time stamping is an optimistic protocol. IV. Time stamping is pessimistic protocol. A I and III B II and IV C I and IV D II and III
Which of the following is correct ? I.Two phase locking is an optimistic protocol. II. Two phase locking is pessimistic protocol III. Time stamping is an optimistic proto...
1.2k
views
answered
Dec 21, 2019
Databases
two-phase-locking-protocol
databases
transaction-and-concurrency
+
–
0
votes
15
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.
443
views
answered
Dec 5, 2019
Operating System
galvin
operating-system
threads
descriptive
+
–
2
votes
16
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.3k
views
answered
Dec 5, 2019
Operating System
galvin
operating-system
threads
+
–
0
votes
17
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 ...
505
views
answered
Nov 14, 2019
Databases
databases
joins
referential-integrity
+
–
0
votes
18
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
9.2k
views
answered
Nov 4, 2019
Operating System
isro2016
operating-system
process-scheduling
+
–
1
votes
19
GATE IT 2007 | Question: 10
Processes $P1$ and $P2$ use critical_flag in the following routine to achieve mutual exclusion. Assume that critical_flag is initialized to FALSE in the main program. get_exclusive_access ( ) { if (critical _flag == FALSE) { critical_flag = TRUE ; critical_region () ; critical_flag = ... Both (i) and (ii) are false (i) is true (ii) is false Both (i) and (ii) are true
Processes $P1$ and $P2$ use critical_flag in the following routine to achieve mutual exclusion. Assume that critical_flag is initialized to FALSE in the main program.get_...
11.2k
views
answered
Oct 4, 2019
Operating System
gateit-2007
operating-system
process-synchronization
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register