Acharya Nagarjuna University (ANU) 2006 B.Sc Information Technology I - DATA STRUCTURES - - Question Paper

B.Sc. IT, 1st Year DEGREE EXAMINATION, DECEMBER 2006
Paper I - DATA STRUCTURES

Time : 3 hours Maximum : 100 marks

ans any 5 ques..

1. (a) elaborate various approaches to measure the complexity of Algorithms?
(b) Write a procedure to obtain whether a number is prime or composite.

2. (a) What do you mean by word processing elaborate various kinds of operations.
(b) discuss what do you mean by static, semi static and dynamic character variables.

3. (a) Write an algorithm for linear search and explain its complexity.
(b) elaborate sparse matrices? How they are represented?

4. (a) elaborate records? elaborate indexing items in a record? How?
(b) What is bubble sort algorithm? Write and discuss. explain about its complexity.

5. (a) elaborate traders in a linked lists write an algorithm to inserts and delete an item into a linked lists with headers.
(b) Let L be a linked lists in memory write a procedure which obtains the number n times a provided item x occurs in a lists.

6. (a) elaborate starks? Write an algorithm using arrays to create a array?
(b) Write and discuss quick sort algorithm.

7. (a) elaborate circular queues? Write procedure to insert and delete and element into a circular queue.

(b) P: 12, 7, 3, -, /, 2, 1, 5, +, *, + is in postfix notation. Translate P by inspection and hand into its
equivalent infix notation and evaluate.

8. (a) discuss the terms:
(i) Binary tree
(ii) Extended binary trees
(iii) Complete binary trees with illustrations.

(b) explain about in order threading using an examples or illustration.

9. (a) What is merging? Write an algorithm to merge 2 sorted arrays.
(b) What is hashing? elaborate various methods to resolve collisions?

10. (a) discuss the Radix sort with an example.
(b) What is recursion? Write a program using recursion to obtain the factorial of a number.

Earning:   Approval pending.