Scribd
Upload
7 views2 pages

Data Structures and Algorithm 2024

This document is an examination paper for the PGDDS semester I course at Gujarat Technological University, focusing on Data Structures and Algorithms. It includes various questions on topics such as stacks, queues, binary trees, sorting algorithms, and graph theory, with a total of 70 marks. Students are instructed to attempt all questions and make suitable assumptions where necessary.

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
7 views2 pages

Data Structures and Algorithm 2024

This document is an examination paper for the PGDDS semester I course at Gujarat Technological University, focusing on Data Structures and Algorithms. It includes various questions on topics such as stacks, queues, binary trees, sorting algorithms, and graph theory, with a total of 70 marks. Students are instructed to attempt all questions and make suitable assumptions where necessary.

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

Enrolment No. /Seat No.

: ______________

GUJARAT TECHNOLOGICAL UNIVERSITY


PGDDS – SEMESTER I- EXAMINATION –WINTER-2024

Subject Code: 1618001 Date: 17/12/2024


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.

Q.1 (a) Differentiate between Stack and Queue 03


(b) What is Binary Tree? Mention Different types of Binary Tree with 04
Example.
(c) Explain Asymptotic notation in detail. 07

Q.2 (a) Explain advantage of circular queue over single queue. 03


(b) Evaluate the following postfix expression in tabular form: 3 5 * 6 2 04
/+
(c) Consider an example where the size of the queue is four elements. 07
Initially the queue is empty. It is required to insert symbols ‘J’,’K’
and ‘L, delete ‘J’ and ‘K’ and insert ‘M’ and ‘N. Show the trace of
the contents of the queue.
OR
(c) Write an algorithm and User Define ‘C’ function to insert node at a 07
specific location in singly linked list.
Q.3 (a) Explain Tower of Hanoi with example. 03
(b) Write user define ‘C’ function to delete a node from a specific 04
location in doubly linked list
(c) Write a C program for Bubble sort. 07
OR
Q.3 (a) What is static and dynamic memory allocation? Explain in brief. 03
(b) Explain double ended queue and priority queue in detail. 04
(c) Write a C program to implement array using row major and column 07
major order.
Q.4 (a) Explain the following terms in context to tree. 03
1. Sibling
2. Depth
3. Level
(b) Differentiate BFS and DFS. 04
(c) Explain Knapsack Problem and also explain how you can solve 07
using Dynamic Programing
OR
Q.4 (a) Describe the characteristics for greedy algorithm. 03
(b) Illustrate binary tree representation using array and linked list. 04
1
(c) Insertion sequence of name is Jigisha, Pinal, Nancy, Daksh, Ritesh 07
and Chandni.
(i) Construct Binary Search Tree
(ii) Insert Viral. Show BST
(iii) Delete Chandni. Show BST
Q.5 (a) Write a Short note on AVL Tree. 03
(b) Write an algorithm for Merge Sort 04
(c) Show How you can solve Job Scheduling Problem using Greedy 07
Approach
OR
Q.5 (a) Explain the following terms in context to graph. 03
1. Weighted Graph
2. In Degree of Vertex
3. Out Degree of vertex
(b) Write a short note on Binary Search and Sequential Search. 04
(c) Explain Kruskal’s Algorithm with suitable example. 07

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

You might also like