Recent activity by JAYKISHAN / GATE Overflow for GATE CSE

3 answers

1

ISRO2020-32
$G$ is an undirected graph with vertex set $\{v1, \ v2, \ v3, \ v4, \ v5, \ v6, \ v7\}$ and edge set $\{v1v2,\ v1v3,\ v1v4\ ,v2v4,\ v2v5,\ v3v4,\ v4v5,\ v4v6,\ v5v6,\ v6v7\ \}$. A breadth first search of the graph is performed with $v1$ as the root node. Which of the following is a tree edge? $v2v4$ $v1v4$ $v4v5$ $v3v4$

$G$ is an undirected graph with vertex set $\{v1, \ v2, \ v3, \ v4, \ v5, \ v6, \ v7\}$ and edge set $\{v1v2,\ v1v3,\ v1v4\ ,v2v4,\ v2v5,\ v3v4,\ v4v5,\ v4v6,\ v5v6,\ v6v...

4.1k views

commented Jan 21, 2020

2 answers

2

BFS
Consider two vertices a and b that are simultaneously on the FIFO queue at same point during the execution of breadth first search from s in an undirected graph. Which of the following is true? 1. The number of edges on the shortest path between s and a is atmost one more than the number of edges on ... and b. 3. There is a path between a and b. a.1 only b.1 and 2 only c. 2 only d. 1, 2 and 3

Consider two vertices a and b that are simultaneously on the FIFO queue at same point during the execution of breadth first search from s in an undirected graph.Which of ...

18.2k views

commented Nov 15, 2019

1 answer

3

MadeEasy Subject Test: Algorithms - Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?

Which of the following statements is true?Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tre...

3.2k views

commented Nov 15, 2019

0 answers

4

Descrete Mathematic ACE Text Book Practice Question #16
A women's health clinic has four doctors and each patient is assigned to one of them. If a patient givs birth btween 8 am and 4 pm, then her chance of being attended by her assigned doctor is 3/4, otherwise it is 1/4. What is the probability ... is attended by the assigned doctor when she gives birth? (A) 25/144 (B) 5/12 (C) 7/12 (D) 1/12

A women's health clinic has four doctors and each patient is assigned to one of them. If a patient givs birth btween 8 am and 4 pm, then her chance of being attended by h...

896 views

asked May 30, 2019

1 answer

5

Multiprocessor Systems
The incorrect match is (for n > 1) : SISD Model of computer : 1 control unit and 1 ALU SIMD Model of computer : 1 control unit and n ALUs MISD Model of computer : n control unit and n ALUs MIMD Model of computer : n control unit and 1 ALU

The incorrect match is (for n 1) :SISD Model of computer : 1 control unit and 1 ALUSIMD Model of computer : 1 control unit and n ALUsMISD Model of computer : n control u...

682 views

answered Jan 31, 2019

1 answer

6

Computer Networks
Suppose a TCP message of 2000 bytes of data and 20 bytes of TCP header is passed to the IP layer. Suppose this host is connected to a link with an MTU size of 512 Bytes. What is the total length of the last IP fragment? Express in bytes. What is the value of the offset field in the last fragment?

Suppose a TCP message of 2000 bytes of data and 20 bytes of TCP header is passed to the IPlayer. Suppose this host is connected to a link with an MTU size of 512 Bytes. W...

1.5k views

answered Jan 28, 2019

2 answers

7

Madeeasy[CN-Flow control]
Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is minimum number of bits required for window to achieve 100% utilization during GBN and SR protocol ?

Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed...

1.3k views

commented Jan 21, 2019

0 answers

8

MadeEasy Subject Test 2019: Computer Networks - Congestion Control
Consider an instance of TCP additive increase multiplicative decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 12 ... question is, After reached to threshold, should we have to increase congestion window with 1MSS or with 2MSS.

Consider an instance of TCP additive increase multiplicative decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the thres...

1.0k views

commented Jan 15, 2019

4 answers

9

MADE EASY TEST SERIES
Consider the following schedules involving two transactions. $S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$ $S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R_3(z), W_2(y), W_3(x), commit_2, commit_3$ Which of the following ... S2 are allowed under 2PL B) only S1 is allowed under 2PL C) only S2 is allowed under 2PL D) neither S1 nor S2 is allowed under 2PL

Consider the following schedules involving two transactions.$S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$$S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R...

3.6k views

answered Dec 4, 2018

0 answers

10

ICE practice book 2
Which of the following task can perform by syntax translation [1] creation of DAG [2] perform type checking [3] generating three address code for any expression [4] we can convert L attributed definition to S attributed (A) 2 and 4 only (B) 1 and 3 only (C) 1 and 4 only (D) All

Which of the following task can perform by syntax translation creation of DAG perform type checking[3] generating three address code for any expression[4] we can conver...

326 views

asked Aug 14, 2018

1 answer

11

ACE Algorithms volume 2 Divede and Conquer Q 11
Given two sorted double linked list L1 and L2 of n elements each, which of the following are true? (A) L1 and L2 can be merged into single sorted list in Θ(n) time. (B) L1 and L2 can be merged into single sorted list in Θ(1) time. ( ... merged into single sorted list in Θ(nlogn) time. (D) L1 and L2 can be merged into single sorted list in Θ(n2) time.

Given two sorted double linked list L1 and L2 of n elements each, which of the following are true?(A) L1 and L2 can be merged into single sorted list in Θ(n) time.(B) L1...

832 views

asked Jul 5, 2018

2 answers

12

Sliding window protocol
Why sender and receiver window size are same in selective repeat?

Why sender and receiver window size are same in selective repeat?

749 views

asked May 3, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true