Recent activity by raja11sep / GATE Overflow for GATE CSE

1 answer

1

GATE CSE 2023 | Question: 12
Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process? Page table base register Stack pointer Program counter General purpose registers

Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process?Pag...

10.0k views

commented Feb 6, 2023

3 answers

2

GATE CSE 1995 | Question: 1.21
In the interval $[0, \pi]$ the equation $x=\cos x$ has No solution Exactly one solution Exactly two solutions An infinite number of solutions

In the interval $[0, \pi]$ the equation $x=\cos x$ has No solutionExactly one solutionExactly two solutionsAn infinite number of solutions

5.7k views

commented Jan 25, 2023

0 answers

3

Theory Of Computation | Minimum Pumping Length | MPL
MSQ Consider the following languages and their MPL (Minimum Pumping Length) Which among these are TRUE: L1 = aa(b)* :: MPL(L1) = 3 L2 = aa(aa)* :: MPL(L2) = 2 L2 = aa(aa)* :: MPL(L2) = 3 L2 = aa(aa)* :: MPL(L2) = 4 L3 = aa(ab)* :: MPL(L3) = 4 L4 = aa(b)* + aad(c)* :: MPL(L4) = 4

MSQ Consider the following languages and their MPL (Minimum Pumping Length)Which among these are TRUE: L1 = aa(b)* :: MPL(L1) = 3 L2 = aa(aa)* :: MPL(L2) = 2 L2 = aa(aa)*...

747 views

commented Jan 19, 2023

1 answer

4

number system
The decimal equivalent value of given 2's complement number 101001.10 is A -20.5 B -23.5 C -22.5

The decimal equivalent value of given 2's complement number 101001.10 is A -20.5B -23.5C -22.5

255 views

commented Jan 5, 2023

1 answer

5

Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads
Let G be any grammar with the following productions: X → X+Y | Y Y→ Y*Z | Z Z → (X) Z → id If LR(1) parser is used to parse the above grammar, then total how many look-a-heads are present for the item “X→.Y” and “Z →.id” in the initial state?

Let G be any grammar with the following productions:X → X+Y | YY→ Y*Z | ZZ → (X)Z → idIf LR(1) parser is used to parse the above grammar, then total how many look...

876 views

commented Jan 1, 2023

0 answers

6

Self Doubt
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?

A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?

322 views

commented Jan 1, 2023

2 answers

7

Self Doubt
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??

Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??

678 views

commented Dec 31, 2022

2 answers

8

DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$} Is the above language DCFL or CFL ?

L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?

737 views

commented Dec 30, 2022

3 answers

9

GATE CSE 2021 Set 1 | Question: 32
Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two schedules. $S_1: r_1(x)r_1(y)r_2(x)r_2(y)w_2(y)w_1(x)$ ... serializable, and $S_2$ is conflict serializable Both $S_1$ and $S_2$ are conflict serializable Niether $S_1$ nor $S_2$ is conflict serializable

Let $r_i(z)$ and $w_i(z)$ denote read and write operations respectively on a data item $z$ by a transaction $T_i$. Consider the following two schedules.$S_1: r_1(x)r_1(y)...

5.6k views

answer edited Dec 28, 2022

1 answer

10

Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False

The following language regularL*, where L={ $0^{{m}^{2}} | m\leq 3$ }TrueFalse

495 views

commented Dec 27, 2022

2 answers

11

GATE CSE 2010 | Question: 38
The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1)

The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1)LR(1) but not LL(1)Both LL(1) and LR(1)Neither LL(1) nor LR(1)

12.9k views

commented Dec 27, 2022

8 answers

12

GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false

Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...

35.7k views

commented Dec 26, 2022

1 answer

13

find all strings of lenght 4 less, for the following regular expression (a*b + b*a)

744 views

commented Dec 25, 2022

2 answers

14

ACE 2023 Test series: TOC: Basic properties

688 views

comment edited Dec 25, 2022

3 answers

15

GATE CSE 2022 | Question: 19
Consider the augmented grammar with $\{ +, {\ast}, (,),\text{id} \}$ as the set of terminals. $S' \rightarrow S$ $S \rightarrow S + R\; |\; R$ $R \rightarrow R {\ast} P \;| \;P$ $P \rightarrow (S)\; |\; \text{id} $ If $I_{0}$ is ... $\{ [S' \rightarrow S.], [S \rightarrow S. + R] \}$, then $\textit{goto(closure}(I_{0}), +)$ contains exactly ______________ items.

Consider the augmented grammar with $\{ +, {\ast}, (,),\text{id} \}$ as the set of terminals.$S’ \rightarrow S$$S \rightarrow S + R\; |\; R$$R \rightarrow R {\ast} P \;...

7.3k views

commented Dec 24, 2022

1 answer

16

MUX | digital-logic multiplexer | MadeEasy
Ans: 35 Please Explain

Ans: 35 Please Explain

897 views

commented Dec 23, 2022

0 answers

17

Unacademy Test
Consider the following language: L = {< M > | L(M) has atleast 10 strings} Which of the following is true about L? A.L is decidable B.L is Turing recognizable C.L is not recursive D.None of these

Consider the following language:L = {< M | L(M) has atleast 10 strings}Which of the following is true about L?A.L is decidableB.L is Turing recognizableC.L is not recurs...

523 views

commented Dec 21, 2022

1 answer

18

Unacademy Test
Consider the following language: L = {<M>|M halts after 200 steps for all inputs} Which of the following is True about L? A.L is decidable B.L is undecidable C.Cannot be predicted D.None of the above

Consider the following language:L = {<M>|M halts after 200 steps for all inputs}Which of the following is True about L?A.L is decidableB.L is undecidableC.Cannot be predi...

529 views

commented Dec 21, 2022

1 answer

19

Unacademy Test
Consider the language given below: L={P!=w | P is prefix of w and w <-{0,1}*} Which is TRUE about L? A.L is CFL B.L is DCFL C.L is CSL CORRECT ANSWER D.L is regular

Consider the language given below:L={P!=w | P is prefix of w and w <-{0,1}*}Which is TRUE about L?A.L is CFLB.L is DCFLC.L is CSL CORRECT ANSWERD.L is regular

287 views

comment edited Dec 21, 2022

1 answer

20

Push Down Automation | Parsing | Input Buffer and Stack
Consider a situation, where the input buffer is still having elements, and our PDA has reached final state. Given that for next input element the final state has no transition defined. In above situation will the i/p string be ... in all cases May be accepted if empty stack acceptance is allowed in the given PDA Something else, I can explain

Consider a situation, where the input buffer is still having elements, and our PDA has reached final state. Given that for next input element the final state has no trans...

493 views

recategorized Dec 20, 2022

1 answer

21

Self Doubt
Does BFS and DFS traversal sequence exist for disconnected graphs? Is yes can you please give a dry run of the algorithm on a disconnected graph? According to me it should not exist as there is no edge to visit certain vertices of a different graph component from the source vertex in a disconnected graph. There is no absolute answer I could find online to this question.

Does BFS and DFS traversal sequence exist for disconnected graphs? Is yes can you please give a dry run of the algorithm on a disconnected graph?According to me it should...

577 views

answered Dec 20, 2022

2 answers

22

GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 8
Which of the following is/are correct about implementation of stack and queue. If stack is implemented as an array, all the push and pop operations can be performed in constant time. If stack is implemented as a ... queue is implemented as a linked list, all the enqueue and dequeue operations can be performed in constant time.

Which of the following is/are correct about implementation of stack and queue.If stack is implemented as an array, all the push and pop operations can be performed in con...

488 views

answer edited Dec 19, 2022

4 answers

23

GATE CSE 2004 | Question: 11
Consider the following statements with respect to user-level threads and kernel-supported threads context switch is faster with kernel-supported threads for user-level threads, a system call can block the entire process Kernel supported threads can be scheduled independently User level threads ... ) and (IV) only (II) and (III) only (I) and (III) only (I) and (II) only

Consider the following statements with respect to user-level threads and kernel-supported threadscontext switch is faster with kernel-supported threadsfor user-level thre...

27.7k views

answer edited Dec 11, 2022

1 answer

24

Kleen closure of {a^nb^n | n>=1} is DCFL

809 views

answer edited Dec 9, 2022

1 answer

25

What should the answer be?
I think the answer should be (B) would be right, because lets say in R, there is a FD NPA -> CK, it won't qualify as BCNF even if CK is single attribute

I think the answer should be (B) would be right, because lets say in R, there is a FD NPA - CK, it won't qualify as BCNF even if CK is single attribute

303 views

retagged Dec 9, 2022

4 answers

26

GATE CSE 2020 | Question: 2
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)

For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is$\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$)$\Thet...

19.6k views

answer edited Dec 8, 2022

1 answer

27

GATE1987-2-i
Match the pairs in the following questions: $\begin{array}{|l|l|l|} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Communication} & \text{(q) Wired-OR } \\\hline \text{(C) Open Collector} & \text{(r) Error detection} \\\hline \text{(D) Hamming Code} & \text{(s) RS-232-C} \\\hline \end{array}$

Match the pairs in the following questions:$$\begin{array}{|l|l|l|} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Co...

2.9k views

answer edited Dec 8, 2022

1 answer

28

acacademy
CFG is not closed under complementation , but REC is?

CFG is not closed under complementation , but REC is?

386 views

answered Nov 24, 2022

1 answer

29

Made Esy Test Series 2022 | COA | Subject wise Q.no 17
** MSQ ** Consider the following sequence of micro-operations (μO) on a system used for instruction fetch: Where MAR is memory address register, PC is program counter, MBR is memory buffer register and IR is instruction register. And ... the following μO's can execute parallely without conflict. μO2 and μO3 μO1 and μO3 μO4 and μO3 μO2 and μO4

MSQ Consider the following sequence of micro-operations (μO) on a system used for instruction fetch:Where MAR is memory address register, PC is program counter, MBR i...

577 views

comment edited Nov 23, 2022

0 answers

30

Theory Of Computation
Can finite automata do addition, subtraction, and multiplication? Anyone, please explain in detail?

Can finite automata do addition, subtraction, and multiplication?Anyone, please explain in detail?

305 views

asked Nov 22, 2022

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