GATE CSE 1999 | Probability Question 76 | Discrete Mathematics

GATE CSE 1999

MCQ (Single Correct Answer)

-0.6

Let X and Y be two exponentially distributed and independent random variables with mean $$\alpha $$ and $$\beta $$, respectively. If Z = min (X, Y), then the mean of Z is given by

$${1 \over {\alpha + \beta }}$$

$$\min \,(\alpha ,\,\beta )$$

$${{\alpha \,\beta } \over {\alpha + \beta }}$$

$${\alpha + \beta }$$

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

The probability that the top and bottom cards of a randomly shuffled deck are both access is

$${4 \over {52}}\, \times \,{4 \over {52}}\,$$

$${4 \over {52}}\, \times \,{3 \over {52}}\,$$

$${4 \over {52}}\, \times \,{3 \over {51}}\,$$

$${4 \over {52}}\, \times \,{4 \over {51}}\,$$

GATE CSE 1995

MCQ (Single Correct Answer)

-0.6

A bag contains 10 white balls and 15 black balls. Two balls drawn in succession. The probability that one of them is black the other is white is

2/3

4/5

$${\raise0.5ex\hbox{$\scriptstyle 1$} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 2$}}$$

1/3

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Greedy Method Complexity Analysis and Asymptotic Notations Dynamic Programming Divide and Conquer Method Searching and Sorting P and NP Concepts

Digital Logic

Boolean Algebra K Maps Combinational Circuits Number Systems Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Syntax Directed Translation Parsing Lexical Analysis Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus

Programming Languages

Function and Recursion Basic of Programming Language Pointer and Structure in C

Computer Organization

Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory