GATE 2018 Computer Science and Information Technology (CS) Solved Question Paper
#1
GATE 2018 Computer Science and Information Technology (CS) Question Paper and Answer key

1.The set of all recursively enumerable languages is
(A) closed under complementation.
(B) closed under intersection.
© a subset of the set of all recursive languages.
(D) an uncountable set.

2. Two people, P and Q, decide to independently roll two identical dice, each with 6 faces,numbered 1 to 6. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a trial as a throw of the dice by P and Q. Assume that all 6 numbers on each dice are equi-probable and that all trials are independent. The probability (rounded to 3 decimal places) that one of them wins on the third trial is _____.

 
Download from the link attached for detailed GATE 2018 Computer Science and Information Technology (CS) Question Paper and Answer key


Attached Files
.pdf   GATE 2018 Computer Science and Information Technology (CS) Question Paper.pdf (Size: 915.82 KB / Downloads: 257)
Reply
#2
GATE 2018 Computer Science and Information Technology (CS) answer key


Attached Files
.pdf   GATE 2018 Computer Science and Information Technology (CS) Answer Key.pdf (Size: 60.25 KB / Downloads: 130)
Reply


Possibly Related Threads...
Thread Author Replies Views Last Post
  GATE solved papers CS Computer Science last 20 years abhilash 310 499,993 12-01-2018, 11:34 AM
Last Post: Nicecy
  GATE 2018 Engineering Sciences (XE) Question Papers with answers joshyjoy 2 736 08-21-2018, 04:56 PM
Last Post: Kannansatheesh
  GATE 2018 Architecture and Planning (AR) question paper and answer key samson 2 766 08-21-2018, 04:55 PM
Last Post: Kannansatheesh
  GATE 2018 Life Sciences (XL) Question Papers with answer key kalyanasundari 1 585 03-22-2018, 11:29 AM
Last Post: nbm
  GATE 2018 Textile Engineering and Fibre Science (TF) solved Question Paper samson 1 717 03-22-2018, 11:00 AM
Last Post: joshyjoy



Users browsing this thread: 1 Guest(s)