Recent activity by Anup / GATE Overflow for GATE CSE

3 answers

1

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar

Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...

3.2k views

commented Jan 26, 2019

1 answer

2

fork() system call
MY QUESTION IS 1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS 2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE RUN A PROGRAM MANY TIMES Consider the following code fragment: if (fork() = ... process and virtual address of a' doesn't change in child process. Therefore, we get same addresses in both parent and child.

MY QUESTION IS1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE ...

1.9k views

commented Nov 22, 2018

1 answer

3

self doubt
What is the actual difference between binary semaphore & Mutex????? Are both same thing???? What is the up() code for binary semaphore?????

What is the actual difference between binary semaphore & Mutex????? Are both same thing????What is the up() code for binary semaphore?????

683 views

answered Nov 19, 2018

6 answers

4

CMI2010-B-04b
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers. A DFA that has $n$ states and accepts an infinite language must accept at least one string $x$ such that $2n < |x| < 3n$, where $|x|$ denotes the length of $x$.

Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.A DFA that has $n$ states and accepts an infinite la...

4.0k views

commented Oct 27, 2018

4 answers

5

GATE IT 2006 | Question: 22
When a coin is tossed, the probability of getting a Head is $p, 0 < p < 1$. Let $N$ be the random variable denoting the number of tosses till the first Head appears, including the toss where the Head appears. Assuming that successive tosses are independent, the expected value of $N$ is $\dfrac{1}{p}$ $\dfrac{1}{(1 - p)}$ $\dfrac{1}{p^{2}}$ $\dfrac{1}{(1 - p^{2})}$

When a coin is tossed, the probability of getting a Head is $p, 0 < p < 1$. Let $N$ be the random variable denoting the number of tosses till the first Head appears, incl...

9.4k views

answered Sep 29, 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