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
Recent activity by AmitPatil
1
answer
1
Test Series
Consider a system with logical address space of 4GB and page size is 8KB, physical address space is 256MB. How many bits required to access an entry in single level page table and in inverted page table respectively? A. 19, 15 B. 15, 15 C. 15, 19 D. 19, 19
Consider a system with logical address space of 4GB and page size is 8KB, physical address space is 256MB. How many bits required to access an entry in single level page ...
3.9k
views
answer selected
Feb 8, 2017
Operating System
operating-system
+
–
2
answers
2
GATE CSE 2010 | Question: 25
Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation Round robin is better than FCFS in terms of response time I only I and III only II and III only I, II and III
Which of the following statements are true?Shortest remaining time first scheduling may cause starvationPreemptive scheduling may cause starvationRound robin is better th...
20.6k
views
commented
Feb 6, 2017
Operating System
gatecse-2010
operating-system
process-scheduling
easy
+
–
4
answers
3
GATE CSE 2012 | Question: 21
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
12.6k
views
commented
Feb 5, 2017
Probability
gatecse-2012
probability
random-variable
easy
+
–
2
answers
4
Test Series
Suppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10msec apart connected by a 1Gbps link. Assume that they are using a packet size of 1000 bytes to transmit the file. Also assume for simplicity that ACK packets ... . At least how big (in packets) would the window size have to be for the channel utilization to be greater than 80%? __________
Suppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10msec apart connected by a 1Gbps link. Assume that they are using a packet ...
787
views
commented
Feb 4, 2017
Computer Networks
computer-networks
+
–
1
answer
5
Ace Test Series
434
views
asked
Feb 4, 2017
Programming in C
programming-in-c
+
–
1
answer
6
Test Series
719
views
asked
Feb 3, 2017
Databases
databases
er-diagram
+
–
2
answers
7
MadeEasy Test Series
625
views
asked
Feb 2, 2017
CO and Architecture
co-and-architecture
dma
+
–
1
answer
8
Ace Test Series: Databases - Er Diagram
877
views
asked
Feb 1, 2017
Databases
ace-test-series
test-series
er-diagram
databases
+
–
5
answers
9
MadeEasy CBT 2017: Algorithms - Graph Algorithms
No of topological sortings
No of topological sortings
2.1k
views
commented
Jan 30, 2017
Algorithms
made-easy-test-series
cbt-2017
algorithms
graph-algorithms
topological-sort
+
–
1
answer
10
Test Series
510
views
commented
Jan 30, 2017
CO and Architecture
co
pipelining
+
–
0
answers
11
Test Series
220
views
asked
Jan 30, 2017
Databases
serializability
conflict-serializable
+
–
2
answers
12
Congestion Window 1.3
The initial congestion window size over a TCP is 1. If slow start algorithm is used and the size of congestion window incremented by 1 whenever an ACK is received i.e. after first rounda trip time congestion window size is 2 segments. Assume that connection never leaves slow start. The number of RTT’s to send 3999 segments are _______.
The initial congestion window size over a TCP is 1. If slow start algorithm is used and the size of congestion window incremented by 1 whenever an ACK is received i.e. af...
2.0k
views
answered
Jan 29, 2017
10
answers
13
GATE CSE 2014 Set 3 | Question: 42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if ... implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order.int ProcessArray(int *listA, int x, int n) { in...
13.5k
views
commented
Jan 28, 2017
DS
gatecse-2014-set3
data-structures
array
easy
+
–
0
answers
14
Online Test Series
L1 = {an bm | n ≤ m ≤ 2n} L2 = {an bm│m≠n & m≠2n} Which of the following is true? A. Only L1 is CFG B. Only L2 is CFG C. Both are CFG D. None of them is CFG
L1 = {an bm | n ≤ m ≤ 2n}L2 = {an bm│m≠n & m≠2n}Which of the following is true?A. Only L1 is CFGB. Only L2 is CFGC. Both are CFGD. None of them is CFG
813
views
asked
Jan 26, 2017
Theory of Computation
theory-of-computation
context-free-grammar
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register