Recent activity by mohitp / GATE Overflow for GATE CSE

6 answers

1

TIFR CSE 2010 | Part B | Question: 36
In a directed graph, every vertex has exactly seven edges coming in. What can one always say about the number of edges going out of its vertices? Exactly seven edges leave every vertex. Exactly seven edges leave some vertex. Some vertex has at least seven edges leaving it. The number of edges coming out of vertex is odd. None of the above.

In a directed graph, every vertex has exactly seven edges coming in. What can one always say about the number of edges going out of its vertices?Exactly seven edges leave...

5.9k views

commented Sep 29, 2020

1 answer

2

GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing is call by value call by reference call by copy restore procedure P{x, y, z}; begin y:y+1; z: x+x; end; begin a:= b:= 3; P(a+b, a, a); Print(a); end

What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...

5.9k views

commented Jul 24, 2020

0 answers

3

Solve the following recurrence relation:
Solve the following recurrence relation: T(n)=9T(n-1)-20T(n-2) T(0)=-3 T(1)=-10 a)2.5n-5.4n b)3.5n-4.3n c)3.4n-2.5n d)4.5n-2.3n can it be solved by substitution..?

Solve the following recurrence relation: T(n)=9T(n-1)-20T(n-2)T(0)=-3T(1)=-10a)2.5n-5.4nb)3.5n-4.3nc)3.4n-2.5nd)4.5n-2.3ncan it be solved by substitution..?

815 views

commented Jul 4, 2020

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