FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams. We connect Students who have an understanding of course material with Students who need help. Benefits:- # Students can catch up on notes they missed because of an absence. # Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand # Students can earn better grades, save time and study effectively Our Vision & Mission – Simplifying Students Life Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.” Like Us - https://www.facebook.com/FellowBuddycom

1. Time : 3 Hours Maximum Marks : 80
Min. Passing Marks : 24
Attempt aryt /ive questions, selecting one questian from each unit. All questions
carry equal marks. (Schematic diagrams must be shown wherever necessatl'.
An1, dctta vou feel missing suitably be assumed and stated clearl.v. Units of
quontities used/calculated must be stated clearly.
Unit - I
What do you understand by quantification? Discuss all different types of
quantifiers. (8)
1. a)
b) What is tauiology and show that given proposition is a tautology.
l@ -q)"{q +,)]+(r-+r) (8)
a)
b)
1.
(8)
(8)'
2. a)
b)
OR
Wha. do. you mean. by logical equivalenco. proposition? Show that
-(w(t "a)
and.-p r','-q are logical equivalent. (&)'
Prove thai:
(-(r =,.)^--(-'a+(cvd')))B (-c = d), (8).
Uni*i'tT
Explain how a quary is processed in prolog?
Explain baekracking in prolog with suitable example.
B.Tech. IVSemester(Old/Back) Examination, June/July - 201 5
Computer Science and Information Tech.
4C56.3 Logic and Functional Programming
482923 lzots lContd....

2. 2. a)
b)
3. a)
b)
' (8)',
(8)
-GR
Define search strategy? Explain BFS witlexample.
Explain, raerits and deaff EFits of prol o g.
Unit - III
Define unification? Explain recursion in prolog.
Write a program in prolog for printing number form I to I 0.
Compare functional and irnperative language.
OR
Describe lazy and Eager evaluation strategies.
Evaluate the given lambda expression where possible
r) (z*.(+,r,.y)s
ii) ()x.1s.(+xyy)2s
(8)
(8)
OR
3' a) what do you understand by sorting? Exprain different types of sorting. (s)
b) Explain the following predicates with suitable examples.
i) Cut predicate
ii) Not predicate (4+4=8)
Unit - IV
what is lambda calculas? Explain syntax and,semantics of rarnbda calculas.(g)
4. a)
b)
4. a)
b)
(8)
(8)
(8)
,Unit.- V
5. a) Whatislistinil:laskdlil.i,*sdiffierentfrmranydor@irys.
'(8)
4l:tq2'3 (2t)

3. b) Explain the IO and may be rnonad. (S)
OR
5. a) Define user define data types in Haskell? What are the type of user define data
rypes. (8)
b) Write a prograrn in Haskell using I/O. (g)
482923 (3)