GATE CSE 1999 | Probability Question 67 | 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

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language 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

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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