Questions by sudharshan / GATE Overflow for GATE CSE

0 votes

2 answers

1

Virtual Gate
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?

A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex...

837 views

asked Jan 24, 2019

0 votes

0 answers

2

General
What is the difference between wheel and cycle in GRAPH THEORY

What is the difference between wheel and cycle in GRAPH THEORY

162 views

asked Jan 8, 2019

0 votes

0 answers

3

own doubt
can we say that every regular language is a DCFL?

can we say that every regular language is a DCFL?

389 views

asked Oct 27, 2018

0 votes

1 answer

4

#sorting
Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array and find the minimum of the remaining elements, remove this element and so on until array become empty. In the best case, how many comparisons are needed? A.O(n) B.O(n2) C.O(nlogn) D.None of the above

Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array an...

969 views

asked Sep 21, 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