Reg No.

Agni College of Technology

Thalambur, Chennai 600 130
Office of Examcell
Internal Test_II
Sub Name : Programming and Data Structures I QP Set : SET- A

Sub Code : CS6202 Department : CSE

Date : 17.2.17 Year & Sec : I & A&B

Timing : 10:00 pm to 1:00 pm Max Mark : 100 Marks

PART-A(10 x 2 = 20 Marks)
Answer Any Ten questions.
1. Define Internal and External Sorting.
2. Define Extendible hashing.
3. What is circular linked list?
4. What are abstract data types?
5. What are advantages of ADT?
6. What is the time complexity of binary search?
7. List sorting algorithms which uses logarithmic time complexity
8. State the applications of linear search and binary search techniques
9. Define dummy node.
10 Name the sorting techniques which uses the divide and conquer strategy
.
11. Give the applications of list.
12 State the advantages and disadvantages of linked list data structures.
.

PART B (5 x 16 = 80 Marks)
13. (a) Write Linked List ADT and implement any five operations. [16
]
(Or)
(b) Illustrate the necessary algorithms to implement to doubly linked list to [16
perform all the operations on created list ]

14. (a) (i) Illustrate the necessary algorithms to implement Radix Sort operations [16]
with example.
(Or)
(b) (i) Write Polynomial ADT and implement the operation add and [16]
multiplication using linked list

[1]
 Agni College of Technology
Thalambur, Chennai 600 130
Office of Examcell
15. (a) (i) Explain multi list representation in linked list with example. [16]
(Or)
(b) (i) What is hashing? Explain open addressing and separate chaining [16]
methods of collision resolution techniques with example

16. (a) (i) Sort the given integers and show the intermediate result using merge [8]
sort. 45,25,10,2,9,85,102,1.
(ii) Write a C code to sort an integer array using merge sort [8]
(Or)
(b) (i) Sort the given numbers and show the intermediate results using shell [8]
sort, 35,12,14,9,15,45,32,95,40,5
(ii) Write a C code to sort an integer array using shell sort. [8]

17. (a) (i) Sort the following sequence using quick sort 2, 13, 45, 56, 27, 18, 24, [8]
30, 87,9.
(ii) Write an algorithm to search a number in given set of numbers using [8]
binary search.
(Or)
(b) (i) What are the different types of hashing techniques? Explain them in [16]
detail

***********

[2]