• retagged by
920 views

1 Answer

0 0 votes

Option C

There are 4 aces in a deck

Probability of 1st card drawn to be ace = $\frac{\binom{4}{1}}{\binom{52}{1}} = \frac{4}{52}$

Now, Remaining aces $= 4 – 1 = 3$ and Remaining cards $= 52 – 1 = 51$

So, Probability of 2nd card drawn to be ace = $\frac{\binom{3}{1}}{\binom{51}{1}} = \frac{3}{51}$

Hence, Total Probability that top and bottom cards of a randomly shuffled deck are both aces is $=\mathbf{\frac{4}{52}\times \frac{3}{51}}$

Answer:
Position:
Show:

Related questions

0 0 votes
1 1 answer
10.6k
10.6k views
admin asked Mar 30, 2020
10,601 views
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is$E$$2E$$V$$2V$
0 0 votes
3 3 answers
19.6k
19.6k views
admin asked Mar 30, 2020
19,612 views
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?In adjacency list representation, space is saved f...
0 0 votes
1 1 answer
2.6k
2.6k views
admin asked Mar 30, 2020
2,600 views
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
2 2 votes
2 2 answers
2.1k
2.1k views
admin asked Mar 30, 2020
2,081 views
What are the appropriate data structures for graph traversal using Breadth First Search(BFS) and Depth First Search(DFS) algorithms?Stack for BFS and Queue for DFSQueue f...