[go: up one dir, main page]

0% found this document useful (0 votes)
500 views3 pages

Data Structure Using C++ For II B.SC

important questions

Uploaded by

sairammtdc
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
0% found this document useful (0 votes)
500 views3 pages

Data Structure Using C++ For II B.SC

important questions

Uploaded by

sairammtdc
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/ 3

MOTHER TERESSA DEGREE COLLEGE BHADRACHALAM

Dept.of Computers Data Structure using C++

UNIT I
1.What is Data Structure? Explain types of Data Structure?

2.Explain Algorithm?

3.Define Stack Explain Operations on Stack using Array? And Applications of


Stack?

//

4.Expressin Evaluations and conversion [ prefix, infix, postfix examples].

5.Reversing a String with a stack?

6.Write a short note on Recursion?

7.Polish notation & expression conversion.

UNIT II
1.Defference between Iteration and Recursion?

2.Define Queue explain operations on Queue using Array?

3.Explain Circular Queue with Example?

4.Applications of Queue?

5.Wrtie a short notes on Double ended Queue[Dequeue].

6.Explain Priority Queue?

//
7.What is Linked list? Explain types of linked list.

8.Explain single linked list operations with example?

9.Explain double linked with example.

10.Explain Circular linked list.

11.stack using linked list.

12.Queue using linked list.

UNIT III
1.Defien Binary Tree? Types of Tress?

2.Representation of Binary Tree?

3.Binary tree traversals and construction with example.

4.Construct the binary tree using the following two traversals.

In order : DBHEAIFJCG

Pre order : ABDEHCFIG

5.Applications of Binary tree.

//

6.Define searching explain linear search with example program.

7.Explain Binary search and define Sorting

8.Explain selection sort Bubble sort, insertion sort, Merge sort, quick sort.

9.Rearrange following number using Quick sort.

10,6,3,7,17,26,56,32,72.

10.Optimal binary search tree.


UNIT IV:
1.Define a Graph & its types.

2.Representation of Graph.

3.Graph Traversal Depth First Search.

4.Graph Traversal Breadth First Search.

5.Spanning tree and minimum spanning tree.

6.Kruskals’s algorithm.

//

7.Hash Definitions & Hash factions.

8.Hash table over flow

9.Implementation of Heap.

10.Sort & Application of heap.

You might also like