Recent activity by Miny / GATE Overflow for GATE CSE

6 answers

1

GATE CSE 2003 | Question: 6
Let $T(n)$ be the number of different binary search trees on $n$ distinct elements. Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$ $n-k$ $n-k-1$ $n-k-2$

Let $T(n)$ be the number of different binary search trees on $n$ distinct elements.Then $T(n) = \sum_{k=1}^{n} T(k-1)T(x)$, where $x$ is $n-k+1$$n-k$$n-k-1$$n-k-2$

23.7k views

commented Apr 17, 2019

1 answer

2

Microprogrammed approach
Microprogrammed control Unit is useful when very small programs are to be run. Shouldn’t this statement be true because microprogrammed approach uses decoder, which slows down speed, so large programs would take more time, and small ones less?

Microprogrammed control Unit is useful when very small programs are to be run. Shouldn’t this statement be true because microprogrammed approach uses decoder, which slo...

319 views

asked Apr 12, 2019

0 answers

3

PhD admission
I have the below GATE 522 score CSE(open category) B.Tech 7.9 CGPA 2 years work experience JEST rank 65(part a) I know i don’t have much, but do I have any chance of PhD/direct PhD in IITs? It would very helpful for me to recieve a kind suggestion, thankyou.

I have the belowGATE 522 score CSE(open category)B.Tech 7.9 CGPA2 years work experienceJEST rank 65(part a)I know i don’t have much, but do I have any chance of PhD/dir...

519 views

edited Apr 5, 2019

4 answers

4

Subnet addresses
A class B network address 130.50.0.0 is submitted as follows. The last 10 bits of the host id are allotted for host number and the remaining 6 bits are reserved for subnet number. How many subnets and number of hosts in each subnet are possible with above scheme ? 62,1022 30,510 14,254 ... 130.50.4.1 and 130.50.16.1 130.50.1.1 and 130.50.4.1 130.50.0.0 and 130.50.3.0 None of these

A class B network address 130.50.0.0 is submitted as follows. The last 10 bits of the host id are allotted for host number and the remaining 6 bits are reserved for subne...

2.3k views

answer edited Mar 26, 2019

1 answer

5

DBMS Korth Edition 6 Exercise 2 Question 11 (Page No. 54)
Describe the differences in meaning between the terms relation and relation schema.

Describe the differences in meaning between the terms relation and relation schema.

304 views

answered Mar 23, 2019

4 answers

6

GATE IT 2004 | Question: 62
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$ ... Time First) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$

A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service...

10.4k views

commented Mar 23, 2019

4 answers

7

GATE CSE 1988 | Question: 2xb
State any undesirable characteristic of the following criteria for measuring performance of an operating system: Waiting time

State any undesirable characteristic of the following criteria for measuring performance of an operating system:Waiting time

2.9k views

answered Dec 5, 2018

11 answers

8

GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$

Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$$\epsilon + 0\left(10^*1+00\right)^*0$$\epsilon...

12.7k views

commented Oct 27, 2018

2 answers

9

gate 1987
In GATE 1987 question, order of $\Sigma$O(n)$ was found to be $O(n^2)$. Similarly, what will be the answer for order of $\Sigma$O(n^2)$ ? Will it be of $O(n^3)$ ? Thanks!

In GATE 1987 question, order of $\Sigma$$O(n)$ was found to be $O(n^2)$.Similarly, what will be the answer for order of $\Sigma$$O(n^2)$ ? Will it be of $O(n^3)$ ?Thanks...

608 views

answered Jun 15, 2018

4 answers

10

GATE CSE 2016 Set 1 | Question: 17
Which of the following decision problems are undecidable? Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$ Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in \Sigma^{*}$, does $x \in L(G)$} ? Given CFGs $G_1$ and $G_2$, is $L (G_1) = L(G_2)$? Given a TM $M$, is $L(M)=\Phi$ ? I and IV only II and III only III and IV only II and IV only

Which of the following decision problems are undecidable?Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in ...

8.6k views

commented Feb 16, 2017

2 answers

11

Find Time complexity

598 views

answered Jul 24, 2015

3 answers

12

why is the time complexity of operations like isempty, isfull, size, delete stack takes constant time ?

According to me when we perform the above operations we have to traverse the entire list so then why does it all take constant time ?

4.1k views

answered Jul 24, 2015

1 answer

13

Hi.i need a correct explanation on binary search..how it will be log n.

404 views

asked Jul 24, 2015

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