Scribd
Upload
13 views1 page

FDS Question Bank Theory Unit-II

The document is a question bank focused on linear data structures using sequential organization, covering topics such as array storage methods, polynomial representation, and operations on arrays. It includes questions on algorithms for polynomial multiplication, sparse matrices, and address calculation for multi-dimensional arrays. Additionally, it addresses the advantages and drawbacks of arrays, providing a comprehensive overview of fundamental concepts in data structures.

Uploaded by

cgraphics53
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views1 page

FDS Question Bank Theory Unit-II

The document is a question bank focused on linear data structures using sequential organization, covering topics such as array storage methods, polynomial representation, and operations on arrays. It includes questions on algorithms for polynomial multiplication, sparse matrices, and address calculation for multi-dimensional arrays. Additionally, it addresses the advantages and drawbacks of arrays, providing a comprehensive overview of fundamental concepts in data structures.

Uploaded by

cgraphics53
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Fundamentals of Data Structure

Unit-II
Linear Data Structure Using Sequential Organization
Question Bank Theory
Q1. What is row major and column major storage representation methods of an array? [6]
Q2. Explain the steps of fast transpose algorithm for getting the transpose of sparse matrix
having maximum ‘m’ rows and ‘n’ columns. What is the time complexity and space
complexity of it? What are the advantages of fast transpose over simple transpose? [6]
Q3. Write a ‘C’ function to implement polynomial multiplication using array. [6]
Q4. Represent the following polynomial using array. Write Pseudo code for the same.
23x^9+18x^7+41X^6+16X^4+3 [6]
Q5. Show how a two-dimensional array is stored in memory. Assume that array start at the
address 4000 [4
Q6. Explain how a polynomial is represented using array with one example. [4]
Q7. Write a ‘C’ function to implement polynomial multiplication using array. [7]
Q8. What is an array? What are its different types? Explain with example. Are there any
drawbacks of an array? If so, explain. [6]
Q9. Write a program for insertion of an element in an array and deletion of an element from
an array. [6]
Q10.Derive the address calculation formula for two dimensional array in columnmajor
representation and calculate the address of an element X[2] [3] in anarray of integers X[5] [4]
using the same. [6]

Q11. How do you represent a polynomial using an array ? Write an algorithm to add two
polynomials.[6]

Q12. What is a sparse matrix ? Write a pseudo ‘C’ code for finding the simple transpose of a
sparse matrix and analyze the time complexity. [6]

Q13. Write an ADT for polynomial. Write pseudocode for 2-polynomialaddition using
arrays. Find out time complexity of it. [6]

Q14. Derive the formula to calculate the address of the elementin one-dimensional and two-
dimensional array using row major representation.

Q15. Write an ADT for sparse matrix.[4]

You might also like