Scribd
Upload
31 views3 pages

MFCS QP

Uploaded by

Shakeer Baba Mohammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views3 pages

MFCS QP

Uploaded by

Shakeer Baba Mohammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MOTHER THERESSA COLLEGE OF ENGINEERING AND TECHNOLOGY

M-TECH I-I MID – I EXAMINATION


SUBJECT: MFCS BRANCH: CSE

WRITE ANY FOUR ANSWER: 4 X 5 = 20

1.Explain foundation logic and proofs?


2.Write applications of propositional logic?
3.Describe the basic structures sets, functions, sums, matrices and relations?
4.Write algorithm of induction and recussioin?
5.Explain N-ray relations and their applications?
6.Definitions of structural induction and recursive algorithm?
Multiple Choice Questions (MCQs) 1 x 5 =5
1.Which of the following is a valid operation in set theory?
A) A∪(B∩C)=(A∪B)∩(A∪C)A \cup (B \cap C) = (A \cup B) \cap (A \cup
C)A∪(B∩C)=(A∪B)∩(A∪C)
B) A∩B=A∪BA \cap B = A \cup BA∩B=A∪B
C) A−B=B−AA - B = B - AA−B=B−A
D) A∪B=A−BA \cup B = A - BA∪B=A−B
2.Which of the following is a property of a graph that is present in both DFS (Depth-First
Search) and BFS (Breadth-First Search)?
A) Finding the shortest path in a weighted graph.
B) Traversing all the vertices of the graph.
C) Detecting cycles in a graph.
D) Finding the Minimum Spanning Tree.
3.Which of the following is not a valid type of automaton for recognizing context-free
languages?
A) Finite Automaton
B) Pushdown Automaton
C) Turing Machine
D) Linear-Bounded Automaton
4.In propositional logic, the logical equivalence of (P→Q)(P \to Q)(P→Q) and ¬P∨Q\neg P
\vee Q¬P∨Q is an example of:
A) Distributive Law
B) De Morgan’s Law
C) Implication Law
D) Associative Law
5.In combinatorics, the number of ways to choose rrr objects from a set of nnn objects is
given by:
A) P(n,r)=n!(n−r)!P(n, r) = \frac{n!}{(n - r)!}P(n,r)=(n−r)!n!
B) C(n,r)=n!r!(n−r)!C(n, r) = \frac{n!}{r!(n - r)!}C(n,r)=r!(n−r)!n!
C) C(n,r)=n!C(n, r) = n!C(n,r)=n!

D) P(n,r)=nrP(n, r) = n^rP(n,r)=nr
Fill-in-the-Blank Questions 1x5=5
1.The set of all strings over an alphabet Σ\SigmaΣ is called the _______ of Σ\SigmaΣ.
2.A _______ graph is a graph in which there is a path between any two vertices.
3.In a Turing Machine, the tape alphabet must include a special symbol called the _______
symbol, which is used to represent empty cells.
4.The Big-O notation is used to describe the _______ of an algorithm, which is the upper
bound on the running time of the algorithm.
5.A _______ is a formal mathematical structure used to model the behavior of a
computation or process, and consists of states and transitions between them.

You might also like