DSU Microproject

Contact Management System

DATA STRUCTURE USING C

A PROJECT REPORT ON:
“Contact Management System:
DATA STRUCTURE USING C”

SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE

AWARD OF DIPLOMA IN
INFORMATION and TECHNOLOGY
SUBMITTED TO
1|Page
SUBMITTED BY THIRD SEMESTER STUDENTS OF
INFORMATION AND TECHNOLOGY GROUP:
SR Name of Student: Roll Enrollment

No: No: No:
1 Gawali Karan Sheshrao 17 2000310212
2 Gawande Kaustubh Dilip 18 2000310213
3 Patne Narendra Ganesh 44 2000310243
4 Ther Kunal Shankar 55 2000310257
Main Subject: Data Structure Using C

[22317]
GUIDED BY
Onkar Ghorsade Sir
2|Page
CERTIFICATE
This is to Certify that the project report entitled:“ Contact Management

System:
DATA STRUCTURE USING C”
Was successfully completed by Students of third semester Diploma in
(Information and Technology engineering).
1. Gawali Karan Sheshrao 17 2000310212
2. Gawande Kaustubh Dilip 18 2000310213
3. Patne Narendra Ganesh 44 2000310243
4. Ther Kunal Shankar 55 2000310257
in partial fulfillment of the requirements for the award of the Diploma in
Information and Technology and submitted to the Department of
Information and Technology of Government Polytechnic Washim work
carried out during a period for the academic year 20xx-xx as per
curriculum.
Name of Guide Name of HOD
Onkar Ghorsade Sir Udaysingh Bagade Sir
Name of Principal
Dr. B. G. Gawalwad Sir
3|Page
Index
Sr. No: Topic Name: Page No:
1 Data Structures Using C 1
2 Types of Data Structures 2
3 Primitive, Non Primitive, Linear and Non Linear 2-3
4 Static , Dynamic + Types of Data Structure Web 4
5 Contact Management System 5-6
6 Main Menu 7
7 Add a New Contact 7
8 List of All Contacts 8
9 Search for Contact 9
10 Edit a Contact 9-10
11 Delete a Contact 11-12
12 Exit 13
13 Links for Program and Executable File 14
14 References 14
0|Page
Data Structure using C:
In computer science, a data structure is a data
organization, management, and storage format that enables
efficient access and modification More precisely, a data structure
is a collection of data values, the relationships among them, and
the functions or operations that can be applied to the data i.e., it
is an algebraic structure about data. It is a way to store and
organize data so that it can be used efficiently.
The data structure name indicates itself that organizing the data
in memory. There are many ways of organizing the data in the
memory as we have already seen one of the data structures, i.e.,
array in C language. Array is a collection of memory elements in
which data is stored sequentially, i.e., one after another. In other
words, we can say that array stores the elements in a continuous
manner. There are also other ways to organize the data in
memory.
Data Structures using C means implementing Data Structures
using C language.
1|Page
❖ Types of Data Structure:
There are two types of data structures:
1] Primitive data structure

2] Non-primitive data structure
------------------------------------------------------------------------
1] Primitive Data structure:
The primitive data structures are primitive data types. The int, char,
float, double, and pointer are the primitive data structures that can hold
a single value.
2] Non-Primitive Data structure
The non-primitive data structure is divided into two types:
i. Linear data structure

ii. Non-linear data structure
2|Page
• Linear Data Structure:
The arrangement of data in a sequential manner is known as a linear

data structure. The data structures used for this purpose are Arrays,
Linked list, Stacks, and Queues. In these data structures, one element is
connected to only one another element in a linear form.
• Non Linear Data Structure:

Data structures where data elements are not arranged sequentially or
linearly are called non-linear data structures. In a non-linear data
structure, single level is not involved. Therefore, we can’t traverse all
the elements in single run only. Non-linear data structures are not easy
to implement in comparison to linear data structure. It utilizes computer
memory efficiently in comparison to a linear data structure. Its
examples are trees, graphs, tables and sets.
• Data structures can also be classified as:

• Static data structure: It is a type of data structure where the size
is allocated at the compile time. Therefore, the maximum size is
fixed. Ex: Array
3|Page
• Dynamic data structure: It is a type of data structure where the
size is allocated at the run time. Therefore, the maximum size is
flexible. Ex: Linked List, Queue, Stack
Types of Data Structure Diagram:
4|Page
❖ Contact Management System:
So, by using the concept of Data Structure using C we

have prepared a Contact Management System Project. It can be
used to save our contacts.
Mainly we have used the concept of Linked list in this program of
Contact Management System. For each contact there is one node
of linked list and its number increases as new contacts are added to
the list.
Linked List: A linked list is a linear data structure, in which the
elements are not stored at contiguous memory locations. The
elements in a linked list are linked using pointers as shown in the
below image:
5|Page
It is a sequence of links which contains items. Each link contains a
connection to another link.
All-important attributes of One Contact are such as:

• Name
• Phone Number
• Address
• Email Address
At beginning, there is a Main Menu which contains various

Operation to perform those Options are such as:
1. Add New Contact

2. List of All Contacts
3. Search for contact
4. Edit a Contact
5. Delete a Contact
6. Exit
------------------------------------------------------------------------------------
6|Page
❖ Main Menu: [ Output Screenshot]
1] Add a New Contact: To add a new contact and save it we have to
select or Enter First Option i.e. (1). Then enter Name, phone no, address
and Email address
7|Page
2] List of All Contacts: To show the list of all contacts there is
Second Option i.e. (2). So here we have entered three contacts
8|Page
3] Search for Contact: To search any contact from saved list we
have to choose third option (3) and then put the name of that contact.
4] Edit a Contact: To edit a previously saved contact there is option
number four i.e. (4). We can change name, phone number, address
and email address means all the attributes.
9|Page
List after Editing Contact:
10 | P a g e
5] Delete a Contact: To delete a particular contact we can use delete
option number five (5). Program asks us to enter the name of contact
which we have to delete. Before delete operation we have two
contacts Harshal and Nawazuddin.
11 | P a g e
List of Contacts after delete operation: After Deletion there is only
one contact and another is deleted.
12 | P a g e
6] Exit: To Exit from the program we can use exit option (0).
13 | P a g e
❖ Links for Contact Management Program and
Executable File:
• C Program file:https://drive.google.com/file/d/1qplw5Msw-
wrJGBe7GwLxUe0O2s08owFI/view?usp=sharing
• Executable File:https://drive.google.com/file/d/1wLxv0BXLppnKQ-
Ucy_7MVPAqZlCEjNZe/view?usp=sharing
❖ References:
• https://www.javatpoint.com/data-structure-tutorial
• https://www.codewithc.com/mini-project-in-c-contact-
management-system/
• https://en.wikipedia.org/wiki/Data_structure
• Various other websites for data and information.
14 | P a g e
Thank You
15 | P a g e

DSU Microproject

Uploaded by

Copyright:

Available Formats

DSU Microproject

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSU Microproject

Uploaded by

Copyright:

Available Formats

Contact Management System

DATA STRUCTURE USING C

DATA STRUCTURE USING C”

SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE

INFORMATION and TECHNOLOGY

INFORMATION AND TECHNOLOGY GROUP:

SR Name of Student: Roll Enrollment

Main Subject: Data Structure Using C

Onkar Ghorsade Sir

This is to Certify that the project report entitled:“ Contact Management

DATA STRUCTURE USING C”

Was successfully completed by Students of third semester Diploma in

(Information and Technology engineering).

1. Gawali Karan Sheshrao 17 2000310212

2. Gawande Kaustubh Dilip 18 2000310213

3. Patne Narendra Ganesh 44 2000310243

4. Ther Kunal Shankar 55 2000310257

in partial fulfillment of the requirements for the award of the Diploma in

Information and Technology and submitted to the Department of

Information and Technology of Government Polytechnic Washim work

Name of Guide Name of HOD

Onkar Ghorsade Sir Udaysingh Bagade Sir

1 Data Structures Using C 1

2 Types of Data Structures 2

3 Primitive, Non Primitive, Linear and Non Linear 2-3

4 Static , Dynamic + Types of Data Structure Web 4

5 Contact Management System 5-6

7 Add a New Contact 7

8 List of All Contacts 8

9 Search for Contact 9

10 Edit a Contact 9-10

11 Delete a Contact 11-12

13 Links for Program and Executable File 14

1] Primitive data structure

2] Non-Primitive Data structure

The non-primitive data structure is divided into two types:

i. Linear data structure

The arrangement of data in a sequential manner is known as a linear

• Non Linear Data Structure:

• Data structures can also be classified as:

Types of Data Structure Diagram:

So, by using the concept of Data Structure using C we

All-important attributes of One Contact are such as:

At beginning, there is a Main Menu which contains various

1. Add New Contact

1] Add a New Contact: To add a new contact and save it we have to

and Email address

Second Option i.e. (2). So here we have entered three contacts

4] Edit a Contact: To edit a previously saved contact there is option

and email address means all the attributes.

which we have to delete. Before delete operation we have two

contacts Harshal and Nawazuddin.

one contact and another is deleted.

• Various other websites for data and information.

You might also like