and 3 others joined a min ago.
0
470views
Data Structures and Algorithms Question Paper - Dec 18 - Computer Engineering (Semester 3) - Pune University (PU)
1 Answer
0
1views
written 6.9 years ago by
teamques10
★ 70k
|
Data Structures and Algorithms - Dec 18
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. Explain static and dynamic data structures with examples.
(4 marks)
00
1.b. What is recurrence relation ? Explain with example.
(2 marks)
00
1.c. Explain the algorithmic strategy of divide and conquer. Explain
its application in binary search.
(6 marks)
00
Or
2.a. Write pseudo C/C++ code for reversing a string and state its
time complexity.
(4 marks)
00
2.b. Explain the need for fast transpose of sparse matrix. Comment
on its time complexity.
(2 marks)
00
2.c. Explain two-dimensional arrays with row and column major
implementation. Explain address calculation in both cases with
example.
(6 marks)
00
3.a. ) Represent the following using GLL :
(p, q(r, s (u, v), w) (x, y))
(3 marks)
00
3.b. Explain the algorithm for evaluation of a postfix expression
with an example.
(3 marks)
00
3.c. (c) Write pseudo C/C++ code to delete a node from a doubly linked
list.
(6 marks)
00
Or
4.a. What is backtracking ? Explain the use of stack in
backtracking.
(4 marks)
00
4.b. Compare sequential and linked organisation of data.
(2 marks)
00
4.c. Write pseudo C/C++ code to perform addition of two polynomials
using arrays.
(6 marks)
00
5.a. Define the following with example :
(1) Multi-queue
(2) Dequeue
(3) Circular queue.
(6 marks)
00
5.b. Explain circular queue using linked list. Write pseudo C code
for enqueue operation.
(7 marks)
00
Or
6.a. Write pseudo C/C++ code to perform insert and delete operation
on linear queue.
(6 marks)
00
6.b. Explain priority queue. Write ADT for priority queue and state
its applications.
(7 marks)
00
7.a. What is heap ? Explain heap sort with suitable example. State
its complexity.
(6 marks)
00
7.b. Sort the following numbers using quick sort :
25, 82, 17, 23, 38, 7, 64, 86, 21
State its time complexity and space complexity.
(7 marks)
00
Or
8.a. Write pseudo C/C++ code to perform shell sort. State its time
complexity.
(6 marks)
00
8.b. Explain linear search with example. State its time complexity
and compare it with binary search.
(7 marks)
00
ADD COMMENT
EDIT
Please log in to add an answer.