Scribd
Upload
26 views

4th Assignment BCA-202 DS

The document discusses a lecture assignment on data structures. It provides questions on topics like tree definitions, differences between tree and graph, binary search tree properties, tree and graph traversals. It also includes an example problem on converting a general tree to a binary tree and performing graph traversal algorithms.

Uploaded by

royalashish177
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

4th Assignment BCA-202 DS

The document discusses a lecture assignment on data structures. It provides questions on topics like tree definitions, differences between tree and graph, binary search tree properties, tree and graph traversals. It also includes an example problem on converting a general tree to a binary tree and performing graph traversal algorithms.

Uploaded by

royalashish177
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

M.M.

InstituteofComputerTechnology&Business Assignment:04
ManagementM.M.(Deemedtobe University),Mullana
Session:2023-2024(Odd) Class/Semester: BCA –2nd Semester(Section – F & H)
Subject Code:BCA-202 Subject Name: Data Structure
Lecture: 4 Tutorial:0
Max.MarksTheory: 60 Max. Marks Sessional:40 Credits:4.0
Assigned Date: 05.05.2024 Submission Date:20.05.2024 Distribution Date:21.05.2024

Q.No. Questions Marks


(Total Marks - 30)
a) Define Tree. 01
1.
01
2. b) Define Graph.

c) What is BST? 01
3.
01
4. d) Formula to calculate the array size in Binary tree.

e) Difference between Tree and Graph. 01


5.

f) What is Binary Tree? 01


6.
7. Write any four differences between Complete binary tree and full binary tree. 02
8. Write down applications of Tree and Graph data structure. 02
Suppose the numbers 7 , 5 , 1 , 8 , 3 , 6 , 0 , 9 , 4 , 2 are inserted in that order into 04
an initially empty binary search tree. The binary search tree uses the usual
ordering on natural numbers.
9.
What is the in order traversal sequence of the resultant tree?

Write down the steps to Convert a general tree to Binary tree. Explain through an 04
10.
example.
What are the two main way to traverse a Graph? Solve any of them by taking an 06
11.
example.
Why Floyd-Warshall Algorithm is used? Write the algorithm and solve by an 06
12. example.

Assignment Outcome (AO):

i) Learn the terminology related to Tree DS and Graph DS.


ii) Understand the algorithms, types of Tree and graph i.e. Non linear data structure.
iii) Understand the different types of Graph traversal method & Tree traversal methods.

Course Outcome (CO): After completion of this course, student is able to:

1. Ability to analyze algorithms and algorithm correctness.


2. Ability to summarize the non linear data structure.
3. Learn different types of tree traversal techniques.

Bloom’s Taxonomy Level (BTL):


1. Remembering 2. Understanding 3. Applying 4. Analyzing 5.Evaluating 6. Creating

Question wise Mapping Matrix (with AO, CO, BTL) Weightage (in %age)
Q. No. 1 2 3 4 5 6 7 8 9 10 11 12 AO 1:50%, 2:25%, 3.25%
AO No. 1 2 2 1 2 1 2 1 2 2 3 2 CO 1:46%, 2:54%
CO No. 1 1 1 1 2 1 1 1 1 3 4 5 BTL 1:66%, 2:20%, 3:14%
BTL 1 1 1 1 2 2 2 1 1 3 4 5
Marks 1 1 1 1 1 1 2 2 4 4 5 5

You might also like