Recent activity by surbhijain93 / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2016 Set 2 | Question: 07
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value of $A$ is one, the decimal value of $B$ that leads to the longest latency for the sum to stabilize is ___________

Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in $2$'s complement form. If the decimal value o...

19.3k views

commented Sep 23, 2020

4 answers

2

GATE CSE 2006 | Question: 38
Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $ i_{1}=\left \langle w_{1}, x_{1}, y_{1},z_{1}\right \rangle $ ... $ wx\overline{y} \overline{z}, xz, w\overline{x}yz$ $ wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$

Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors...

21.0k views

commented Aug 21, 2020

3 answers

3

GATE CSE 1997 | Question: 73
A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the range $1 \dots 3$, $3$ being the highest priority. It is required to synchronize ... =true; else begin V(proceed [priority]); busy:=true; end V(mutex) Give the pseudo code for the procedure release_R.

A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the ...

1.9k views

commented Aug 20, 2020

1 answer

4

$(\log n)!$ and $(\log \log n)!$ are polynomially bounded ? anybody can prove?

5.2k views

comment reshown Apr 5, 2020

6 answers

5

GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing ... the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only

Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the...

19.1k views

commented Mar 23, 2020

0 answers

6

algorithms
Consider you start in city s' and need to drive to city t ' and you will follow the road via cities (in sequence) a1,a2, a3,..., an. Given all the distances between consecutive cities and prices of gas at each station in the above table: If car ... Your goal to make the trip spending as little as possible on gas. The optimal cost for tour is __________. (Assume initially tank is full)

Consider you start in city ‘s’ and need to drive to city ‘t ’ and you will follow the road via cities (in sequence) a1,a2, a3,..., an. Given all the distances bet...

496 views

comment edited Mar 18, 2020

2 answers

7

Madeeasy
Which of the following is true? $f(n)=O\left(\left(f\left(n\right)\right)^{2}\right)$ $f(n)=O\left(g\left(n\right)\right)\Rightarrow 2^{f\left (n\right)}=O\left(2^{g\left(n\right)}\right)$ $f(n)+O\left(f\left(n\right)\right)=\theta \left(f\left(n\right)\right)$ Both (a) and (b)

Which of the following is true?$f(n)=O\left(\left(f\left(n\right)\right)^{2}\right)$$f(n)=O\left(g\left(n\right)\right)\Rightarrow 2^{f\left (n\right)}=O\left(2^{g\left(n...

1.1k views

comment edited Mar 4, 2020

7 answers

8

GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true

Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$.Consider the following statements.P does not have an inverseP has ...

27.4k views

commented Oct 30, 2019

0 answers

9

linear algebra
If the A-matrix of the state space model of a SISO linear time invariant system is rank deficient, the transfer function of the system must have (a) a pole with a positive real part (b) a pole with a negative real part (c) a pole with a positive imaginary part (d) a pole at the origin

If the A-matrix of the state space model of a SISO linear time invariant system is rank deficient, the transfer function of the system must have(a) a pole with a positive...

489 views

commented Oct 30, 2019

4 answers

10

MadeEasy Test Series 2018: Compiler Design - Runtime Environments
Consider the following statements: S1 : Static allocation can not support recursive function. S2 : Stack allocation can support pointers but can not deallocate storage at run-time. S3 : Heap allocation can support pointers and it can allocate or deallocate ... statements are true? a S1 and S2 b S2 and S3 c S3 and S1 d S1, S2 and S3

Consider the following statements:S1 : Static allocation can not support recursive function.S2 : Stack allocation can support pointers but can not deallocate storage at r...

3.0k views

commented Oct 20, 2019

2 answers

11

intermediate code
Consider four programming languages viz. C, C++, C# and JAVA and three machines which have different configuration (such as OS, hardware). If someone needs to write a compiler for the above mentioned languages and machines, then the number of compilers required with and without intermediate code phase are --------- and ------ respectively.

Consider four programming languages viz. C, C++, C# and JAVA and three machines which have different configuration (such as OS, hardware). If someone needs to write a com...

2.1k views

commented Oct 20, 2019

1 answer

12

S-attribute grammar
Is this statement correct... Attribute evaluation in S-attribute grammars can be incorporated conveniently in both top-down parsing and bottom-up parsing since S-attributed grammars are not inherited.

Is this statement correct...Attribute evaluation in S-attribute grammars can be incorporated conveniently in both top-down parsing and bottom-up parsing since S-attribute...

804 views

commented Oct 17, 2019

0 answers

13

what is the relation between CFG , LL(K) ,LR(K) and regular grammars ?
I am unable to get the basic difference between these and which one are actually parsed by a top down parser and a bottom up parser ?

I am unable to get the basic difference between these and which one are actually parsed by a top down parser and a bottom up parser ?

2.9k views

commented Oct 16, 2019

2 answers

14

Grammars
Please provide example to disapprove the following points:- 1.every DCFG need not be a LR(K). 2.every DCFG need not be a LL(K). 3.every DCFL is not LL(k).

Please provide example to disapprove the following points:-1.every DCFG need not be a LR(K).2.every DCFG need not be a LL(K).3.every DCFL is not LL(k).

792 views

commented Oct 16, 2019

1 answer

15

Zeal Test Series 2019: Theory of Computation - Identify Class Language
select the correct statement Non-CFL is closed under reversal operation . L=$ \{ \;0^n1^m0^m: n+m \; mod \;6 =2 \} $ is CFL but not regular. if L is context free and R and S are regular ,then MAJORITY(L,R,S)={ w| w is in atleast two of R,L,S } is also context free (a) only i (b) only I and II (c) Only II and III (d) All

select the correct statement Non-CFL is closed under reversal operation .L=$ \{ \;0^n1^m0^m: n+m \; mod \;6 =2 \} $ is CFL but not regular.if L is context free and R and ...

826 views

commented Oct 2, 2019

3 answers

16

UGC NET CSE | July 2018 | Part 2 | Question: 28
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number): 45 72 360 450

The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450

17.2k views

commented Sep 21, 2019

6 answers

17

Deadlock
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free ________. Given answer is 6. I am getting 12.

Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which sy...

5.7k views

commented Jul 29, 2019

0 answers

18

Relationship b/w closure and decidability?
Is there any relationship b/w closure and decidability? Thanks

Is there any relationship b/w closure and decidability?Thanks

299 views

commented Jun 29, 2019

2 answers

19

parsing technique
Consider an SLR(1) & LALR(1) tables which of the following is true?? 1. shift entries are same. 2 Reduce entries are same. 3. goto entries are different. 4.error entries are different.

Consider an SLR(1) & LALR(1) tables which of the following is true??1. shift entries are same.2 Reduce entries are same.3. goto entries are different.4.error entries ar...

1.4k views

commented Jun 28, 2019

2 answers

20

PARSING
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??

ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??

2.7k views

commented Jun 28, 2019

1 answer

21

Difference between computability and decidability
Hi, Could someone please tell the difference between computability and decidability? Thanks

Hi,Could someone please tell the difference between computability and decidability?Thanks

2.6k views

comment reshown Jun 26, 2019

1 answer

22

doubt in databases

1.3k views

commented Jun 18, 2019

14 answers

23

GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$

A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level...

76.4k views

commented May 16, 2019

4 answers

24

GATE CSE 2006 | Question: 79
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of processes ... at the beginning of the barrier and re-enabled at the end. The variable process_left is made private instead of shared

Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arr...

8.3k views

comment edited May 15, 2019

5 answers

25

GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only

Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?$\neg \exists t \in r \left(P\left(t\ri...

14.0k views

commented Apr 28, 2019

4 answers

26

GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III

Consider the following statements about the context free grammar$$G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $$$G...

28.7k views

comment edited Sep 10, 2018

0 answers

27

equality of two language
Equality problem for language L1 and L2, L1 =L2 or L1 ≠ L2 For which of the following class language equality problem is decidable a. Regular b. CFL c. CSL d. REC e. RE

Equality problem for language L1 and L2, L1 =L2 or L1 ≠ L2For which of the following class language equality problem is decidablea. Regularb. CFLc. CSL...

1.0k views

commented Sep 9, 2018

2 answers

28

DCFL
Is DFCL closed under complement ? If so can you provide any text for the same.

Is DFCL closed under complement ? If so can you provide any text for the same.

7.0k views

commented Sep 9, 2018

1 answer

29

why completeness problem in case of DCFL is decidable, & it is undecidable in case of CFL?

2.8k views

commented Sep 7, 2018

0 answers

30

universal turing machine

2.0k views

commented Sep 6, 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