Dark Mode

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

answer selected in Operating System Feb 8, 2017

3.9k views

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

commented in Operating System Feb 6, 2017

20.5k views

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$

commented in Probability Feb 5, 2017

12.5k views

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%? __________

commented in Computer Networks Feb 4, 2017

778 views

1 answer

5

Ace Test Series

asked in Programming in C Feb 4, 2017

416 views

1 answer

6

asked in Databases Feb 3, 2017

705 views

2 answers

7

MadeEasy Test Series

asked in CO and Architecture Feb 2, 2017

618 views

1 answer

8

Ace Test Series: Databases - Er Diagram

asked in Databases Feb 1, 2017

880 views

5 answers

9

MadeEasy CBT 2017: Algorithms - Graph Algorithms
No of topological sortings

commented in Algorithms Jan 30, 2017

2.1k views

1 answer

10

commented in CO and Architecture Jan 30, 2017

501 views

0 answers

11

asked in Databases Jan 30, 2017

220 views

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 _______.

answered in Computer Networks Jan 29, 2017

1.9k views

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$.

commented in DS Jan 28, 2017

13.4k views

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

asked in Theory of Computation Jan 26, 2017

801 views