Dark Mode

Recent questions tagged difficult

0 votes

2 answers

1

made easy test series for gate cse 2023
please help me out in solving this question. the solution provided there is not upto the mark

sachidanand_dwivedi asked in Programming in C Dec 21, 2022

by sachidanand_dwivedi

1.1k views

0 votes

1 answer

2

Parsing Table | Shift Reduce Parsers | Numerical Answer
Consider the following statements regarding the Parsing Table of a shift reduce parser, for any given grammar No. of states/ size of parse table is same for all Shift-Reduce Parsers. No. of states/ size of parse table in LR(0), SLR(1 ... CORRECT statement is _______ (For example, if statement 1 and 7 are correct, answer would be 1+7, i.e. 8)

Souvik33 asked in Compiler Design Dec 11, 2022

667 views

10 votes

1 answer

3

GATE CSE 2021 Set 1 | Question: 35
Consider the two statements. $S_1:\quad$ There exist random variables $X$ and $Y$ such that $ \left(\mathbb E[(X-\mathbb E(X))(Y-\mathbb E(Y))]\right)^2>\textsf{Var}[X]\textsf{Var}[Y]$ $S_2:\quad$ For all random variables $X$ ... $S_2$ are true $S_1$ is true, but $S_2$ is false $S_1$ is false, but $S_2$ is true Both $S_1$ and $S_2$ are false

Arjun asked in Probability Feb 18, 2021

by Arjun

7.3k views

0 votes

0 answers

4

Cormen Edition 3 Exercise 10.2 Question 8 (Page No. 241)
Explain how to implement doubly linked lists using only one pointer value $x.np$ per item instead of the usual two (next and prev). Assume that all pointer values can be interpreted as $k$-bit integers, and define $x.np$ ... $INSERT$, and $DELETE$ operations on such a list. Also, show how to reverse such a list in $O(1)$ time.

akash.dinkar12 asked in Algorithms Jun 30, 2019

by akash.dinkar12

640 views

1 vote

0 answers

5

Cormen Edition 3 Exercise 8.4 Question 5 (Page No. 204)
A probability distribution function $P(x)$ for a random variable $X$ is defined by $P(x) =Pr\{X\leq x\}$.Suppose that we draw a list of $n$ random variables $X_1,X_2,…,X_n$ from a continuous probability distribution function $P$ that is computable in $O(1)$ time. Give an algorithm that sorts these numbers in linear averagecase time.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

445 views

0 votes

0 answers

6

Cormen Edition 3 Exercise 8.4 Question 4 (Page No. 204)
We are given $n$ points in the unit circle, $P_i=(x_i,y_i)$, such that $0<x_i^2+y_i^2<1$ for $i=1,2, .,n$.Suppose that the points are uniformly distributed; that is, the probability of finding a point in ... the origin. (Hint: Design the bucket sizes in BUCKET-SORT to reflect the uniform distribution of the points in the unit circle.)

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

640 views

1 vote

1 answer

7

Cormen Edition 3 Exercise 7.4 Question 6 (Page No. 185)
Consider modifying the PARTITION procedure by randomly picking three elements from the array $A$ and partitioning about their median (the middle value of the three elements). Approximate the probability of getting at worst a $\alpha$-to-$(1-\alpha)$ split, as a function of $\alpha$ in the range $0<\alpha<1$.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

1.1k views

1 vote

1 answer

8

Cormen Edition 3 Exercise 7.2 Question 6 (Page No. 179)
Argue that for any constant $0<\alpha\leq 1/2$, the probability is approximately $1-2\alpha$ that on a random input array, PARTITION produces a split more balanced than $1-\alpha$ to $\alpha$.

akash.dinkar12 asked in Algorithms Jun 27, 2019

by akash.dinkar12

401 views

Page:

1
2
3
4
next »

Recent questions tagged difficult