0% found this document useful (0 votes)
4 views

DSA(UCS2009) Assignment 1

The document outlines an assignment for a Data Structure and Algorithm course, detailing various tasks such as defining data structures, discussing abstract data types, and writing C programs for array and linked list operations. It also includes problems related to linear arrays, sparse matrices, and expression conversions between infix, postfix, and prefix forms. The assignment aims to enhance understanding of fundamental concepts in data structures and algorithms.

Uploaded by

amxittt
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

DSA(UCS2009) Assignment 1

The document outlines an assignment for a Data Structure and Algorithm course, detailing various tasks such as defining data structures, discussing abstract data types, and writing C programs for array and linked list operations. It also includes problems related to linear arrays, sparse matrices, and expression conversions between infix, postfix, and prefix forms. The assignment aims to enhance understanding of fundamental concepts in data structures and algorithms.

Uploaded by

amxittt
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structure and Algorithm (UCS2004)

B. Tech -2nd Semester


Assignment -1
1. Define data structure and also describe the difference between primitive and non primitive

data structure.

2. Discuss the importances of abstract data type (ADT) in programming?

3. Write a C program for insertion of an element in an Array?

4. Consider the linear arrays AAA[5:50],BBB[-5:10] and CCC[1:8]

5. Find the number of elements in each array?

6. Suppose base (AAA) =300 and w=4 words per memory cell for AAA. Find the address of

AAA[15],AAA[35] and AAA[55].

7. What is sparse matrix? Explain. Write the applications of sparse matrix?

8. Demonstrate and convert the infix expression (((A+B)*(C-D))/E)-(F*(G+H)/I+J*K) to

postfix expression using stack.

9. Write a C program to implement insertion of element at beginning, end and specific node

in linked list.

10. Write algorithm to convert a postfix expression into an infix expression. Consider the

following arithmetic expression in postfix notation:

752+* 4 1 5- /-

11. (i) Find the value of the expression.

12. (ii) Find the equivalent prefix form of the above expression.

You might also like