>
Exams
>
General Aptitude
>
Data Interpretation
>
the probability of getting a distinct number while
Question:
The probability of getting a distinct number while throwing dice six times?
GATE CS - 2024
GATE CS
Updated On:
Feb 12, 2024
Hide Solution
Verified By Collegedunia
Correct Answer:
0.015
Solution and Explanation
The correct answer is 0.015
Download Solution in PDF
Was this answer helpful?
0
0
Top Questions on Data Interpretation
Select the \textbf{CORRECT
option that names the art movements sequentially from left to right.}
CEED - 2026
General Aptitude
Data Interpretation
View Solution
The following images show cave paintings from India. Which of the options is correct?
CEED - 2026
Observation and design sensitivity
Data Interpretation
View Solution
P is a transparent glass filled with water as shown below. Q is a white cylinder with parallel lines printed around it. If the cylinder is viewed through the glass from the direction of the arrow, find the correct pattern observed.
CEED - 2026
Observation and design sensitivity
Data Interpretation
View Solution
A delicious triangular shaped chocolate was left open at night. A mouse could smell the yummy chocolate and could not resist but eat some of it. The remaining chocolate is shown below. How many triangles (including partial) have been eaten?
CEED - 2026
Observation and design sensitivity
Data Interpretation
View Solution
The following image shows a set of letters in different fonts. Which of the options is the word formed by letters of the same font?
UCEED - 2026
Logical Reasoning
Data Interpretation
View Solution
View More Questions
Questions Asked in GATE CS exam
With respect to a TCP connection between a client and a server, which of the following is true?
GATE CS - 2026
Computer Networks
View Solution
Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
GATE CS - 2026
Database Management Systems
View Solution
Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
GATE CS - 2026
Theory of Computations
View Solution
A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
GATE CS - 2026
Computer Organization and Architecture
View Solution
Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
GATE CS - 2026
Computer Organization and Architecture
View Solution
View More Questions