Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
air1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by air1
16
answers
1
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ___...
15.4k
views
commented
Dec 18, 2018
Combinatory
gatecse-2015-set3
combinatory
normal
numerical-answers
+
–
1
answer
2
largest number
I take an integer $n$ .If $n$ is even, I divide it by $2$, if it is odd, I multiple $n$ by $3$ and add one to the product.I keep doing this till the number reduces to $1$.If I start with $5$ for example,I reach $1$ in $5$ ... . $7$ takes $16$ steps to reach $1$. The number between $1$ and $2000000000$ that requires the largest number of steps to reach $1$ this way is?
I take an integer $n$ .If $n$ is even, I divide it by $2$, if it is odd, I multiple $n$ by $3$ and add one to the product.I keep doing this till the number reduces to $1$...
461
views
commented
Mar 21, 2018
Quantitative Aptitude
quantitative-aptitude
+
–
0
answers
3
Combinatorics
There are total 21 identical balls in a shop and 7 children. In how many ways can 7 children claim the balls? (it is not necessary to claim all the balls)
There are total 21 identical balls in a shop and 7 children. In how many ways can 7 children claim the balls? (it is not necessary to claim all the balls)
1.3k
views
commented
Mar 3, 2018
Combinatory
combinatory
+
–
4
answers
4
GATE CSE 1987 | Question: 1-xxi
If $a, b,$ and $c$ are constants, which of the following is a linear inequality? $ax+bcy=0$ $ax^{2}+cy^{2}=21$ $abx+a^{2}y \geq 15$ $xy+ax \geq 20$
If $a, b,$ and $c$ are constants, which of the following is a linear inequality?$ax+bcy=0$$ax^{2}+cy^{2}=21$$abx+a^{2}y \geq 15$$xy+ax \geq 20$
3.9k
views
commented
Jan 27, 2018
Linear Algebra
gate1987
linear-algebra
inequality
out-of-gate-syllabus
+
–
0
answers
5
Introduction to algorithms by Cormen
Determine an LCS of {1,0,0,1,0,1,0,1} (assume A) and {0,1,0,1,1,0,1,1,0} (assume B) If we draw the matrix and backtrack then one of the possible sequence is 100110. But this sequence won't appear in B. So, how come while backtracking it gives this as a solution. https://gateoverflow.in/?qa=blob&qa_blobid=3569576287134533309
Determine an LCS of {1,0,0,1,0,1,0,1} (assume A) and {0,1,0,1,1,0,1,1,0} (assume B)If we draw the matrix and backtrack then one of the possible sequence is 100110. But th...
874
views
commented
Jul 16, 2017
Algorithms
algorithms
longest-common-subsequence
+
–
1
answer
6
What's the coefficient of this expansion??
What's the coefficient of $x^7$ in $(2x+4)^{10}$?
What's the coefficient of $x^7$ in $(2x+4)^{10}$?
535
views
commented
Jul 11, 2017
Mathematical Logic
combinatory
engineering-mathematics
+
–
1
answer
7
probability
India plays two matches each with West Indies and Srilanka. In any match the probabilities of India getting points 0,1 and 2 are 0.45,0.05 and 0.50 respectively. Assuming that the outcomes are independent, the probability of India getting at least 7 points is? a) 0.8750 b) 0.0875 c) 0.0625 d) 0.0250
India plays two matches each with West Indies and Srilanka. In any match the probabilities of India getting points 0,1 and 2 are 0.45,0.05 and 0.50 respectively. Assuming...
608
views
commented
Jul 11, 2017
Probability
probability
engineering-mathematics
+
–
1
answer
8
Gatebook
I am not able to understand the last component in square brackets we have to minus from all combinations the combinations with that dotted line but intersection part i didn't get
I am not able to understand the last component in square brackets we have to minus from all combinations the combinations with that dotted line but intersection part i di...
523
views
commented
Jul 9, 2017
8
answers
9
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
23.9k
views
commented
Jul 9, 2017
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
0
answers
10
Discrete Mathematics for Computer Scientists and Mathematicians , Chapter- 2 , Exercise- 2.1, Question-36
Twenty athletes compete in a contest. Each of 3 judges assign 20 different ratings to the 20 athletes. For an athlete to be named winner he must be given the highest rati...
426
views
commented
Jul 6, 2017
Combinatory
discrete-mathematics
combinatory
+
–
1
answer
11
Find n(K) where K is the size of string that a DFA accepts.
Subject: Finite Automata Topic: DFA Q) Can anyone explain me how i can find the no of strings of length k words that is accepted by a given DFA. Do post the resources which can be helpful to understand this concept.
Subject: Finite AutomataTopic: DFAQ) Can anyone explain me how i can find the no of strings of length k words that is accepted by a given DFA.Do post the resources which ...
909
views
commented
Jul 5, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
12
GATE Overflow | Programming | Test 1 | Question: 1
What will be the output of the following C program? #include <stdio.h> int main() { int f1(int,int); int x = 9,n = 3; printf("%d", f1(x, n)); } int f1(int x, int n) { int y = 1,i = 1; for(i = 1;i <= n; i++) y = y * x; return(y); } 27 729 81 Compilation Error
What will be the output of the following C program?#include <stdio.h int main() { int f1(int,int); int x = 9,n = 3; printf("%d", f1(x, n)); } int f1(int x, int n) { int y...
1.2k
views
commented
Jul 1, 2017
Programming in C
go-programming-1
programming
programming-in-c
+
–
1
answer
13
aptitude
let a1,a2,a3...........a10 be integers such that 0<a1<a2<a3................<a10 if S=a1+a2+a3 +........+a10 then 110<= S<= 55 110<=S 55<=S 55<=S<=110
let a1,a2,a3...........a10 be integers such that 0<a1<a2<a3................<a10 if S=a1+a2+a3 +........+a10 then110<= S<= 55110<=S55<=S55<=S<=110
317
views
commented
Jun 29, 2017
Verbal Aptitude
quantitative-aptitude
+
–
0
answers
14
C programming
How can we print these alphabets using simple c program? A BC CDEF DEFGHIJ EFGHIJKLMNO
How can we print these alphabets using simple c program? ABCCDEFDEFGHIJEFGHIJKLMNO
273
views
commented
Jun 27, 2017
0
answers
15
Combinatorics : Multinomial Coefficients
What's the relationship between combination and polynomial equation? I mean, I am not able to grasp certain points here or let's say connect them into a whole: 1. Take a question where it's asked that we have ... doing probability's tricky questions. EDIT: Here's the images of different questions. How do I differentiate between them?
What's the relationship between combination and polynomial equation? I mean, I am not able to grasp certain points here or let's say connect them into a whole:1. Take a q...
909
views
commented
Jun 24, 2017
Combinatory
combinatory
discrete-mathematics
engineering-mathematics
polynomials
+
–
0
answers
16
[Discrete Maths] Inclusion/Exclusion Probability
find the probability that when four numbers from 1 to 100,inclusive,are picked at random with no repetitions allowed,either all are odd,all divisible by 3,or all divisible by 5
find the probability that when four numbers from 1 to 100,inclusive,are picked at random with no repetitions allowed,either all are odd,all divisible by 3,or all divisibl...
758
views
comment edited
Jun 20, 2017
Mathematical Logic
discrete-mathematics
combinatory
+
–
1
answer
17
#Algorithm+
hi i got this question in an interview question can anyone provide me the algorithm to this. You've got a table of size N*M containing positive integers. We'll consider the table rows numbered from top to bottom 1 through N, and the columns numbered from left to right 1 through M. ... case for clarification) Sample Input 3 3 2 3 7 5 4 2 3 7 11 Sample Output 4 1 1 2 1 3 2 3 3
hi i got this question in an interview question can anyone provide me the algorithm to this.You've got a table of size N*M containing positive integers. We'll consider th...
661
views
commented
Jun 11, 2017
Algorithms
algorithm-design
+
–
1
answer
18
Finding best time complexity
$\begin{align*} & a[n] = \{x_1,x_2,x_3,x_4,....,x_n\} \text{ is an array of integers where } n,x_i > 0. \\ & A = \left [ \text{min}\left ( x_i,x_j \right ) \right ] \cdot \left ( j-i \right ) \text{ where } j > i \text{ and } i,j \leq n \\ & \text{What is the best time complexity to find out the value of } A_{\bf max} \; ? \end{align*}$
$\begin{align*} & a[n] = \{x_1,x_2,x_3,x_4,....,x_n\} \text{ is an array of integers where } n,x_i 0. \\ & A = \left [ \text{min}\left ( x_i,x_j \right ) \right ] \cdot ...
1.1k
views
commented
May 28, 2017
Algorithm Challenges
algorithms
time-complexity
+
–
4
answers
19
GATE CSE 2016 Set 1 | Question: 51
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This...
21.3k
views
commented
Feb 1, 2017
Databases
gatecse-2016-set1
databases
transaction-and-concurrency
normal
+
–
1
answer
20
Probability
A,B,C and D are four players playing the dice game and who gets the number 5 first wins the game. If A starts first what is the probability that D wins the game in second trail is
A,B,C and D are four players playing the dice game and who gets the number 5 first wins the game. If A starts first what is the probability that D wins the game in second...
729
views
commented
Jan 25, 2017
Probability
probability
engineering-mathematics
+
–
0
answers
21
Evaluation order in return statement
//Consider the following C program #include <stdio.h> int f(int *a,int *b,int c) { if(c == 0) return 1; else { *b = *b-1; *a = *a+1; c = c - 1; return *a + f(a,b,c) + *b; } } int main() { int ... ,c)); return 0; } Doubts : Is there any undefined behaviour according to C language? if NO, then what will be the output ? Please explain with proper explanation.
//Consider the following C program #include <stdio.h int f(int *a,int *b,int c) { if(c == 0) return 1; else { *b = *b-1; *a = *a+1; c = c - 1; return *a + f(a,b,c) + *b; ...
1.5k
views
commented
Jan 23, 2017
Programming in C
programming-in-c
+
–
1
answer
22
probability
1.7k
views
commented
Jan 21, 2017
1
answer
23
Calculation
#how to calulate this my results is not coming correct #??
#how to calulate this my results is not coming correct #??
222
views
answered
Jan 21, 2017
1
answer
24
MADE EASY TEST SERIES
What is the output of the following program?
What is the output of the following program?
401
views
answered
Jan 21, 2017
2
answers
25
Compiler Design
How to do this type of QUESTIONS? Consider following grammar : S → S1 + A | A A → D – A | D D → D1 * B | B B → num The number of internal nodes for the parse tree for 5 * 4 + 10 * 6 – 7 – 8
How to do this type of QUESTIONS?Consider following grammar : S → S1 + A | A A → D – A | D D → D1 * B | B B → num The number of internal nodes for the parse tre...
2.7k
views
commented
Jan 19, 2017
Compiler Design
compiler-design
grammar
parsing
numerical-answers
+
–
1
answer
26
number of BST
The number of BST possible with 6 nodes numbered 1, 2, 3, 4, 5 and 6 with exactly one leaf node __________
The number of BST possible with 6 nodes numbered 1, 2, 3, 4, 5 and 6 with exactly one leaf node __________
3.2k
views
commented
Jan 19, 2017
DS
binary-search-tree
numerical-answers
+
–
2
answers
27
probability
two independent random variables X and Y are uniformly distributed in[-1,1] probability that max(X,Y) is less than 1/2 1)3/4 2) 9/16 3)1/4 4)2/3
two independent random variables X and Y are uniformly distributed in[-1,1] probability that max(X,Y) is less than 1/21)3/42) 9/163)1/44)2/3
5.2k
views
commented
Jan 18, 2017
0
answers
28
imp. question
565
views
commented
Jan 17, 2017
0
answers
29
summation series
what is the summation of this series? S=nC0*20+nC1*21+nC2*22+..............nCn*2n
what is the summation of this series?S=nC0*20+nC1*21+nC2*22+..............nCn*2n
430
views
commented
Jan 17, 2017
Combinatory
summation
+
–
0
answers
30
ace mock knapsack
413
views
commented
Jan 17, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register