Dark Mode

Answers by Oaesp

0 votes

1

GATE CSE 2002 | Question: 2.10
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values: Choose an $i$ at random from $1..n$ If $A[i] = x$, then Stop else Goto 1; Assuming that $x$ is present in $A$, what is the expected number of comparisons made by the algorithm before it terminates? $n$ $n-1$ $2n$ $\frac{n}{2}$

answered in Algorithms Aug 11, 2022

18.2k views

1 vote

2

GATE IT 2005 | Question: 1
A bag contains $10$ blue marbles, $20$ green marbles and $30$ red marbles. A marble is drawn from the bag, its colour recorded and it is put back in the bag. This process is repeated $3$ ... $\left(\dfrac{1}{6}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{3}\right)$

answered in Probability Jun 27, 2022

6.4k views

0 votes

3

GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...

answered in Mathematical Logic Nov 26, 2021

11.7k views

0 votes

4

GATE CSE 1999 | Question: 22-a
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Find all employees names who work in departments located at ‘Calcutta’ and whose salary is greater than Rs.50,000. Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000.

answered in Databases Nov 11, 2021

10.7k views