krishnadey30/Bank-Management-System

Bank Management System

Banking Management System is a simple database project in C. It is done using file handling mechanism in C. The record of the customer can be added, updated, searched and deleted. It is a simple project made using console application of C. This means, no graphics component are added. The main target user of this project are the C beginners who want to make the project in C and especially those who are interested in File handling. This project is a complete package to learn how to use the file as a database.

Group Name

return sleep;

Group No

P36

GROUP MEMBERS

DATA STRUCTURE USED

Binary Search Tree is used for the data creation because it will be efficient in terms of space and complexity to search records. Also Linked list is used to delete an Account.

Requirements

• C

Getting Started

To clone and run this application, you'll need Git,gcc installed on your computer. From your command line:

Clone this repository

$ git clone https://github.com/krishnadey30/Bank-Management-System.git

Go into the repository

$ cd Bank-Management-System

Run the app

$ gcc p36-main().c

Task 1:

Customer Registration (Account Number, Name, Age,etc.,)

• void filetolist(USER_DETAIL *temp,USER_DETAIL *new)

  • this function add nodes in a binary search tree of user details
  • tree is made based on account No of the user

• void validating_account_no(USER_DETAIL *temp,long int acc_no)

  • this function validate that the account no given is prevoiusly present or not
  • mainly used while creating account by new user to allocate different account no to different users.
  • it is traversing via pre-order traversal
  • if account no found make the flag '0'

• void Account_No(USER_DETAIL *acc,USER_DETAIL *roothead)

  • for Generating account number randomly
  • calls the 'validating_account_no()' to validate the new account no generated so that no two user have same account no
  • if that account no does not exist then assign it to the new user
  • else going back to the loop again to generate the account no randomly

• USER_DETAIL *from_file_to_tree()

  • reading from file and creating a tree
  • reading from file line by line
  • calls 'filetolist()' for adding it the binary search tree

• void Address(int pin,USER_DETAIL *acc,ADDRESS *temp)

  • checking address from the given pin code
  • traversing in post order and checking the address for the given pin code
  • 4 options are given:
    1. to conferm
       • if confermed the add that address in user details
    2. to check for another
       • if user want to check another address with same pin code
    3. to enter by yourself
       • if user want to enter the address by themself
    4. to enter another pincode
       • if user want to check for another pin code

• void validating_username(USER_DETAIL *temp,char user_name[])

  • to check if that username doesnot exist previously
  • if username found making flag '0' so that program can ask to enter different username
  • traversing in pre-order traversal

• void Username(USER_DETAIL *acc,USER_DETAIL *roothead)

  • Asking for username
  • calling 'validating_username()' for validating username
  • if username not found then conferm the username
  • else ask for another username

• void passwordhide(USER_DETAIL *acc)

  • to take password and print * in place of password

• void createadresstree(ADDRESS *temp,ADDRESS *new)

  • Creating Address Tree
  • binary search tree by pincode

• ADDRESS *addressinlist()

  • scaning pincode and address from file
  • calling 'createadresstree()' to add the address in binary tree
  • returns the address for root

• int validating_email(char A[])

  • for validating email address
  • retruns 1 if correct else 0

• USER_DETAIL *NEW_USER(USER_DETAIL *temp)

  • function to create a new user account
  • will ask the user for
    • Account_type
      • Saving
      • Current
      • Fixed
    • Name
    • Gender
      • Male
      • Female
      • Others
    • Father's Name
    • DOB(DD/MM/YYYY)
    • Pincode
      • call the 'Address()' function to know the address of that pincode
    • Mobile No
      • validate the Mobile No
    • Email_Id
      • call the 'validating_email()' to validate the email id
    • Opening balance
    • Userame
      • call the 'Username()' to get a valid username
    • password
      • call the 'passwordhide()' to get password in hidden form
    • account_no
      • calls 'Account_No()' to get a valid account no
  • call 'filetolist()' to add the new user in binary search tree
  • return root pointer of binary search tree

• void from_tree_to_file(FILE *pas,USER_DETAIL *new_ac)

  • re-writting the whole tree to file
  • pre-oreder traversal of bst

• void writingtofile(USER_DETAIL *temp)

  • call the 'from_tree_to_file()' to re-write the whole tree to file

Task 2:

Account Updation

Email update

Mobile number update(eg. Customer wants update email)

• _void updation(USER_DETAIL *user,long int n)

  • This is main updating function where all options can be updated.
    1. username
    2. password
    3. mobile number
    4. email-id
    5. address
       • *user is a pointer to head of binary search tree consisting of userdetails.

• void checkusername(USER_DETAIL *user,char y2[])

  • While updating username , this function is checking whether entered username is exists or not.
  • 'y2' is username.

• void username(USER_DETAIL *user,long int n,char y2[])

  • This function is updating the username.
  • 'y2' is username.

• void checkpass(USER_DETAIL *user,long int n,char x[])

  • While updating password , this function is checking whether entered password is exists or not.
  • 'n' is account number. 'x' is password string.

• void password(USER_DETAIL *user,long int n,char y[])

  • This function is updating the password.
  • 'n' is account number. 'y' is password string.

• void mobilenumber(USER_DETAIL *user,long int n,char x3[])

  • This function is updating the mobile number.
  • 'n' is account number. 'x3' is mobile number string.

• void emailid(USER_DETAIL *user,long int n,char y3[])

  • This function is updating the email-id.
  • 'n' is account number. 'y3' is email-id string.

• void address(USER_DETAIL *user,long int n,char y4[])

  • This function is updating address .
  • 'n' is account number. 'y4' is address string.

• void updatebalance(USER_DETAIL *user,long int n,float balance)

  • This is function to update the money into account during transaction.
  • 'n' is account number. 'balance' is a amouont which transacted during transaction.

Task 3:

Transaction history

Searching (eg. search database to find all customers with name “ABCD”.)

• void EXISTING_USER();

  • If entered Username and Password exist in the userfile asks user for any transactions or updations.
  • As per the option selected by user it calls respective functions.

• int searchusername(char entry1[],char entry2[]);

  • entry1 is the username of user.
  • entry2 is for storing password of user.

• void searchuserintree(char entry1[], char entry2[],USER_DETAIL *root,int flag1);

  • Here username is searched in binary search tree.
  • If entry1(username) exists in bst then password is stored.

• void Transaction(char entry1[],USER_DETAIL *root);

  • entry1 is username of user.
  • here user can tranfer amount to any account based on his/her account details(accountno).

• void updatetransactionfiles(long int sender,long int receiver,int amount);

  • FILE1 is updated with new transactions with details like sender(accountno), receiver(accountno), amount transfered, and Time(date and timings).

• int getaccountno(char entry1[]);

  • This function returns the accountno of entry1.

• void searchintree(char entry1[], USER_DETAIL *root, char accountno[],int flag1);

  • This function searches entry1(username) in BST and stores the accountno of entry1.

• int checkaccountno(int an,int s);

  • If accountno(an) exists in userfile it returns available balance of s(user) else it return 0.

• void Transactionhistory(char entry1[]);

  • Asks the user to selects one of given options. If option 1 is selected then it displays all Transaction history of the user.
  • (Using linkedlist) if the account no of user matches it displays details.
  • If 2nd option is selected 'searchbydate' function is called.

• LLIST *createlinkedlist(LLIST *head);

  • Input is taken from FILE1(Transaction history file). Head has 4 parts 1.accountno, 2.string1, 3.string2, 4.next
  • Accountno is stored in accountno, date is stored in string1 ,transaction details are stored in string2.

• void searchbydate(char entry1[]);

  • Here user can search transactions on particular date.
  • This function searches for accountno and date in FILE1(Transaction history file), If matches then displays details.

• int checkdate(char Month[],int date,int year,char string[])

  • Checks if the date matches with the date in the string.
  • If matches return 1 else retuen 0.

• void Deposit(char entry1[]);

  • This function is used to deposit amount in users account.

• void Withdrawl(char entry1[]);

  • This function is used to withdraw amount in users account.

Task 4:

Deletion (eg. Removing account by providing the account number)

• void delete1(USER_DETAIL *root,long int n);

  • It needs 2 parameters head pointer and the data to be deleted.
  • deletion involves 3 parts:
    • deletion of node having no childs:
      • We keep traversing and storing the parent node when node to be deleted is found,we cut the link of - - - this node with the parent node.
  • deletion of node having one child:
    • We store node which is before parent node in 'p' every time and when the node to be deleted is found,we cut the link of the present node and join it to 'p'.
  • deletion of node having two childs:
    • We keep traversing and if the node to be deleted is found store it ,find the minimum element in right sub tree and now again delete the node with minimum element by recursive call of deletion function.
    • Later replace the present node data with the minimum data.
    • We call the function recursively for traversing.

• long int min(USER_DETAIL *root);

  • This function is used to find and return the minimum value from right subtree of a binary search tree.

• void delete(USER_DETAIL *temp,long int n);

  • This function calls the delete function of binary search tree, having the head pointer and the data to be deleted as parameters.

• LLIST *createlinkedlist(LLIST *llhead)

  • creating stacks using linked list
  • start reading from file and keep creating the stack till end of file

• LLIST* del(LLIST *t,long int n)

  • deletion of nodes with given account no