Dark Mode

Questions by Jhunjhunuwala

0 votes

1 answer

1

Virtual Test Series

asked in Graph Theory Feb 7, 2017

198 views

0 votes

1 answer

2

Virtual Gate
Calculate the limit (A) 1 (B) 0 (C) -1 (D) Does not exist

asked in Calculus Feb 7, 2017

434 views

0 votes

1 answer

3

Doubt regarding Go Back n
What is 'n' in Go back n protocol Is it the number of bits required in total sequence numbers or is it the total sequence numbers? Please explain

asked in Computer Networks Feb 6, 2017

325 views

0 votes

0 answers

4

virtual test series
Consider the following directed graph Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is T, the number of back edges is B and the number of cross edges is C. Then ... T = 4. (C) B = 2, C = 1, and T = 3. (D) B = 1, C = 2, and T = 3.

asked in DS Feb 1, 2017

197 views

0 votes

1 answer

5

virtual test series
Find the number of all possible conflict-equivalent schedules to the following serial schedule: r1(X);w1(Y);w1(Z);r2(X);w2(Y);w2(Z); where ri(A) means ith transaction reads resource A and wi(A) means ith transaction writes resource A.

asked in Databases Feb 1, 2017

190 views

2 votes

0 answers

6

asked in Theory of Computation Jan 31, 2017

272 views

0 votes

1 answer

7

asked in Databases Jan 31, 2017

392 views

0 votes

1 answer

8

Complexity
What is the time complexity of above program

asked in Algorithms Jan 22, 2017

273 views

0 votes

1 answer

9

virtual test series

asked in Operating System Jan 1, 2017

370 views

0 votes

1 answer

10

virtual test series

asked in Databases Jan 1, 2017

267 views

0 votes

1 answer

11

virtual test series

asked in Theory of Computation Jan 1, 2017

398 views

0 votes

1 answer

12

virtual test series

asked in Theory of Computation Jan 1, 2017

304 views

2 votes

1 answer

13

Virtual Test Series
Consider a social network with n persons. Two persons A and B are said to be connected if either they are friends or they are related through a sequence of friends: that is, there exists a set of persons F1, . . . , Fm such that A and F1 are friends, F1 and ... them is connected. What is the maximum number of friendships possible? (A) n−k+1C2 (B) n-kC2 (C) n-k-1C2 (D) none

asked in Mathematical Logic Jan 1, 2017

254 views

0 votes

1 answer

14

Test Series
Two concurrent processes P1 and P2 use four shared resources R1, R2, R3, R4. Both processes are started at same time and each resource can be accessed by only 1 process at a time. The following scheduling constants exists between the access of ... . If any binary semaphore are used to enforce the above scheduling constants, what is the minimum number of binary semaphore needed?

asked in Operating System Nov 18, 2016

330 views

1 vote

2 answers

15

Virtual Test series

asked in Algorithms Sep 25, 2016

345 views

0 votes

2 answers

16

Virtual Test series

asked in Algorithms Sep 25, 2016

622 views

0 votes

1 answer

17

Virtual Test series

asked in Algorithms Sep 25, 2016

374 views

1 vote

0 answers

18

Virtual Test series

asked in Algorithms Sep 25, 2016

197 views

1 vote

1 answer

19

Virtual Test series

asked in Algorithms Sep 25, 2016

503 views

1 vote

1 answer

20

Virtual Test series

asked in Algorithms Sep 25, 2016

329 views

Page: