Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Combinatory:
Recent questions tagged combinatory
1
votes
1
answer
841
In a multiple-choice test there are 6 questions.
In a multiple-choice test there are 6 questions. 4 alternatives answers are given for each question by choosing one answer for each question, then the number of ways to get exactly 4 correct answers is (A) ; (B) 135; (C) 9; (D) 120.
In a multiple-choice test there are 6 questions. 4 alternatives answers are given for each question by choosing one answer for each question, then the number of ways to g...
.
1.4k
views
.
asked
Feb 23, 2017
Combinatory
combinatory
+
–
1
votes
1
answer
842
There are 7 identical white balls and 3 identical black balls.
There are 7 identical white balls and 3 identical black balls. The number of distinguishable arrangements in a row of all the balls, so that no two black balls are adjacent, is (A) 120; (B) 89(8!); (C) 56; (D) 42x.
There are 7 identical white balls and 3 identical black balls. The number of distinguishable arrangements in a row of all the balls, so that no two black balls are adjace...
.
3.6k
views
.
asked
Feb 23, 2017
Combinatory
combinatory
+
–
1
votes
0
answers
843
In an examination, the score in each of the four languages
In an examination, the score in each of the four languages – Bengali, Hindi, Urdu and Telegu- can be integers between 0 and 10. Then the number of ways in which a student can secure a total score of 21 is (A) 880; (B) 760; (C) 450; (D) 1360.
In an examination, the score in each of the four languages – Bengali, Hindi, Urdu and Telegu- can be integers between 0 and 10. Then the number of ways in which a stude...
.
1.6k
views
.
asked
Feb 23, 2017
Combinatory
combinatory
+
–
0
votes
1
answer
844
The number of ways in which three non-negative integers
The number of ways in which three non-negative integers can be chosen such that is
The number of ways in which three non-negative integers can be chosen such that is
.
622
views
.
asked
Feb 23, 2017
Combinatory
combinatory
+
–
2
votes
2
answers
845
Generating function
The coefficient of in the expansion of is
The coefficient of in the expansion of is
.
756
views
.
asked
Feb 22, 2017
Combinatory
generating-functions
combinatory
+
–
0
votes
1
answer
846
#combinatorics #aptitude
Vicky rix
658
views
Vicky rix
asked
Feb 14, 2017
Combinatory
combinatory
discrete-mathematics
engineering-mathematics
+
–
0
votes
2
answers
847
combinatorics
Vicky rix
879
views
Vicky rix
asked
Feb 14, 2017
Quantitative Aptitude
combinatory
discrete-mathematics
engineering-mathematics
+
–
39
votes
6
answers
848
GATE CSE 2017 Set 1 | Question: GA-9
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways ... the shirts so that no one has a shirt with a colour he or she dislikes? $21$ $18$ $16$ $14$
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shwet...
Arjun
10.0k
views
Arjun
asked
Feb 14, 2017
Quantitative Aptitude
gatecse-2017-set1
combinatory
quantitative-aptitude
+
–
58
votes
9
answers
849
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
Arjun
17.7k
views
Arjun
asked
Feb 14, 2017
Combinatory
gatecse-2017-set2
combinatory
generating-functions
numerical-answers
normal
+
–
0
votes
2
answers
850
#first course in probability #sheldon_ross
In how many ways can 3 boys and 3 girls can sit together such that ONLY boys should together?
In how many ways can 3 boys and 3 girls can sit together such that ONLY boys should together?
Vicky rix
465
views
Vicky rix
asked
Feb 10, 2017
Combinatory
combinatory
discrete-mathematics
engineering-mathematics
+
–
2
votes
1
answer
851
Test by Bikram | Mock GATE | Test 3 | Question: 4
There are coloured pens in a box. $10$ black ones, $8$ blue, $8$ green, $4$ red. With closed eyes, a person picks up some number of pens from the box. The least number of pens that person needs to pick up to ensure they get at least $4$ pens of the same color is _____.
There are coloured pens in a box. $10$ black ones, $8$ blue, $8$ green, $4$ red. With closed eyes, a person picks up some number of pens from the box.The least number of ...
Bikram
302
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
discrete-mathematics
combinatory
pigeonhole-principle
numerical-answers
+
–
3
votes
2
answers
852
gatebook
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's? (A) 5! ways (B) 7! ways (C) 8! ways (D) 4! ways Note: AMZIA is valid and AIA is also valid right?
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's?(A) 5! ways(B) 7! ways(C) 8! ways(D) 4! waysNote: AMZIA i...
Purple
956
views
Purple
asked
Feb 7, 2017
Quantitative Aptitude
gatebook
combinatory
+
–
0
votes
0
answers
853
How to Calculate No of Simple graph with labelled vertices?
No of Simple Undirected Graph with unablled vertices - 2nC2 No of Simple Undirected Graph with labelled vertices - ? No of Simple Undirected Connected Graph with unablled vertices - ? No of Simple Undirected Connected Graph with labelled vertices - ?
No of Simple Undirected Graph with unablled vertices - 2nC2No of Simple Undirected Graph with labelled vertices - ?No of Simple Undirected Connected Graph with unablled v...
yg92
452
views
yg92
asked
Feb 5, 2017
Programming in C
graph-theory
graph-algorithms
data-structures
algorithms
combinatory
+
–
1
votes
2
answers
854
Combinations
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
rahul sharma 5
1.8k
views
rahul sharma 5
asked
Feb 3, 2017
Mathematical Logic
combinatory
+
–
3
votes
1
answer
855
Stacks and Permutation
A stack A has 4 entries as following sequence a,b,c,d and stack B is empty. An entry popped out of stack A can be printed or pushed to stack B. An entry popped out of stack B can only be printed. Then the number of possible permutations that the entries can be printed will be ? Stack A Stack B = empty a(TOP) b c d
A stack A has 4 entries as following sequence a,b,c,d and stack B is empty. An entry popped out of stack A can be printed or pushed to stack B. An entry popped out of sta...
Prajwal Bhat
3.5k
views
Prajwal Bhat
asked
Feb 3, 2017
DS
combinatory
discrete-mathematics
data-structures
+
–
9
votes
1
answer
856
P&C examples : finding no of ways
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls , 5 identical yellow balls and 3 identical blue balls are_______ .
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls , 5 identical yellow balls and 3 identical blue balls are_______ .
S Ram
2.3k
views
S Ram
asked
Feb 2, 2017
Others
combinatory
see-later
+
–
1
votes
0
answers
857
set theory
Let S = {1, 2,......,10 }. The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don’t distinguish the pair A,B and B,A)
Let S = {1, 2,......,10 }.The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don&...
indrajeet
381
views
indrajeet
asked
Feb 1, 2017
Mathematical Logic
discrete-mathematics
set-theory&algebra
combinatory
+
–
3
votes
1
answer
858
permutation and combination
How may binary sequence of length 10 with 4 zeroes such that 2 zeroes are never together?
How may binary sequence of length 10 with 4 zeroes such that 2 zeroes are never together?
harshit agarwal
363
views
harshit agarwal
asked
Jan 31, 2017
Combinatory
combinatory
+
–
1
votes
1
answer
859
Permutation and combinations
I am confused with Following formulaes of combination.. 1. n!/r! 2. n+k-1 C k 3. (P+1)*2^R where (P+R are total things and P are alike). 4. question such as number of ways of choosing 10 balls out of 15 balls in which 5 are red,8 are green,2 are black. Anybody please provide me some reference to understand these formulaes related to combination.
I am confused with Following formulaes of combination..1. n!/r!2. n+k-1 C k3. (P+1)*2^R where (P+R are total things and P are alike).4. question such as number of ways of...
Ravi_1511
360
views
Ravi_1511
asked
Jan 31, 2017
Combinatory
combinatory
+
–
1
votes
1
answer
860
Permutation and Combinations
The number of ways to choose n things from 2n things of which n are alike and rest are unlike?
The number of ways to choose n things from 2n things of which n are alike and rest are unlike?
yg92
679
views
yg92
asked
Jan 29, 2017
Combinatory
cbt-2017
discrete-mathematics
combinatory
+
–
0
votes
1
answer
861
Virtual Gate Test Series: Algorithms - Recurrence Relation
pps121
303
views
pps121
asked
Jan 25, 2017
Combinatory
combinatory
recurrence-relation
virtual-gate-test-series
+
–
9
votes
2
answers
862
functions-combinations
Assume an almost injective function is a function in which exactly two element from domain maps to a single element in co-domain, otherwise function is injective. $S$ and $R$ are sets with cardinality $m$ and $n$ respectively. $(m<n)$ and $m\geq 2$. Number of almost injective ... $\frac{( n-m)!}{ 2}$ put m=2 and n=5. we get almost injective functions=5 shudnt it be C?
Assume an almost injective function is a function in which exactly two element from domain maps to a single element in co-domain, otherwise function is injective. $S$ and...
Anusha Motamarri
966
views
Anusha Motamarri
asked
Jan 23, 2017
Mathematical Logic
combinatory
functions
+
–
7
votes
1
answer
863
Testbook Test Series: Programming & DS - Binary Search Tree
In a binary search tree, the key with value $5$ was searched after traversing nodes with values $1, 3, 4, 6, 7, 8, 9$ not necessarily in this order. Lets $P$ is the probability that $3rd$ element on the search path ... different orders possible in which given nodes can be traversed before finding node with value $5$. Find $\frac{N}{10}+P$
In a binary search tree, the key with value $5$ was searched after traversing nodes with values $1, 3, 4, 6, 7, 8, 9$ not necessarily in this order. Lets $P$ is the proba...
Pankaj Joshi
1.1k
views
Pankaj Joshi
asked
Jan 16, 2017
Programming in C
testbook-test-series
probability
data-structures
binary-search-tree
combinatory
+
–
3
votes
1
answer
864
Test by Bikram | Mock GATE | Test 1 | Question: 1
There are "m" red balls and "n" green balls in a bucket. p balls are drawn from the urn and if found that all of them are green then what is the probability that another ball drawn from those remaining will also be green? Assume p < n p-n/m+n n-p/m+n-p p-m/m+n m-p/m+n-p
There are "m" red balls and "n" green balls in a bucket. p balls are drawn from the urn and if found that all of them are green then what is the probability that another ...
Bikram
454
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
combinatory
engineering-mathematics
probability
conditional-probability
+
–
2
votes
1
answer
865
Recurrence relation for total no of n length English letter words, with even no of a’s
The recurrence relation for total no of n length English letter words, with even no of a's. Below is some parts I could build - Assumptions - 26 english letters and no epsilon Let us assume a string ... odd 'a's Could someone please guide how to proceed further and if things are correct till here?
The recurrence relation for total no of n length English letter words, with even no of a’s.Below is some parts I could build -Assumptions - 26 english letters and no ep...
yg92
662
views
yg92
asked
Jan 14, 2017
Combinatory
recurrence-relation
combinatory
+
–
1
votes
2
answers
866
hoe many different choices for classes does we have? ________
Tom Riddle must choose 4 classes for his final semester at school. He must take at least 1 science class and at least 1 art class. In his school offers 4 (distinct) science classes, 3 (distinct) art classes and three other (distinct) classes, hoe many different choices for classes does we have? ________ 195 175 210 160
Tom Riddle must choose 4 classes for his final semester at school. He must take at least 1 science class and at least 1 art class. In his school offers 4 (distinct) scien...
Akriti sood
710
views
Akriti sood
asked
Jan 13, 2017
Combinatory
combinatory
+
–
4
votes
2
answers
867
Generating Function
Find the coefficient of $x^{83}$ in $(x^5+ x^8+ x^{11}+ x^{14}+ x^{17})^{10} ?$
Find the coefficient of $x^{83}$ in $(x^5+ x^8+ x^{11}+ x^{14}+ x^{17})^{10} ?$
Prajwal Bhat
2.4k
views
Prajwal Bhat
asked
Jan 11, 2017
Combinatory
generating-functions
combinatory
+
–
6
votes
1
answer
868
Counting possible no of subsets from a set of numbers S
Using numbers from S = $\left \{ 1,2,3,4.......n \right \}$ We can use maximum up to m numbers to form a set using numbers from S. Repetition of numbers allowed. How many ways we can form a set such that, $\sum x_i = K$. Where $K$ is ... $m = 5$, $K = 8$ ? If there is any generic idea ? Ordered / Unordered both the cases !
Using numbers from S = $\left \{ 1,2,3,4.......n \right \}$We can use maximum up to m numbers to form a set using numbers from S. Repetition of numbers allowed.How many ...
dd
714
views
dd
asked
Jan 9, 2017
Combinatory
combinatory
counting
+
–
5
votes
1
answer
869
Number of Boolean function possible
Number of boolean function with 3 boolean variable such that the function contain exactly 2 or 7 min term in their canonical SOP? Please explain the logic!
Number of boolean function with 3 boolean variable such that the function contain exactly 2 or 7 min term in their canonical SOP?Please explain the logic!
smartmeet
3.6k
views
smartmeet
asked
Jan 8, 2017
Digital Logic
combinatory
min-sum-of-products-form
+
–
32
votes
5
answers
870
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
Jithin Jayan
16.0k
views
Jithin Jayan
asked
Jan 7, 2017
DS
data-structures
binary-heap
combinatory
+
–
Page:
« prev
1
...
24
25
26
27
28
29
30
31
32
33
34
...
38
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register