Seat No.: ________ Enrolment No.
______________
GUJARAT TECHNOLOGICAL UNIVERSITY
PGDDS– SEMESTER I- EXAMINATION- WINTER-2022
Subject Code: 1618001 Date: 14/02/2023
Subject Name: Data Structures and Algorithm
Time: 10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make Suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Use of simple calculators and non-programmable scientific calculators are permitted.
MARKS
Q.1 (a) Discuss types of data structures with the help of suitable 03
example.
(b) Compare and contrast array with stack mentioning various 04
advantages and disadvantages.
(c) Explain the Shortest path algorithm with the help of a directed 07
graph.
Q.2 (a) What do you understand by Asymptotic notation? Justify your 03
answer using some important asymptotic notations.
(b) Illustrate the Linked list representation in memory, mentioning 04
its advantages over array.
(c) Explain the concept of Circular linked list with possible set of 07
operations performed using a circular list.
OR
(c) Demonstrate the use of Doubly linked list with available set of 07
operations with the help of suitable example.
Q.3 (a) How to compute the address location of a multi-dimensional 03
array element in row major implementation, explain with
suitable example.
(b) Explain the insert and delete operations on a Circular queue with 04
the help of suitable example.
(c) Write an algorithm\pseudo code to perform matrix 07
multiplication on a 2 D array.
OR
Q.3 (a) How to compute the address location of a multi-dimensional 03
array element in column major implementation, explain with
suitable example.
(b) Illustrate the insert and delete operations on a Double ended 04
queue with the help of suitable example.
(c) Write an algorithm\pseudo code to perform matrix transpose on 07
a 2 D array.
Q.4 (a) Explain the following terms in context to Tree: 03
Degree
Level
Page 1 of 2
Depth or Height
(b) Illustrate the Binary tree representation using array and linked 04
list.
(c) Write short note on following Binary Tree traversal algorithm: 07
In-order
Post-order
OR
Q.4 (a) Explain the following terms in context to Graph: 03
Degree
Weight
Order
(b) Demonstrate the adjacency matrix and adjacency list 04
representation for the graphs with the help of a diagram.
(c) Write short note on following Graphs traversal algorithm: 07
Breadth First Search (BFS)
Depth First Search (DFS)
Q.5 (a) Explain the basic principal of Stack and its representation in 03
memory.
(b) Write short note on the following searching techniques: 04
Sequential Search
Binary Search
(c) How Dynamic programing can be applied to traditional matrix 07
chain multiplication to find minimum number of multiplications
for a possible set of matrices, explain with example.
OR
Q.5 (a) Put some light on priority queue, its use and characteristics in 03
nonlinear data structures.
(b) Write short note on the following sorting techniques: 04
Bubble Sort
Quick Sort
(c) Explain the principal of optimization, and its relevance for the 07
real world applications. Provide Job scheduling problem
optimal solution with the help of Greedy algorithm approach.
*************
Page 2 of 2
