Answers by meghna / GATE Overflow for GATE CSE

12 votes

1

GATE CSE 2016 Set 1 | Question: 25
Which of the following is/are example(s) of stateful application layer protocol? $\textsf{HTTP}$ $\textsf{FTP}$ $\textsf{TCP}$ $\textsf{POP3}$ $\text{(i)}$ and $\text{(ii)}$ only $\text{(ii)}$ and $\text{(iii)}$ only $\text{(ii)}$ and $\text{(iv)}$ only $\text{(iv)}$ only

Which of the following is/are example(s) of stateful application layer protocol?$\textsf{HTTP}$$\textsf{FTP}$$\textsf{TCP}$$\textsf{POP3}$$\text{(i)}$ and $\text{(ii)}$ o...

18.9k views

answered May 6, 2018

27 votes

2

GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined

You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P...

39.0k views

answered Apr 27, 2018

1 votes

3

Brute Force Parsing
Which of the following can be said about the Exhaustive search parsing or brute force parsing ? It is inefficient as the time taken is proportional to the length of the string. The parser always terminates on the strings in the $L(G)$. The parser always terminates on the strings not in $L(G)$. $\text{1 & 2}$ $\text{2 & 3}$ $\text{1 & 3}$ $\text{1, 2 & 3}$

Which of the following can be said about the Exhaustive search parsing or brute force parsing ?It is inefficient as the time taken is proportional to the length of the st...

1.5k views

answered Apr 13, 2018

1 votes

4

#Theory of computation #Regular Expresions
Regular expression always generates a language.Is it true?Why?

Regular expression always generates a language.Is it true?Why?

382 views

answered Apr 11, 2018

0 votes

5

Peter Linz ex 2.2
Construct an nfa that accepts all integer number in C.

Construct an nfa that accepts all integer number in C.

2.1k views

answered Apr 7, 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