Dsu Mproject Mohini
Dsu Mproject Mohini
Dsu Mproject Mohini
Sr.
Characteristic to be Poor Average Good Excellent
No.
assessed (Marks 1-3) (Marks 4-5) (Marks 6 - 8) (Marks 9-10)
(A) Process and Product Assesssment (Convert above total marks out of 6 marks)
1 Relevance to the Course
Literature Survey /
2
Information Collection
Completion of the Target as
3
per project proposal
Analysis of data and
4
representation
5 Quality of Prototype / Model
6 Report Preparation
(B) Individual Presentation / Viva (Convert above total marks out of 4 marks)
8 Presentation
9 Viva
Micro – Project Evaluation Sheet:
Process Assessment Product Assessment
Part Project Part Individual Total
A – project Methodology B – Project Presentation / Marks 10
Name of Student Proposal (2 marks) Report / Working Viva (4 marks)
(2 marks) Model(2 marks)
Comments / Suggestions about team work / leadership / inter – personal communication (if any)
Sr.
Characteristic to be Poor Average Good Excellent
No.
assessed (Marks 1-3) (Marks 4-5) (Marks 6 - 8) (Marks 9-10)
(A) Process and Product Assesssment (Convert above total marks out of 6 marks)
1 Relevance to the Course
Literature Survey /
2
Information Collection
Completion of the Target as
3
per project proposal
Analysis of data and
4
representation
5 Quality of Prototype / Model
6 Report Preparation
(B) Individual Presentation / Viva (Convert above total marks out of 4 marks)
8 Presentation
9 Viva
Micro – Project Evaluation Sheet:
Process Assessment Product Assessment
Part Project Part Individual Total
A – project Methodology B – Project Presentation / Marks 10
Name of Student Proposal (2 marks) Report / Working Viva (4 marks)
(2 marks) Model(2 marks)
Comments / Suggestions about team work / leadership / inter – personal communication (if any)
Sr.
Characteristic to be Poor Average Good Excellent
No.
assessed (Marks 1-3) (Marks 4-5) (Marks 6 - 8) (Marks 9-10)
(A) Process and Product Assesssment (Convert above total marks out of 6 marks)
1 Relevance to the Course
Literature Survey /
2
Information Collection
Completion of the Target as
3
per project proposal
Analysis of data and
4
representation
5 Quality of Prototype / Model
6 Report Preparation
(B) Individual Presentation / Viva (Convert above total marks out of 4 marks)
8 Presentation
9 Viva
Micro – Project Evaluation Sheet:
Process Assessment Product Assessment
Part Project Part Individual Total
A – project Methodology B – Project Presentation / Marks 10
Name of Student Proposal (2 marks) Report / Working Viva (4 marks)
(2 marks) Model(2 marks)
Comments / Suggestions about team work / leadership / inter – personal communication (if any)
SHRI H. H. J. B POLYTECHNIC,
CHANDWAD-423101 (Nashik)
MICRO PROJECT
Academic year 2022-23
TITLE OF PROJECT
SEARCHING AND SORTING
CERTIFICATE
This is to certify 1) Nikam Tejaswini
2) Jagtap Damini
3) Patil Mohini
of 3rd Semester of Diploma in Computer Technology of Institute, SHHJB
POLYTECHNIC, CHANDWAD (Code: 0079) has completed the Micro-Project
satisfactorily in Subject Data Structure Using ‘C’ (22317) for the academic year 2022- 2023 as
prescribed in the curriculum.
Place: CHANDWAD
Date: 12 / 12 /2023
Part B
PART B-Plan
To use databases efficiently there are several search techniques you can use to
improve the precision of your search results. These include: phrase search,
wildcards, and Boolean logic.
1) Searching method:
Searching in the data structure can be done by applying searching
algorithms to check for a or extract an element from of stored data structure.
These algorithms are alssified according to the type of search
operation they perform ,such as:
.Linear search
This is the simplest of all searching techniques.In this technique,an
ordered or unordered list will be searched one by one from the beginning until
the desired element is found.
If the desired element is found in the list then the search is successful
otherwise unsuccesfull.
The time complexity of linear search is 0(n)
.Algorithm:
Let array a[n] stores n elements .Determine whether element ‘x’ is present or
not.
Linsrch(a[n],x)
{
Index=0;
Flag=0;
While(index<n)do
{
If(x== a[index])
{
Flag = 1;
Break;
}
Index++;
}
If(flag == 1)
Printf(“data found at %d position”,index);
Else
Printf(“data not found”);
}
Program code:
#include<stdio.h>
#include<conio.h>
Void main()
{
Int arr[20],key,size,I;
Clrscr();
Printf(“enter the size of array”);
Scanf(“%d”,&size);
Printf(“\n enter elements of aaray :”);
For(i=0;i<size;i++)
Scanf(“%d”,&arr[i]);
Printf(“enter the search elements:”);
Scanf(“%d”,,&key);
For(i=0;i<size;i++)
{
If(arr[i]== key)
{
Printf(“\n element is found at %d”,i);
Break;
}
}
If(i==size)
{
Printf(“\n element is not found’’);
}
Getch();
}
Output:
Enter the size of aaray: 3
Enter elements of array:34 52 63 47
Enter the search element: 47
Element is found:47
2) Binary search:
Linear search is not efficient in care of large data elements.
In that case the binary search is bat to search data that large element.
While searching elements using binary search the given list must
be innsorted order.The binary search is comparatively difficult method of
searching.Binary search is consider to be a more efficient method that could be
used with large lists.
Algorithm:
Step 1: Start .
Step 2: Declare variable I,n,mid,low,search and array.
Step 3: Accept elements of array and element to be search from user.
Step 4: First and lower index & upper index of array and calculate
Mid.
I.e mid=(low+high)/2
Step 5 : compare the search element with mid position if mid is less
Than search then low=mid+1.
Step 6:if mid= search element then print element is found.
Step 7:if mid is grater than search then high =mid-1
1,mid=(low+high)/2
Step 8: if low index is greater than high then print element is not
Found.
Step 9: Stop.
Program code:
#includeMstdio.h>
#include<conio.h>
Void main()
{
Int I, n ,mid,low,arr[10],search;
Clrscr();
Printf(‘enter the number of elements”);
Scanf(“%d”,&n);
Printf(“enter the elements:”);
For(i=0;i<n;i++)
Scanf(“%d”,&arr[i]);
Printf(“enter the number of to be search:”);
Scanf(“%d”,&search);
Low=0;
High=n-1;
Mid=(low<=high)
{
If(arr[mid],search)
Low=mid+1;
Else if (arr[mid]==search)
{
Printf(“\n%d is present at index %d”,search,mid+1);
Break;
]
Else
High=mid-1;
Mid=(low+high)/2;
}
If(low>high)
Printf(“\n not found!%d is not present in list”);
Getch();
}
Output:
Enter the number of elements:5
Enter the elements: 43 54 23 47 87
Enter the number to be search: 23
…………………………………………………………….
2) Sorting Method:
1) Selection Sort-
It works as follows: first and find the smallest in the array and
exchange it with the element in the first position,then find the second smallest
this way until the entired array is sorted.
The selection sort algorithm sorts an array by repeatedly finding
the minimum element from unsorted paret and putting it at the beginning.
In every iteration of selection sort,the minimum element the
array is picked and moved to its fixed position.
Algorithm:
Step 1: Start.
Step 2: Declare a variable size,I,temp,j,and array i.ea[20].
Step 4: Compare oth index element is found to be greater than the
Compared element they are interchanged.
Step 5: if the 0th index element is found to be greater than the
Compared element they are interchanged.
Steo 6: In this way after the 1st iteration, the smallest element of list
Is placed at 0th position .
Step 7: In 2nd iteration ,start with 1st element of list and process of
Comparision &swapping is repeated until the next smallest
Element is placed at 1st position .
Step8: If there are ‘n’ number of element in the list then after (n+1)
Iteration the array will be sorted .
Step 9: Stop.
Program code:
#include<stdio.h>
#include<conio.h>
Void main()
{
int size,i,a[20], j, temp ;
clrscr();
Printf(“Enter the no of elements:”);
Scanf(“%d”,&size);
Printf(“\n ente the elements of array “);
For(i=0; i<size;i++)
{
Sacnf(“%d”,&a[i]);
}
For(i=0;i<size-1;i++)
{
int min =I;
for(j=i+1;j<size;j++)
{
If(a[j]<a[min])
{
min=j;
}
}
If(min=!=i)
{
temp=a[i];
a[i]=a[min];
a[min]=temp;
}
Printf(“\n sorted elementsare:”);
For(i=0;i<size;i++)
Printf(“\n%d\n”,a[i]);
getch();
}
2) Insertion sort-
Insertion sort algorithm arranges a list of elements in a particular order .In
insertion sort algorithm every iteration moves an element from unsorted portion
until all the elements are sorted in the list.
In this method the elements are inserted at their appropriate place.Hence ,is
the name insertion sort.
Algorithm:
Step 1: Assume that first element from the unsorted list is in sorted portion of
the list and remaining all elements are in unsorted portion.
Step 2:Consider first element from the unsorted list and insert that element into
the sorted list in order specified.
Step 3: Repeat the above process until all the elements from the unsorted list are
moved into the sorted list.
Program code
For example – logarithmic search, binary search .
/* Simple Insertion Sort Program Using Functions in C*/
/* Data Structure Programs,C Array Examples */
#include<stdio.h>
#include<conio.h>
#define MAX_SIZE 5
void insertion(int[]);
int main() {
int arr_sort[MAX_SIZE], i;
printf("Simple Insertion Sort Example - Array and Functions\n");
printf("\nEnter %d Elements for Sorting\n", MAX_SIZE);
for (i = 0; i < MAX_SIZE; i++)
scanf("%d", &arr_sort[i]);
printf("\nYour Data :");
for (i = 0; i < MAX_SIZE; i++) {
printf("\t%d", arr_sort[i]);
}
insertion(arr_sort);
getch();
}
void insertion(int fn_arr[]) {
int i, j, a, t;
for (i = 1; i < MAX_SIZE; i++) {
t = fn_arr[i];
j = i - 1;
while (j >= 0 && fn_arr[j] > t) {fn_arr[j + 1] = fn_arr[j];
j = j - 1;
}
fn_arr[j + 1] = t;
printf("\nIteration %d : ", i);
for (a = 0; a < MAX_SIZE; a++) {
printf("\t%d", fn_arr[a]);
}
}
printf("\n\nSorted Data :");
for (i = 0; i < MAX_SIZE; i++) {
printf("\t%d", fn_arr[i]);
}
}
Output:
Enter 5 elements for sorting
901
56
34
23
2