Madras University: MXP FUNDAMENTALS OF COMPUTER ALGORITHMS, B.Sc Computer Science 2007 Question Paper

What you are looking at internet? On a search of FUNDAMENTALS OF COMPUTER ALGORITHMS university question bank from Madras University? Here's a collection of old question paper of FUNDAMENTALS OF COMPUTER ALGORITHMS which covers important questions and topics. The below shown previous years paper was asked originally in the year 200, B.Sc Computer Science Examination. Read on to get it!

Sponsored Links:

Madras University

November 2007 MXP

Maximum Marks: 100 marks

Subject: FUNDAMENTALS OF COMPUTER ALGORITHMS

Course: B.Sc Computer Science

2788/MXP November 2007
FUNDAMENTALS OF COMPUTER ALGORITHMS
(for those who joined in JULy 2005)
TIME:THREE HOURS MAXIMUM: 100 MARKS
PART A- (10 x 1=10 marks)

Choose the correct answer:

1. A ________ is the expression of an algorithm in a programming language

(a) module (b) program (c) subprogram (d) None of the above

2. _____ is the process of executing a correct program on data sets and  measuring the time and space it takes to compute the results.

(a) profiling (b) debugging (c) analyzing (d) none of the above.

3. In binary search, Ak is the middle element where k= _______

(a) (n+1)/2 (b) [(n+1)/2] (C) [(n+1)/2] (d) n/2

4. Procedure PARTITION is in

(a) merge  (b) quick  (c) insertion (d) none of the above

5. _______ programming is an algorithm design method that can be used when the solution to a problem may be viewed as the result of a sequence of decisions

(a) dynamic (b) static  (c) object (d) procedural.

6. The travelling sales person problem is to find a tour of _____ cost.

(a) maximum  (b) minimum   (c) average (d) None of the above

7. _______ method is used to obtain a minimum cost spanning tree

(a) Floyd's (b) Dijkstra's (c) Prim's (d) None of the above

8. A __________ tree is a binary tree in which external nodes represent messages

(a) decode (b) encode (b) syntax (d) none of the above

9. which of the following is not a user interface to a data warehouse?

(a) EIS (b) OLAP (c) Data mining (d) RDBMS

10.A ________ cycle is a round trip path along n edges of G which visits  every vertex once and returns to its starting position.

(a) Hamiltonian (b) Refresh (c) Rotation (d) None of the above


PART B-(5 x 6=30marks)
Answer ALL questions

11.(a) Write a note on: Time and Space Complexity.

or

(b) Discuss about Bigh-oh and Omega Notations.


12. (a) Write about binary search algorithm.

or

(b) Discuss about quick sort algorithm.


13 (a) Write a note on: Principle of optimality.

or

(b) Write about optimal binary search trees.


14 (a) Write a note on: Greedy Method.

or

(b) Write short notes on: Huffman Codes.


15 (a) Distinguish between explicit and implicit constraints.

or

(b) Write a procedure to find all m-colorings of a graph.


PART C-(5x12=60 marks)
Answer ALL questions.

16 (a) Explain the importance of developing efficient algorithms.

or

(b) Describe in detail, LC Branch-and-Bound solution for zero-one Knapsack problem.


17 (a) Explain the merge sort algorithm using divide-and-conquer technique

or

(b) Describe in detail, arithmetic with large numbers.


18 (a) Explain about Dynamic Programming and Optimization problems.

or

(b) Describe in detail, chained matrix multiplication.


19 (a) Explain about scheduling Algorithm using Greedy Approach.

or

(b) Explain any ONE method to find minimum spanning tree with example.


20 (a) Describe in detail, n queens problem using Backtracking.

or

(b) Write a recursive backtracking algorithm for sum of subsets problem and explain.

Share This