0
1.4kviews
Data Structures and Algorithms Question Paper - Jun 17 - Computer Engineering (Semester 3) - Pune University (PU)
1 Answer
0
38views

Data Structures and Algorithms - Jun 17

Computer Engineering (Semester 3)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.

1.a. Show that f(X)= 0 (X³) if function f(X) is defined as f(X) = 5x² + 6x² + 1
(3 marks) 00

1.b. differentiate between linear and non linear data structure with example.
(3 marks) 00

1.c. Explain divide and conquer strategy with example. Also comment on the time analysis.
(6 marks) 00

Or

2.a. Explain fast Transpose of sparse matrix with suitable example. Discuss time complexity of fast Transpose.
(6 marks) 00

2.b. Explain polynomial representation using array with suitable example.
(3 marks) 00

2.c./b> Derive recurrence relation to represent set of natural numbers giving remainder one when digvided by three.
(3 marks) 00

3.a. Represent the following polynomial by using-generalized linked list : (a, b (c, d ( e, g,), h) (f))
(3 marks) 00

3.b. Write an algorithm for postfix evaluation with suitable example.
(6 marks) 00

3.c. Write a pseudo C code to reserve singly linked list.
(3 marks) 00

Or

4.a. Convert the following prefix expression into postfix * + a _ bc / _ de + _ fgh.
(3 marks) 00

4.b. Write an algorithm to convert infix expression to postfix expression.
(6 marks) 00

4.c. Write an algorithm to delete intermediate node from Doubly Linked List.
(3 marks) 00

5.a. What is circular queue? Explain the advantages of circular queue over linear queue.
(6 marks) 00

5.b. Write pseudo C/C++ code to represent queue as an ADT.
(7 marks) 00

Or

6.a. Explain array implementation of priority queue with all basic operations.
(6 marks) 00

6.b.Write pseudo C/C++ code to implement circular queue using linked list.
(7 marks) 00

7.a. Explain quick sort and sort the given list using quick sort : 39, 09, 81, 45, 90, 27, 72, 18.
(6 marks) 00

7.b. Write an algorithm for binary search. Derive recurrence relation and find out time complexity of the search.
(7 marks) 00

Or

8.a. Explain heap sort and sort the given list using heap sort : 08, 03, 02, 11, 05, 14, 00, 02, 09, 04, 20.
(6 marks) 00

8.b. Write a short note an stability of sorting compare bubble sort, insertion sort and selection sort with one example and discuss time complexity.
(7 marks) 00

Please log in to add an answer.