Recent activity by rahuljai / GATE Overflow for GATE CSE

1 answer

1

Number of subnets can be formed by using the subnet mask 255.255.248.0 in a class B network _________

What’s the right answer ?, please have a look at Q.5(here) they are appending network bits but this question doesn't.

1.2k views

commented Dec 16, 2018

0 answers

2

what is possible number of subnets that can be formed from 3 bits from hostid part in class c network ?

422 views

commented Dec 15, 2018

1 answer

3

compiler design. Why SLR(1) even if follow are different?
Consider the following grammar S --> Ka|bKc|dc|bda K ---> d The grammar is not LALR(1) SLR(1) LR(1) none of the above

Consider the following grammarS Ka|bKc|dc|bdaK - dThe grammar is notLALR(1)SLR(1)LR(1)none of the above

1.0k views

commented Dec 14, 2018

1 answer

4

Test by Bikram | Compiler Design | Test 1 | Question: 24
Consider the following grammar: $E \rightarrow E + T \mid T$ $T \rightarrow T ^* F \mid F$ $F \rightarrow (E) \mid id$ ... $E \rightarrow TE' , \ \ T \rightarrow FT' , \ \ F \rightarrow (E) \mid id$

Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...

483 views

commented Dec 13, 2018

1 answer

5

TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n> 0 } L = {a^nb^n | n < 1000 } L = {a^nb^k | n is odd or k is even } L = {wxw^R | w,x ∈(0+1)* } 1, 3 and 4 2, 3, 4 2, 3 1, 2, 3, 4

Which of the following languages is regular? L = { bba (ba)* a^n-1 | n 0 }L = {a^nb^n | n < 1000 }L = {a^nb^k | n is odd or k is even }L = {wxw^R | w,x ∈(0+1)* }1, 3 a...

1.1k views

commented Dec 13, 2018

3 answers

6

GATE CSE 2011 | Question: 43
An $8\text{KB}$ direct-mapped write-back cache is organized as multiple blocks, each size of $32\text{-bytes}$. The processor generates $32\text{-bit}$ addresses. The cache controller contains the tag information for each cache block comprising of the ... the cache controller to store meta-data (tags) for the cache? $4864$ bits $6144$ bits $6656$ bits $5376$ bits

An $8\text{KB}$ direct-mapped write-back cache is organized as multiple blocks, each size of $32\text{-bytes}$. The processor generates $32\text{-bit}$ addresses. The cac...

12.4k views

commented Dec 13, 2018

1 answer

7

Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 29
Suppose in a system we store data using arrays, we have $2$ arrays A1 and A2. Array A1 contains $256$ elements of size $4$ bytes each. The first element is stored at physical address $4096$ ... of bytes that will be written to memory during execution of the loop is : $256$ $1$ $0$ $2048$

Suppose in a system we store data using arrays, we have $2$ arrays A1 and A2. Array A1 contains $256$ elements of size $4$ bytes each. The first element is stored at phy...

537 views

commented Dec 13, 2018

1 answer

8

Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 2
$16$kB cache with line size $64$B uses $4$ – way set associative mapping. Main memory is $8$ MB and byte addressable. The size of extra space needed for storing tag information in bytes is _________

$16$kB cache with line size $64$B uses $4$ – way set associative mapping. Main memory is $8$ MB and byte addressable. The size of extra space needed for storing tag inf...

362 views

commented Dec 12, 2018

1 answer

9

Test by Bikram | General Aptitude | Test 2 | Question: 17
Choose the grammatically wrong one among the following sentences: The young will support the nation. We like to clean the house in spring. He is a honest person. Each student was present in the hall.

Choose the grammatically wrong one among the following sentences:The young will support the nation.We like to clean the house in spring.He is a honest person.Each student...

208 views

answered Dec 12, 2018

1 answer

10

Test by Bikram | General Aptitude | Test 2 | Question: 1
My sister is getting ______ her studies quite well. Fill in the blank with the appropriate word: round over at on

My sister is getting ______ her studies quite well.Fill in the blank with the appropriate word: roundoveraton

279 views

answered Dec 12, 2018

1 answer

11

Test by Bikram | Mathematics | Test 2 | Question: 15
Read the following premises: $\textbf{A} \rightarrow X \text{ or } Y \text{ or not }P$ $\textbf{B} \rightarrow \text{ not }Y$ $A \text{ or not } B \rightarrow P$ $Y \text{ and } A \text{ are true}$ Which of the following statements is ... $X$ is true. $\textbf{A}$ and $\textbf{B}$ are false. Either $X$ or $Y$ is true.

Read the following premises:$\textbf{A} \rightarrow X \text{ or } Y \text{ or not }P$$\textbf{B} \rightarrow \text{ not }Y$$A \text{ or not } B \rightarrow P$$Y \text{ an...

300 views

commented Dec 12, 2018

2 answers

12

Test by Bikram | Mathematics | Test 2 | Question: 14
Given $f : Z^*Z \rightarrow Z$ And: $f(m,n) = \mid m \mid – \mid n \mid$ $f(m,n) = m2 + n2$ $f(m,n) = m2 – 4$ $f(m,n) = 2m – n$ Which one of the following options is correct? only IV is onto. only IV and I are onto. III is not onto. II is onto.

Given $f : Z^*Z \rightarrow Z$And:$f(m,n) = \mid m \mid – \mid n \mid$$f(m,n) = m2 + n2$$f(m,n) = m2 – 4$$f(m,n) = 2m – n$ Which one of the following options is co...

375 views

commented Dec 12, 2018

1 answer

13

TLB OS
Why the formula used here is not P(10) + (1-P)(50) = 20 ?; A computer keeps its page tables in memory. The time required to read a word from the page table is 50ns. To reduce this overhead, the computer has a TLB, which holds 32 (virtual page, physical page frame) pairs and can ... : 10ns + (1 - p) 50ns = 20ns p =4/5 = .80 The TLB hit rate has to be 80% for a mean access time of 20ns.

Why the formula used here is not P(10) + (1-P)(50) = 20 ?;A computer keeps its page tables in memory. The time required to read a word from the pagetable is 50ns. To redu...

1.3k views

commented Dec 3, 2018

1 answer

14

TOC - PDA
Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0 is the bottom of stack marker. The set of states of PDA is {q0,q1} where q0 is the start state and rules of the PDA are, (The languare accepted by the grammar is)

Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0 is the bottom of stack marker. The set o...

606 views

reshown Nov 30, 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