GATE CSE 1996 | Probability Question 64 | Discrete Mathematics

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Two dice are thrown simultaneously. The probability that at least one of them will have 6 facing up is

$${1 \over {36}}$$

$${1 \over {3}}$$

$${25 \over {36}}$$

$${11\over {36}}$$

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

The probability that a number selected at random between $$100$$ and $$999$$ (both inclusive ) will not contain the digit $$7$$ is

$${{16} \over {25}}$$

$${\left( {{9 \over {10}}} \right)^3}$$

$${{27} \over {75}}$$

$${{18} \over {25}}$$

GATE CSE 1994

MCQ (Single Correct Answer)

-0.3

Let A and B be any two arbitrary events, then, which one of the following is true?

$$P\,(A\, \cap \,B)\, = \,P\,(A)\,P\,(B)$$

$$P\,(A\, \cup \,B)\, = \,P\,(A)\, + \,P\,(B)$$

$$P\,(A\,\left| {B) = \,} \right.P\,(A\, \cap \,B)\,P\,(B)$$

$$P\,(A\, \cup \,B)\, < \,\,P\,(A)\, + \,P\,(B)$$

GATE CSE Subjects

Discrete Mathematics

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

Programming Languages

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

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

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

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Verbal Ability Numerical Ability