Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
Let langle M rangle be the encoding of a Turing machine as a string over Sigma left 0 1 right Let L left langle M rangle mid M ext is a Turing machine ext that accepts a string of length 2014 right Then L is decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable | Turing Machine | 195 |
Let a decision problem X be defined as follows X Given a Turing machine M over Sigma and any word w in Sigma does M loop forever on w You may assume that the halting problem of Turing machine is undecidable but partially decidable Show that X is undecidable Show that X is not even partially decidable | Turing Machine | 195 |
Define languages L_0 and L_1 as follows L_0 langle M w 0 rangle mid M ext halts on w L_1 langle M w 1 rangle mid M ext does not halts on w Here langle M w i rangle is a triplet whose first component M is an encoding of a Turing Machine second component w is a string and third component i is a bit Let L L_0 u222a L_1 Which of the following is true L is recursively enumerable but L is not L is recursively enumerable but L is not Both L and L are recursive Neither L nor L is recursively enumerable | Turing Machine | 195 |
Consider the following languages L_ 1 left left langle M right rangle mid M ext takes at least 2016 steps on some input right L_ 2 left left langle M right rangle mid M ext takes at least 2016 steps on all inputs right and L_ 3 left left langle M right rangle mid M ext accepts epsilon right where for each Turing machine M left langle M right rangle denotes a specific encoding of M Which one of the following is TRUE L_ 1 is recursive and L_ 2 L_ 3 are not recursive L_ 2 is recursive and L_ 1 L_ 3 are not recursive L_ 1 L_ 2 are recursive and L_ 3 is not recursive L_ 1 L_ 2 L_ 3 are recursive | Turing Machine | 195 |
A single tape Turing Machine M has two states q0 and q1 of which q0 is the starting state The tape alphabet of M is 0 1 B and its input alphabet is 0 1 The symbol B is the blank symbol used to indicate end of an input string The transition function of M is described in the following table 0 1 B q0 q1 1 R q1 1 R Halt q1 q1 1 R q0 1 L q0 B L The table is interpreted as illustrated below The entry q1 1 R in row q0 and column 1 signifies that if M is in state q0 and reads 1 on the current page square then it writes 1 on the same tape square moves its tape head one position to the right and transitions to state q1 Which of the following statements is true about M M does not halt on any string in 0 1 M does not halt on any string in 00 1 M halts on all strings ending in a 0 M halts on all strings ending in a 1 | Turing Machine | 195 |
L_1 is a recursively enumerable language over Sigma An algorithm A effectively enumerates its words as omega_1 omega_2 omega_3 dots Define another language L_2 over Sigma cup left ext right as left w_i ext w_j mid w_i w_j in L_1 i lt j right Here is new symbol Consider the following assertions S_1 L_1 is recursive implies L_2 is recursive S_2 L_2 is recursive implies L_1 is recursive Which of the following statements is true Both S_1 and S_2 are true S_1 is true but S_2 is not necessarily true S_2 is true but S_1 is not necessarily true Neither is necessarily true | Turing Machine | 195 |
The transport layer protocols used for real time multimedia file transfer DNS and email respectively are A TCP UDP UDP and TCP B UDP TCP TCP and UDP C UDP TCP UDP and TCP D TCP UDP TCP and UDP | Udp | 196 |
Packets of the same session may be routed through different paths in TCP but not UDP TCP and UDP UDP but not TCP Neither TCP nor UDP | Udp | 196 |
Consider socket API on a Linux machine that supports connected UDP sockets A connected UDP socket is a UDP socket on which connect function has already been called Which of the following statements is are CORRECT A connected UDP socket can be used to communicate with multiple peers simultaneously A process can successfully call connect function again for an already connected UDP socket I only II only Both I and II Neither I nor II | Udp | 196 |
A program on machine X attempts to open a UDP connection to port 5376 on a machine Y and a TCP connection to port 8632 on machine Z However there are no applications listening at the corresponding ports on Y and Z An ICMP Port Unreachable error will be generated by Y but not Z Z but not Y Neither Y nor Z Both Y and Z | Udp | 196 |
Suppose you break a stick of unit length at a point chosen uniformly at random Then the expected length of the shorter stick is ________ | Uniform Distribution | 197 |
Consider a selection of the form sigma_ A leq 100 r where r is a relation with 1000 tuples Assume that the attribute values for A among the tuples are uniformly distributed in the interval 0 500 Which one of the following options is the best estimate of the number of tuples returned by the given selection query 50 100 150 200 | Uniform Distribution | 197 |
A point is randomly selected with uniform probability in the X Y plane within the rectangle with corners at 0 0 1 0 1 2 and 0 2 If p is the length of the position vector of the point the expected value of p 2 is left dfrac 2 3 right quad 1 left dfrac 4 3 right left dfrac 5 3 right | Uniform Distribution | 197 |
A user level process in Unix traps the signal sent on a Ctrl C input and has a signal handling routine that saves appropriate files before terminating the process When a Ctrl C input is given to this process what is the mode in which the signal handling routine executes User mode Kernel mode Superuser mode Privileged mode | User Modes | 198 |
Let u and v be two vectors in R2 whose Euclidean norms satisfy left u right 2 left v right What is the value of alpha such that w u alpha v bisects the angle between u and v 2 frac 1 2 1 frac 1 2 | Vector Space | 199 |
If V_1 and V_2 are 4 dimensional subspaces of a 6 dimensional vector space V then the smallest possible dimension of V_1 cap V_2 is _____ | Vector Space | 199 |
Consider the set of column vectors defined by X left x in R 3 mid x_1 x_2 x_3 0 ext where x T left x_1 x_2 x_3 right T right Which of the following is TRUE left left 1 1 0 right T left 1 0 1 right T right is a basis for the subspace X left left 1 1 0 right T left 1 0 1 right T right is a linearly independent set but it does not span X and therefore is not a basis of X X is not a subspace of R 3 None of the above | Vector Space | 199 |
Alexander turned his attention towards India since he had conquered Persia Which one of the statements below is logically valid and can be inferred from the above sentence Alexander would not have turned his attention towards India had he not conquered Persia Alexander was not ready to rest on his laurels and wanted to march to India Alexander was not completely in control of his army and could command it to move towards India Since Alexander s kingdom extended to Indian borders after the conquest of Persia he was keen to move further | Verbal Reasoning | 200 |
u201cWe lived in a culture that denied any merit to literary works considering them important only when they were handmaidens to something seemingly more urgent u2013 namely ideology This was a country where all gestures even the most private were interpreted in political terms u201d The author u2019s belief that ideology is not as important as literature is revealed by the word u2018culture u2019 u2018seemingly u2019 u2018urgent u2019 u2018political u2019 | Verbal Reasoning | 200 |
Let G be a simple graph with 20 vertices and 100 edges The size of the minimum vertex cover of G is 8 Then the size of the maximum independent set of G is 12 8 less than 8 more than 12 | Vertex Cover | 201 |
For the IEEE 802 11 MAC protocol for wireless communication which of the following statements is are TRUE I At least three non overlapping channels are available for transmissions II The RTS CTS mechanism is used for collision detection III Unicast frames are ACKed All I II and III I and III only II and III only II only | Wifi | 202 |
Select the pair of best expresses a relationship similar to that expressed in the pair Children Pediatrician Adult Orthopaedist Females Gynaecologist Kidney Nephrologist Skin Dermatologist | Word Pairs | 203 |
A transporter receives the same number of orders each day Currently he has some pending orders backlog to be shipped If he uses 7 trucks then at the end of the 4th day he can clear all the orders Alternatively if he uses only 3 trucks then all the orders are cleared at the end of the 10th day What is the minimum number of trucks required so that there will be no pending order at the end of 5th day A 4 B 5 C 6 D 7 | Work Time | 204 |
In the working set strategy which of the following is done by the operating system to prevent thrashing It initiates another process if there are enough extra frames It selects a process to suspend if the sum of the sizes of the working sets exceeds the total number of available frames I only II only Neither I nor II Both I and II | Working Set | 205 |
What happens when a bit string is XORed with itself n times as shown left B oplus B oplus B oplus B dots n ext times right complements when n is even complements when n is odd divides by 2 n always remains unchanged when n is even | Xor | 206 |
If x is real and mid x 2 2x 3 mid 11 then possible values of mid x 3 x 2 x mid include 2 4 2 14 4 52 14 52 | Absolute Value | 0 |
The expression large frac x y x y 2 is equal to The maximum of x and y The minimum of x and y 1 None of the above | Absolute Value | 0 |
If x is real and mid x 2 2x 3 mid 11 then possible values of mid x 3 x 2 x mid include 2 4 2 14 4 52 14 52 | Absolute Value | 0 |
The expression large frac x y x y 2 is equal to The maximum of x and y The minimum of x and y 1 None of the above | Absolute Value | 0 |
The expression large frac x y x y 2 is equal to The maximum of x and y The minimum of x and y 1 None of the above | Absolute Value | 0 |
If x is real and mid x 2 2x 3 mid 11 then possible values of mid x 3 x 2 x mid include 2 4 2 14 4 52 14 52 | Absolute Value | 0 |
If mid 4X 7 mid 5 then the values of 2 mid X mid mid X mid is quad 2 left dfrac 1 3 right left dfrac 1 2 right 3 left dfrac 3 2 right 9 left dfrac 2 3 right 9 | Absolute Value | 0 |
If mid 4X 7 mid 5 then the values of 2 mid X mid mid X mid is quad 2 left dfrac 1 3 right left dfrac 1 2 right 3 left dfrac 3 2 right 9 left dfrac 2 3 right 9 | Absolute Value | 0 |
If mid 4X 7 mid 5 then the values of 2 mid X mid mid X mid is quad 2 left dfrac 1 3 right left dfrac 1 2 right 3 left dfrac 3 2 right 9 left dfrac 2 3 right 9 | Absolute Value | 0 |
If x is real and mid x 2 2x 3 mid 11 then possible values of mid x 3 x 2 x mid include 2 4 2 14 4 52 14 52 | Absolute Value | 0 |
If mid 4X 7 mid 5 then the values of 2 mid X mid mid X mid is quad 2 left dfrac 1 3 right left dfrac 1 2 right 3 left dfrac 3 2 right 9 left dfrac 2 3 right 9 | Absolute Value | 0 |
The expression large frac x y x y 2 is equal to The maximum of x and y The minimum of x and y 1 None of the above | Absolute Value | 0 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
An Abstract Data Type ADT is same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used but none else all of the above | Abstract Data Type | 1 |
Consider the ALU shown below If the operands are in 2 u2019s complement representation which of the following operations can be performed by suitably setting the control lines K and C_0 only and u2013 denote addition and subtraction respectively A B and A u2013 B but not A 1 A B and A 1 but not A u2013 B A B but not A u2013 B or A 1 A B and A u2013 B and A 1 | Adder | 2 |
Consider an eight bit ripple carry adder for computing the sum of A and B where A and B are integers represented in 2 s complement form If the decimal value of A is one the decimal value of B that leads to the longest latency for the sum to stabilize is ___________ | Adder | 2 |
Fill in the blanks In the two bit full adder subtractor unit shown in below figure when the switch is in position 2 ___________ using _________ arithmetic | Adder | 2 |
The number of full and half adders required to add 16 bit numbers is 8 half adders 8 full adders 1 half adder 15 full adders 16 half adders 0 full adders 4 half adders 12 full adders | Adder | 2 |
A 4 bit carry look ahead adder which adds two 4 bit numbers is designed using AND OR NOT NAND NOR gates only Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit what is the overall propagation delay of the adder Assume that the carry network has been implemented using two level AND OR logic 4 time units 6 time units 10 time units 12 time units | Adder | 2 |
Consider a carry look ahead adder for adding two n bit integers built using gates of fan in at most two The time to perform addition using this adder is Theta 1 Theta log n Theta sqrt n Theta n | Adder | 2 |
The number of full and half adders required to add 16 bit numbers is 8 half adders 8 full adders 1 half adder 15 full adders 16 half adders 0 full adders 4 half adders 12 full adders | Adder | 2 |
A 4 bit carry look ahead adder which adds two 4 bit numbers is designed using AND OR NOT NAND NOR gates only Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit what is the overall propagation delay of the adder Assume that the carry network has been implemented using two level AND OR logic 4 time units 6 time units 10 time units 12 time units | Adder | 2 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable | Aliasing | 3 |
The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit numbers is O n 2 O n O log n O 1 | Array Multiplier | 4 |
The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit numbers is O n 2 O n O log n O 1 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit numbers is O n 2 O n O log n O 1 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
Consider an array multiplier for multiplying two n bit numbers If each gate in the circuit has a unit delay the total delay of the multiplier is Theta 1 Theta log n Theta n Theta n 2 | Array Multiplier | 4 |
The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit numbers is O n 2 O n O log n O 1 | Array Multiplier | 4 |
An n imes n array v is defined as follows v left i j right i j for all i j i leq n 1 leq j leq n The sum of the elements of the array v is 0 n 1 n 2 3n 2 n 2 frac left n 1 right 2 | Arrays | 5 |
A program P reads in 500 integers in the range 0 100 representing the scores of 500 students It then prints the frequency of each score above 50 What would be the best way for P to store the frequencies An array of 50 numbers An array of 100 numbers An array of 500 numbers A dynamically allocated array of 550 numbers | Arrays | 5 |
The procedure given below is required to find and replace certain characters inside an input character string supplied in array A The characters to be replaced are supplied in array oldc while their respective replacement characters are supplied in array newc Array A has a fixed length of five characters while arrays oldc and newc contain three characters each However the procedure is flawed void find_and_replace char A char oldc char newc for int i 0 i lt 5 i for int j 0 j lt 3 j if A i oldc j A i newc j The procedure is tested with the following four test cases oldc u201cabc u201d newc u201cdab u201d oldc u201ccde u201d newc u201cbcd u201d oldc u201cbca u201d newc u201ccda u201d oldc u201cabc u201d newc u201cbac u201d If array A is made to hold the string u201c abcde u201d which of the above four test cases will be successful in exposing the flaw in this procedure None 2 only 3 and 4 only 4 only | Arrays | 5 |
A B tree index is to be built on the Name attribute of the relation STUDENT Assume that all the student names are of length 8 bytes disk blocks are of size 512 bytes and index pointers are of size 4 bytes Given the scenario what would be the best choice of the degree i e number of pointers per node of the B tree 16 42 43 44 | B Tree | 6 |
Suppose a fair six sided die is rolled once If the value on the die is 1 2 or 3 the die is rolled a second time What is the probability that the sum total of values that turn up is at least 6 dfrac 10 21 dfrac 5 12 dfrac 2 3 dfrac 1 6 | Bayes Theorem | 7 |
An automobile plant contracted to buy shock absorbers from two suppliers X and Y X supplies 60 and Y supplies 40 of the shock absorbers All shock absorbers are subjected to a quality test The ones that pass the quality test are considered reliable Of X u2019s shock absorbers 96 are reliable Of Y u2019s shock absorbers 72 are reliable The probability that a randomly chosen shock absorber which is found to be reliable is made by Y is A 0 288 B 0 334 C 0 667 D 0 720 | Bayes Theorem | 7 |
Suppose a fair six sided die is rolled once If the value on the die is 1 2 or 3 the die is rolled a second time What is the probability that the sum total of values that turn up is at least 6 dfrac 10 21 dfrac 5 12 dfrac 2 3 dfrac 1 6 | Bayes Theorem | 7 |
An automobile plant contracted to buy shock absorbers from two suppliers X and Y X supplies 60 and Y supplies 40 of the shock absorbers All shock absorbers are subjected to a quality test The ones that pass the quality test are considered reliable Of X u2019s shock absorbers 96 are reliable Of Y u2019s shock absorbers 72 are reliable The probability that a randomly chosen shock absorber which is found to be reliable is made by Y is A 0 288 B 0 334 C 0 667 D 0 720 | Bayes Theorem | 7 |
Box P has 2 red balls and 3 blue balls and box Q has 3 red balls and 1 blue ball A ball is selected as follows i select a box ii choose a ball from the selected box such that each ball in the box is equally likely to be chosen The probabilities of selecting boxes P and Q are dfrac 1 3 and dfrac 2 3 respectively Given that a ball selected in the above process is a red ball the probability that it came from the box P is dfrac 4 19 dfrac 5 19 dfrac 2 9 dfrac 19 30 | Bayes Theorem | 7 |
Box P has 2 red balls and 3 blue balls and box Q has 3 red balls and 1 blue ball A ball is selected as follows i select a box ii choose a ball from the selected box such that each ball in the box is equally likely to be chosen The probabilities of selecting boxes P and Q are dfrac 1 3 and dfrac 2 3 respectively Given that a ball selected in the above process is a red ball the probability that it came from the box P is dfrac 4 19 dfrac 5 19 dfrac 2 9 dfrac 19 30 | Bayes Theorem | 7 |
Suppose a fair six sided die is rolled once If the value on the die is 1 2 or 3 the die is rolled a second time What is the probability that the sum total of values that turn up is at least 6 dfrac 10 21 dfrac 5 12 dfrac 2 3 dfrac 1 6 | Bayes Theorem | 7 |
An automobile plant contracted to buy shock absorbers from two suppliers X and Y X supplies 60 and Y supplies 40 of the shock absorbers All shock absorbers are subjected to a quality test The ones that pass the quality test are considered reliable Of X u2019s shock absorbers 96 are reliable Of Y u2019s shock absorbers 72 are reliable The probability that a randomly chosen shock absorber which is found to be reliable is made by Y is A 0 288 B 0 334 C 0 667 D 0 720 | Bayes Theorem | 7 |
Suppose a fair six sided die is rolled once If the value on the die is 1 2 or 3 the die is rolled a second time What is the probability that the sum total of values that turn up is at least 6 dfrac 10 21 dfrac 5 12 dfrac 2 3 dfrac 1 6 | Bayes Theorem | 7 |
Box P has 2 red balls and 3 blue balls and box Q has 3 red balls and 1 blue ball A ball is selected as follows i select a box ii choose a ball from the selected box such that each ball in the box is equally likely to be chosen The probabilities of selecting boxes P and Q are dfrac 1 3 and dfrac 2 3 respectively Given that a ball selected in the above process is a red ball the probability that it came from the box P is dfrac 4 19 dfrac 5 19 dfrac 2 9 dfrac 19 30 | Bayes Theorem | 7 |
Subsets and Splits