*project in data structure *project name (bank) * you maybe use array .linked list .stack.and queue as data structure *you maybe use searching algorithms (binary or any searching algorithms) you maybe use sorting algorithms.

Create linked list for students information (you can used linear linked list). the student node contains: name, address, Sid, level, spec., age, average..... ) Main menu Padd, Search Using linear search - Using binary search Select other search Pupdate, delete Sorting using array of string Using bubble sort - Select sorting algorithm - Reports (use normal functions and recursion) You program must have main menu contains the following add students information using first liked list update menu Delete menus Search menu reports menu Note: (add, search, update, delete and reports) must have submenus. (i.e. reports) Reports submenu Show all students Show students lives in a specific address - Display students information with GPA>90 - Show graduated students Display the new students Be creative Create linked list for students information (you can used linear linked list). the student node contains: name, address, Sid, level, spec., age, average..... ) Main menu Padd, Search Using linear search - Using binary search Select other search Pupdate, delete Sorting using array of string Using bubble sort - Select sorting algorithm - Reports (use normal functions and recursion) You program must have main menu contains the following add students information using first liked list update menu Delete menus Search menu reports menu Note: (add, search, update, delete and reports) must have submenus. (i.e. reports) Reports submenu Show all students Show students lives in a specific address - Display students information with GPA>90 - Show graduated students Display the new students Be creative