Paradigms & Computer Programming Foundation Exam Paper - 2024 - PDF

D1 2...

D1 2 D1 YD YD X5 Paper / Subject Code: 51425 / Paradigms & Computer Programming Foundation 0E 0E 25 12 25 YD YD June 14, 2024 02:30 pm - 05:30 pm 1T01233 - S.E.(Information Technology Engineering)(SEM-III) ED X5 ED X5 (Choice Base Credit Grading System ) (R- 19) (C Scheme) / 51425 - 25 12 25 D0 12 D0 X5 Paradigms & Computer Programming Foundation QP CODE: 10057813 ED X5 ED Y Y 5 12 5 12 0 D0 2 2 YD X5 Time: 3 Hours Marks: 80 D X5 D 5Y 0E E 12 5 12 0 52 52 YD D 5 D D 2X 2X 5Y N.B.: 1. Question No.1 is compulsory. 2X E E 25 0 0 D1 D1 52 YD D1 YD 2. Answer any three out of remaining questions. X5 2X 0E E 0E 25 12 25 3. Assume suitable data if necessary. 0 YD 1 YD YD 5 D X5 D 2X 4. Figures to the right indicate full marks. E E 25 25 12 25 D0 0 D1 D YD X5 X5 ED X5 5Y 5Y 0E 2 Q1. a) Explain encapsulation with example. How does it differ from abstraction? (10) 2 25 12 D0 52 D1 52 D1 YD X5 D 2X 2X 5Y 0E E 0E 25 b) Describe the use of scripting in web development along with an example (10) 12 0 D1 D1 52 D YD YD 5 D 5Y X X 0E 0E 0E 12 25 2 25 52 YD D1 D YD ED ED X5 X5 2X Y E 25 Q2. a) Explain Type and Type classes in Haskell. (10) 5 D0 2 25 D0 12 0 D1 52 1 YD X5 ED X5 D 5Y 5Y X 0E 0E 12 b) Explain different storage allocation mechanisms. (10) 2 25 12 D0 52 52 D1 D YD ED X5 D 2X Y 2X Y E 0E 25 5 D0 12 25 0 D1 D1 52 YD D X5 ED X5 5Y X 5Y 0E E Q3. a) What do you mean by Programming Paradigm. Explain with example the difference 12 5 2 D0 12 D0 52 2 YD D1 52 ED X5 ED between declarative and imperative programming paradigm. (10) 2X Y 5Y 2X 0E 25 5 2 D0 D0 D1 2 1 52 D1 YD X5 5 ED b) Describe various methods to create a thread. (10) 5Y X 2X 5Y 0E 0E 12 2 25 D0 52 1 YD D1 52 YD ED ED X5 2X Y 2X 0E 25 5 D0 12 25 0 D1 52 YD D1 YD X5 ED X5 5Y Q4. a) What is logic programming? Explain Facts and Rules along with an example. (10) 2X 0E 0E 12 5 25 12 D0 52 2 D1 D YD ED 5 X5 ED b) Explain the different communication and synchronization techniques in Concurrent 2X Y 2X 5Y 0E 5 D0 12 25 D0 D1 2 D1 52 YD X5 ED X5 Programming model. (10) 5Y 2X 5Y 0E E 12 25 D0 12 D0 52 YD D1 52 D X5 ED 2X 5Y 5Y 2X E 0E 25 12 0 D0 D1 52 52 D D1 YD X5 ED Q5. a) Explain database manipulation commands in Prolog with an example. (10) 5Y 2X 2X 5Y E 0E 12 25 0 D0 52 D1 YD D1 52 YD ED X5 b) What is Inheritance? Explain different types of Inheritance in OPP. (10) 2X 5Y 2X 0E 0E 25 D0 12 25 D1 52 YD D1 YD X5 ED X5 5Y 2X 0E 12 25 25 12 D0 52 1 YD ED X5 ED X5 ED Q6. Short note on: (Any 4) (20) 2X 5Y 25 12 D0 12 0 D0 D1 52 YD X5 ED ED a) Static Scoping vs. Dynamic Scoping 5Y 2X 5Y 0E 2 25 D0 D0 2 b) Forward chaining vs. Backward chaining D1 YD 1 52 X5 X5 ED 5Y 5Y 0E c) List operations in Prolog 25 12 12 D0 52 52 YD X5 ED ED d) Currying in Haskell 2X 5Y 2X 12 25 D0 D0 e) Programming languages vs. Scripting languages 1 52 1 ED X5 ED ED 5Y 5Y 2X 12 D0 D0 D0 52 52 D1 ED 5Y 2X 5Y 2X ********************** 0E 0 52 1 2 1 YD YD ED X5 ED 2X 25 12 25 D0 D0 D1 X5 ED X5 5Y 5Y 0E 12 12 D0 52 52 YD ED 2X 5Y 2X 25 D0 D1 2 D1 X5 X5 57813 5Y 0E 0E 12 12 2 YD YD ED X5 ED 25 12 25 D0 D0 X5 ED 5Y 5Y 2 D0 X525YD0ED12X525YD0ED12X525YD0ED12X525YD0ED12 52 D1 52