Scribd
Upload
7 views2 pages

Data Structures Exam Questions Guide

The document outlines important questions for a module on Data Structures and Applications at Tontadarya College of Engineering. It covers topics such as data structures, pointer variables, arrays, structures, unions, dynamic memory allocation, polynomials, strings, stacks, and algorithms for expression evaluation and conversion. Specific questions are provided for students to focus on for their assignments.

Uploaded by

misbahulfalak007maniyar
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
7 views2 pages

Data Structures Exam Questions Guide

The document outlines important questions for a module on Data Structures and Applications at Tontadarya College of Engineering. It covers topics such as data structures, pointer variables, arrays, structures, unions, dynamic memory allocation, polynomials, strings, stacks, and algorithms for expression evaluation and conversion. Specific questions are provided for students to focus on for their assignments.

Uploaded by

misbahulfalak007maniyar
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

STSKK’s

TONTADARYA COLLEGE OF ENGINEERING


Mundaragi Road, GADAG-582101.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

MODULE – I

IMPORTANT QUESTIONS

1) What is data structure? Explain the classification of data structures and


operations that are performed on data structures.
2) What are pointer variables? How to declare pointer variable? Explain.
3) Write ADT array. Explain with figure the following operations on array.
a) Create b) Insert c) Delete d) Display
4) Define structure. Explain various ways of structure declarations.
5) What is union? Write the differences between structure and union.
6) Briefly explain self referential structures with an example.
7) Explain various dynamic memory allocation functions .
8) What is polynomial? Write ADT for the polynomial.
9) Write a C function to add two polynomials using array representation and
explain with an example.
10) For the given sparse matrix A, write the triplet representation for the matrix
and its transpose.

1 0 0 2 0 15
0
A= 11 3 0 0 0
0
0 0 6 0 0
0
0 0 0 0 0
9
1 0 0 0 0 0
0
0 28 0 0 0
11) Define string. Explain with example, various ways of storing strings.
12) Explain with an example for each, the various operations that can be
performed on strings.
13) Explain the KNP pattern matching algorithms with an example.
14) Define stack. Explain various operations on stack with code and
diagrammatic representation.
15) Explain ADT stack
16) Explain how stacks can be implemented using dynamic arrays.
17) Write an algorithm for evaluation of a postfix expression.

Data Structures and Applications (BCS304)


STSKK’s
TONTADARYA COLLEGE OF ENGINEERING
Mundaragi Road, GADAG-582101.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
18) Write an algorithm for conversion of infix to postfix expression.
19) Convert all the above Infix expressions to their postfix form.
a) ( a * b ) + c / d b) ( ( a + ( b – c ) * d ) ^ e + f )
c) ( ( ( a / b ) – c ) + ( d * e ) ) – ( a * c ) d) ( a + b ) * d + e / ( f + a * d ) + c
e) ( ( a / ( b – c + d ) ) * ( e – a ) * c ) f) a / b – c + d * e – a * c
20) Using tabular form evaluate all the above expressions (Q. No: 17) in their
postfix forms after converting them to postfix notation. Assume values of
operands as follows. a = 1 , b = 2 , c = 3, d = 4 , e = 5 , f = 6.

***Write below mentioned question no. in your assignment booklet from


module I ***
1, 6 ,14, 17, 18, 19

Data Structures and Applications (BCS304)

You might also like