Implement all the functions from the Question 2 and make a login and sign up module, all the data will be stored in the files and as well as in the linked list, Program will have two modules 1. login 2. sign up Sign Up: In this module the program will ask the user to enter username, password, address, city, phone number, gender and will store the data in the linked list. If the username already exists in the linked list it will ask the user to change the username, all the data will also be stored in the text file. Login: In this module the user will enter its username and password, the program will check if the data exists in the linked list, if yes then show “Welcome to home screen”, if not then ask the user to enter the username and password again. Work Flow: 1. The program will start and all the data from the files will be loaded in the linked list. 2. The login and sign up screen will pop up 3. Apply proper checks, if the file exists or not (Hint: you can use try catch to handle the exceptions)
Implement all the functions from the Question 2 and make a login and sign up module, all the
data will be stored in the files and as well as in the linked list, Program will have two modules
1. login
2. sign up
Sign Up:
In this module the program will ask the user to enter username, password, address, city, phone
number, gender and will store the data in the linked list. If the username already exists in the
linked list it will ask the user to change the username, all the data will also be stored in the text
file.
Login:
In this module the user will enter its username and password, the program will check if the data
exists in the linked list, if yes then show “Welcome to home screen”, if not then ask the user to
enter the username and password again.
Work Flow:
1. The program will start and all the data from the files will be loaded in the linked list.
2. The login and sign up screen will pop up
3. Apply proper checks, if the file exists or not (Hint: you can use try catch to handle the
exceptions)
QUESTION 2 :(FOR HELP)
Make a doubly linked list and apply all the insertion, deletion and search cases. The node will
have an int variable in the data part. Your LinkedList will have a head and a tail pointer.
Your LinkedList class must have the following functions:
1) insert a node
1. void insertNodeAtBeginning(int data);
2. void insertNodeInMiddle(int key, int data); //will search for key
and insert node after the node where a node’s data==key
3. void insertNodeAtEnd(int data);
2) delete a node
1. bool deleteFirstNode(); //will delete the first node of the LL
2. bool deleteNode(int key); //search for the node where its data==key
and delete that particular node
3. bool deleteLastNode(); //will delete the last node of the LL
3) Search a node
1. Node* searchNodeRef(int key); //will search for the key in the data
part of the node
2. bool searchNode(int key);
The program must be completely generic, especially for deleting/inserting the middle nodes.
Step by step
Solved in 2 steps