MD-FYIPG in Mathematical and Computing Sciences
SUBJECT: Problem Solving using Computers
PAPER CODE: CSCI1101T
Time Allowed:3 Hours Max. Marks: 70
NOTE: Attempt any four questions selecting two questions from each of the Section A and B. Section C
will be compulsory.
SECTION A
Q1. Exemplify the conditional and iterative constructs in python.
Q2. Define algorithm. Elucidate the implementation, analysis and efficiency of algorithms.
Q3. Write an algorithm and program to generate the Fibonacci sequence up to given number.
Q4. Write an algorithm and program to print the prime numbers for a given range. (2×12)
SECTION B
Q5. Write an algorithm and program that rearrange the elements in an array in reverse order.
Q6. Explain selection sort and write program to sort the given list using this method.
Q7. Write pan algorithm and a program to search a given value using binary search.
Q8. Illustrate Quicksort and write down the recursive algorithm to sort a list using it. (2×12)
SECTION C
Q9.
(i) List the data types in python.
(ii) What do you mean by logical operators in python?
(iii) What are the design approaches in problem solving?
(iv) Write down the algorithm to swap two numbers.
(v) Write the code snippet in python to check whether given number is prime or not
(vi) Explain the insertion of an element in an array.
(vii) Exemplify the merge sort.
(viii) Write python code of bubble sort
(ix) What are the merits and demerits of linear search?
(x) Explain the method of keyword searching in a given text.
(xi) Write an algorithm to solve Tower of Hanoi problem (2×11)
Page 2
Certified that the question paper in the subject of __________________ code ___________ has been set
by me covering whole of the syllabus
(Signatures of the paper setter)
Certified that the question paper in the subject of __________________ code ___________ has been set
by covering whole of the prescribed syllabus
(Question Paper vet by: Name of teacher ________________; Signatures ____________________ )