Madras University (UnOM) 2008 B.C.A Computer Application -university question paper

NOVEMBER 2008 46411/PK4C
----------------------------------------------------------
PART -A--(10*3=30 MARKS)

Answer any TEN ques.
1.What is the use of data structure?
2.What is called as premitive data type?
3.Write the algorithm for push operation on stack.
4.Define Queue.
5.Write any 3 advantages of linked list than an array.
6.Define a graph.
7.What is calles as forest?
8.Write an expression for infix to postfix expression.
9.Give any 2 differences ranging from binary search and
sequential search.
10.What is the use of sorting method?
11.What do you mean by complexity of algorithm?
12.What is Traversal?

PART-B--(5*6=30 MARKS)
Answer any 5 ques.
13.Write short notes on Asymptotic notations.
14.Define data structure. describe algorithm.
elaborate the criteria for an algorithm
15.What are the operations done with a Queue?
discuss with an algorithm.
16.Write an algorithm for finding the factorial using Recursion.
17.What are the traversals available in a graph?
18.Write about Hash function.
19.Explain about Binary search.

PART -C--(4*10=40 MARKS)

Answer any 4 ques.
20. List out the differences ranging from stack and queue.
21.Write an algorithm to arranging books in library
in alphabetical order.
22.Explain about the concept of finding the shortest path
with DIJKSTRA'S ALGORITHM.
23.Develop a procedure which addds 2 polynomials using singly linked list.
Apply it your own suitable examples.
24.Write the procedure to obtain the Max and Min in an array.
25.Explain about the Maze issue in detail.

--------------------

Earning:   Approval pending.