Skip to main content

Address Book Project in Windows Forms with C#

Download this project

Project cost : 300Rs or $10
Pay me at:

Via bank transfer
 
ICICI bank account number is :    153801503056
Account holder name is :                 Tarun kumar saini
IFSC code is :                                   ICIC0001538

SBBJ bank detail :                             61134658849
Account holder name:                        Tarun kumar saini
IFSC code :                                        SBBJ0010398

CONTACT ME

Introduction:

Sometimes we can’t remember all of the detail of each of our friend. We have to store them, so that we can remind the details when we want. If we talk about our personal computer then it will be the safest place for us to store them in a file.
Address Book is a windows application which stores all the details of your friends. It saves their common fields like name, father name, age, date of birth and etc. Of course we are the administrator of our computer that’s why we can trust our computer.

Features of Project:


  • One can add/modify/remove an address from the database easily.
  • Search option is available for larger databases.
  • User can print the list of his/her friends using a single click.
  • It have its own username and password that is known only to the administrator.


System Requirements:


  • Visual Studio 2010 or higher
  • SqlServer 2008 or higher
  • DotNet Framework 4.0 or higher (pre-loaded with Visual Studio)

Run the project:

It is a windows form application, so either press F5 or click on Start button. It will load the login window, which requires username and password. Username is “admin” and password is “password”, click on login button and the manage options window will be shown to you.

Screenshots:

Gives you the brief description of the project.

Login Window

Address Book Project in Windows Forms with C#

Manage options: 

Provides basic three options i.e. list of addresses, search and print option.

Address Book Project in Windows Forms with C#

List of addresses: 

Contains list of addresses your address book have, you can add, edit or remove any record that is selected in the list.
Address Book Project in Windows Forms with C#

There are some more forms like edit window, search and print window.
If you want to purchase this please contact me on :  narenkumar851@gmail.com

Comments

  1. How can i download this project Pleaze

    ReplyDelete
    Replies
    1. Click on "Buy Now" button and follow the instructions

      Thanks & Regards
      Subhash Sharma

      Delete

Post a Comment

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …