Recent activity by rituraj_s / GATE Overflow for GATE CSE

6 answers

1

GATE CSE 2021 Set 1 | Question: 36
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as: $\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortest path between $u$ and $v$}\}$ Let $M$ be the adjacency matrix of $G$. Define graph $G_2$ ... $\text{diam}(G_2) = \text{diam}(G)$ $\text{diam}(G)< \text{diam}(G_2)\leq 2\; \text{diam}(G)$

Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as:$$\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortes...

10.1k views

commented Jan 31, 2022

5 answers

2

GATE CSE 2017 Set 1 | Question: 46
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below. ... $T2 \leftarrow CR\div T1$ The number of rows in $T2$ is ______________ .

Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.$$\begin{array}{|c|c|} \hline \textbf{Student...

13.0k views

answered Sep 24, 2021

8 answers

3

GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above

The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above

31.8k views

commented May 23, 2021

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