Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for counting
1
votes
1
answer
1
GATE Civil 2023 Set 2 | GA Question: 4
There are $4$ red, $5$ green, and 6 blue balls inside a box. If $N$ number of balls are picked simultaneously, what is the smallest value of $N$ that guarantees there will be at least two balls of the same colour? One cannot see the colour of the balls until they are picked. $4$ $15$ $5$ $2$
There are $4$ red, $5$ green, and 6 blue balls inside a box. If $N$ number of balls are picked simultaneously, what is the smallest value of $N$ that guarantees there wil...
admin
1.0k
views
admin
asked
May 21, 2023
Quantitative Aptitude
gatecivil-2023-set2
quantitative-aptitude
counting
+
–
1
votes
1
answer
2
GATE Civil 2023 Set 2 | GA Question: 3
In how many ways can cells in a $3 \times 3 $ grid be shaded, such that each row and each column have exactly one shaded cell? An example of one valid shading is shown. $2$ $9$ $3$ $6$
In how many ways can cells in a $3 \times 3 $ grid be shaded, such that each row and each column have exactly one shaded cell? An example of one valid shading is shown. ...
admin
753
views
admin
asked
May 21, 2023
Analytical Aptitude
gatecivil-2023-set2
analytical-aptitude
counting-figure
+
–
111
votes
9
answers
3
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
gatecse
34.6k
views
gatecse
asked
Sep 12, 2014
Graph Theory
gatecse-2012
graph-theory
normal
marks-to-all
counting
+
–
76
votes
12
answers
4
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
Kathleen
34.4k
views
Kathleen
asked
Oct 4, 2014
Graph Theory
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
+
–
86
votes
8
answers
5
GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? $^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^2-3n}{2} \right )}}.\left(n^2-n\right)}C_k$ $^{\left(\frac{n^2-n}{2}\right)}C_n$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ?$^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$$^{{\l...
Kathleen
14.3k
views
Kathleen
asked
Sep 18, 2014
Graph Theory
gatecse-2004
graph-theory
combinatory
normal
counting
+
–
25
votes
6
answers
6
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Arjun
11.8k
views
Arjun
asked
Feb 18, 2021
Combinatory
gatecse-2021-set2
combinatory
counting
numerical-answers
2-marks
+
–
31
votes
4
answers
7
GATE CSE 2005 | Question: 35
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$42$
Kathleen
24.2k
views
Kathleen
asked
Sep 22, 2014
DS
gatecse-2005
data-structures
binary-search-tree
counting
normal
+
–
52
votes
6
answers
8
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
Kathleen
14.0k
views
Kathleen
asked
Sep 14, 2014
Graph Theory
gatecse-2001
graph-theory
normal
counting
+
–
14
votes
3
answers
9
GATE CSE 2023 | Question: 38
Let $U=\{1,2, \ldots, n\},$ where $n$ is a large positive integer greater than $1000.$ Let $k$ be a positive integer less than $n$. Let $A, B$ be subsets of $U$ with $|A|=|B|=k$ and $A \cap B=\emptyset$. We say that a permutation of $U$ separates $A$ from $B$ if ... $2\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k !)^{2}$
Let $U=\{1,2, \ldots, n\},$ where $n$ is a large positive integer greater than $1000.$ Let $k$ be a positive integer less than $n$. Let $A, B$ be subsets of $U$ with $|A|...
admin
6.3k
views
admin
asked
Feb 15, 2023
Combinatory
gatecse-2023
combinatory
counting
2-marks
+
–
38
votes
3
answers
10
GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...
Arjun
11.6k
views
Arjun
asked
Feb 18, 2021
Combinatory
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
+
–
6
votes
2
answers
11
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 17
The number of ways that one can divide $10$ distinguishable objects into $3$ indistinguishable non-empty piles, is: $ \left\{\begin{array}{c} 10 \\ 3 \end{array}\right\}=9330 $ In how many different ways can one do this if the piles are also distinguishable?
The number of ways that one can divide $10$ distinguishable objects into $3$ indistinguishable non-empty piles, is:$$\left\{\begin{array}{c}10 \\3\end{array}\right\}=9330...
GO Classes
861
views
GO Classes
asked
Jan 21
Combinatory
goclasses2024-mockgate-12
goclasses
numerical-answers
combinatory
counting
1-mark
+
–
0
votes
2
answers
12
Kenneth Rosen Edition 7 Exercise 6.3 Question 26 (Page No. 414)
Thirteen people on a softball team show up for a game. How many ways are there to choose $10$ players to take the field? How many ways are there to assign the $10$ positions by selecting players from the $13$ people who show ... ways are there to choose $10$ players to take the field if at least one of these players must be a woman?
Thirteen people on a softball team show up for a game.How many ways are there to choose $10$ players to take the field?How many ways are there to assign the $10$ position...
admin
4.4k
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
+
–
4
votes
1
answer
13
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 30
A university's mathematics department has $10$ professors and will offer $20$ different courses next semester. Each professor will be assigned to teach exactly $2$ of the courses, and each course will have exactly one professor assigned to teach it. If any ... $10^{20}-2^{10}$ $\dfrac{20 ! 10 !}{2^{10}}$
A university's mathematics department has $10$ professors and will offer $20$ different courses next semester. Each professor will be assigned to teach exactly $2$ of the...
GO Classes
501
views
GO Classes
asked
Jan 28
Combinatory
goclasses2024-mockgate-13
goclasses
combinatory
counting
1-mark
+
–
5
votes
2
answers
14
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 18
The number of ways that one can divide $10$ distinguishable objects in $3$ indistinguishable non-empty piles, is: $ \left\{\begin{array}{c} 10 \\ 3 \end{array}\right\}=9330 $ In how many different ways can one do this if the objects are also indistinguishable?
The number of ways that one can divide $10$ distinguishable objects in $3$ indistinguishable non-empty piles, is:$$\left\{\begin{array}{c}10 \\3\end{array}\right\}=9330$$...
GO Classes
848
views
GO Classes
asked
Jan 21
Combinatory
goclasses2024-mockgate-12
goclasses
numerical-answers
combinatory
counting
1-mark
+
–
26
votes
5
answers
15
GATE CSE 1994 | Question: 1.15
The number of substrings (of all lengths inclusive) that can be formed from a character string of length $n$ is $n$ $n^2$ $\frac{n(n-1)}{2}$ $\frac{n(n+1)}{2}$
The number of substrings (of all lengths inclusive) that can be formed from a character string of length $n$ is$n$$n^2$$\frac{n(n-1)}{2}$$\frac{n(n+1)}{2}$
Kathleen
9.9k
views
Kathleen
asked
Oct 4, 2014
Combinatory
gate1994
combinatory
counting
normal
+
–
0
votes
4
answers
16
Made Easy Probability - Let X be a set containing n elements. Three subsets A,B, C of X are chosen at random. The probability that A, B, C are pairwise disjoint is? (What do they mean by pairwise disjoint? and how should I approach this question?)
tishhaagrawal
969
views
tishhaagrawal
asked
Dec 4, 2023
Probability
probability
combinatory
counting
made-easy-test-series
gate-preparation
test-series
engineering-mathematics
self-doubt
bad-question
+
–
0
votes
0
answers
17
Combinatorics & Probability
A rumor is spread randomly among a group of 10 people by successively having one person call someone, who calls someone, and so on. A person can pass the rumor on to anyone except the individual who just called. (a) By how many different paths can a rumor ... in $N$ calls? (c) What is the probability that if $A$ starts the rumor, then $A$ receives the third calls?
A rumor is spread randomly among a group of 10 people by successively having one person call someone, who calls someone, and so on. A person can pass the rumor on to anyo...
Debargha Mitra Roy
136
views
Debargha Mitra Roy
asked
Feb 8
Combinatory
combinatory
counting
+
–
1
votes
0
answers
18
Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?
tishhaagrawal
497
views
tishhaagrawal
asked
Dec 16, 2023
Graph Theory
gate-preparation
test-series
made-easy-test-series
self-doubt
counting
graph-theory
discrete-mathematics
graph-connectivity
+
–
1
votes
0
answers
19
Test Series: Aptitude question --> "Counting cubes" Can somebody please explain the approach behind such questions? I often spend a lot of time in them.
tishhaagrawal
606
views
tishhaagrawal
asked
Nov 28, 2023
Spatial Aptitude
made-easy-test-series
test-series
gate-preparation
general-aptitude
spatial-aptitude
counting
+
–
2
votes
2
answers
20
GATE Mechanical 2023 | GA Question: 9
How many pairs of sets $\text{(S, T)}$ are possible among the subsets of $\{1,2,3,4,5,6\}$ that satisfy the condition that $\mathrm{S}$ is a subset of $\mathrm{T}?$ $729$ $728$ $665$ $664$
How many pairs of sets $\text{(S, T)}$ are possible among the subsets of $\{1,2,3,4,5,6\}$ that satisfy the condition that $\mathrm{S}$ is a subset of $\mathrm{T}?$ $729$...
admin
1.2k
views
admin
asked
May 21, 2023
Quantitative Aptitude
gateme-2023
quantitative-aptitude
counting
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register