 MORE IN Fundamentals of Data Structures
SPPU Information Technology (Semester 3)
Fundamentals of Data Structures
December 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary

Solve any one question.Q1(a,b,c) Q2(a,b,c)
1(a) Explain entry controlled loop structure in C.
4 M
1(b) What are advantages of using structure? Give difference between Union and Structure.
4 M
1(c) What is pointer varible? Explain declaration, intialization and accessing a pointer variable with an exmaple.
4 M

2(a) Write pseudo C algorithm for reverse of String using pointers.
4 M
2(b) Explain concept of arrays with suitable example.
4 M
2(c) Explain call by value and call by reference functions with suitable examples.
4 M

Solve any one question.Q3(a,b) Q4(a,b)
3(a) Define the following terms with example:
i) Data object
ii) Data structure
iii) Abstract Data Type.
6 M
3(b)(i) Write Pseudo C algorithms for:
i) Linear Search
3 M
3(b)(ii) ii) Binary Search
4 M

4(a) Explain Big-oh,
omega and theta notation with example.
6 M
4(b) Explain selection sort with given example by showing all passes. Also analyze time complexity. Number are:
17,
35,
24,
13,
26,
14.
7 M

Solve any one question.Q5(a,b) Q6(a,b)
5(a) Write a pseudo C algorithm for addition of two sparse matrices. Analyze its time complexity.
6 M
5(b) Explain the two-dimensional array in detail with column and row major representation and address calculation in both the cases.
6 M

6(a) Explain stack and write pseudo C algorithm PUSH and POP operations of stack.
6 M
6(b) Explain polynomial representation of an array and also write data structure declaration with suitable example.
6 M

Solve any one question.Q7(a,b) Q8(a,b)
7(a) Explain concept Generalized Linked List and representation polynomial using GLL with given example:
4x3+2x2+6xy+7xy3.
6 M
7(b) Write C function to insert a node and delete a node in DLL.
7 M

8(a) Explain with suitable example: