Dsu Mproject Mohini

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 17

Teacher Evaluation Sheet

Name of Student: Nikam Tejaswini Nitin


Enrolment No: 2200790506
Name of Program: Computer Technology Semester:- III
Course Title: Data Structure Using ‘C’ (DSU) Code: -22317
Title of the Micro Project:Searching And Sorting

Course Outcomes Achieved:-

CO-b Apply different Searching and Sorting techniques.

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)

Nikam Tejaswini Nikam

Comments / Suggestions about team work / leadership / inter – personal communication (if any)

Any Other Comment

Name and designation of the faculty Member: Mr. A.A.Pawar Signature


Teacher Evaluation Sheet

Name of student: Jagtap Damini Avinash


Enrolment no: 2200790503
Name of Program: Computer Technology Semester:-III
Course Title: Data Structure Using ‘C’ (DSU) Code: -22317
Title of the Micro Project: Searching And Sorting

Course Outcomes Achieved:-


a) CO-b Apply different Searching and Sorting techniques.

Evaluation as per Suggested Rubric for Assessment of Micro-Project:

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)

Jagtap Damini Avinash

Comments / Suggestions about team work / leadership / inter – personal communication (if any)

Any Other Comment

Name and designation of the faculty Member: Mr. A.A.Pawar signature


Teacher Evaluation Sheet
Name of Student: Patil Mohini Sunil
Enrolment No: 2200790508
Name of Program: Computer Technology Semester:-III
Course Title: Data Structure Using ‘C’ (DSU) Code: -22317
Title of the Micro Project:

Course Outcomes Achieved:-


a) CO- a Apply different Searching and Sorting techniques.

Evaluation as per Suggested Rubric for Assessment of Micro-Project:

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)

Patil Mohini Sunil

Comments / Suggestions about team work / leadership / inter – personal communication (if any)

Any Other Comment

Name and designation of the faculty Member: Mr. A.A.Pawar signature


MAHARASHTRA STATE BOARD OF TECHNICAL
EDUCATION

SHRI H. H. J. B POLYTECHNIC,
CHANDWAD-423101 (Nashik)

MICRO PROJECT
Academic year 2022-23

TITLE OF PROJECT
SEARCHING AND SORTING

Program:Computer Technology Program Code:CM

Course: Data Structure Using ‘C’ Course code: 22317


MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION

Sr.No. Name of Student Roll No Enrollment No Seat No


1. Nikam Tejaswini Nitin 62 2200790506 325558
2. Jagtap Damini Avinash 61 2200790503 325555
3. Patil Mohini Sunil 64 2200790508 325560

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

Subject Teacher Head of the Department Principal


(Mr. A.A.Pawar) (Mr.P.R.Sali) (Dr. V.A.Wankhede)
INDEX

SR_NO. CONTENT PAGE NO.


Part A

1.0 Brief Introduction

2.0 Aim of Micro Project

3.0 Action Plan

4.0 Resources Required

Part B

1.0 Brief Description

2.0 Aim of Micro Project

3.0 Course Outcome Integrated

4.0 Actual Procedure Followed

5.0 Actual Resource Used

6.0 Outputs of the Micro-projects

7.0 Skill Developed

8.0 Applications of this Microproject


PART A-Plan

Title of micro-project: Searching And Sorting

Aim/Benefits of the Micro-Project:


The data structure is an important
aspect for Computer Engineering and Information Technology Diploma
graduates. The data structure is a logical & mathematical model of
storing & organizing data in a particular way in a computer. The methods
and techniques of Data Structures are widely used in industries. After
learning this subject students will be able to identify the problem, analyze
different algorithms to solve the problem & choose the most appropriate
data structure to represent the data.

2.0 Course Outcomes Addressed-

CO-b. Apply different Searching and Sorting techniques.

3.0 Proposed Methodology: -


Insertion sort is a simple sorting algorithm that builds the final sorted
array (or list) one item at a time.It is much less efficient on large lists
than more advanced algorithms such as quicksort, heapsort, or merge
sort. However, insertion sort provides several advantages like simple
implementation, efficient for (quite) small data sets, more efficient in
practice than most other simple quadratic algorithms, adaptive, stable,
in-place; i.e., only requires a constant amount of additional memory
space, online; i.e., can sort a list as it receives it

4.0 Action plan:-

Planned Start Planned Finish


Sr no. Details of activity
Date Date
1. Finalization of topic 18/2/2022 25/8/2022
2. Preparation of Abstract 22/9/2022 29/9/2022
3. Collection of data 20/10/2022 27/10/2022
4. Preparation of concept 22/11/2022 24/11/2022
5. Seminar / Presentation 1/12/2022 1/12/2022
6. Submission of Micro Project 14/12/2022 14/12/2022

5.0 Resources Required:


Sr.No Name of Resource/Material Specification Quantity Remarks
1. Computer (Desktop/Laptop) i3,RAM 2GB 1 Available
2. Microsoft office word 2010 1 Available
3. Books Nirali 1 Available
4. Websites Available
5. Softwares TASM 1 Available

PART B-Plan

Title of micro-project: Searching And Sorting

1.0 Brief Description: This process is adopted when the management of


the system development, Personnel decides that the particular
system needs improvement. The system development life cycle is
the set of activities, carried out by the analyst, designers, and users
to develop and implement a system. The systems that are present in
nature follow a common life cycle pattern. For example, consider the
rainy system. Initially, the rain falls into the river, the river flows into
the sea, the seawater evaporates to form vapors, and the vapors
form clouds which again bring rain. Similarly consider a manmade
system initially a system is analyzed, designed, and made
operational by the efforts of system analysis. After a successful
operation or a number of users, the system becomes less and less
effective for a change in the environment. So these changes have to
be incorporated into the system by minor modifications. So the
general activities from the life cycle of the system are given below:

2.0 Aims/Benefits of Micro Project:


The data structure is an important aspect for
computer engineering and information technolog diploma graduates.The data
structure is logical and mathematical model of storing and organizing data in a
particular way in a computer.The methods and techniques of data structres are
widely used in industries.After learning this subjects students will be able to
identify the problem, analyse different algorithms to solve the problem and
choose the most appropriate data structure to represent the data.

Course Outcomes Achieved:

CO-b. Apply different Searching and Sorting techniques.

4.0 Actual Methodology/Procedure Followed:

Search techniques - phrasing, wildcards & boolean operators

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.

5.0 Actual Resources Used:

Sr.No Name of Resource/Material Specification Quantity Remarks


1. Computer (Desktop/Laptop) i3,RAM 2GB 1 Available
2. Microsoft office word 2010 1 Available
3. Books Nirali Available
4. Websites Available
5. Softwares TASM 1 Available

7.0 Skill Developed:.Searching And Sorting Methods

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();
}

Output:Enter the no.of elements :4


Enter the elements of array:23 54 34 65
Sorted elements are: 23 34 54 65

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

Sorted data : 2 23 34 56 901

8.0 Applications of this Microproject:


Searching is the process of locating a given object or data within a large set of
data. Sorting, on the other hand, is the arrangement of data in a specific required
order. The common application of these algorithms is in databases and other
computer applications.

You might also like