0% found this document useful (0 votes)
62 views6 pages

20CM004 Dsa MP Report

This micro-project report describes implementing a program for binary search tree operations. A group of students created a program that allows insertion, deletion, searching of nodes in a binary search tree, and displays the tree graphically. The program also implements in-order, pre-order and post-order tree traversals. The report outlines the aim, activities, resources used, and outputs of the micro-project program for binary search trees.
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)
62 views6 pages

20CM004 Dsa MP Report

This micro-project report describes implementing a program for binary search tree operations. A group of students created a program that allows insertion, deletion, searching of nodes in a binary search tree, and displays the tree graphically. The program also implements in-order, pre-order and post-order tree traversals. The report outlines the aim, activities, resources used, and outputs of the micro-project program for binary search trees.
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/ 6

GOVERNMENT POLYTECHNIC, AMRAVATI

(An Autonomous Institute of Govt. of Maharashtra)

MICRO-PROJECT REPORT ON

“IMPLEMENT ALL TREE RELATED CONCEPTS AND


OPERATIONS THAT WILL SHOW THE TREES
GRAPHICALLY”

In Partial fulfilment of Diploma in Computer Engineering


In the subject of Data Structures Using C (FC3407)

By

Chaitanya Vijay Paraskar (20CM004)

Under the guidance of

V. R. Rathod

Lecturer of Computer Department


Government Polytechnic, Amravati

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


Session - 2021-22
GOVERNMENT POLYTECHNIC, AMRAVATI
(An Autonomous Institute of Govt. of Maharashtra)

MICRO-PROJECT REPORT ON

“IMPLEMENT ALL TREE RELATED CONCEPTS AND


OPERATIONS THAT WILL SHOW THE TREES
GRAPHICALLY”

In Partial fulfilment of Diploma in Computer Engineering


In the subject of Data Structures Using C (FC3407)

By

Chaitanya Paraskar (20CM004)


Pratik Ghurde (20CM014)
Mandar Lakhe (20CM031)
Devesh Patil (20CM041)
Abhang Paturkar (20CM044)
Omkar Shelke (20CM050)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


Session – 2021-22
GOVERNMENT POLYTECHNIC, AMRAVATI
(An Autonomous Institute of Govt. of Maharashtra)

Department of Computer Science

Certificate
This is to certify that Mr. Chaitanya Vijay Paraskar Identity Code 20CM004 of
Third Semester Diploma in Computer Engineering has satisfactorily completed
the Micro project entitled “Implement All Tree Related Concepts and Operations
That Will Show the Trees Graphically” in Data Structures Using C – FC3407
for academic year 2021-22 as prescribed in curriculum.

Place: Amravati V. R. Rathod


Date: Lecturer of Computer Department
PART – A

1. Brief Introduction

In this micro project we prepared a program based on the Concept of Binary Search
Trees. This Program includes the concepts of Insertion, Searching, Deletion,
Graphical Representation of tree and In-Order, Pre-Order, and Post-Order Traversal
of Tree.

2. Aim
This Micro- Project aims at:

• Implement basic operations on Linked List.


• Implement program to create and traverse tree to solve problems.

3. Action Plan

Details of activity Planned start date Planned finish date

Collecting and Sorting Information 13/10/2021 20/10/2021

Preparing Program 22/10/2021 31/10/2021

Testing Program 9/11/2021 30/11/2021

Making Changes and Preparing final


1/12/2021 8/12/2021
Program

Preparing Report 9/12/2021 11/12/2021


4. Actual Resources Used

Sr. No. Name of The Resource Specifications

1 DEV C++ --

2 Laptop --

3 Microsoft Office Word 2019 Version

4 CODE BLOCKS --

5 VS CODE --

5. Outputs of the Micro-Projects

• Binary Search Tree Implementation.


• Graphical Tree Representation.
• Insertion, Deletion and Searching the BST.
• In-Order , Pre-Order , Post-Order Traversal of BS Tree.
PART - B

1. Brief Introduction

In this micro project we prepared a program based on the Concept of Binary Search
Trees. This Program includes the concepts of Insertion, Searching, Deletion,
Graphical Representation of tree and In-Order, Pre-Order, and Post-Order Traversal
of Tree.

2. Aim of the Micro-Project

This Micro- Project aims at:

• Implement basic operations on Linked List.


• Implement program to create and traverse tree to solve problems.

3. Action Plan

Details of activity Planned start date Planned finish date

Collecting and Sorting Information 13/10/2021 16/10/2021

Preparing Program 18/10/2021 31/10/2021

Testing Program 1/11/2021 30/11/2021


Making Changes and Preparing final
1/12/2021 8/12/2021
Program
Preparing Report 9/12/2021 11/12/2021

You might also like