Scribd
Upload
3 views2 pages

Data Structures and Algorithm Dec 2023

This document outlines the examination details for the Data Structures and Algorithm course at Gujarat Technological University for Winter 2023. It includes instructions for the exam, a breakdown of questions covering various topics such as data structures, algorithm performance, and sorting methods, along with their respective marks. The exam is scheduled for December 1, 2023, from 10:30 AM to 1:00 PM, with a total of 70 marks available.

Uploaded by

dhruv13542virtual
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Data Structures and Algorithm Dec 2023

This document outlines the examination details for the Data Structures and Algorithm course at Gujarat Technological University for Winter 2023. It includes instructions for the exam, a breakdown of questions covering various topics such as data structures, algorithm performance, and sorting methods, along with their respective marks. The exam is scheduled for December 1, 2023, from 10:30 AM to 1:00 PM, with a total of 70 marks available.

Uploaded by

dhruv13542virtual
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Seat No.: ________ Enrolment No.

______________

GUJARAT TECHNOLOGICAL UNIVERSITY


PGDDS– SEMESTER I- EXAMINATION –WINTER-2023

Subject Code:1618001 Date: 01/12/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) Define primitive data structures with the help of suitable 03
example.
(b) How performance of an algorithm can be measured using 04
asymptotic notation, explain.
(c) Write a pseudo code to perform multiplication operation on a 2- 07
D array matrix.
Q.2 (a) Define non-primitive data structures with the help of suitable 03
example.
(b) Explain all possible set of operations performed on a circular 04
linked with the help of suitable example.
(c) Implement singly linked list for insertion and deletion of nodes 07
at beginning and end.
OR
(c) Implement doubly linked list for insertion and deletion of nodes 07
at middle.
Q.3 (a) Compute the address location of a multi-dimensional array 03
element in row major implementation, with suitable example.
(b) Implement a circular queue using a linked list along with all 04
possible set of operations.
(c) Write a pseudo-code for prefix to postfix conversion considering 07
suitable data structures.
OR
Q.3 (a) Compute the address location of a multi-dimensional array 03
element in column major implementation, with suitable
example.
(b) Implement a double ended queue using linked list with suitable 04
example.
(c) Write a pseudo code to find the inverse of a 2-D matrix. 07
Q.4 (a) Explain degree, level, depth in context of a Tree. 03
(b) Write short note on: 04
(i) Linear search
(ii) Binary search
(c) Explain the adjacency matrix representation for the graphs with 07
the help of a suitable diagram.
OR
Q.4 (a) Explain degree, weight and order in context of a Graph. 03
(b) Write short note on: 04

1
(i) Breadth First search
(ii) Depth First search

(c) Explain the adjacency list representation for the graphs with the 07
help of a suitable diagram.
Q.5 (a) Explain the basic principal of Stack and its representation in 03
memory.
(b) Write short note on: 04
• Bubble Sort
• Quick Sort
(c) Implement dynamic programing for 2-D matrix chain 07
multiplication to obtain minimum number of multiplications for
a possible set of matrices.
OR
Q.5 (a) Explain the basic principal of Queue and its representation in 03
memory.
(b) Write short note on: 04
• Selection Sort
• Merge Sort
(c) Implement greedy algorithm to find the optimal solution for a 07
job scheduling problem with the help of suitable example.

*************

You might also like