Question Bank Data Structure with C Application 17CS33 Module-1 and Module-2
Question bank for First IAT
Name of the faculty:Guru prasad
Sem:5 Subject:Data Structure with Application Subject code:17CS33
Sl.No.
|
Question Module-1
| ||||||||||||||||||||
1
|
Identify,classify and categories different data structure.
| ||||||||||||||||||||
2
|
List out and determine different data structure operation
| ||||||||||||||||||||
3
|
Identify role of structure and its syntax.Determine the ways of structure declaration by interpreting with examples
| ||||||||||||||||||||
4
|
Formulate the importance of union with syntax declaration with example.
| ||||||||||||||||||||
5
|
Distinguish between structure and union with example.
| ||||||||||||||||||||
6
|
Identify the way sparse matrix is represented and provide c function to read the sparse matrix in triple. Represent the following sparse matrix using triples in a single dimension array
| ||||||||||||||||||||
7
|
Identify the way sparse matrix is represented and provide c function to read the sparse matrix in triple. Represent the following sparse matrix using triples in a single dimension array. Also provide transpose of matrix
| ||||||||||||||||||||
8
|
Is triangular matrix a sparse matrix. Determine the way to represent triangular matrix using 2-dimensional array and 1-dimensional array.
| ||||||||||||||||||||
9
|
Is tridiagonal matrix a sparse matrix. Determine the way to represent triangular matrix using 2-dimensional array and 1-dimensional array.
| ||||||||||||||||||||
10
|
Develop knuth prior matching algorithm and analyse how to apply the same to search abcdabcy in the text “abcxabcdabxabcdabcdabcy”.
| ||||||||||||||||||||
11
|
Create a c function to 1) to search for term of poly 1 in poly 2 2)to add polynomial 3)to copy a polynomial 4)to read a polynomial 5)to read and display polynomial
| ||||||||||||||||||||
12
|
Consider two polynomial
A(x)=4X15 + 3X4 +5
B(x)=X4 + 10X2 +1 .Show how these polynomial are stored in 1-D. Represent using c function.
| ||||||||||||||||||||
13.
|
Design and develop a c function for bubble sort algorithm
| ||||||||||||||||||||
14
|
Design and develop a c function for binary search and linear search.
| ||||||||||||||||||||
15.
|
Assess how array are represented . List and identify the role of different array function
| ||||||||||||||||||||
16
|
Design and Develop a psuedocode for array operations.
A) Insert an element at any position of array
B) Delete an element from any position of array
C)sorting an element in an array
D)merge
E)Traverse and display
| ||||||||||||||||||||
17
|
Determine the different ways of storing a string. Analyse which is the best method of storing a string .
| ||||||||||||||||||||
18
|
Formulate the role of Dynamic memory allocation.
| ||||||||||||||||||||
19
|
Distinguish between malloc and calloc.
| ||||||||||||||||||||
20
|
Show on a simple example the concept of malloc,calloc ,realloc and free functions.
| ||||||||||||||||||||
Module 2:
| |||||||||||||||||||||
1
|
Analyse with neat diagram by taking example sequence of Push and Pop operation taking into consideration overflow and underflow conditions.
| ||||||||||||||||||||
2
|
Design a psuedocode for Push,Pop operation and display operations with/without parameters.
| ||||||||||||||||||||
3
|
Develop a program to implement a stack operation using Dynamic Array
| ||||||||||||||||||||
4.
|
Identify different representation of Expressions
| ||||||||||||||||||||
5
|
Convert infix to postfix expression for given task below
1. A*(B+C)
2. A-B/(C*D$E)
3. A-B(C*D^fF
4. A*(B+C)*D
5. (A+B)*D+E/(F+A*D)+C
6. ((A/(B-C+D))*(E-A)*C)
7. A/B-C+D*E-A*C
| ||||||||||||||||||||
6
|
Convert infix to postfix as given in 5. Evalute the postfix expression by considering A=3,B= 2,C=1,D=3 E=4 ,F=1
| ||||||||||||||||||||
7
|
Design a c function to convert infix to postfix expression
| ||||||||||||||||||||
8
|
Design a c function to evaluate a postfix expression.
| ||||||||||||||||||||
9
|
Identify the role of recursive. Design a pseudocode for factorial of a given number, GCD ,fibonacci and tower of Hanoi
| ||||||||||||||||||||
10
|
Solve A(2,1) using Ackerman’s Function. Design a c function for Ackerman’s function
| ||||||||||||||||||||
11
|
Identify the working principle of QUEUE Data Structure.
|
Module 1: Question Bank
Data Structure with Application (17CS33)
Q1. What is Data Structure. Explain classification/types of Data Structure.
Q2.List and Explain various data structure operations.
Q3. Define Entities, attribute, entity set, field record ,file.
Q4.What is structure. How they are declared?Explain different way of structure declaration with examples.
Q5.What is union. Explain the concept of union with example.
Q6. List out differences between structures and union.
Q7. Explain the concept of Self Referential Structures with example.
Q8. Define sparse matrices . How sparse matrix are represented and provide c function to read the sparse matrix in triple. Represent the following sparse matrix using triples in a single dimension array
10
|
0
|
0
|
40
|
11
|
0
|
22
|
0
|
0
|
0
|
0
|
0
|
20
|
0
|
0
|
50
|
0
|
15
|
0
|
25
|
Q9.Define transpose of a matrix. Write a C function and how do you represent following sparse matrix in a single dimension array. Also show the transpose of same.
10
|
0
|
0
|
40
|
11
|
0
|
22
|
0
|
0
|
0
|
0
|
0
|
20
|
0
|
0
|
50
|
0
|
15
|
0
|
25
|
Q10. What is triangular matrix. Is it sparse matrix?. How do you represent triangular matrix using 2-dimensional array and 1-dimensional array.
Q11. What is tridiagonal matrix. Is it sparse matrix?. How do you represent tridiagonal matrix using 2-dimensional array and 1-dimensional array.
Q12. Write the knuth prior matching algorithm and apply the same to search abcdabcy in the text “abcxabcdabxabcdabcdabcy”.
Q13. What is polynomial . Write a c function to 1) to search for term of poly 1 in poly 2 2)to add polynomial 3)to copy a polynomial 4)to read a polynomial 5)to read and display polynomial
Q15. Consider two polynomial
A(x)=4X15 + 3X4 +5
B(x)=X4 + 10X2 +1 .Show how these polynomial are stored in 1-D. Represent using c function.
Q16.Define array. How arrays are represented. List and explain various function of array
Q17.Write a short note on array operations.
A) Insert an element at any position of array
B) Delete an element from any position of array
C)sorting an element in an array
D)merge
E)Traverse and display
Q18. Design and develop a c function for bubble sort algorithm
Q19. Design and develop a c function for binary search and linear search.
Q20. What is string. What are different ways of Storing a String.
Q21.Explain various String operation function with pseudocode.
Q22.Explain Various String handling function and purpose
Q23.What is Dynamic Memory Function
I)Explain the concept of malloc and calloc with examples.
Ii)Explain the concept of realloc and free with examples.
Iii)List out difference between malloc and calloc .
