Recent activity by Human / GATE Overflow for GATE CSE

1 answer

1

GATE CSE 1995 | Question: 22
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).

How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).

5.1k views

commented Feb 14, 2020

4 answers

2

GATE CSE 2003 | Question: 70
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j-1$. A simple path is a path in ... length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges

Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1})...

17.6k views

commented Oct 15, 2019

7 answers

3

GATE CSE 1996 | Question: 17
Let $G$ be the directed, weighted graph shown in below figure We are interested in the shortest paths from $A$. Output the sequence of vertices identified by the Dijkstra's algorithm for single source shortest path when the algorithm is started at node $A$ Write down ... vertices in the shortest path from $A$ to $E$ What is the cost of the shortest path from $A$ to $E$?

Let $G$ be the directed, weighted graph shown in below figureWe are interested in the shortest paths from $A$.Output the sequence of vertices identified by the Dijkstra�...

7.6k views

commented Oct 13, 2019

0 answers

4

Aptitude
1.9, 2.95,4,5.05,6.2,… The next number in the series?

1.9, 2.95,4,5.05,6.2,…The next number in the series?

599 views

commented Jan 3, 2019

0 answers

5

Vani online test series
They have give option c as the answer. But for me both option b and d seems correct? Can someone please clarify.

They have give option c as the answer. But for me both option b and d seems correct? Can someone please clarify.

472 views

commented Oct 17, 2018

1 answer

6

Vani online test series
how the answer is 23699? For column major order I get answer as 80039. Even if i go by row major order the answer I get is 23599

how the answer is 23699?For column major order I get answer as 80039.Even if i go by row major order the answer I get is 23599

625 views

commented Oct 8, 2018

1 answer

7

Vani test series question
https://gateoverflow.in/?qa=blob&qa_blobid=16020532755515515346 Shouldnt the answer be option d? How option c?

https://gateoverflow.in/?qa=blob&qa_blobid=16020532755515515346Shouldnt the answer be option d? How option c?

477 views

commented Sep 27, 2018

1 answer

8

Tree DS
1. How many Binary trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? 2. How many Binary Search trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? 3. How many AVL trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? Can these be generalised for 'n' nodes?

1. How many Binary trees can be made with:(a) 3 unlabelled nodes?(b) 3 labelled nodes?2. How many Binary Search trees can be made with:(a) 3 unlabelled nodes?(b) 3 labell...

767 views

commented Sep 5, 2018

1 answer

9

Calculate the FIRST and FOLLOW for each non Terminal
Consider the Following Grammar P - > S S - > A | A ;S A - > id = E E - > E+E | E-E | E*E | E/E | (E) | T T - > id | num Calculate FIRST and FOLLOW for each non terminal.

Consider the Following GrammarP - SS - A | A ;S A - id = EE - E+E | E-E | E*E | E/E | (E) | TT - id | numCalculate FIRST and FOLLOW for each non terminal.

1.5k views

commented Aug 18, 2018

7 answers

10

GATE CSE 2017 Set 1 | Question: 36
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(val > 0) { x ... in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.

Consider the C functions foo and bar given below:int foo(int val) { int x=0; while(val 0) { x = x + foo(val ); } return val; }int bar(int val) { int x = 0; while(val 0)...

25.4k views

commented Jul 25, 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