Rajasthan Technical University 2009-5th Sem B.Tech Computer Science and Engineering Logic & Functional Programming - Question Paper
Rajasthan tech. Univercity
B.Tech 3rd Year
2009
Logic & Functional Programming
a-\ i r-u>
Roll No.
Total No. of Question* : 5| |Totsl No. of P
|2019]
H.Tcch. Vth Semester Main Examination - 2009 Computer Engineering Logic & Functional Programming (5CS6.1)
. 5E3164
Time : 3 Hours Maximum Mari
Min. Passing Mart
Instructions to Candidates:
Attempt five questions in all selecting one question from each unit. Sch diagrams must be shown wherever necessary. Any data you feel mis sir, suitably be assumed and stated clearly. Units of quantities used/calculate Be'stated clearly. All questions carry equal marks.
1. u) Explain fully parenthesized propositions?
b) Write down BNF grammer for proposetions?
c) Explain tautology with example and show that following proposetic tautology using truth table:-
f) a i - JI => (d ~ b)
ii) (4+3+
OR
at Write down precedence rules for operators'.' h i Prove that following proposetion is tautolog)
( 7 | ,* r; t ) / *kvi/)l)=>(7c=>./)
5K 3164 / 3000 <1i
c) Consent following sentences in proposetion form
i) If he is rich, then he is unhappy.
ii) He is neither rich nun happy
iii) Wheather or not it is raining , I am going swimming.
iv) * < y or x = y (4x2=8) a; Prove that following logical law in equivalent using truth table
?(,*,) = 7$v7, (4)
b) Explain rule of substitution and transitivity with suitable examples?(4+4=8)
c) Explain scope rule with example? (4)
OR
a) Explain all inference rules with examples? (8)
d) Explain development of natural deduction system proof with example?(5) ;) Explain rule of substitution of equals for equals with suitable examp!e?(3)
i) Explain quantification in detail with examples? (6)
>) Explain free and bound identifiers with examples? (4)
) Explain textual substitution with examples? (6)
OR
(2)
64
(Coiitd...
a) Explain some theorems about textual substitution? (6)
b) Explain cand, cor operators by drawing truth tables and by suitable examples?
(6)
c) Prove following by suitable examples
E *\E
<4>
4. a) Explain applications, strengths and weaknesses of PROLOG? (6
b) Explain Back Tracking in PROLOG with suitable example? (2>
c) What do you mean by unification? Wrrte down the algorithm for it and explain this algorithm by suitable example? (8)
OR
a) Explain following predicates in PROLOG with suitable example?
i) CUT predicate
ii) Fail predicate
iii) ,Not predicate (2+2+2-6)
b) Explain PROLOG program implementation in detail'. . (4)
c) What do you mean by resolution'. Explain resolution in predicate logic .by taking a suitable example? (6)
5. a) Give the comparison between functional and imperative languages?(6)
b) Write down the application of functional languages'.' (4)
o Explain features of functional languages in detaii? ,6)
. OR
5E 3164 i3> {Contd____
a) Explain following in LISP programming:-1) Primitive functions with example
ii) Functions for constructing functions
iii) Functional forms
(l + l + l + ]=4) (6)
iv) Data type and structures
- b) Explain lambda calculus in detail with example?
c) Explain a,p and n conversion with examples?
* *
5K 31 64 (4)
|
Attachment: |
| Earning: Approval pending. |
