Scribd
Upload
2 views3 pages

DSA Assignment for SE ECS Students

The document is an assignment for the DSA course at Rizvi College of Engineering, covering various topics in data structures and algorithms. It includes questions on graph representations, binary trees, linked lists, hash functions, graph traversal techniques, and minimum spanning trees. Students are required to provide implementations and explanations for each topic, including coding tasks in C.

Uploaded by

divyanshpal595
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
2 views3 pages

DSA Assignment for SE ECS Students

The document is an assignment for the DSA course at Rizvi College of Engineering, covering various topics in data structures and algorithms. It includes questions on graph representations, binary trees, linked lists, hash functions, graph traversal techniques, and minimum spanning trees. Students are required to provide implementations and explanations for each topic, including coding tasks in C.

Uploaded by

divyanshpal595
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

Rizvi College of Engineering

Rizvi Educational Complex, Off Carter Road, Bandra West, Mumbai,


Maharashtra 400050
Subject: DSA Assignment:02

Branch: ECS Class: SE ECS

Q1)
a) Find adjacency matrix A and adjacency list for the following graph.

b) Write down the expression that is represented by following binary


tree?

c) Explain in short: Depth first Search

Q2) Explain the properties of binary search tree create a binary search
tree using the following data elements.
45,28,34,63,87,76,31,11,50,17
Q3) Write a C program to implement a singly linked list. The program
should be able to perform the following operations:
i) Insert a node in the end
ii) Delete the last node
iii) Display the node.
Q4) Explain possible operations on doubly linked list and write an
algorithm to the display list?

Q5) What is harshing? explain hash collision with an example?


Q6) Write a function in C for DFS traversal of graph?
Explain DFS graph traversal with suitable example?
Q7) Explain different graph traversal techniques.

Q8) Given the inorder and postorder traversal of a binary tree.


construct the original tree:
In-order Traversal:
DBHEIAFJCJ
Post order Traversal:
DHIEBJFGCA

Q9) Define a minimum spanning tree.


Construct minimum spanning tree shown in figure 1 using Kruskal's and
prim's algorithm and find out the cost with all the intermediate steps.
ALL THE BEST

You might also like