0% found this document useful (0 votes)
3 views1 page

Module 1 Importent Question

The document outlines various topics related to data structures, including definitions, classifications, and operations such as stack implementation using arrays. It also covers concepts like dynamic memory allocation, sparse matrices, and abstract data types (ADTs). Additionally, it includes algorithms for evaluating postfix expressions and examples of self-referential structures.

Uploaded by

pritykumarishahi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views1 page

Module 1 Importent Question

The document outlines various topics related to data structures, including definitions, classifications, and operations such as stack implementation using arrays. It also covers concepts like dynamic memory allocation, sparse matrices, and abstract data types (ADTs). Additionally, it includes algorithms for evaluating postfix expressions and examples of self-referential structures.

Uploaded by

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

1.

define data structure explain the classification of data structure with a neat
diagram (2)
[Link] a c function to implement pop, push and display operation for stacks using
arrays(2)
3. differentiate structure and unions(2)
[Link] an alogo to evaluate a postfix expression and apply the same for the given
postfix expression 62/3-4 2*+(2)
[Link] the dynamic memory allocation function in detail(2)
[Link] is sparce matrix give the triplet form of a given matrix and find its
transpose
[0 0 3 0 4]
a=[0 0 5 7 0]
[0 0 0 0 0]
[0 2 6 0 0]
[Link] is data structure list and explain data structure operation
[Link] suitable example discuss self referential structure
[Link] ADT stack
[Link] stack implement the operation of stack using arrays
[Link] is sparce matrix give the triplet form of a given matrix and find its
transpose
[10 0 0 40]
a=[11 0 22 0]
[0 0 0 0]
[20 0 0 50]
[0 15 0 25]
12.

You might also like