Scribd
Upload
269 views

Cp7201 Tfoc Model QP 1 Theoretical Foundations of Computer Science

This document contains a model examination for the theoretical foundations of computer science course. It is divided into two parts: Part A contains 10 short answer questions covering topics like propositional logic, graph coloring, recursive algorithms, and language theory. Part B contains 5 longer answer questions with choices to choose between two related topics for each, covering additional topics like formal languages, computability, algorithms, and complexity theory. The exam tests fundamental concepts in computer science theory.

Uploaded by

appasami
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
269 views

Cp7201 Tfoc Model QP 1 Theoretical Foundations of Computer Science

This document contains a model examination for the theoretical foundations of computer science course. It is divided into two parts: Part A contains 10 short answer questions covering topics like propositional logic, graph coloring, recursive algorithms, and language theory. Part B contains 5 longer answer questions with choices to choose between two related topics for each, covering additional topics like formal languages, computability, algorithms, and complexity theory. The exam tests fundamental concepts in computer science theory.

Uploaded by

appasami
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DR.

PAULS ENGINEERING COLLEGE


DEPARTMENT OF CSE
ME Computer Science & Engineering
CP7201 Theoretical Foundations of Computer Science
Model Examination I
PART A (10*2=20)
1. Define principle of inclusion.
2. Define recursive algorithm and explain with Example
3. Define Propositional and Predicate logic.
4. Construct truth table for (p q) (p q).
5. Define Normal order reduction and Applicative order reduction.
6. Differentiate Call by name and call by value.
7. Explain Graph coloring problem.
8. Define Cliques and Vertex covers.
9. Compare State machines and languages
10. Define RL and RE languages.

PART B (16*5=80)
11. a. i. S.T.

is divisible by (a-b) for all .


ii. Explain Structural Induction with example.
or
b. i. Discuss the Fibonacci recurrence relation.
ii. State and prove the generalized pigeonhole principle.

12. a. i. Give any 2 applications of Satisfiability problems.
ii. Show that
or
b. i. Discuss the SLD Resolution.
ii. Write the features of PROLOG.

13. a. i. State and Prove Church-Rosser Theorem I & II.
ii. Prove the following using the -calculus not (not true) = true & or false true = true.
or
b. i. Show that succ 2 = 3 and (* 1 3) = 3.
ii. State and Prove Extensionality Theorem and explain with example.

14. a. i. State and prove handshaking theorem.
ii. Compare Euler and Hamiltonian graph.
or
b. i. Explain ST, MST With algorithms.
ii. Discuss about network flows and matching with necessary functions associated with them.

15. a. i. How will you convert an NFA with epsilon to NFA without epsilon?
ii. Construct FA which accepts Decimal numbers which are divisible by 3.
or
b. i. Compare NP hard and NP complete problems.
ii. Explain the Computability functionalities of TM.


All the best No substitute for hard work






DR. PAULS ENGINEERING COLLEGE
DEPARTMENT OF CSE
ME Computer Science & Engineering
CP7201 Theoretical Foundations of Computer Science
Model Examination I
PART A (10*2=20)
1. Define principle of inclusion.
2. Define recursive algorithm and explain with Example
3. Define Propositional and Predicate logic.
4. Construct truth table for (p q) (p q).
5. Define Normal order reduction and Applicative order reduction.
6. Differentiate Call by name and call by value.
7. Explain Graph coloring problem.
8. Define Cliques and Vertex covers.
9. Compare State machines and languages
10. Define RL and RE languages.

PART B (16*5=80)
11. a. i. S.T.

is divisible by (a-b) for all .


ii. Explain Structural Induction with example.
or
b. i. Discuss the Fibonacci recurrence relation.
ii. State and prove the generalized pigeonhole principle.

12. a. i. Give any 2 applications of Satisfiability problems.
ii. Show that
or
b. i. Discuss the SLD Resolution.
ii. Write the features of PROLOG.

13. a. i. State and Prove Church-Rosser Theorem I & II.
ii. Prove the following using the -calculus not (not true) = true & or false true = true.
or
b. i. Show that succ 2 = 3 and (* 1 3) = 3.
ii. State and Prove Extensionality Theorem and explain with example.

14. a. i. State and prove handshaking theorem.
ii. Compare Euler and Hamiltonian graph.
or
b. i. Explain ST, MST With algorithms.
ii. Discuss about network flows and matching with necessary functions associated with them.

15. a. i. How will you convert an NFA with epsilon to NFA without epsilon?
ii. Construct FA which accepts Decimal numbers which are divisible by 3.
or
b. i. Compare NP hard and NP complete problems.
ii. Explain the Computability functionalities of TM.


All the best No substitute for hard work

You might also like