Download linked list and thier types and algortithems and more Study Guides, Projects, Research Data Structures and Algorithms in PDF only on Docsity!
Index
Sr. No. Contents Page No.
Annexure I– Micro Project Proposal 1-
1.Aims/Benefits of the Micro-Project 1
Course Outcome Addressed 1
1 3.Proposed Methodology 1
Action Plan 1
Resources Required 2
Name of Team Members with Roll No.’s 2
Annexure II – Micro Project Report 3-
1.Rationale 3
2.Aims/Benefits of the Micro-Project 3
3.Course Outcome Achieved 3
Literature Review 3-
2 5.Actual Methodology Followed 4
5.1.Algorithm 4
5.2 Flowchart 5
5.3 Source code 5-
6.Actual Resources Used 7
7.Outputs of Micro-Projects 8
Skill developed / Learning out of this Micro-Project 8
Applications of this Micro-Project 8
i
Report 3:00-5:00pm 3:00-5:00pm
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.
Abhijit.A.Patil. DSD 8
2 1910950000 Jivan Poman DSD
Name and Signature of the Teacher
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 :-
- start
- create a new node n
- set
n
F 0 E 0 (^) next=null
n
F 0 E 0 (^) data=value 4.set
n
F 0 E 0 (^) next=p
start=n
5.stop
2.At middle:-
- start
- create a new node n
- (^) set
n
F 0 E 0 (^) next=null
n
F 0 E 0 (^) data=value
- Search the specific position
- set
p
F 0 E 0 (^) next=n
n
F 0 E 0 (^) next=q
- stop
- At end:-
- start
- create a new node n
- set
n
F 0 E 0 (^) next=null
n
F 0 E 0 (^) data=value
- search the last node
- set
last
F 0 E 0 (^) next=n
n
F 0 E 0 (^) next=null
- stop
3
Single linked list
5 Actual Methodology Followed:
5.1 Algorithm:
1.At start :-
- start
- create a new node n
- set
n
F 0 E 0 (^) next=null
n
F 0 E 0 (^) data=value 4.set
n
F 0 E 0 (^) next=p
start=n
5.stop
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; }
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
