[go: up one dir, main page]
Scribd
Upload
11 views2 pages

GTU IMP Question Index

Uploaded by

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

GTU IMP Question Index

Uploaded by

sankalppatel721
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

V.P.M.P.

POLYTECHNIC
DEPARTMENT OF COMPUTER ENGINEERING

INDEX
SUBJECT NAME: DSA SEMESTER: III
SUBJECT CODE: 4330704 TERM: ODD
STUDENT NAME: ______________________________ CLASS: _________
ENROLLMENT NO.: _________________ BATCH: ________
Sr. Sign of
No.
Date List of Questions Faculty
Chapter-1
1 What is Data Structure? Give the classification of Data
Structure.
2 Define Algorithm. List features of an algorithm.

3 Define Time complexity, Space complexity and Big-Oh


notation.
4 Explain Row major array.
5 Explain linear search method of an array.

6 Explain Binary search method of an array with suitable


example. Write down Binary search algorithm.

Chapter -2

7 Define String. & list out string Operation

8 Develop an algorithm to find length of string.


9 Explain string Copy operation with algorithm
10 Explain string Reverse operation with algorithm

Chapter-3
11 Define Stack. & Explain Push & Pop Operation of Stack.
Define Queue. Differentiate between Simple Queue and
12 Circular Queue.

13 Write an algorithm of Insert & Delete Operation of Queue.

14 Write a short note on Circular Queue.

15 Differentiate between stack and queue.


Chapter -4
16 Define pointer and linked list. List out different types of linked
lists.
17 Explain operation for inserting a node at beginning and at the
end of the singly linked list.
18 Difference between circular linked list and singly linked list.

19 Explain doubly linked list.

Chapter -5
20 Generate a binary search tree for the following data:
34(root node),43,56,22,31,10,8
21 Explain Tree traversal operation with algorithm.
Chapter -6
22 Explain Selection sort in detail.
23 Explain Bubble sort in detail
24 Write an algorithm for Merge sort
25 Define Hashing. List various hashing techniques.

You might also like