GATE 2015 qn no 61

Kiran005 asked Jun 23, 2018

384 views

0 votes

Is this solution correct ?

Kiran005 asked Jun 23, 2018

Kiran005

384 views

See all

1 1 comment

akash.dinkar12

commented Jun 24, 2018

https://gateoverflow.in/8010/gate2015-1-ga-6

1 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

No above one is not correct because above answer will give the avg number of marks for correctly answered question.

the correct one should be $\frac{21*2+15*3+11*1+23*2+31*5}{21+17+6} = 6.795$

Shubhgupta answered Jun 24, 2018

Shubhgupta

See all

1 1 comment

Kiran005

commented Jun 24, 2018

Thus arihant gate cse 16 book contains wrong solution!

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

2 votes

3 answers

go_editor asked Aug 11, 2016

5,097 views

UGC NET CSE | December 2015 | Part 3 | Question: 61
Consider the following three SQL queries (Assume the data in the people table): Select Name from people where $\text{Age}>21$; Select Name from people where $\text{Height}>180$; Select Name from people where $(\text{Age}>21)$ ... respectively, then what is one possible number of rows returned by the SQL query $c$? $3$ $7$ $10$ $21$

Consider the following three SQL queries (Assume the data in the people table):Select Name from people where $\text{Age}>21$;Select Name from people where $\text{Height}>...

go_editor

5.1k views

go_editor asked Aug 11, 2016

Databases
ugcnetcse-dec2015-paper3
databases
sql

+ –

3 votes

2 answers

go_editor asked Aug 1, 2016

2,850 views

UGC NET CSE | Junet 2015 | Part 3 | Question: 61
A context free grammar for $L=\{w \mid n_0 (w) > n_1 (w)\}$ is given by: $S \rightarrow 0 \mid 0S \mid 1 S S$ $S \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1$ $S \rightarrow 0 \mid 0 S \mid 1 S S \mid S 1 S \mid S S 1$ $S \rightarrow 0 S \mid 1 S \mid 0 \mid 1$

A context free grammar for $L=\{w \mid n_0 (w) n_1 (w)\}$ is given by:$S \rightarrow 0 \mid 0S \mid 1 S S$$S \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1...

go_editor

2.9k views

go_editor asked Aug 1, 2016

Theory of Computation
ugcnetcse-june2015-paper3
theory-of-computation
context-free-grammar

+ –

0 votes

0 answers

Optimus Prime asked Jul 6, 2018

532 views

Gate 2018 Qn. 43
Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2,…,100. There is an edge between vertices and if and only if the label of can be obtained by swapping two adjacent numbers in the label of . Let denote the degree of a vertex in G, and denote the number of connected components in G. Then, y + 10z = _____.

Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2,…,100. There is an edge between vertices and if and only if...

Optimus Prime

532 views

Optimus Prime asked Jul 6, 2018

Graph Theory
graph-theory

+ –

1 votes

2 answers

Mani Perumal asked Apr 13, 2015

1,369 views

gate qn
A full binary tree with 'n' non-leaf node contains

A full binary tree with 'n' non-leaf node contains

Mani Perumal

1.4k views

Mani Perumal asked Apr 13, 2015

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

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

1 1 comment

1 1 comment