Scribd
Upload
8 views1 page

DSA - Assignment - 3

Uploaded by

Gunjan Pawar
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
8 views1 page

DSA - Assignment - 3

Uploaded by

Gunjan Pawar
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

ASSIGNMENT – 3

CLASS: - SY BCA (Applicable to All Divisions)


Subject: - Data Structure & Algorithms (Practical in C)
Unit -3:- Queue & Graph

1. What is a queue in data structures? Explain types of queues.


2. Explain difference between stack and queue.
3. Explain enqueue operation algorithm in linear queue.
4. Write an algorithm to perform insert and delete operation in circular queue.
5. Explain advantages of circular queue over Simple queue.
6. What is a graph? Explain various representations of graphs.
7. Define: 1. Connected graph 2. Outgoing Edge 3. Degree of node 4. Weighted Graph 5.
Sub Graph
8. Define adjacency matrix. Explain Adjacency matrix for a directed graph with example.
9. Explain algorithm of Breadth First Search (BFS) traversal for a Graph with suitable
example.
10. Consider the graph G given below and apply depth-first search algorithm.

NOTE: - Submit your assignment (after mid sem) during your DATA STRUCTURE LAB
SESSION only.

You might also like