Recent activity by ankyAS / GATE Overflow for GATE CSE

1 answer

1

465 views

commented Jan 3, 2018

0 answers

2

3C's of caches
Can a fully associative cache have conflict misses? Yes/No Can capacity and conflict misses occur together ? Yes/No Consider the following block access sequence by CPU assisted by a fully associative cache with 4 blocks available using FIFO replacement policy. $4,5,7,12,4,5,13,4,5,7$ Find number of : compulsory misses conflict misses capacity misses

Can a fully associative cache have conflict misses? Yes/NoCan capacity and conflict misses occur together ? Yes/NoConsider the following block access sequence by CPU assi...

594 views

commented Jan 3, 2018

5 answers

3

GATE CSE 2010 | Question: 1
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in $G.$ If $S$ and $T$ are two different trees with $\xi(S) = \xi(T)$, then $| S| = 2| T |$ $| S | = | T | - 1$ $| S| = | T | $ $| S | = | T| + 1$

Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in $G.$ If $S$ and $T$ are two different trees with ...

11.5k views

commented Feb 10, 2017

2 answers

4

GATE CSE 2011 | Question: 41
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline ... under ideal conditions when compared to the corresponding non-pipeline implementation? $4.0$ $2.5$ $1.1$ $3.0$

Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stag...

13.6k views

commented Feb 9, 2017

2 answers

5

madeeasy
What are the last two digits of the number 7245 ? (A) 07 (B) 23 (C) 49 (D) 43

What are the last two digits of the number 7245 ?(A) 07 (B) 23 (C) 49 (D) 43

598 views

commented Feb 8, 2017

2 answers

6

Pankaj and Mythili were both asked to write the code to evaluate the following expression
Pankaj and Mythili were both asked to write the code to evaluate the following expression: $a - b + c/(a-b) + (a-b)^2 $ Pankaj writes the following code statements (Code A): print (a-b) + c/(a-b) ... Code B Code A uses more memory and is faster than Code B Code A uses more memory and is slower than Code B

Pankaj and Mythili were both asked to write the code to evaluate the following expression: $$a - b + c/(a-b) + (a-b)^2 $$Pankaj writes the following code statements (Code...

96.2k views

commented Feb 5, 2017

1 answer

7

RANDOM TEST SERIES
Suppose there are 4 nodes N1, N2, N3 and N4 are using a slotted ALOHA channel to send their own huge data. When competing all the nodes to transfer their data only one node will get succeeded with a probability P. The time is divided into slots S1, S2, S3 .and so on. What is probability of N1 succeeded in ... P)3) P(1-P)3(1-P(1-P)3) 4*P(1-P)3(1-P(1-P)3) 4*P(1-P)3(1-P3(1-P)3)

Suppose there are 4 nodes N1, N2, N3 and N4 are using a slotted ALOHA channel to send their own huge data. When competing all the nodes to transfer their data only one no...

673 views

commented Feb 3, 2017

1 answer

8

madeeasy
Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above datalink layer. S2 : Packet delivery in correct order is the functionality that must be implemented by network layer above datalink layer. Which of ... S1 is true b. Only S2 is true c. Both S1 and S2 are true d. Neither of S1 or S2 is true

Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above datalink layer. S2 ...

903 views

commented Feb 3, 2017

1 answer

9

aloha
6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calculate normalized total traffic on channel

6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calcu...

813 views

commented Feb 3, 2017

2 answers

10

Testbook 4 Qno33
here answer is 8 or 9??

here answer is 8 or 9??

343 views

answered Feb 3, 2017

2 answers

11

NPTEL-Operating Syste,-Week2-Quiz-1-Q1
Which of the following statements about Softwares is false? System Softwares provide an API that can be accessed by the Application Softwares. DBMS, Compilers, Assemblers are examples of System Software. OS Interface is used by the System Softwares to interact with the hardware/OS. System Softwares can control and coordinate the use of hardware.

Which of the following statements about Softwares is false?System Softwares provide an API that can be accessed by the Application Softwares.DBMS, Compilers, Assemblers a...

891 views

answered Feb 3, 2017

4 answers

12

Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?

Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...

4.7k views

commented Feb 2, 2017

1 answer

13

CFL Automata
A = {w t wr |w, t ∈ {0, 1} and |t|=5} is this a CFL? My Analysis if |t|=5 were not mentioned it would have been a Regular language.But for the given question above,I could construct only NPDA.Thus the laguage I believe is not DCFL . Is this the correct answer?

A = {w t wr |w, t ∈ {0, 1} and |t|=5} is this a CFL?My Analysisif |t|=5 were not mentioned it would have been a Regular language.But for the given question above,I co...

302 views

commented Feb 1, 2017

2 answers

14

L 1= {an bn+m cm | n ≥ 0, m ≥ 1}
Given ∑ = {a, b, c}, consider the language L 1= {an bn+m cm | n ≥ 0, m ≥ 1} L2 = {an bmcn+m | n ≥ 0, m ≥ 1} Which one of the following is incorrect? The language L 1 shall have 6 states in its equivalent PDA The language L1 is not DCFL. The language L1 requires an NPDA for its acceptance. The language L2 is DCFL

Given ∑ = {a, b, c}, consider the language L 1= {an bn+m cm | n ≥ 0, m ≥ 1}L2 = {an bmcn+m | n ≥ 0, m ≥ 1}Which one of the following is incorrect? The language...

3.0k views

commented Feb 1, 2017

1 answer

15

Ace Test Series: Theory Of Computation - Recursive And Recursively Enumerable Languages

1.1k views

commented Jan 31, 2017

2 answers

16

graph theory

1.3k views

commented Jan 31, 2017

1 answer

17

Deterministic finite automata
Construct DFA for $\color{navy}{L=\big \{w \;|\;(\;number\; of \;a's - number\; of\; b's)\;mod3 \gt 0, w\in (a+b)^* \big \}}$

Construct DFA for $\color{navy}{L=\big \{w \;|\;(\;number\; of \;a's - number\; of\; b's)\;mod3 \gt 0, w\in (a+b)^* \big \}}$

237 views

commented Jan 31, 2017

2 answers

18

Language Class

412 views

commented Jan 31, 2017

2 answers

19

How can I tell if these languages are context sensitive
How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?

How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?

959 views

commented Jan 31, 2017

1 answer

20

made eaasy mock 6
Consider the following languages : L1 : Set of all strings of form {apbqp + q = 500} over alphabet Σ = {a, b}. L2 : Set of all strings of form {apbqp – q = 500} over alphabet Σ = {a, b}. Which of the above languages is regular ? A) L1 B) L2 C) Both D) None of these

Consider the following languages :L1 : Set of all strings of form {apbqp + q = 500} over alphabet Σ = {a, b}.L2 : Set of all strings of form {apbqp – q = 500} ov...

255 views

answered Jan 31, 2017

1 answer

21

ACE TEST SERIES

413 views

commented Jan 30, 2017

1 answer

22

TOC Language Property Discussion
Here are some fundamental questions that i am a bit doubtful 1.Regular languages are closed under a)infinite Union b)infinite intersection or not? 2.what is the intersection of CFL and a Regular Language

Here are some fundamental questions that i am a bit doubtful1.Regular languages are closed under a)infinite Union b)infinite intersection or not?2.what is the intersecti...

315 views

commented Jan 30, 2017

1 answer

23

CFL - Problem Test Series
L={a^n b^k, n <= k <=2n} 1.CFL 2.Non CFL

L={a^n b^k, n <= k <=2n}1.CFL2.Non CFL

386 views

answered Jan 30, 2017

1 answer

24

If x={a,b,c,d}, then number of binary operations that can be defined on x is
If x={a,b,c,d}, then number of binary operations that can be defined on x is:- a. 4^16 b. 4^2 c. 2^16 d. 2^4

If x={a,b,c,d}, then number of binary operations that can be defined on x is:-a. 4^16b. 4^2c. 2^16d. 2^4

3.7k views

commented Jan 23, 2017

1 answer

25

#digital#counter
I have read somewhere that J-K flip-flop used as divide by 2 frequency counter is it true ?? if not how to solve given problem??

I have read somewhere that J-K flip-flop used as divide by 2 frequency counter is it true ??if not how to solve given problem??

914 views

commented Jan 22, 2017

1 answer

26

Switching Theory and Logic Design AnandKumar - Chapter 6 Example6-10
What is the minimum number of Synchronuous T Flip Flops Required to count the sequence 0-3-5-6-0

What is the minimum number of Synchronuous T Flip Flops Required to count the sequence 0-3-5-6-0

677 views

commented Jan 22, 2017

1 answer

27

Minimum Number of JK Flip Flops required
What is the minimum number of JK Flip Flops required to construct counter with count sequence 0−0−0−1−1−2−2−3−3

What is the minimum number of JK Flip Flops required to construct counter with count sequence 0−0−0−1−1−2−2−3−3

1.7k views

commented Jan 22, 2017

1 answer

28

no. of edges
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have? a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2

A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have?a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2

479 views

commented Jan 21, 2017

4 answers

29

GATE IT 2005 | Question: 85a
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, ...

Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...

5.3k views

commented Jan 15, 2017

7 answers

30

GATE IT 2005 | Question: 85b
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$

Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...

14.9k views

commented Jan 15, 2017

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