Thiruvalluvar University Question Paper

[sumit]

Sir I am looking for the Thiruvalluvar University B.C.A Computer Application Data structures and C programming Question Paper so can you please provide me the same

[Shaleen]

Hey the Thiruvallauvar University is a public university in the city of Vellore, Tamil Nadu, India.

It was established by the government of Tamil Nadu, under the Thiruvalluvar University Act, 2002.

B.C.A Computer Application Data structures and C programming


APRIL/MAY 2006 CAE

Time:Three hours Maximum marks:100 marks

PART A- (5 * eight = 40marks)

ans any 5 ques..

All ques. carry equal marks.

1. discuss the while and do....while statements

2. provide a brief account on functions in C..

3. discuss with example any 4 string handling functions.

4. discuss array with examples in C.

5. discuss how infix and postfix expressions are evaluated..

6. Write about singly linked list.

7. provide brief account on Hashing.

8. Write about binary tree and its operations..


PART B-( three * 20 = 60 marks)

9. discuss Dynamic memory allocation in C.

10. Write about input/output operations on files in C.

11. explain in detail about stack and queue.

12. discuss how linked list can be used for polynomial addition.

13. Explain:
(a) Graph traversals
(b) Tree traversals
(c) Shortest path.

Address:
Thiruvallauvar University
Serkadu, Vellore,
Tamil Nadu 632115
Phone: 0416 227 4755

Sir I am looking for the Thiruvalluvar University BSC computerscience Design analysis and algorithm previous year question paper so can you please provide me

[venus]

2007 Anna University Chennai B.Sc Computer Science DESIGN OF ALGORITHMS Question paper
University Question Papers
2007 Anna University Chennai B.Sc Computer Science DESIGN OF ALGORITHMS Question paper

Computer Technology

DESIGN OF ALGORITHMS

(Common to B.Sc. Information Technology)

PART A (10 X 2 = 20 marks)

1. What do you mean by algorithm validation?
2. Compare direct and indirect recursive algorithms.
3. Show the binary decision tree for binary search. (assume no. of elements=14)
4. Write an algorithm for finding maximum and minimum in a straight forward
method.
5. State the principle of optimality.
6. Show the diagrammatic representation of graph with negative cycle.
7. Distinguish between preemptive and non preemptive schedule.
8. Define articulation point. Give example.
9. What is the total number of nodes in 8queens state space tree?
10. What is Branchand Bound method?

PART B (5 X 16 = 80 marks)

11. (i) Find an optimal solution to the knapsack instance n7, m=15 (6)

(p1, p2, p3 to p7) = (10,5,15,7,6,18,3) and
(w1,w2,w3, to w7) = (2,3,5,7,1,4,1)

(ii) Write an algorithm to find the shortest path from one node to every other node
in the graph. Illustrate with an example. (10)

12. (a) (i) What is algorithm? Explain the criteria to be satisfied in every algorithm. (6)

(ii) Devise an recursive algorithm to compute the following binomial coefficient.
Analyse its worstcase and bestcase performance. (10)

n n!
=
m m! (nm)!

(b) (i) How do we analyze the performance of an algorithm? Give an example. (8)

(ii) Explain the various asymptotic notations used in algorithm. (8)





13. (a) (i) Write a recursive binary search algorithm. Analyze its time complexity. (8)

(ii) Sort the following numbers using merge sort. (8)

310,285,179,652,351,423,867,254,450,220

Or
(b) (i) Write an algorithm for Quick sort. Give an example. (10)

(ii) Compare the performance analysis of merge sort and Quick sort. (6)

14. (a) (i) Explain the use of Traveling Salesman problem with an example. (10)

Or
(ii) Write a note on flow shop scheduling (6)

(b) (i) Write an algorithm to count the number of lead nodes in a binary tree?
What is its time complexity? (6)

(ii) Explain Depth First Search algorithm. (8)

(iii) Define spanning tree (2)

15. (a) Discuss the use of backtracking in solving 8queens problem. Analyze its
Performance measures. (16)

or

(b) (i) Write down the control abstraction for LC search (6)

(ii) Explain the method of solving knapsack problem using BranchandBound
Technique.