Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
11 views1 page

Fds Assignment 2

The document outlines an assignment on various topics related to data structures, specifically focusing on array representations, sparse matrices, polynomial representation, and matrix transposition. It includes questions on row major and column major representations, algorithms for sparse matrix addition, and polynomial operations. Additionally, it discusses the differences between simple and fast transposes of sparse matrices, along with providing pseudo code for polynomial multiplication.

Uploaded by

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

Fds Assignment 2

The document outlines an assignment on various topics related to data structures, specifically focusing on array representations, sparse matrices, polynomial representation, and matrix transposition. It includes questions on row major and column major representations, algorithms for sparse matrix addition, and polynomial operations. Additionally, it discusses the differences between simple and fast transposes of sparse matrices, along with providing pseudo code for polynomial multiplication.

Uploaded by

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

Subject-FDS

Unit- II
Assignment no-2
1. What is Row Major and Column Major Representation? Explain with example. Write the
formula to find any element A[i][j] in row major and column major representations of A.
2. What is meant by sparse Matrix? Write an algorithm to perform addition of two sparse
matrices.
3. Explain with example how single variable polynomial can be represented using 1-D array?
What is advantage and disadvantage of this representation?
4. What is the difference between simple and fast transpose of sparse matrix? Write an
algorithm to find simple transpose of sparse matrix.
5. Write an algorithm to find addition of two single variable polynomials using array.
Polynomial term consists of coefficient and exponent and both are stored as an element in
array. Assume terms are arranged in descending order of exponent. State time complexity
of the same.
6. Draw and explain following terms : -2-D Array, 3-D Array
7. Explain polynomial representation using arrays with suitable example
8. Explain fast Transpose of sparse matrix with suitable example, Discuss time complexity of
fast transpose.
9. Write pseudo Python code to perform polynomial multiplication using array
10.Explain two-dimensional arrays with row and column major implementation. Explain
address calculation in both cases with example

You might also like