Recent questions without an upvoted answer / GATE Overflow for GATE CSE

0 votes

0 answers

7411

Peter Linz Edition 4 Exercise 6.2 Question 7 (Page No. 169)
Draw the dependency graph for the grammar in Exercise 4.

Draw the dependency graph for the grammar in Exercise 4.

Naveen Kumar 3

296 views

Naveen Kumar 3 asked Apr 19, 2019

1 votes

0 answers

7412

Peter Linz Edition 4 Exercise 6.2 Question 6 (Page No. 169)
Let $G = (V, T, S, P)$ be any context-free grammar without any $λ$-productions or unit-productions. Let $k$ be the maximum number of symbols on the right of any production in $P$. Show that there is an equivalent grammar in Chomsky normal form with no more than $(k-1)|P|+|T|$ production rules.

Let $G = (V, T, S, P)$ be any context-free grammar without any $λ$-productions or unit-productions.Let $k$ be the maximum number of symbols on the right of any productio...

Naveen Kumar 3

1.1k views

Naveen Kumar 3 asked Apr 19, 2019

0 votes

0 answers

7413

Peter Linz Edition 4 Exercise 6.2 Question 5 (Page No. 169)
Convert the grammar with productions $S\rightarrow AB|aB,$ $A\rightarrow aab|\lambda,$ $B\rightarrow bbA$ into Chomsky normal form.

Convert the grammar with productions$S\rightarrow AB|aB,$$A\rightarrow aab|\lambda,$$B\rightarrow bbA$ into Chomsky normal form.

Naveen Kumar 3

282 views

Naveen Kumar 3 asked Apr 19, 2019

0 votes

0 answers

7414

Peter Linz Edition 4 Exercise 6.2 Question 4 (Page No. 169)
Transform the grammar with productions $S\rightarrow abAB,$ $A\rightarrow bAB|\lambda,$ $B\rightarrow BAa|A|\lambda$ into Chomsky normal form.

Transform the grammar with productions$S\rightarrow abAB,$$A\rightarrow bAB|\lambda,$$B\rightarrow BAa|A|\lambda$ into Chomsky normal form.

Naveen Kumar 3

241 views

Naveen Kumar 3 asked Apr 19, 2019

0 votes

0 answers

7415

Peter Linz Edition 4 Exercise 6.2 Question 3 (Page No. 169)
Transform the grammar $S\rightarrow aSaA|A, A\rightarrow abA|b$ into Chomsky normal form.

Transform the grammar $S\rightarrow aSaA|A, A\rightarrow abA|b$ into Chomsky normal form.

Naveen Kumar 3

175 views

Naveen Kumar 3 asked Apr 19, 2019

0 votes

0 answers

7416

Peter Linz Edition 4 Exercise 6.2 Question 2 (Page No. 169)
Convert the grammar $S\rightarrow aSb|ab$ into Chomsky normal form.

Convert the grammar $S\rightarrow aSb|ab$ into Chomsky normal form.

Naveen Kumar 3

125 views

Naveen Kumar 3 asked Apr 19, 2019

0 votes

0 answers

7417

Peter Linz Edition 4 Exercise 6.2 Question 1 (Page No. 169)
Provide the details of the proof of Theorem 6.6. Theorem 6.6 Any context-free grammar $G = (V, T, S, P)$ with $λ ∉ L (G)$ has an equivalent grammar $\widehat G=(\widehat V,\widehat T,S,\widehat P)$ in Chomsky normal form.

Provide the details of the proof of Theorem 6.6.Theorem 6.6Any context-free grammar $G = (V, T, S, P)$ with $λ ∉ L (G)$ has an equivalent grammar $\widehat G=(\widehat...

Naveen Kumar 3

164 views

Naveen Kumar 3 asked Apr 19, 2019

1 votes

1 answer

7418

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$

Mk Utkarsh

951 views

Mk Utkarsh asked Apr 19, 2019

1 votes

1 answer

7419

JEST Cut Off for CDS CSA
What is the cut off rank in JEST called for Mtech Research in CSA and CDS in general category and EWS category?

What is the cut off rank in JEST called for Mtech Research in CSA and CDS in general category and EWS category?

N

1.1k views

N asked Apr 18, 2019

0 votes

0 answers

7420

Assignment 2.9 (b) page no. 28 from book Classic Data Structures Second Edition by Debasis Samanta
Obtain the indexing formula for lower-right and upper-left triangular matrices using row-major order and column-major order. Consider the cases of : square matrix of order n x n. non-square matrix of order m x n, m ≠ n. I need a solution with explanation thanks in advance.

Obtain the indexing formula for lower-right and upper-left triangular matrices using row-major order and column-major order. Consider the cases of :square matrix of order...

mahi.0409

747 views

mahi.0409 asked Apr 18, 2019

0 votes

0 answers

7421

ISI paper
A block of bits with n rows and m columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expression for the probability that the error will be detected.

A block of bits with n rows and m columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expr...

Priyanka17

234 views

Priyanka17 asked Apr 18, 2019

0 votes

0 answers

7422

ISI DBMS
Consider the relations r1(A, B, C), r2(C, D, E) and r3(E, F). Assume that the set of all attributes constitutes the primary keys of these relations, rather than the individual ones. Let V (C, r1) be 500, V (C, r2) be 1000, V (E, r2) be ... r2 has 1500 tuples, and r3 has 750 tuples, then give the ordering of the natural join r1 ▷◁ r2 ▷◁ r3 for its efficient computation. Justify your answer

Consider the relations r1(A, B, C), r2(C, D, E) and r3(E, F). Assume that the set of all attributes constitutes the primary keys of these relations, rather than the indiv...

Priyanka17

434 views

Priyanka17 asked Apr 18, 2019

1 votes

2 answers

7423

Kurose and Ross Edition 6 Exercise 3 Question R17 (Page No 287)
Suppose two TCP connections are present over some bottleneck link of rate R bps. Both connections have a huge file to send (in the same direction over the bottleneck link). The transmissions of the files start at the same time. What transmission rate would TCP like to give to each of the connections?

Suppose two TCP connections are present over some bottleneck link of rate R bps. Both connections have a huge file to send (in the same direction over the bottleneck link...

ajaysoni1924

1.8k views

ajaysoni1924 asked Apr 18, 2019

0 votes

0 answers

7424

Kurose and Ross Edition 6 Exercise 3 Question R13 (Page No 287)
Visit the Selective Repeat Java applet at the companion Web site. Have the source send five packets, and then pause the animation before any of the five packets reach the destination. Then kill the first packet and resume ... what happens. Finally, try sending six packets. What happens? How selective repeat and go back-n is different?

Visit the Selective Repeat Java applet at the companion Web site.Have the source send five packets, and then pause the animation before any of the five packets reach the ...

ajaysoni1924

334 views

ajaysoni1924 asked Apr 18, 2019

0 votes

1 answer

7425

Kurose and Ross Edition 6 Exercise 3 Question R12 (Page No 286)
Visit the Go-Back-N Java applet at the companion Web site. Have the source send five packets, and then pause the animation before any of the five packets reach the destination. Then kill the first packet and ... destination and kill the first acknowledgment. Describe again what happens. Finally, try sending six packets. What happens?

Visit the Go-Back-N Java applet at the companion Web site.Have the source send five packets, and then pause the animation before any of the five packets reach the destina...

ajaysoni1924

1.3k views

ajaysoni1924 asked Apr 18, 2019

0 votes

0 answers

7426

Kurose and Ross Edition 6 Exercise 3 Question R11 (Page No 286)
Suppose that the roundtrip delay between the sender and receiver is constant and known to the sender. Would a timer still be necessary for protocol rdt 3.0 as shown in the figure, assuming that packets can be lost? Explain.

Suppose that the roundtrip delay between the sender and receiver is constant andknown to the sender. Would a timer still be necessary for protocol rdt 3.0 as shown in the...

ajaysoni1924

520 views

ajaysoni1924 asked Apr 18, 2019

1 votes

1 answer

7427

Kurose and Ross Edition 6 Exercise 3 Question R10 (Page No 286)
In our rdt protocols, why did we need to introduce timers?

In our rdt protocols, why did we need to introduce timers?

ajaysoni1924

740 views

ajaysoni1924 asked Apr 18, 2019

0 votes

1 answer

7428

Kurose and Ross Edition 6 Exercise 3 Question R9 (Page No 286)
In our rdt protocols, why did we need to introduce sequence numbers?

In our rdt protocols, why did we need to introduce sequence numbers?

ajaysoni1924

706 views

ajaysoni1924 asked Apr 18, 2019

1 votes

2 answers

7429

Kurose and Ross Edition 6 Exercise 3 Question R8 (Page No 286)
Suppose that a Web server runs in Host C on port 80. Suppose this Web server uses persistent connections and is currently receiving requests from two different Hosts, A and B. Are all of the requests being sent through the ... If they are being passed through different sockets, do both of the sockets have port 80? Discuss and explain.

Suppose that a Web server runs in Host C on port 80. Suppose this Web server uses persistent connections and is currently receiving requests from two different Hosts, A a...

ajaysoni1924

2.0k views

ajaysoni1924 asked Apr 18, 2019

1 votes

1 answer

7430

Kurose and Ross Edition 6 Exercise 3 Question R6 (Page No 286)
Is it possible for an application to enjoy reliable data transfer even when the application runs over UDP? If so, how?

Is it possible for an application to enjoy reliable data transfer even when the application runs over UDP? If so, how?

ajaysoni1924

850 views

ajaysoni1924 asked Apr 18, 2019

1 votes

2 answers

7431

Kurose and Ross Edition 6 Exercise 3 Question R5 (Page No 286)
Why is it that voice and video traffic is often sent over TCP rather than UDP in today’s Internet? (Hint: The answer we are looking for has nothing to do with TCP’s congestion-control mechanism.)

Why is it that voice and video traffic is often sent over TCP rather than UDP in today’s Internet? (Hint: The answer we are looking for has nothing to do with TCP’s c...

ajaysoni1924

585 views

ajaysoni1924 asked Apr 18, 2019

1 votes

1 answer

7432

Kurose and Ross Edition 6 Exercise 3 Question R3 (Page No 286)
Consider a TCP connection between Host A and Host B. Suppose that the TCP segments traveling from Host A to Host B have source port number x and destination port number y. What are the source and destination port numbers for the segments traveling from Host B to Host A?

Consider a TCP connection between Host A and Host B. Suppose that the TCP segments traveling from Host A to Host B have source port number x and destination port number y...

ajaysoni1924

1.8k views

ajaysoni1924 asked Apr 18, 2019

0 votes

0 answers

7433

Kurose and Ross Edition 6 Exercise 3 Question R2 (Page No 285)
Consider a planet where everyone belongs to a family of six, every family lives in its own house, each house has a unique address, and each person in a given house has a unique name. Suppose this planet has a mail ... protocol, does the mail service ever have to open the envelope and examine the letter in order to provide its service?

Consider a planet where everyone belongs to a family of six, every family lives in its own house, each house has a unique address, and each person in a given house has a ...

ajaysoni1924

685 views

ajaysoni1924 asked Apr 18, 2019

0 votes

0 answers

7434

Kurose and Ross Edition 6 Exercise 3 Question R1 (Page No 285)
Suppose the network layer provides the following service. The network layer in the source host accepts a segment of maximum size 1,200 bytes and a destination host address from the transport layer. The network layer then guarantees ... In your protocols, does the transport layer have to do anything in the core of the computer network?

Suppose the network layer provides the following service. The network layer in the source host accepts a segment of maximum size 1,200 bytes and a destination host addres...

ajaysoni1924

634 views

ajaysoni1924 asked Apr 18, 2019

0 votes

0 answers

7435

ISI question bank
Consider the fast square and multiply algorithm to calculate x y mod N as given below, where x, y, N are positive integers and 1 ≤ x, y < N. Input: x, y, N Output: x y mod N 1. z = y, u = 1, v = x; 2. while z > 0 do ... , e.g., more than 512 bits. Assume that the time complexity of modular multiplication is O(log2 N), when the positive integers involved are less than N.]

Consider the fast square and multiply algorithm to calculate x y mod N as given below, where x, y, N are positive integers and 1 ≤ x, y < N.Input: x, y, NOutput: x y mo...

Priyanka17

187 views

Priyanka17 asked Apr 18, 2019

0 votes

0 answers

7436

ISI previous year question
The C function divby3 given below is intended to check whether a given number is divisible by 3. It assumes that the argument number is a string containing the decimal representation of a positive integer, and returns 1 or 0 depending on whether ... positive integers. note: The smaller the number of ALU operations used by your function, the more efficient it would be.

The C function divby3 given below is intended to check whether a given number is divisible by 3. It assumes that the argument number is a string containing the decimal re...

Priyanka17

207 views

Priyanka17 asked Apr 18, 2019

0 votes

0 answers

7437

Swap consecutive algorithm
There are n students standing in a line. The students have to rearrange themselves in ascending order of their roll numbers. This rearrangement must be accomplished only by successive swapping of adjacent students. (i) Design an algorithm for this purpose ... of swaps required. (ii) Derive an expression for the number of swaps needed by your algorithm in the worst case.

There are n students standing in a line. The students have to rearrange themselves in ascending order of their roll numbers. This rearrangement must be accomplished only ...

Priyanka17

269 views

Priyanka17 asked Apr 18, 2019

0 votes

1 answer

7438

Made Easy Test Series : Aptitude
Seetal wants to sell her bicycle, either a profit of $K$% or a loss of $K$%. What is value of $K?$ Statement $1:$ Difference between the amount Seetal gets in the $2$ cases is $Rs 2560$ Statement $2:$ If Seetal profit is $Rs. K$ her profit percentage is $7.5$%

Seetal wants to sell her bicycle, either a profit of $K$% or a loss of $K$%. What is value of $K?$Statement $1:$ Difference between the amount Seetal gets in the $2$ case...

srestha

449 views

srestha asked Apr 18, 2019

0 votes

0 answers

7439

self doubt *0/1 knapsack problem*
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQUAL TO W OR IT CAN BE LESS THAN W AS WELL????

In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQ...

karan25gupta

694 views

karan25gupta asked Apr 17, 2019

0 votes

0 answers

7440

Peter Linz Edition 4 Exercise 6.1 Question 25 (Page No. 164)
Prove the following counterpart of Exercise 23. Let the set of productions involving the variable $A$ on the left be divided into two disjoint subsets $A\rightarrow x_1A|x_2A|...|x_nA,$ and, $A\rightarrow y_1|y_2|...|y_m,$ where $A$ is not a ... $Z\rightarrow x_i|Zx_i,$ $i=1,2,3, ,n.$ is equivalent to the original grammar.

Prove the following counterpart of Exercise 23. Let the set of productions involving the variable $A$ on the left be divided into two disjoint subsets ...

Naveen Kumar 3

142 views

Naveen Kumar 3 asked Apr 17, 2019

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