1/2
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
DIPLOMA ENGINEERING SEMESTER -III• EXAMINATION SUMMER 2017
Subject Code: 330701 Date: 11-05-2017
Subject Name: Data Structure Management
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 programmable Communication aids are strictly prohibited.
5. Use of only simple calculator is permitted in Mathematics.
6. English version is authentic.
Q.1

What is Data Structure? Explain Primitives non Primitive Data Structure with Example.
07



07

List out operations performs on an array. Write a C program for inserting and deleting elements in array.


Array Array

Q.2

What is Stack? Explain Applications of Stack.
07


Stack Stack
07

What is a simple queue? What are its disadvantages Write an algorithm to delete an element.


Simple queue Queue

OR

Convert the expression into postfix notation using stack.
07


Q.3

Describe an algorithm to DELETE a last node in doubly linked list.
07


Doubly linked list
07

Write an algorithm to DELETE a node in singly linked list.


Singly linked list

OR
Q.3

What is recursion Explain with example.
07


Recursion
07

List different application of linked list. Explain two with example.


Linked list

2/2
Q.4

Write algorithm of Bubble sort.
07


Bubble sort
07

Give trace of algorithm for radix sort.
25,45,36,67,78,99,101,19,75,50



25,45,36,67,78,99,101,19,75,50

OR
Q.4

Briefly explain Quick Sort algorithm.
07


Quick Sort
07

Give trace of algorithm for quick sort.
16,10,18,22,26,12,34,04,67,29


quick sort
16,10,18,22,26,12,34,04,67,29

Q.5

What is binary tree Explain Operation on binary tree.
07


Binary tree Binary tree
07

Compare Linked list with Sequential list.


Linked list Sequential list

OR
Q.5

Write an algorithm for finding substring into main string.
07



07

List Various hashing functions. Explain any two.


Hashing functions