Recent activity by dutta18 / GATE Overflow for GATE CSE

1 answer

1

BARC 2015
Operand is fetched from memory During (A) fetch phase (B) execute phase (C) decode phase (D) read phase

Operand is fetched from memory During(A) fetch phase(B) execute phase(C) decode phase(D) read phase

480 views

commented Mar 10, 2023

3 answers

2

NIELIT 2018-68
_____ IP address can be used in WAN $256.0.0.1$ $172.16.0.10$ $15.1.5.6$ $127.256.0.1$

_____ IP address can be used in WAN$256.0.0.1$$172.16.0.10$$15.1.5.6$$127.256.0.1$

7.8k views

answered Mar 2, 2023

4 answers

3

GATE IT 2005 | Question: 4
Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ ... TRUE? It is necessarily regular but not necessarily context-free. It is necessarily context-free. It is necessarily non-regular. None of the above

Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ respectively. Whi...

7.8k views

commented Dec 29, 2022

1 answer

4

Self doubt
How to do this Boolean multiplication? And which Boolean law is applicable here ? ( P' + Q ) ( Q' + P )

How to do this Boolean multiplication? And which Boolean law is applicable here ?( P' + Q ) ( Q' + P )

363 views

answer selected Dec 9, 2022

5 answers

5

GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .

Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .

8.9k views

answered Nov 30, 2022

4 answers

6

GATE CSE 2006 | Question: 71
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$

The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding set...

17.3k views

commented Nov 21, 2022

2 answers

7

GATE CSE 2020 | Question: 38
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $\text{III}$ only $\text{III}$ and $\text{IV}$ only $\text{I}$ and $\text{IV}$ only

An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this ...

24.6k views

answered Nov 17, 2022

2 answers

8

GATE CSE 2021 Set 2 | GA Question: 3
If $\theta$ is the angle, in degrees, between the longest diagonal of the cube and any one of the edges of the cube, then, $\cos \theta =$ $\frac{1}{2} \\$ $\frac{1}{\sqrt{3}} \\$ $\frac{1}{\sqrt{2}} \\$ $\frac{\sqrt{3}}{2}$

If $\theta$ is the angle, in degrees, between the longest diagonal of the cube and any one of the edges of the cube, then, $\cos \theta =$$\frac{1}{2} \\$$\frac{1}{\sqrt{...

8.2k views

commented Nov 7, 2022

5 answers

9

GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty

In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?A...

21.1k views

commented Nov 4, 2022

2 answers

10

GATE CSE 2022 | Question: 44
Consider a system with $2 \;\text{KB}$ direct mapped data cache with a block size of $64 \; \text{bytes}.$ The system has a physical address space of $64 \; \text{KB}$ and a word length of $16 \; \text{bits.}$ During the execution of a program, four data ... only $\text{R}$ and $\text{S}$ reside in the cache. Every access to $\text{R}$ evicts $\text{Q}$ from the cache.

Consider a system with $2 \;\text{KB}$ direct mapped data cache with a block size of $64 \; \text{bytes}.$ The system has a physical address space of $64 \; \text{KB}$ an...

9.1k views

commented Nov 2, 2022

3 answers

11

GATE CSE 2018 | Question: 8
Which one of the following statements is FALSE? Context-free grammar can be used to specify both lexical and syntax rules Type checking is done before parsing High-level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack

Which one of the following statements is FALSE?Context-free grammar can be used to specify both lexical and syntax rulesType checking is done before parsingHigh-level lan...

11.8k views

commented Oct 20, 2022

6 answers

12

GATE CSE 2022 | Question: 41
Consider the following recurrence: $\begin{array}{} f(1) & = & 1; \\ f(2n) & = & 2f(n) - 1, & \; \text{for}\; n \geq 1; \\ f(2n+1) & = & 2f(n) + 1, & \; \text{for}\; n \geq 1. \end{array}$ Then, which of the following statements is/are $\text{TRUE}?$ ... $f(2^{n}) = 1$ $f(5 \cdot 2^{n}) = 2^{n+1} + 1$ $f(2^{n} + 1) = 2^{n} + 1$

Consider the following recurrence:$$\begin{array}{} f(1) & = & 1; \\ f(2n) & = & 2f(n) – 1, & \; \text{for}\; n \geq 1; \\ f(2n+1) & = & 2f(n) + 1, & \; \text...

7.8k views

answered Oct 11, 2022

1 answer

13

GATE CSE 2020
Is this language a regular language ? If yes why and if No why ? The last part is “x!=y” cropped in the picture According to my understanding this is not regular because its says number of x = number of y But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?

Is this language a regular language ? If yes why and if No why ?The last part is “x!=y” cropped in the pictureAccording to my understanding this is not regular becaus...

1.3k views

asked Sep 22, 2022

1 answer

14

context free language
Show that the language L={xy∣|x|=|y|,x≠y} is context free. Do not give links plz explain in simple manner

Show that the language L={xy∣|x|=|y|,x≠y} is context free. Do not give links plz explain in simple manner

3.6k views

commented Sep 22, 2022

4 answers

15

GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.

Consider the following languages.$$\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \e...

18.2k views

commented Sep 22, 2022

7 answers

16

GATE CSE 2020 | Question: 51
Consider the following language. $L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$ The minimum number of states in DFA that accepts $L$ is _________

Consider the following language.$L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$The minimum number of states in DFA that ...

13.5k views

answered Sep 21, 2022

1 answer

17

Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?

What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?

450 views

commented Sep 21, 2022

4 answers

18

GATE CSE 2017 Set 1 | Question: 21
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$ ... . The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .

Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$, the respective comple...

14.2k views

commented Sep 11, 2022

6 answers

19

GATE CSE 2009 | Question: 6
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates? $2$ $3$ $4$ $5$

What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?$2$$3$$4$$5$

20.2k views

commented Jan 13, 2021

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