Madras University (UnOM) 2006 B.C.A Computer Application Data structures - Question Paper

PART A - (10 x three = 30 marks)



ans any TEN ques..

All ques. carry equal marks.

every ans should not exceed 50 words.



1.Define data structure. provide examples.



2. elaborate primitive data types? How do they differ

from composite data types?



3.Define the terms Queue and Dequeue.



4.List the applications of stacks.



5. State the merits and demerits of linked lists over

arrays.



6. provide the linked list representation for the

subsequent polynomials:



(a) A = 3X14 + 2X8 -1



(b)B = 8X14 - 3XlO + 10x6 .



7.Define circularly linked list. provide an example.





8.Differentiate ranging from trees and binary trees.



9.Define graph.



10. Construct the binary tree uniquely represented by

the subsequent preorder-inorder sequences.



Preorder sequence: ABCDEFGHI Inorder



sequence: BCAEDGHFI



11. describe algorithm and list the desirable

characteristics.



12. What do you mean by 'divide and conquer'

technique?



PART B - (5 x six = 30 marks)



ans any 5 ques..

All ques. carry equal marks.

every ans should not exceed 200 words.



13. provided an array A (1 : n), write an algorithm to

produce the array Z (1 : n) such that Z (1) = A (n) ,

Z(2)=A(n-1),...,Z(n-1)=A(2), Z(n)=A(1). Use a

minimal amount of storage.



14. Write algorithms to insert and delete elements in

a circular queue.



15. Write an algorithm LENGTH(P) to count the

number of nodes in a singly linked list P, where P points

to the 1st node in the list. The last node has link

field O.



16. Write algorithms to insert and delete nodes in a

doubly linked list.



17. Write the Dijkstra's algorithm to obtain the shortest

path.



18. discuss the steps to convert a forest to a binary

tree.



19. discuss the algorithm to obtain the maximum and

the minimum .of a set of numbers using dived and

conquer technique.



PART C - (4 x 10 = 40 marks)



ans any 4 ques..

All ques. carry equal marks.

every ans should not exceed 500 words.



20.Discuss the operations on arrays with examples.



21. explain the valuation of expressions along with

the algorithm for infix to postfix: conversion.



22. Write and discuss the algorithm to add 2

polynomials using linked representation.



23.Discuss the hashing tables and hashing functions.



24. discuss the binary tree traversal algorithms with

examples.



25. explain the merge sort algorithm with an example.

Earning:   Approval pending.