Recent activity by shashin / GATE Overflow for GATE CSE

9 answers

1

GATE CSE 2020 | Question: 39
Which one of the following predicate formulae is NOT logically valid? Note that $W$ is a predicate formula without any free occurrence of $x$. $\forall x (p(x) \vee W) \equiv \forall x \: ( px) \vee W$ ... $\exists x(p(x) \rightarrow W) \equiv \forall x \: p(x) \rightarrow W$

Which one of the following predicate formulae is NOT logically valid?Note that $W$ is a predicate formula without any free occurrence of $x$.$\forall x (p(x) \vee W) \equ...

17.3k views

comment edited Feb 15, 2020

5 answers

2

GATE CSE 2020 | Question: 21
A direct mapped cache memory of $1$ MB has a block size of $256$ bytes. The cache has an access time of $3$ ns and a hit rate of $94 \%$. During a cache miss, it takes $2$0 ns to bring the first word of a block from the main memory, while ... word takes $5$ ns. The word size is $64$ bits. The average memory access time in ns (round off to $1$ decimal place) is______.

A direct mapped cache memory of $1$ MB has a block size of $256$ bytes. The cache has an access time of $3$ ns and a hit rate of $94 \%$. During a cache miss, it takes $2...

15.6k views

commented Feb 13, 2020

10 answers

3

GATE CSE 2020 | Question: 53
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $\textsf{TLB}$ lookup takes $20$ ns. Each page transfer to/from the disk ... $1$ decimal places) is ___________

Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $...

46.6k views

commented Feb 12, 2020

12 answers

4

ISRO2020-50
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form

If every non-key attribute functionally dependent on the primary key, then the relation will be inFirst normal formSecond normal formThird normal formFourth Normal form

9.2k views

commented Jan 16, 2020

1 answer

5

MadeEasy Test Series 2018: Computer Networks - Network Flow
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SW then the answer wil be - ceil(log x) Is my approach is correct, if not then how to solve this?

my approach is 1 <= Td(x)/(Td+2Tp), x is size of SWthen the answer wil be - ceil(log x)Is my approach is correct, if not then how to solve this?

342 views

commented Dec 9, 2019

2 answers

6

TheGateAcademy Test Series
In DFA, does each state need to have transition on "EACH" input alphabet? The answer was given "False" but I dont think so. Can anyone explain? Because if this statement is False, then there is no use of "Dead State"

In DFA, does each state need to have transition on "EACH" input alphabet?The answer was given "False" but I dont think so. Can anyone explain?Because if this statement is...

461 views

answered Sep 17, 2019

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