169 views

Uploaded by appasami

Cp7201 Tfoc Model Qp 1 Theoretical Foundations of Computer Science

Cp7201 Tfoc Model Qp 1 Theoretical Foundations of Computer Science

© All Rights Reserved

- Cauchy Integral Theorem -- From Wolfram MathWorld
- Cp7201 Tfoc Model Qp 2 Theoretical Foundations of Computer Science
- Cp7004 Image Processing and Analysis 1
- Cp7201 Tfoc Lesson Plan Theoretical Foundations of Computer Science
- unit 2 image processing and analysis cp7004
- metamath
- Cp 7004_image Processing _ Unit 1
- Java 8 New Features
- Protein Functional Site Prediction Using the Shortest-Path Graph Kernel Method
- AIAS.pdf
- cs1101s-rec01
- Engineering the Computer Science and IT
- 2.Inequalities
- Branch_and_Bound.doc
- hw3-13-noSol
- Space Sintax
- Mathematical Techniques in Computer Science_1
- Lógica TK
- (0) Algebra Distributive 2terms Exponents All
- Week 05 Notes

You are on page 1of 2

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.

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.

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

- Cauchy Integral Theorem -- From Wolfram MathWorldUploaded byLekkala Ramesh
- Cp7201 Tfoc Model Qp 2 Theoretical Foundations of Computer ScienceUploaded byappasami
- Cp7004 Image Processing and Analysis 1Uploaded byVishnu Kumar
- Cp7201 Tfoc Lesson Plan Theoretical Foundations of Computer ScienceUploaded byappasami
- unit 2 image processing and analysis cp7004Uploaded bytiruman
- metamathUploaded byParesh Panditrao
- Cp 7004_image Processing _ Unit 1Uploaded byKavitha Ravi
- Java 8 New FeaturesUploaded bySumit Rawal
- Protein Functional Site Prediction Using the Shortest-Path Graph Kernel MethodUploaded byThái Sơn
- AIAS.pdfUploaded byMore Classes
- cs1101s-rec01Uploaded byTrung Hieu Nguyen
- Engineering the Computer Science and ITUploaded byFloricele Pecimpii
- 2.InequalitiesUploaded bySmith
- Branch_and_Bound.docUploaded bymansha99
- hw3-13-noSolUploaded byCorey Taylor
- Space SintaxUploaded byIDark Skynet
- Mathematical Techniques in Computer Science_1Uploaded byAnonymous sZZ7bFS
- Lógica TKUploaded byelias
- (0) Algebra Distributive 2terms Exponents AllUploaded byNurul
- Week 05 NotesUploaded byclements20077994
- Anipla Final[1]Uploaded byAndreea
- Ai Disjunctivity 5Uploaded byvanaj123
- Daniel PresentationUploaded bysanjayvsarang
- sat0wUploaded byAlex Muscar
- Testing7.pdfUploaded bydoomachaley
- IOSR JournalsUploaded byInternational Organization of Scientific Research (IOSR)
- Philo 11 (TFD) Predicate Logic Guide.pdfUploaded bypinkishbloo
- Logic HW4Uploaded byapi-3729180
- 2feb5Session 10 Bayes TheoremUploaded byAbhishek Jain
- Generalized Hyperspaces and Non-Metrizable Fractals PREPRINTUploaded byJonathan Robert Kraus (OutofMudProductions)

- Cs6702 Graph Theory and Applications Title Index PageUploaded byappasami
- Short Notes to Memorize gateUploaded byappasami
- Cs6503 Theory of Computation November December 2016Uploaded byappasami
- Cs6702 Graph Theory and Applications Notes PDF BookUploaded byappasami
- CS6660 COMPILER DESIGN PART B IMPARTANT QUESTIONS APPASAMIUploaded byappasami
- Cs6402 Design and Analysis of Algorithms Appasami Lecture NotesUploaded byappasami
- Cs6503 Theory of Computation SyllabusUploaded byappasami
- Cs6503 Theory of Computation Index PageUploaded byappasami
- CS6702 GRAPH THEORY AND APPLICATIONS syllabusUploaded byappasami
- Cs6702 Graph Theory and Applications SyllabusUploaded byappasami
- Cs6503 Theory of Computation Lesson PlanUploaded byappasami
- Cs6702 Graph Theory and Applications Lesson PlanUploaded byappasami
- Cs6660 Compiler Design AppasamiUploaded byappasami
- Chapter 1 Database SystemsUploaded byappasami
- Cs6660compiler Design 2 Marks AppasamiUploaded byappasami
- CS64O2 DESIGN AND ANATYSIS OF ALGORITHMS PART B IMPARTANT QUESTIONS APPASAMIUploaded byappasami
- Prospectus PU 2014_15Uploaded byappasami
- UNIT VUploaded byappasami
- RaidUploaded byappasami
- English Grammar TensesUploaded byMiguel Angel Urbina G.
- Cs6302 Dbms Apr May 2015 QpUploaded byappasami
- VB Access DbUploaded byappasami
- EC6301 Object Oriented Programming and Data Structures v6Uploaded byappasami
- Ec6301 Oop&Ds NotesUploaded byprabhuabi143
- EC2202-qbUploaded byappasami
- EC2202 2010 QPUploaded byappasami
- EC2202 2009 QPUploaded byappasami
- Anna university report formatUploaded bydilip_666
- IETECHUploaded byappasami

- GeoRUploaded byLuis Zanxex
- The Reasoned SchemerUploaded byVickyDX
- Imperative to Functional Programming SuccinctlyUploaded byIacob Razvan
- TFcs_Lesson_Plan_v00.docUploaded byKavitha Ravi
- Glmnet BetaUploaded byHarsh Tyagi
- Cp7201 Tfoc Model Qp 1 Theoretical Foundations of Computer ScienceUploaded byappasami
- PF_C2Uploaded bydercousin
- Smith -- Procedural ReflectionUploaded byBrian Cantwell Smith
- logic-programming-in-scheme.pdfUploaded bybwbuiz
- 03. M.E. CSEUploaded byMEcse1styear
- Metacircular Semantics for Common Lisp Special FormsUploaded bystacycurl
- Design and Analysis of Purely Functional Programs.pdfUploaded bymek mek
- CoercionUploaded byHotnCrispy Crispy
- UntitledUploaded bythefirearmblog
- The Scheme Programming Language Third EditionUploaded byChris Topher
- Theory Introduction to Programming LanguagesUploaded byJulián Calderón Almendros
- Advanced Topics in Types and Programming LanguagesUploaded byChandramouli Kolavasi
- Learning LispUploaded byFarmboy Antonio Bonifati
- ss10ch.pdfUploaded byLucas
- cs94-26Uploaded byWildo Gómez
- MCSE13Uploaded byJonathan Gomez
- Functional ProgrammingUploaded byhoanganh200870
- Heinrich Taube - Notes From the Metalevel: An Introduction to Computer CompositionUploaded byAlex Di Nunzio
- Case Studies in CUploaded byVivek Vardhan Reddy
- A Brief Look at Java 6,7,8 FinalUploaded bynithinkg
- Foundational Calculi for Programming LanguagesUploaded byrgomezv
- UT Dallas Syllabus for cs4337.001.09f taught by Shyam Karrah (skarrah)Uploaded byUT Dallas Provost's Technology Group
- Tutorial PictUploaded byCaccolo345
- IntroSem2008-03Uploaded byAsia Douglas