Solve any one question from Q.1(a,b,c,d) &Q.2(a,b,c)

1(a)
What is the use of void data type?

2 M

1(b)
What is Macro? Compare it with function.

4 M

1(c)
Explain the use of pointer to array of structure with suitable example.

2 M

1(d)
Explain any four functions used for file handling.

4 M

2(a)
Explain different storage classes in C.

4 M

2(b)
What is pointer? Explai pointer to a function with suitable example.

5 M

2(c)
Differentiate between binary and text file.

3 M

Solve any one question from Q.3(a,b,c) &Q.4(a,b,c)

3(a)
Explain static and dynamic data structures with suitable examples.

3 M

3(b)
What is space complexity of an algortihm? Explain its importance with example.

3 M

3(c)
Explain the following terms: i) Internal sorting

ii) External sorting

iii) Sort stability.

ii) External sorting

iii) Sort stability.

6 M

4(a)
Explain linear data structures with suitable example.

3 M

4(b)
What are different asymptotic notations?

3 M

4(c)
Write pseudo C code for insertion sort. Show all the passes to sort the values in ascending order using insertion sort, values are : 5, 15, 3, 7, 2.

6 M

Solve any one question from Q.5(a,b,c) &Q.6(a,b)

5(a)
Write a pseudo C algorithm for simple transpose of sparse matrix. What is it time complexity?

5 M

5(b)
Explain row and column major storage representation of two dimensional array.

6 M

5(c)
Explain stack as Abrstract Data Type (ADT).

2 M

6(a)
Explain sequential memory organization using suitable data structure.

6 M

6(b)
Write an algorithm to add two sorted polynomial in a single variable. Analyze its time complexity.

7 M

Solve any one question from Q.7(a,b,c) &Q.8(a,b,c)

7(a)
What is generalized linked list? Give graphical representation of the generalized list:

A = ( 1, 2, (3, (4, 5)),6)

A = ( 1, 2, (3, (4, 5)),6)

4 M

7(b)
Compare linear and circular linked list.

3 M

7(c)
Write pseudo C code to delete a node from doubly linked list (DLL).

6 M

8(a)
Compare array and linked list.

3 M

8(b)
Write pseudo C code to insert a node at start and end of singly linked list (SLL).

6 M

8(c)
Give practical applications of circular linked list.

4 M

More question papers from Fundamentals of Data Structures