Applied Data Structure Class Assignment
1. What is Data Structure? Explain at least 5 Applications of Data Structure.
2. Define ADT. What are the components of ADT? Explain its importance in
Data Structure. Describe and implement rational ADT.
3. Show the representation of the following polynomial using
Multidimensional Array
4x3y2+3x2y+5y.
4. Suppose, an Array A [-15……64] is stored in a memory whose starting
address in a memory whose starting address is 459. Assume that word size
for each element is 2. Then obtain the following:
a) How many numbers of elements are there in the array A?
b) If one word of the memory is equal to 2 bytes, then how much
memory is required to store the entire Array?
c) What is the location for A [50]?
d) What is the location of 10th element?
e) Which element is located at 589?
5. Give an idea how a polynomial with three variables, say X, Y and Z can be
represented using a One-dimensional Array?
6. How a Sparse Matrix is implemented?
7. Define size of Array as 5, then Insert & Display 20 elements. Justify output.
8. Write an algorithm/ Program for different types of Array operation (Insert,
Delete, Display, Reverse and Search).
9. Accept 1st Name and Last Name from Users and Insert Middle Name.
10.Take full name from Users and Delete Middle Name.
11. Write a program for 2D-Array Having M*N elements and print the
elements in row order and column order.
12.Write a program to accept a symmetric matrix and print it.
13.What are advantages and disadvantages of using array? Compare array
data structure with Link List Data structure.
14.Explain applications of single link list in dynamic memory management.
15.Write an algorithm/ Program for different types of Link List operation (Insert,
Delete, Display, Reverse and Search).