Recent activity by a new one / GATE Overflow for GATE CSE

0 answers

1

problem on back edge
Can someone provide good example to illustrate cross edge,back edge ,forward edge?

Can someone provide good example to illustrate cross edge,back edge ,forward edge?

575 views

commented Apr 21, 2019

1 answer

2

Find Asymptotic upper bound (http://www.csd.uwo.ca/~moreno/CS433-CS9624/Resources/master.pdf)
$\Large T(n) = 2^nT(\frac{n}{2}) + n^n$

$\Large T(n) = 2^nT(\frac{n}{2}) + n^n$

962 views

commented Apr 21, 2019

4 answers

3

GATE CSE 2008 | Question: 50
Which of the following statements are true? Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa All $\epsilon$-productions can be removed from any context-free grammar by suitable transformations The language generated by a context-free grammar all ... trees I, II, III and IV II, III and IV only I, III and IV only I, II and IV only

Which of the following statements are true?Every left-recursive grammar can be converted to a right-recursive grammar and vice-versaAll $\epsilon$-productions can be remo...

13.9k views

commented Jan 18, 2019

6 answers

4

GATE CSE 2003 | Question: 33
Consider the following formula and its two interpretations $I_1$ and $I_2$. $\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg Q_{yy} \right]\right] \Rightarrow (\forall x)\left[\neg P_x\right]$ $I_1$ : Domain: ... I_1\) does not Neither $I_1$ nor $I_2$ satisfies $\alpha$ Both $I_1$ and $I_2$ satisfies $\alpha$

Consider the following formula and its two interpretations $I_1$ and $I_2$.\(\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg...

16.1k views

commented Dec 30, 2018

3 answers

5

GATE CSE 2014 Set 1 | Question: 40
Consider a hash table with $9$ slots. The hash function is $h(k)= k \mod 9$. The collisions are resolved by chaining. The following $9$ keys are inserted in the order: $5, 28, 19, 15, 20, 33, 12, 17, 10$. The maximum, minimum, and average chain lengths in the hash table, respectively, are $3, 0,$ and $1$ $3, 3,$ and $3$ $4, 0,$ and $1$ $3, 0,$ and $2$

Consider a hash table with $9$ slots. The hash function is $h(k)= k \mod 9$. The collisions are resolved by chaining. The following $9$ keys are inserted in the order: $5...

10.4k views

commented Dec 19, 2018

3 answers

6

GATE CSE 2014 Set 1 | Question: 35
Let $L$ be a language and $\bar{L}$ be its complement. Which one of the following is NOT a viable possibility? Neither $L$ nor $\bar{L}$ is recursively enumerable $(r.e.)$. One of $L$ and $\bar{L}$ is r.e. but not recursive; the other is not r.e. Both $L$ and $\bar{L}$ are r.e. but not recursive. Both $L$ and $\bar{L}$ are recursive.

Let $L$ be a language and $\bar{L}$ be its complement. Which one of the following is NOT a viable possibility?Neither $L$ nor $\bar{L}$ is recursively enumerable $(r.e.)...

8.5k views

commented Dec 19, 2018

12 answers

7

GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.

Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...

38.4k views

commented Dec 19, 2018

4 answers

8

GATE CSE 2014 Set 1 | Question: GA-8
Round-trip tickets to a tourist destination are eligible for a discount of $10\%$ on the total fare. In addition, groups of $4$ or more get a discount of $5\%$ on the total fare. If the one way single person fare is $Rs$ $100$, a group of $5$ tourists purchasing round-trip tickets will be charged $Rs$ __________

Round-trip tickets to a tourist destination are eligible for a discount of $10\%$ on the total fare. In addition, groups of $4$ or more get a discount of $5\%$ on the tot...

6.3k views

commented Dec 17, 2018

9 answers

9

GATE CSE 2013 | Question: 34
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, increments by one, stores it to memory, and then terminates. Each of the ... initialized to two. What is the maximum possible value of $x$ after all processes complete execution? $-2$ $-1$ $1$ $2$

A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, ...

23.0k views

commented Dec 17, 2018

1 answer

10

GATE CSE 2013 | Question: 18
Which of the following statements are TRUE? The problem of determining whether there exists a cycle in an undirected graph is in $P$. The problem of determining whether there exists a cycle in an undirected graph is in $NP$. If a problem A is $NP-Complete$, there exists a non-deterministic ... solve $A$ $1$, $2$ and $3$ $1$ and $2$ only $2$ and $3$ only $1$ and $3$ only

Which of the following statements are TRUE?The problem of determining whether there exists a cycle in an undirected graph is in $P$.The problem of determining whether the...

7.5k views

commented Dec 16, 2018

5 answers

11

GATE CSE 2013 | Question: 8
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$

Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ?$\{\epsilon\}$$\phi$$a^*$$\{\epsilon, a\}$

19.1k views

commented Dec 16, 2018

13 answers

12

GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...

35.5k views

answered Dec 16, 2018

4 answers

13

GATE CSE 2012 | Question: 48
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += + ... $\begin{array}{lll} 3 & & 1 & \\ 5 & & 2 & \\ 5 & & 2 & \end{array}$

Consider the following C code segment.int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, ...

14.0k views

commented Dec 15, 2018

3 answers

14

GATE CSE 2012 | Question: 47
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root. int height(treeptr n) { if(n == NULL) return -1 ... ; B2: $\max(h1, h2) $ B1: $(1+ \text{height}(n \to \text{ right}))$ ; B2: $\max(h1, h2)$

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute...

11.2k views

commented Dec 15, 2018

4 answers

15

GATE CSE 2012 | Question: 43
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a foreign key that refers to $C$ in $R_{2}$. If data in $r_{1}$ and $r_{2}$ satisfy referential ... $\prod_{B}(r_{1}) = \prod _{C}(r_{2})$ $\prod_{B}(r_{1}) - \prod _{C}(r_{2}) \neq \varnothing$

Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a for...

11.4k views

commented Dec 15, 2018

4 answers

16

GATE CSE 2012 | Question: 36
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... Call ... The correct set of activation records along with their access links is given by:

Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted.Program main; Var ... Procedure A1; Var ....

13.2k views

commented Dec 14, 2018

7 answers

17

GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn

Consider the following transactions with data items $P$ and $Q$ initialized to zero:$${\begin{array}{|c|l|r|c|}\hline \textbf{$T_1$}& \text{read (P);}\\ & \text{read...

23.0k views

commented Dec 14, 2018

3 answers

18

GATE CSE 2011 | Question: 1
In a compiler, keywords of a language are recognized during parsing of the program the code generation the lexical analysis of the program dataflow analysis

In a compiler, keywords of a language are recognized duringparsing of the programthe code generationthe lexical analysis of the programdataflow analysis

17.4k views

commented Dec 13, 2018

5 answers

19

GATE CSE 2011 | Question: 64
A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses $7$ trucks, then at the end of the $4^{th}$ day he can clear all the orders. Alternatively, if he uses only $3$ trucks, then all ... of trucks required so that there will be no pending order at the end of $5^{th}$ day? $4$ $5$ $6$ $7$

A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses $7$ trucks, then at the end of the $4...

10.2k views

commented Dec 13, 2018

3 answers

20

GATE CSE 2011 | Question: 62
$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the growth of a single microbe surviving human immunity system within $24$ hours of ... against the most dangerous microbe. Which microbe should the company target in its first attempt? $P$ $Q$ $R$ $S$

$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the gro...

8.0k views

commented Dec 13, 2018

4 answers

21

GATE CSE 2011 | Question: 60
Choose the word from the options given below that is most nearly opposite in the meaning to the given word Amalgamate merge split collect separate

Choose the word from the options given below that is most nearly opposite in the meaning to the given wordAmalgamatemergesplitcollectseparate

3.2k views

commented Dec 13, 2018

2 answers

22

GATE CSE 2010 | Question: 36
The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. typedef struct node { int value; struct node *next; ... $q \rightarrow next = NULL; p \rightarrow next = head; head = p$;

The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified l...

11.0k views

commented Dec 12, 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