PART A – Micro-Project Proposal

Title of Micro-Project:
Infix to prefix conversion using linked list.
1.0. Brief Introduction
Infix expression: The expression of the form an op b. When an operator is in-
between every pair of operands.
Prefix: An expression is called the prefix expression if the operator appears in the
expression before the operands. Simply of the form (operator operand1
operand2). ... Given a Prefix expression, convert it into a Postfix expression.

2.0. Aim of Project

a) Understand the infix to prefix conversion
b) Understand the linked list operations
c) Implements operations on stack and linked list.
d) To converts the element using infix to prefix linked list conversion.

3.0 Intended Course Outcomes

a) Preform basic operations on arrays.
b) Implement basic operations on stack and queue using array representation.
c) Implement basic operations on Linked List.

4.0. Proposed Methodology

1) Algorithm of Infix to Prefix
Step 1: Onto STACK, and add “(“to end of the A Push “)”
Step 2: Scan A from right to left and repeat step 3 to 6 for each element of A until the
STACK is empty
Step 3: If an operand is encountered add it to B
Step 4: If a right parenthesis is encountered push it onto STACK
Step 5: If an operator is encountered then:
a) Repeatedly pop from STACK and add to be each operator (on the top of STACK)
which has same
Or higher precedence than the operator.
b) Add operator to STACK
Step 6: If left parenthesis is encountered then
 a) Repeatedly pop from the STACK and add to B (each operator on top of stack until a
left parenthesis is encountered)
b) Remove the left parenthesis
Step 7: Exit

2) FLOWCHART:
 Methodology to be followed:
1. Preparation of Part A
2. Information Collection
3. Information Analysis
4. Design of Project(Algorithm)
5. Implementation
6. Report Preparation
7. PPT preparation

5.0. Resources Required

Sr. Name of Specifications Quantity Remark
No. Resource/material
1 Hardware:Computer Computer(i3_i5 1 -
System preferable),RAM minimum
2GB and onward but not
limited to
2 Operating System Window XP/window 7/LINUX 1 -
version 5.0 or later
3 Turbo C++ IDE 1 -
Learning Resources
Sr. No. Title of Book Author Publication
01 Data structure using c Reema Thareja Oxford University Press

Software Learning Resources

1) https://www.geeksforgeeks.org/convert-infix-prefix-notation/
2) http://scanftree.com/Data_Structure/infix-to-prefix
3) http://see-programming.blogspot.com/2013/02/infix-to-prefix-conversion.html
6.0. Action Plan
Name of Student Enrollment No

Abusalem Mahamad Mangalwedhe 1805400008

Sanket Rajkumar Kadam 1905400064

Payal Arun Jadhav 1905400070

Suhasi Ramesh Rajput 1905400068

Name of Programme: Computer Engineering Semester: CO3I

Course Title: Data structure using c Code: 22317
 Title of the Micro-Project: infix to prefix conversion using linked list.
Name of subject Teacher: Mrs. Mane V.M.
S. No./ Details of activity Planned Planned Name of
week Start date Finish date Responsible
Team
Members
1. Topics given by Subject Teacher and 29-6-2019 6-7-2019
discussed on given topic with all members.

2. Collection of information related to the 6-7-2019 13-7-2019

topic.
3. Planning of project. 13-7-2019 20-7-2019
Abusalem
4. Analyze the collected data and finalize 20-7-2019 27-7-2019
Sanket
structure of project. Payal
5. Distribution of task and discussion of roles 27-7-2019 3-8-2019 Suhasi
and responsibilities of each member.
6. Design of micro-project 3-8-2019 10-8-2019
7. Design of micro-project 10-8-2019 21-8-2019
8. Implementation 21-8-2019 24-8-2019

9. Implementation 24-8-2019 31-8-2019

10. Implementation 31-8-2019 7-9-2019
11. Implementation 7-9-2019 14-9-2019
12. Report Preparation 14-9-2019 21-9-2019
13. Report Submission 21-9-2019 28-9-2019
14. PPT Preparation 28-9-2019 5-10-2019
15. Presentation 5-10-2019 12-10-2019
16. Submission of Micro project 12-10-2019 14-10-2019

Name of Course Teacher: Mrs. Mane V.M Sign: ___________