Index

Sr. No. Contents Page No.

Annexure I– Micro Project Proposal 1-2

1.Aims/Benefits of the Micro-Project 1

2. Course Outcome Addressed 1

1 3.Proposed Methodology 1

4. Action Plan 1

5. Resources Required 2

6. Name of Team Members with Roll No.’s 2

Annexure II – Micro Project Report 3-8

1.Rationale 3

2.Aims/Benefits of the Micro-Project 3

3.Course Outcome Achieved 3

4. Literature Review 3-4

2 5.Actual Methodology Followed 4

5.1.Algorithm 4

5.2 Flowchart 5

5.3 Source code 5-6

6.Actual Resources Used 7

7.Outputs of Micro-Projects 8

8. Skill developed / Learning out of this Micro-Project 8

9. Applications of this Micro-Project 8

i
 Annexure I

Micro Project Proposal

Linked list

1. Aims/Benefits of the Micro-Project:

To present the concept of array, structure, queue, stack and linked list.

2. Course Outcome Addressed:

Implement basic operation on linked list.

3. Proposed Methodology:
In this micro project we are perform linked list using insert and delete.

There are two operations

1. Insert: - Adding a new element in linked list is called inset operation.

2. Delete:- Deleting a element from linked list is called delete.

4.ActionPlan:(Sequence and time required for major activities)

Sr. Planned Planned Name of Responsible

Details of Activity
No Start date Finish date Team Members
1 Selection of topic 8-July-2019 9-July-2019
2:00-3:00 2:00-3:00
2 Search the information 15-July-2019 22-July-2019
2:00-3:30pm 2:00-3:30pm Pradnyavant B.
3 Algorithm developing 23-July-2019 29-July-2019 Bansode
2:00-3:00pm 2:00-3:00pm
4 Flowchart developing 30-July-2019 6-Aug-2019
2:00-3:30pm 2:00-3:30pm
5 Function making 13-Aug-2019 27-Aug-2019
2:00-3:00pm 2:00-3:00pm
6 Coding developing 9-Sep-2019 23-Sep-2019
2:00-3:00pm 2:00-3:00pm
7 Debugging 16-Sep-2019 30-Sep-2019
2:00-3:30 2:00-3:30
8 Finalizing Project with its 7-Oct-2019 14-Oct-2019
report 2:00-3:30 2:00-3:30

1
5. Resources Required:(Major resources such as raw materials, some machining facility, software etc.)

Sr.
No Name of resource / material Specification Quantity Remarks
.
1 Computer WINDOWS 7,2GB RAM, 1
160GB HDD
2 Operating System WINDOWS 7 1

3 Compiler Turbo C/GCC 1

4 Browser Chrome 1

Names of Team Members with Roll No.’s:

Sr. Enrollment
Name of Team Member Roll No.
No. No.
1 1810950145 Pradnyavant.B. Bansode 15

Name and Signature of the Teacher

2
 Annexure – II

Micro-Project Report

Infix to Prefix

1. Rationale:
For this conversion we take help of linked list, we need the insert and delete operation to perform linked list.

There are three types of inset operation:

1.At start :-
1. start
2. create a new node n
3. set
nnext=null
ndata=value
4.set
nnext=p
start=n
5.stop
2.At middle:-
1. start
2. create a new node n
3. set
nnext=null
ndata=value
4. Search the specific position
5. set
pnext=n
nnext=q
6. stop
3. At end:-
1. start
2. create a new node n
3. set
nnext=null
ndata=value
4.search the last node
5. set
lastnext=n
nnext=null
6. stop

3
 2.Aims/Benefits of the Micro-Project:
To present the concept of array, structure, queue, stack and linked list.

3. Course Outcomes Achieved:

Implement basic operation on linked list.

4. Literature Review:

5 Actual Methodology

Followed:

5.1 Algorithm:
1.At start :-
1. start
2. create a new node n
3. set
nnext=null
ndata=value
4.set
nnext=p
start=n
5.stop

4
5.2Flow Chart:

5
 5.3 Source Code:

#include <stdio.h>
#include <stdlib.h>

struct node {
int data;
struct node *next;
};

struct node *head = NULL;

struct node *current = NULL;

//display the list

void printList() {

struct node *ptr = head;

printf("\n[head] =>");
//start from the beginning
while(ptr != NULL) {
printf(" %d =>",ptr->data);
ptr = ptr->next;
}

printf(" [null]\n");
}

//insert link at the first location

void insert(int data) {
//create a link
struct node *link = (struct node*) malloc(sizeof(struct node));

//link->key = key;
link->data = data;

link->next = head;

head = link;
}

int main() {
insert(10);
insert(20);
insert(30);
insert(1);
insert(40);
insert(56);

printList();
return 0;
}

6
 Example

6. Actual Resources Used:

Sr. Name of resource /

Specification Quantity Remarks
No. material

1 Computer WINDOWS 7,2GB RAM, 1

160GB HDD
2 Operating System WINDOWS 7 1

3 Compiler Turbo C/GCC 1

4 Browser Chrome 1

7.Outputs of Micro-Projects:

7
8.Skill developed / Learning out of this Micro-Project:
There are so many thing that we learn from this project of

1. How to do the testing of program in turbo c.

2. How to collect the information and how to make the presentation that we learn from this project.
3. We develop our logic implementation for programing and coding.
4. This all thing we learn from this project.

9. Applications of this Micro-Project:

1. Dynamic memory management.

2. Sparse matrix.

3. Representation of long integer.

4.Polynomial representation.

*********