munotes®

BSc CS Sem 3 BSc CS Semester 3 (2015 2016) 2016 COMPUTER I Question Paper - Mumbai University | munotes

BSc CS Semester 3 (2015 2016) Question Paper, 2015.pdf
SEM 3 · BSc CS Semester 3 (2015-2016) · 1 May 2025

Loading PDF...

Questions asked in this paper

integers not exceeding 100 are
State the inclusion - exclusion principle. How many positive integ
f length 8? Also find how
State the sum and product rule. How many bit string are there o
of them ends with two bits
State the Binomial theorem. Use it
= 2", for non negative
(ii) 3", for non negative integerm
d) State the V. if n\2 for non-negative integer
e Vandermonde’s identify. Use it to prove
e) State and prove Pascal’s
f) Define the term Grammer. Explain the types of Grammer
g) Define the term:
(i) ing
(ii) Finite state automata
h) Consider following FSA. Find states, input letters, initial state, accepting state, /(S,,
Also write it’s state table

Read from the scan above, so a character or two may differ. The scan is the original.

Report or request

Something wrong on this page? Report it and we will check it against the scan.

Quick Help

No. The full paper opens straight away, with no login and nothing to pay.

Something wrong with this paper? Report it.

Connected Papers
BSc CS / Sem 3 · 72 papers
Browse all →
Questions? Email contact@munotes.in
Done!
Done!