Dark Mode

Recent activity by Arkaprava

0 answers

1

Can I apply for PhD program at IIT’s after qualifying for JRF ?
I qualified for JRF in the month of June 2023, can I apply for PhD at any Indian university ?

asked in GATE Oct 10, 2023

157 views

1 answer

2

GO Classes Test Series 2023 | Calculus | Test 1 | Question: 13
Suppose $g(x)$ is a polynomial function such that $g(-1)=4$ and $g(2)=7$. Then there is a number $c$ between $-1$ and $2$ such that $g(c)=1$ $g^{\prime}(c)=1$ $g(c)=0$ $g^{\prime}(c)=0$

comment edited in Calculus Aug 29, 2022

632 views

8 answers

3

GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$

answered in Probability Jul 18, 2022

29.5k views

1 answer

4

ISI2018-PCB-CS2
You can climb up a staircase of $n$ stairs by taking steps of one or two stairs at a time. Formulate a recurrence relation for counting $a_n$, the number of distinct ways in which you can climb up the staircase. Mention the boundary conditions for your recurrence relation. Find a closed form expression for $a_n$ by solving your recurrence.

commented in Algorithms May 6, 2022

739 views

9 answers

5

GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$

answered in Combinatory Jul 25, 2021

16.6k views

4 answers

6

TIFR CSE 2011 | Part A | Question: 13
If $z=\dfrac{\sqrt{3}-i}{2}$ and $\large(z^{95}+ i^{67})^{97}= z^{n}$, then the smallest value of $n$ is $1$ $10$ $11$ $12$ None of the above

commented in Quantitative Aptitude Aug 18, 2020

1.4k views

1 answer

7

Ace Academy Question Bank: Automata
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$

commented in Theory of Computation Aug 8, 2020

1.0k views

1 answer

8

ISI2015-PCB-A-1
Given an array $A$ of n positive integers, write a program segment / pseudo-code to print the histogram of $A$ using the hash character ($\#$). Your histogram should consist of $n$ vertical columns of $\#$ with the $i$-th vertical bar containing $A[i]$ number of $\#$'s. For example, ...

answered in Algorithms Mar 13, 2020

533 views

1 answer

9

GATE2015 EC-1: GA-8
Fill in the missing value

commented in Analytical Aptitude Jan 30, 2020

1.8k views

7 answers

10

TIFR CSE 2019 | Part B | Question: 13
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$

answer edited in Combinatory Jan 22, 2020

4.9k views

2 answers

11

ISI2018-MMA-20
Consider the set of all functions from $\{1, 2, . . . ,m\}$ to $\{1, 2, . . . , n\}$,where $n > m$. If a function is chosen from this set at random, the probability that it will be strictly increasing is $\binom{n}{m}/n^m\\$ $\binom{n}{m}/m^n\\$ $\binom{m+n-1}{m-1}/n^m\\$ $\binom{m+n-1}{m}/m^n$

commented in Probability Jun 29, 2019

2.1k views

1 answer

12

Cormen Edition 3 Exercise 2.3 Question 7 (Page No. 39)
Describe a $\Theta(n\ lg\ n)$ time algorithm that, given a set $S$ of $n$ integers and another integer $x$, determines whether or not there exist two elements in $S$ whose sum is exactly $x$.

answered in Algorithms Jun 26, 2019

366 views

1 answer

13

A FIRST COURSE IN PROBABILITY (SHELDON ROSS),CHAPTER 4 RANDOM VARIABLES, QUESTION#43
A carnival swing ride swings to the left with probability 0.4 and to the right with probability. If the ride stops after 10 swings, what is the probability that it is exactly at the place it started?

answered in Probability Jun 26, 2019

753 views

1 answer

14

Self doubt:Pumping Lemma
How by Pumping Lemma we can prove that “context free grammar generate an infinite number of strings” and here what could be pumping length ?

commented in Theory of Computation Jun 15, 2019

666 views

2 answers

15

GATE CSE 1990 | Question: 12b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ ... that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.

commented in Algorithms Jun 14, 2019

2.6k views

1 answer

16

GATE CSE 1988 | Question: 12iic
Using Armstrong’s axioms of functional dependency derive the following rules: $\{ x \rightarrow y, \: z \subset y \} \mid= x \rightarrow z$ (Note: $x \rightarrow y$ denotes $y$ is functionally dependent on $x$, $z \subseteq y$ denotes $z$ is subset of $y$, and $\mid =$ means derives).

answered in Databases Jun 14, 2019

1.3k views

1 answer

17

Go-schedule information
As per Gate Overflow Schedule for 2020 for the first week we have to study " Logical Reasoning and Data Interpretation: Verbal reasoning deriving conclusion from passage, conclusions as in puzzles (can be in mathematical logic also) ". So which topics are covered under this and what questions to practice from GO PDF?

answered in Verbal Aptitude Jun 12, 2019

482 views

4 answers

18

Self doubt DIGITAL LOGIC
Is Y' + Z' same as (YZ)' ? Please explain this concept of compliments..!!

answered in Digital Logic Jun 11, 2019

651 views

1 answer

19

TIFR CSE 2012 | Part A | Question: 4
Let $\text{ABC}$ be a triangle with $\text{n} $ distinct points inside. A triangulation of $\text{ABC}$ with respect to the $\text{n}$ points is obtained by connecting as many points as possible, such that no more line segments can be added without intersecting other line segments. In ... with $n$ points inside it? $3n - 1$ $n^{2} + 1$ $n + 3$ $2n + 1$ $4n - 3$

commented in Quantitative Aptitude Jun 11, 2019

889 views

2 answers

20

Theory of Computation: Context Free Languages
Hi, I am having a doubt understanding the result of CFL - Regular: Here's my approach: CFL - Regular = CFL INTERSECTION Regular' = CFL INTERSECTION Regular = CFL Suppose some CFL L1= {a^n b^n | n>=1} and some Regular R1= (a+b)* ... to say CFL - Regular = Regular or CFL - Regular = CFL ? If both are separate options, which one should I go for? Thanks

answered in Theory of Computation Jun 9, 2019

410 views

3 answers

21

GEEKS FOR GEEKS GATE 2017 MOCK
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)

answered in Algorithms Jun 9, 2019

3.6k views

4 answers

22

GATE2017 CE-2: GA-9
Budhan covers a distance of $19$ km in $2$ hours by cycling one fourth of the time and walking the rest. The next day he cycles (at the same speed as before) for half the time and walks the rest (at the same speed as before) and covers $26$ km in $2$ hours. The speed in km/h at which Budhan walk is $1$ $4$ $5$ $6$

commented in Quantitative Aptitude Jun 7, 2019

2.8k views

4 answers

23

Nfa dfa toc ace 1

commented in Theory of Computation Jun 6, 2019

1.1k views

1 answer

24

Self doubt in percentage and mixtures
In a mixture of 80 litres of milk and water, 25% of the mixture is milk. How much water should be added to the mixture so that milk becomes 20% of the mixture? (a) 20 litres (b) 15 litres (c) 25 litres (d) None of these

answer edited in Quantitative Aptitude Jun 4, 2019

357 views

1 answer

25

Doubt on Bipartite Graph
What is T.C. to find maximum number of edges to be added to a tree so that it stays as a bipartite graph? Now my question is, why do we need to add edges to make a tree bipartite? A tree is already bipartite graph. Right?? Again how do we add edges in it?? Is BFS or DFS do any improvement in such a tree?? How to think such a question??

commented in Algorithms Jun 2, 2019

629 views

0 answers

26

#Rosen exercise-1 ,question-71 counting
use mathematical induction to prove the sum rule for m tasks from the sum rule for two tasks.

commented in Combinatory Jun 2, 2019

247 views

2 answers

27

Made Easy Test Series:Algo- Asymptotic Complexity
$1)n^{2019}=O\left (n^{2020} \right )$ $2)O(n^{2019})=O\left (n^{2020} \right )$ Which one is correct?? If $1)$ is correct, why $2)$ not correct?

commented in Algorithms Jun 2, 2019

1.3k views

0 answers

28

Descrete Mathematic ACE Text Book Practice Question #16
A women's health clinic has four doctors and each patient is assigned to one of them. If a patient givs birth btween 8 am and 4 pm, then her chance of being attended by her assigned doctor is 3/4, otherwise it is 1/4. What is the probability ... is attended by the assigned doctor when she gives birth? (A) 25/144 (B) 5/12 (C) 7/12 (D) 1/12

commented in Mathematical Logic May 30, 2019

885 views

1 answer

29

Probability question of CLRS
In a restaurant each of $n$ customer gives a hat to the hat check person. The hat check person gives the hat back to the customer in a random order. What is expected number of customer who get back their own hat?

commented in Probability May 27, 2019

876 views

3 answers

30

GateBook Test Series: Digital Logic - Boolean Algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above

answered in Digital Logic May 25, 2019

1.3k views