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

Monday, 12 August 2013 04:05Web

**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 structur

**e.**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 = 3X14 + 2X8 -1

**a)**(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

**1**describe algorithm and list the desirable

**1.**characteristics.

**1**What do you mean by 'divide and conquer'

**2.**technique?

**PART B**- (5 x six = 30 marks)

ans any 5 ques..

All ques. carry equal marks.

every ans should not exceed 200 words.

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

**3.**produce the array Z (1 : n) such that Z

**(**= A (n) ,

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

minimal amount of storage.

**1**Write algorithms to insert and delete elements in

**4.**a circular queue.

**1**Write an algorithm LENGTH(P) to count the

**5.**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.

**1**Write algorithms to insert and delete nodes in a

**6.**doubly linked list.

**1**Write the Dijkstra's algorithm to obtain the shortest

**7.**path.

**1**discuss the steps to convert a forest to a binary

**8.**tree.

**1**discuss the algorithm to obtain the maximum and

**9.**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.

**2**explain the valuation of expressions along with

**1.**the algorithm for infix to postfix: conversion.

**2**Write and discuss the algorithm to add 2

**2.**polynomials using linked representation.

23.Discuss the hashing tables and hashing functions.

**2**discuss the binary tree traversal algorithms with

**4.**examples.

**2**explain the merge sort algorithm with an exampl

**5.****e.**

Earning: Approval pending. |