MC1651-MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

UNIT-I
MATRICES
PART-A
0 1 2 1 
3 1  
1. Find the rank of  6  ,2 3 0  1 .
 2  
1 1 1 0 

3 1 2 
 
2. Find the value of “k” if the rank of the matrix 0 1  3 .
k 1 1 
 
3. State the condition for a system of equations in “n” unknowns to have
(i) one solution (ii) many solution (iii) no solution.
4. Give an example of two equations in two unknowns that are
(i) consistent with one solution (ii) inconsistent
(iii) consistent with many solution.
5. Find the values of “a”, “b” , if the equations 2 x  3 y  5 and ax  by  10
have many solutions.
6. For what value of “  ” the system x  2 y  0 and 2 x  y  0 has (i) a unique
solution
(ii) more than one solution.
7. Test if the the equations x  y  z  a, 2 x  y  3z  b, 5 x  2 y  z  c have unique
solution, where a, b, c are not all zero.
1 3
8. Use Cayley-Hamilton theorem to find A3,A-1 for A   2 .
 4 
1 2
9. Use Cayley-Hamilton theorem to find A 4  4 A 3  5 A 2  A  2 I for A   4 3  .
 
PART-B
1. Test for consistency of the following system of equations and hence solve it

2x  y  5z  w 5
(i) x  y  3z  4w  1

2 x  6 y  3 z  18
(ii) 3 x  4 y  7 z  31
x1  2 x 2  x3 2

2. Find for what values of “  ” the following equations have non-trivial solution
x  2 y  3z  x
3x  y  2 z  y
2x  3y  z  z
3. Find the eigen values and eigen vectors of
2 2 3 
 
(i ) 1 1 1 
1 3  1

 2 0 1
 
(iv ) 0 3 0
1 0 2 

4. Verify Cayley-Hamilton theorem for
1 3 7
 
(i ) 4 2 3 and hence find A-1
1 2 1 


1 2 1 
 
5. Given that A  0 1  1 , Express A 6  5 A 5  8 A 4  2 A 3  9 A 2  35 A  6 I
3 1 1 

in terms of linear polynomial in A, using Cayley-Hamilton theorem
 Ans : 4 A  42 I 
6. Find the inverse for the following matrices without using CHT
1 0  2
 
 i 2 2 4 
0 0 2 


UNIT – II
PART-A
1. What is meant by proposition and predicate?
2. Define Tautology and Contradiction.
3. Define Converse, Inverse, Contra positive..
4. Show that ( P Q) ( R  Q)  ( P  R)  Q.
5. Show that P  ( P  Q).
6. State the truth value of “ If tigers have wings then the earth travels round the sun”.
7. Give the converse and contra positive of the implication “If it is raining then I get
wet”.
8. Show that ~ (P Q)  ( ~P  ( ~P Q) )  (~P  Q) ( use only laws).
9. Define DNF and CNF.
10. Prove (~P(~QR)) (Q R)(PR) R ( use only laws).
11. Define functionally complete set of connectives and give an example.
12. What are the rules of inferences?
13. Define conditional and biconditional
14. Negate the following
a. Ottawa is a small town.
b. It is not easy that city in Canada is clean.
15. Verify whether ( P  ( P  Q) )  Q is a tautology.
16. Show that ~r is a valid conclusion form the premises p  ~q , r  p , q.
17. Obtain CNF of ~ ( p  ( q  r) ) .
18. Find the PDNF of q ~ r ~s)  (r s).
19. Consider the following
p : you take a course in D.M
 q : you understand logic
r : you get first class A on the final exam.
(a) ( p ~q)  ~r. (b) ( p  q)  r.
20. Prove that ( p  ( p  q) )  q.
21. Prove that p ( q r)  ( p  q)  r.

PART - B

1. Prove that [ ( p  q)  ( p  r)  ( q  r) ]  r is a tautology.

2. Check whether the hypothesis “ It is not sunny this afternoon and it is colder than
yesterday”, “ we will go swimming only if it is sunny” , “If we do not go
swimming then we will take a canoe trip” and “ If we take a canoe trip, then we
will be home by sunset” lead to the conclusion “ we will be home by sunset”.
3. Check the validity of the following argument. “If the band could not play rock
music or the refreshments were not delivered on time, then the New year’s party
would have been cancelled and Alice would have been angry. If the party were
cancelled, then refunds would have to be made. No refunds were made”.
4. Show that the following set of premises is inconsistent.. “If the contract is valid,
then John is liable for penalty. If John is liable for penalty, he will go bankrupt. If
the bank will loan him money, he will not go bankrupt. As a matter of fact, the
contract is valid and the bank will loan him money”.
5. Show that the following premises are inconsistent:
a. If Vijay misses many classes, then he fails in M.E
b. If Vijay fails in M.E , then he is unemployed.
c. If Vijay appears for lot of interviews, then he is not unemployed.
d. Vijay misses many classes and appears for lot of interviews.
6. Show that the following premises are inconsistent.
a. If Jack misses many classes through illness, then he fails high school.
b. If Jack fails high school, then he is uneducated.
c. If Jack reads a lot of books, then he is not uneducated.
d. Jack misses many classes through illness and reads a lot of books.
7. Show that R  S follows logically from the premises C  D, (C  D)  ~ H, ~
H ( A  ~B) and ( A  ~B)  (R  S).
8. Find the PDNF and PCNF of ( p q)  (~p  r) ( q r).
9. Prove that S  ( P  Q)  ( P  R)  ( Q  S)  ( S R)
10. Obtain PDNF and PCNF of P ( ( P Q)  ~(~ Q  ~ P)).
11. Obtain PDNF and PCNF of (~ P R)  ( Q  P).
12. Define inconsistent premises. Show that the premises E S, S H, A  ~H,
E  A are inconsistent.
13. Using rule C.P, show that ~P Q, ~Q R, R S  P  S.
14. Obtain PDNF and PCNF of P  ( ~P  ( Q  ( ~Q R))).
15. Obtain PDNF and PCNF of S  ( P  ( Q R))  ( ~P  ( ~Q ~R)).
16. Derive P  ( Q  S) from the premises P  ( Q  R), Q ( R  S) by using
the rule CP.
17. Prove that P  Q , Q  R, P  R  R by using indirect method..
 UNIT – III
PART-A
1. What is meant by predicate calculus?
2. Rewrite the following using quantifiers “Some men are genius”.
3. Rewrite the following using quantifiers “All students in the class have taken a
course in discrete mathematics”.
4. Write the negations for each of the following using quantifiers
a. “Real number x , if x > 3 then x2 > 9”.
b. Integers a, b and c if a – b is even and b – c is even then a – c is even.
5. Remove all negations of the quantifiers of the following expression
~ y (x P (x, y)  ~ x Q( x, y))
6. Write down the rules of inferences in Predicate calculus.
7. Write the following sentence in a symbolic form:
“Every one who is healthy can do all kinds of work”.
8. What is meant by Universal Modus Ponens and Universal Modus Tollens.
9. Show that  y x P( x, y)   x  y P( x, y).
10. Express the statement “ For every x then there exists a y such that x2+y2  100” in
symbolic form.
11. Prove that (x) ( H( x) M(x)) H(s) M(s).
12. What is meant by “ proof by contradiction”
13. Symbolize the following statement with and without using the set of positive
integer on the universe of Discourse.
“Give any positive integers , there is a greater positive integer”.
14. Translate the following using quantifiers “Some student of this class selected in
Infosys”.
15. Let Z, the set of integer, be the universe of discourse and consider the statements
(x  Z) , x2 = x, (x  Z) , x2 = x,
16. Give an example to show that ( x) ( A(x)  B(x) ) need not be a conclusion from
( x) A(x) and ( x) B(x).
17. Find the truth value of (x) ( P  Q(x) )  ( x) R(x).
PART - B
18. Prove that (x ) ( ( P(x)  Q(x))  (x ) (P(x))  (x ) (Q(x)).
19. Translate the following predicate calculus formula into English sentence
x [ C(x)   y(C(y)  F( x, y) ].Here C(x) : x has a computer, F(x ,y) : x and y
are friends. The universe for both x and y is the set of all students of your college.
20. Show that (x) ( P(x)  Q(x))  (x) P(x)  ( x) Q(x) by using indirect method.
21. Show that (x) ( P(x)  Q(x)) (Q(x) R(x))  (P(x) R(x))
22. Is the following conclusion validly derivable form the premises given?
If (x) ( P(x)  Q(x) ), (  y ) P(y) then (  z ) Q(z)
23. Symbolize the following arguments and check for its validity: “Every living thing
is a plant or an animal. David’s dog is alive and it is not a plant. All animals have
hearts. David’s dog has a heart”.
24. Explain the two types of quantifiers and determine the truth value of each of the
following statements:
 a. (x) , |x| = -x ( b ). (x) , x + 2 > x (c ).  x , x4 = x (d).  x , x – 2 =
x
25. Use conditional proof to prove that (x) ( P(x)  Q(x) )  (x) P(x)  (x)Q(x)
26. If one person is more successful than another, then he has worked harder to
deserve success. John has not worked harder than Peter. Therefore, John is not
more successful than Peter.
27. Show that (x) ( F(x)  S(x) )  ( y) ( M (y)  W(y))
i. (y) ( M (y)  ~ W(y))
(x) (F(x)  ~ S(x))
28. Lions are dangerous animals. There are lions . Therefore lions are dangerous
animals.
29. All men are mortal. Socrates is a man. Therefore Socrates is a mortal.

UNIT-IV
PART-A
1) Show that the truth values of the following formulas are independent of their
components
(a)  P P  Q    Q
2) Verify whether the following statements are tautology or contradiction or
contigent
(a)  P  Q  V  7Q  7 P 
(b)  7Q  7 P 
3) Prove the following by constructing the truth table
(a)  P  Q  R    P  Q    P  R 
(b) P  Q  P 
(c) 7  P  Q    P  7Q 
4) Verify the following without constructing the truth table
(a)  P   Q  P    7P   P  Q 
(b)   P  Q    R  Q      P V R   Q
(c)   P  Q   Q  PV Q
5) Show that
(a)  V  is not functionally complete
(b)  7  is not functionally complete
6) Find the dual of the following
(a) P   Q  7  R  P
(b)  Q V  P 7Q  V  7 P  7Q  
7) Find DNF for the following
(a)  R V 7 P   7 Q  P 
8) Find CNF for the following
(a) P V  7 P   Q V  7Q  R   
(b)  Q V  P 7Q  V  7 P  7Q  
9) Find the PDNF for the following
 (a) P V  7 P 7Q  R 
(b) P V  7 P   Q V  7Q  R   
10) Find the PCNF for the following
(a)  Q  P   7P  Q
(b)  7P  R   Q  P
11) Find the PDNF and PCNF for the following by constructing truth table
(a)  Q  P   7P  Q
(b)  7Q  R  V  7Q  7 R  P 
UNIT-IV
PART-A
1. Define phrase-structure grammer
2. Define formal languages
3. Define a context-sensitive language
4. Define a context-sensitive grammer
5. Explain CNF
6. Explain GNF
7. Define ambiguous grammer
8. State pumping lemma
9. Define type-0 grammer
10. Show that the grammer with productions S  aAb abSb a, A  bS aAAb is
ambiguous and also draw the derivation trees

PART-B
1. Explain the classification of grammars?
2. Explain Chomsky hierarchy of languages?
3. Find the grammer such that L(G )  a n b n ; n  1
4. Find the grammer generating L(G )  a n b n c m ; n  1, m  0
5. Construct a grammer G for the language L(G )  a n bc m ; n, m  1
6. Construct the grammer for the language L(G )  a i b j ; i  j  0
7. Construct a grammer generating all palindromes over {a,b}
8. Find the grammer generating L(G )  a n b n c n ; n  1
9. Define a context-sensitive language.Show that the set a n b n c n ; n  1 is a
context-sensitive language.
10. Reduce the following grammer to CNF
(a) S  a b cSS (b) S  abSb a aAb,

11. Reduce the following grammer to CNF

(a) S  S  S S * S a b (b) S  A0, A  0 B, B  A0, B  1
12. Show that the grammer is ambiguous
S  SS , S  a, S  b
13. State and prove pumping lemma
14. Show that L  a p ; p is prime is not regular
UNIT-V
 PART-A

1. Define finite automaton

2. Explain representation of finite automaton
3. Define NFA
4. Define DFA
5. List down the difference between NFA and DFA
PART-B
1. Convert the following to DFA
0, 1 0, 1
start 0 0

0, 1

2. Which of the following strings are recognized by the DFA in the following fig.
(a) 010 (b) 1101 (c) 1111110 (d) 010101010

1
1

0 1
0
0

0,1

3. Construct a NFA that recognizes the regular set 11*U01

4. Convert the following into equivalent NFA without  moves
  
0 1 2
start

5. Construct a finite automaton M accepting {ab,ba}

6. Construct a finite automaton that accepts those input strings of 0’s and 1’s that
end in 11
7. Give DFA accepting the set of all strings over {0,1} with three consecutive 0’s