Recent activity by cool_dude / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2019 | Question: GA-8
A recent High Court judgement has sought to dispel the idea of begging as a disease - which leads to its stigmatization and criminalization - and to regard it as a symptom. The underlying disease is the failure of the state to protect citizens ... offence that has to be dealt with firmly Begging has to be banned because it adversely affects the welfare of the state

“A recent High Court judgement has sought to dispel the idea of begging as a disease – which leads to its stigmatization and criminalization – and to regard it as ...

4.8k views

commented Feb 12, 2019

1 answer

2

doubt
What is cutoff for IIITS?

What is cutoff for IIITS?

365 views

commented Feb 9, 2019

0 answers

3

Does all the sets are counted here ??

131 views

asked Jul 26, 2018

0 answers

4

How it is possible?

168 views

closed Jul 24, 2018

1 answer

5

Q:Suppose that a computer science laboratory has 15 workstations and 10 servers.
Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only one direct connection to that ... the minimum number of direct connections needed to achieve this goal? Please explain the answer with explanation.

Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only on...

4.2k views

commented Jul 24, 2018

0 answers

6

doubt
Q: Identify pigeon and pigeonhole : Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only one direct connection to that server can be active at any ... to every server (using 150 connections), what is the minimum number of direct connections needed to achieve this goal? (ans 60)

Q: Identify pigeon and pigeonhole :Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to...

215 views

asked Jul 24, 2018

0 answers

7

doubt
Let f∘g denote function composition such that (f∘g)(x)=f(g(x)). Let f:A→B such that for all g:B→A and h:B→A we have f∘g=f∘h⇒g=h. Which of the following must be true? (ans : one to one) doubt: why it is not onto? Bcz : for function g , (to qualify to be a function, the entire domain of g must be mapped). So, domain of g= range of f.

Let f∘g denote function composition such that (f∘g)(x)=f(g(x)). Let f:A→B such that for all g:B→A and h:B→A we have f∘g=f∘h⇒g=h. Which of the following mu...

193 views

asked Jul 20, 2018

0 answers

8

#doubt
Let f∘gf∘g denote function composition such that (f∘g)(x)=f(g(x))(f∘g)(x)=f(g(x)). Let f:A→Bf:A→B such that for all g:B→Ag:B→A and h:B→Ah:B→A we have f∘g=f∘h⇒g=hf∘g=f∘h⇒g=h. Which of the following must be true? Ans: One-one. My doubt: WHY IT IS NOT ONTO ?

Let f∘gf∘g denote function composition such that (f∘g)(x)=f(g(x))(f∘g)(x)=f(g(x)). Let f:A→Bf:A→B such that for all g:B→Ag:B→A and h:B→Ah:B→A we have ...

309 views

asked Jul 13, 2018

4 answers

9

TIFR CSE 2017 | Part A | Question: 11
Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: : \: B \rightarrow A$ ... ) $f$ is one-to-one (injective) $f$ is both one-to-one and onto (bijective) the range of $f$ is finite the domain of $f$ is finite

Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: :...

4.0k views

commented Jul 13, 2018

1 answer

10

what is the tightest bound for the below functions ?
n2 + O(n2) = Theta(n2) I am not getting how can we say that tightest bound is in terms of theta , because theta(n2 ) implicitly implies Big-Omega(n2 ) and Big O(n2 ) , Now If we say the function f(n) is Big-Omega(n2 ... will never get a function greater than n2 so how can we say the tightest bound to be Big-Omega(n2 ) ? Please explain briefly .

n2 + O(n2) = Theta(n2) I am not getting how can we say that tightest bound is in terms of theta , because theta(n2 ) implicitly implies Big-Omega(n2 ) and Big O(n2 ) , ...

656 views

commented Jun 24, 2018

1 answer

11

DOUBT
Can anyone explain the refresh formula for DRAMS?

Can anyone explain the refresh formula for DRAMS?

286 views

answer selected Jun 24, 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