MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION

SHRI H.H.J.B. POLYTECHNIC COLLEGE

CHANDWAD

TITLE OF MICROPROJECT:

TREE

SUBJECT: DATA STURUTURE USING C.

SUBJECT CODE: 22317

SEMISTER: 3rd.

COURSE: CM

COURSE CODE: 0079

SUBJECT TEACHER: Mr.A.A. Pawar.

YEAR: 2021-2022.
 Maharashtra state board of technical Education
SNJB’S S.H.H.J. B.POLYTECHNIC, CHANDWAD

Year 2021-22

CERTIFICATE

This is to certify that,

Name:
1. KADAM VAISHNAVI LALIT – (2000790331).
2. PATIL PARVANI DATTAREY- (2000790344).

Student of third semester of Diploma in Computer Technology

of institute “S.H.H.J.B. POLYTECHNIC, CHANDWAD” has
completed the Micro project satisfactorily in subject “Data
structure using C”, code-22317 for the academic year 2021-22
has prescribed in the curriculum.

Place: -Chandwad
Date: - 01|01|2022

Subject teacher Head of department Principal

MR.A.A. PAWAR. MS.A.S. CHORDIYA. DR.V.A.WANKHEDE.
 TEACHING AND EVALUATION SHEET

NAME OF STUDENTS: - KADAM VAISHNAVI, PATIL PARVANI.

ENROLLMENT NO: 2000790331, 2000790344. SEAT NO: 203148,203161.

SUBJECT CODE: 22317. NAME OF PROGRAM: Computer Technology.

SUBJECT: Data structure using C

TITLE OF MICROPROJECT: TREE.

COURSE OUTCOME:
a. Perform basic operations on arrays.
b. Apply different searching and sorting techniques.
c. Implement basic operations on stack and queue using array representation.
d. Implement basic operations on Linked List.
e. Implement program to create and traverse tree to solve problems.

EVALUATION AS PER SUGGESTED RUBRIC FOR ASSESSMENT OF

MICROPROJECT

SR.NO NAME OF CONTENT POOR (1-3) AVG (4-5) GOOD (6-8) EXC (9-10)
1. Relevance to the course.
2. Literature survey / information
collection.
3. Project proposal.
4. Completion of the target as per
project proposal.
5. Analysis of data and representation.
6. Quality of prototype / model.
7. Report preparation.
8. Presentation.
9. Defense.

MICROPROJECT EVALUATION SHEET

NAME OF PROJECT PROPOSAL PROJECT PRODUCT VIVA TOTAL

STUDENT (2) METHAODOLO REPORT (2) (4 MARKS) MARKS (10)
GY (2)
KADAM VAISHNAVI

PATIL PARVANI
Name and designation of faculty member: A.A. PAWAR. Signature:
Introduction To Tree:-
 A tree is a non linear data structure used to represent data containing the hi-
erachical relationship between elements.
 Tree is non linear data structure in which node are arranged in a non linear
fashion.
 A tree is a connected graph without any circuits/cycle.
 There are multiple nodes in a tree .
 The nodes are connected with each other with edges.
 The tree starts or originates from a node called root node.

TREE TERMINOLOGIES:-
1.Parent 7.Level
2.Child 8.Height
3.Siblings 9.Depth
4.Degree 10.Subtree
5.Internal Node 11.Forest
6.Leaf Node 12.Root
13.Edge

Types Of Trees:-
1.General Tree - No limitation on child nodes.
2. Binary Tree - 0 to 2(0,1, but not more than 2)
3. Strictly Binary Tree – Exactly 2 or 0 (1 child is not accepted or
more than 2 child’s also not accepted).
4. Complete Binary Tree – Every node should have 2 child’s and
all the leaf nodes should be on same level.
5.Skewed Binary Tree – The branches of this tree have either only
left branches or only right branches.
 6.Binary Search Tree – In BST, the value of the left child of a node
must be smaller than or equal to the value of its parent and the value of the right
child is always larger than or equal to the value of its parent.

Aim Of Microproject:

 To know the concept of tree.

 To know how to program executed when it is sort.
 To develop practical knowledge.
 To use program in day-to-day life.
 To increase programming skill.
 To improve logic.

PROCEDURE: -
Skill Developed/ learning out of Microproject:
 We learned the concept of tree.
 Our logic is improved.
 Our skill of developing C program is improved.