# Math for Computer science Questions and Answers 281 to 290

## Math for Computer science

### Questions 281 to 290

 281 What is the 5th term of (3 + x)8 ? (a)  C(8, 4) 34 x4                                      (b)  C(8, 5) 33 x5       (c)  C(8, 4) 34 x5 (d)  C(8, 4) 35 x4                                     (e)  C(7, 4) 34 x4. 282 How many different strings can be made by reordering the letters of the word ABRACADABRA (a)  8 ! / 5!2!2!         (b)  11! / 5!2!2!         (c)  5!2!2! / 11!         (d)  5!2!2! / 8!          (e)  11!. 283 What is the value of k after the following code has been executed. k := 0           for i1 := 1 to n1               for  i2 := 1 to n2               for i2 := 1 to n2               :               :                 for  im := 1 to nm                      k := k + 1 (a)  n1 + n2 + n3 +….nm                           (b)  n1.n2.n3…………nm                     (c)  C(n+m-1, m) (d)  C(n,m)                                             (e)  P(n,m). 284 GCD of 24.35.72 and 24.32 is (a)  22.35.72              (b)  24.35.72              (c)  25.34.72              (d)  24.32.70              (e)  22.35.74. 285 How many solutions are there to the equation x1 + x2 +x3+x4 = 17 (a)  C(20,17)                                          (b)  C(20 , 3)                                          (c)  1140                        (d)  All the above                                   (e)  none of the above. 286 Fermat’s theorem states that If  p is prime and a is an integer not divisible by p, then (a)  ap–1  1 (mod p)                                                             (b)  ap  1 (mod p)                    (c)  ap–1  0 (mod p) (d)  ap–1  1 (mod p–1)                            (e)  ap  1 (mod p–1). 287 Warshall’s algorithm is used for finding the __________ of a relation. (a)  reflexive closure                                                             (b)  symmetric closure              (c)  transitive closure (d)  transpose                                        (e)  inverse. 288 Suppose that A is a subset if V*. Then the set consisting of concatenations of arbitrarily many strings from A represented by A* is called (a)  Symmetric closure                           (b)  Reflexive closure                   (c)  Kleene closure (d)  Finite closure                                   (e)  Finite state closure. 289 The finite-state machine with no output is called _________ (a)  Kleene machine                               (b)  Finite machine                (c)  Output-free machine (d)  Finite-state automata                        (e)  Moore machine. 290 Type 2 grammars are also called ­__________ (a)  Context-sensitive grammars             (b)  Regular grammars            c)  Context-free grammars (d)  Context less grammars                    (e)  Irregular grammars.