Scribd
Upload
9 views1 page

Data Structures and Algorithm Jun 2023

This document outlines the examination details for the PGDDS Semester I course at Gujarat Technological University, specifically for the subject 'Data Structures and Algorithm' scheduled on June 22, 2023. It includes instructions for the exam, a breakdown of questions covering various topics such as time complexity, data structures, algorithms, and sorting techniques. The exam consists of multiple questions requiring definitions, explanations, and programming tasks related to data structures and algorithms.

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
9 views1 page

Data Structures and Algorithm Jun 2023

This document outlines the examination details for the PGDDS Semester I course at Gujarat Technological University, specifically for the subject 'Data Structures and Algorithm' scheduled on June 22, 2023. It includes instructions for the exam, a breakdown of questions covering various topics such as time complexity, data structures, algorithms, and sorting techniques. The exam consists of multiple questions requiring definitions, explanations, and programming tasks related to data structures and algorithms.

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/ 1

Seat No.: ________ Enrolment No.

______________
GUJARAT TECHNOLOGICAL UNIVERSITY
PGDDS– SEMESTER - I EXAMINATION- SUMMER-2023
Subject Code: 1618001 Date: 22/06/2023
Subject Name: Data Structures and Algorithm
Time: 02:30 PM TO 05: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.

Q.1 (a) Define Time complexity and space complexity with example. 03
(b) Define below terms: 04
1) Primitive data types 3) Linear Data Structure
2) Non-primitive data types 4) Non-linear Data Structure
(c) What is Data Structure? Explain Non-linear data structure with examples. Also, write 07
advantages and disadvantages of each of them.
Q.2 (a) Define below terms. 03
1) Infix expression
2) Postfix expression
3) Prefix expression
(b) Explain circular queue with example. 04
(c) Write a program to implement one dimensional array with its operations. 07
OR
(c) Write a program to implement two dimensional array with its operations. 07

Q.3 (a) Explain the properties of tree data structure. 03


(b) Differentiate between tree and graph. 04
(c) Write an algorithm to find a shortest path in a graph and explain it with suitable example. 07
OR
Q.3 (a) Define Depth first search (DFS) and explain it with suitable example. 03
(b) What are the types of graph? Define each type with eaxmple. 04
(c) Write an algorithm for a Matrix chain multiplication. 07
Q.4 (a) Write down the applications of binary search trees. 03
(b) Explain quick sort algorithm with suitable example. 04
(c) Explain binary search with suitable example. 07
OR
Q.4 (a) Explain merge sort algorithm with example. 03
(b) Differentiate between divide & conquer method and greedy technique. 04
(c) Explain Floyd Warshall’s Algorithm with suitable example. 07

Q.5 (a) What is the job scheduling problem? Explain it with suitable example. 03
(b) Explain the types of rotation techniques in AVL tree with suitable example. 04
(c) Write an algorithm for selection sort. 07
OR
Q.5 (a) Write down the steps to perform bubble sort. 03
(b) What is a knapsack problem? Explain how you can solve it using dynamic programming. 04
(c) Write a short note on Huffman code using the greedy approach with suitable example. 07

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

Page 1 of 1

You might also like