Answers by khushtak / GATE Overflow for GATE CSE

0 votes

1

distance vector routing query
Consider a network system having 4 routers P,Q,R AND S as shownbelow.initially, the routersise Distance vector routing and use number of hops as distance metric. Initially, link p-q was down and all other routers agree p is unreachable.thr ... "count to infinity" problem as all routers are sending the information at the same instant. How to solve this ques?

Consider a network system having 4 routers P,Q,R AND S as shownbelow.initially, the routersise Distance vector routing and use number of hops as distance metric.Initially...

1.8k views

answered Feb 3, 2017

43 votes

2

GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.

Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...

20.8k views

answered Feb 2, 2017

11 votes

3

MadeEasy Subject Test: Operating System - Process Synchronization
Consider the following code used by the classical readers and writers. Note: rc = rc+1; will execute in 3 instructions like load, increment and then store. Which of the below statement is true, regarding synchronizing the classical ... and (c) are true. I think it should be a but answet is d can somebody provide the simulation

Consider the following code used by the classical readers and writers.Note: rc = rc+1; will execute in 3 instructions like load, increment and then store.Which of the bel...

1.2k views

answered Feb 1, 2017

41 votes

4

GATE IT 2006 | Question: 41
The data path shown in the figure computes the number of $1s$ in the $32-bit$ input word corresponding to an unsigned even integer stored in the shift register. The unsigned counter, initially zero, is incremented if the most significant bit of the shift register is $1.$ The ... $32, 5, 010$ $5, 32, 010$ $5, 31, 011$ $5, 31, 010$

The data path shown in the figure computes the number of $1s$ in the $32-bit$ input word corresponding to an unsigned even integer stored in the shift register.The unsign...

10.1k views

answered Jan 29, 2017

2 votes

5

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

No of topological sortings

2.2k views

answered Jan 24, 2017

19 votes

6

GATE CSE 1990 | Question: 4-iii
State whether the following statements are TRUE or FALSE with reason: The flags are affected when conditional CALL or JUMP instructions are executed.

State whether the following statements are TRUE or FALSE with reason:The flags are affected when conditional CALL or JUMP instructions are executed.

3.3k views

answered Jan 20, 2017

4 votes

7

GATE IT 2006 | Question: 49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, " ... $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$

Which one of the choices given below would be printed when the following program is executed ?#include <stdio.h struct test { int i; char *c; }st[] = {5, "become", 4, "be...

27.2k views

answered Nov 10, 2016

0 votes

8

GATE CSE 2003 | Question: 45
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $\left(xy+xz'\right)$ is $4.$ What are the minimum possible literal counts of the product-of-sum and sum-of-product ... ? Here, $X$ denotes "don't care" $(11, 9)$ $(9, 13)$ $(9, 10)$ $(11,11)$

The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $\left(xy+xz'\right)...

16.1k views

answered Sep 3, 2016

–2 votes

9

GATE CSE 2003 | Question: 45
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $\left(xy+xz'\right)$ is $4.$ What are the minimum possible literal counts of the product-of-sum and sum-of-product ... ? Here, $X$ denotes "don't care" $(11, 9)$ $(9, 13)$ $(9, 10)$ $(11,11)$

The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $\left(xy+xz'\right)...

16.1k views

answered Sep 3, 2016

130 votes

10

GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$

Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs...

14.6k views

answered Jun 6, 2016

2 votes

11

GATE1991-15,a
Show that the product of the least common multiple and the greatest common divisor of two positive integers $a$ and $b$ is $a\times b$.

Show that the product of the least common multiple and the greatest common divisor of two positive integers $a$ and $b$ is $a\times b$.

2.0k views

answered May 28, 2016

1 votes

12

TIFR CSE 2012 | Part A | Question: 2
If $Mr.M$ is guilty, then no witness is lying unless he is afraid. There is a witness who is afraid. Which of the following statements is true? (Hint: Formulate the problem using the following predicates $G - Mr.M$ is guilty $W(x) - x$ ... guilty. From these facts one cannot conclude that $Mr.M$ is guilty. There is a witness who is lying. No witness is lying.

If $Mr.M$ is guilty, then no witness is lying unless he is afraid. There is a witness who is afraid. Which of the following statements is true?(Hint: Formulate the proble...

4.4k views

answered May 28, 2016

3 votes

13

Find the total number of ways in which the vowels in the word ' PERMUTATION ' appears in alphabetical order .

2.4k views

answered May 24, 2016

1 votes

14

CMI2010-A-09
Consider the following functions $f()$ and $g().$ f(){ w = 3; w = 4; } g(){ z = w; z = z + 2*w; print(z); } We start with $w$ set to $0$ and execute $f()$ and $g()$ in parallel-that is, at each step we either execute one statement from $f()$ or one statement from $g()$. What is the set of possible values printed by $g()?$ $0,9,12$ $0,8,9,12$ $0,6,8,9,11,12$ $0,4,6,9,10,12$

Consider the following functions $f()$ and $g().$f(){ w = 3; w = 4; } g(){ z = w; z = z + 2*w; print(z); }We start with $w$ set to $0$ and execute $f()$ and $g()$ in para...

753 views

answered May 24, 2016

14 votes

15

GATE2015 CE-2: GA-4
Mr. Vivek walks $6$ meters North-east, then turns and walks $6$ meters South-east, both at 60 degrees to east. He further moves $2$ meters South and $4$ meters West. What is the straight distance in meters between the point he started from and the point he finally reached? $2\sqrt 2$ $2$ $\sqrt 2$ $1/\sqrt2$

Mr. Vivek walks $6$ meters North-east, then turns and walks $6$ meters South-east, both at 60 degrees to east. He further moves $2$ meters South and $4$ meters West. What...

5.7k views

answered May 15, 2016

7 votes

16

TIFR CSE 2012 | Part A | Question: 6
A certain pair of used shoes can be repaired for $Rs.1250$ and will last for $1$ year. A pair of the same kind of shoes can be purchased new for $Rs.2800$ and will last for $2$ years. The average cost per year of the new shoes is what percent greater than the cost of repairing the used shoes? $5%$ $12%$ $15%$ $3%$ $24%$

A certain pair of used shoes can be repaired for $Rs.1250$ and will last for $1$ year. A pair of the same kind of shoes can be purchased new for $Rs.2800$ and will last f...

985 views

answered May 14, 2016

3 votes

17

GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false

Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...

24.1k views

answered May 11, 2016

0 votes

18

GATE2014 AE: GA-3
Rajan was not happy that Sajan decided to do the project on his own. On observing his unhappiness, Sajan explained to Rajan that he preferred to work independently. Which one of the statements below is logically valid and can be inferred from the above ... to give in to Rajan's request to work with him. Rajan had believed that Sajan and he would be working together.

Rajan was not happy that Sajan decided to do the project on his own. On observing his unhappiness, Sajan explained to Rajan that he preferred to work independently.Which ...

2.3k views

answered May 7, 2016

11 votes

19

GATE CSE 2011 | Question: 60
Choose the word from the options given below that is most nearly opposite in the meaning to the given word Amalgamate merge split collect separate

Choose the word from the options given below that is most nearly opposite in the meaning to the given wordAmalgamatemergesplitcollectseparate

3.2k views

answered May 7, 2016

3 votes

20

GATE2013 EE: GA-10
Find the sum to $'n'$ terms of the series $10+84+734+\dots$ $\frac{9(9^n+1)}{10} +1$ $\frac{9(9^n-1)}{8} +1$ $\frac{9(9^n-1)}{8} +n$ $\frac{9(9^n-1)}{8} +n^2$

Find the sum to $'n'$ terms of the series $10+84+734+\dots$$\frac{9(9^n+1)}{10} +1$$\frac{9(9^n-1)}{8} +1$$\frac{9(9^n-1)}{8} +n$$\frac{9(9^n-1)}{8} +n^2$

4.1k views

answered May 7, 2016

0 votes

21

GATE2014 EC-4: GA-3
While receiving the award, the scientist said, "I feel vindicated". Which of the following is closest in meaning to the word 'vindicated'? Punished Substantiated Appreciated Chastened

While receiving the award, the scientist said, "I feel vindicated". Which of the following is closest in meaning to the word 'vindicated'?PunishedSubstantiated Appreciate...

1.9k views

answered May 6, 2016

2 votes

22

UPPCL'13
The first two letter clusters on the left of the sign ‘::’ are related in a certain way. The same relationship holds for the second pair on the right of the sign ‘::’ of which one is missing. Choose the missing one from among the alternatives. BLOCK : LBPKA :: THIRD : ? 1) EQHIS 2) CSHIS 3) EQJIU 4) CQJIU

The first two letter clusters on the left of the sign ‘::’ are related in a certain way. The same relationship holds for the second pair on the right of the sign ‘:...

619 views

answered May 4, 2016

2 votes

23

Which type of function it is?
Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is: (A) injective (B) surjective (C) both injective and surjective (D) neither injective nor surjective

Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is:(A) injective (B) surjective(C) both injective and surjective(D) neither injective nor surjective

397 views

answered Mar 30, 2016

0 votes

24

Calculating frame length when bit rate, propagation delay(in bits) and length of link is given.
Assume CSMA/CD protocol. Find the least frame length in bytes for a 2 Mbps bit rate and 1.5km long network where propagation delay is 4.25 nano seconds per metre _______

Assume CSMA/CD protocol. Find the least frame length in bytes for a 2 Mbps bit rate and 1.5km long network where propagation delay is 4.25 nano seconds per metre _______

2.3k views

answered Jan 26, 2016

0 votes

25

concurrent

373 views

answered Jan 26, 2016

0 votes

26

give answer for relational algebra , tuple calculas , and SQL
BOOK(acc_no.,year,title) USER(card_no.,names,address) SUPPLIER(s_name,address) BORROWED BY (acc_no.card_no,date of issue) SUPPLIED BY(acc_no,date of supply,price ,s_name) in above given relation find out the acc_no of all the book which are present in the library in (a)relational algebra form (b) in sql form (c)in tuple calculas form

BOOK(acc_no.,year,title)USER(card_no.,names,address)SUPPLIER(s_name,address)BORROWED BY (acc_no.card_no,date of issue)SUPPLIED BY(acc_no,date of supply,price ,s_name)in a...

1.4k views

answered Jan 26, 2016

1 votes

27

Consider the following statement about indexes
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these

Consider the following statement(i) Primary index is always sparse(ii) Secondary index may or may not be denseWhich of the above statement is/are false?A)Only (i)B)Only (...

8.2k views

answered Jan 25, 2016

1 votes

28

DATA LINK LAYER
A group of $2^n -1$ routers are interconnected in a centralized binary tree with a router at each tree node . Router 1 communicates with Router j by sending a message to the root of the tree. The root then sends a message back down to j Derive an approximate expression for the minimum number ... all the router pairs are equally likely 1). $2N-4$ 2). $N-4/2$ 3). $N-4/2$ 4). $N-4$

A group of $2^n -1$ routers are interconnected in a centralized binary tree with a router at each tree node . Router 1 communicates with Router j by sending a message to ...

5.3k views

answered Jan 24, 2016

1 votes

29

How to determine a partial functional dependency when checking for second normal form ?
What is the best and the most accurate way to check if a given functional dependency is partial on the set of FDs given. Earlier, I used to follow {part of CK -> non prime ... ://stackoverflow.com/questions/25747802/partial-dependencydatabases ) see answer by 'Mike Sherrill 'Cat Recall''

What is the best and the most accurate way to check if a given functional dependency is partial on the set of FDs given. Earlier, I used to follow {part of CK - non prime...

2.3k views

answered Jan 18, 2016

0 votes

30

Find the number of productions
Consider the grammar S ---> PQ | SQ | PS P --->x Q--->y To get a string of n terminals the number of productions to be used is n2 n+1 2n 2n-1

Consider the grammarS - PQ | SQ | PSP ->xQ ->yTo get a string of n terminals the number of productions to be used isn2n+12n2n-1

6.9k views

answered Jan 11, 2016

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