DSA Final Project

Topic:-

“Election management system”

Submitted By:-

Muhammad Awais.
L1F11BSCS0273.

Submitted To:-
Prof. Nabeel Sabir.
University of central Punjab, Lahore.
Data structures used:-
I am doing the project on voting system.
1) So the Ids of the voters are unique and the size of the voters list is fix.
2) After inserting the data, there is no need to update the data instantly may it needed for some special cases we only need to generate a key to search and retrieve.
As we know that when we have distinct values and fix size so the suitable data structure is………
“Hash Tables”
1) There are not certain changes required in the data we only need to search the data.
2) As the Ids are unique so there are fewer chances of collisions in data by using it we get fast searching and fast storage and retrieval of data.
“Hashing Technique”
1) To reduce the chances of collisions in the I will use this technique.
“Chaining”
1) The chaining will going to be used the collision resolution strategy.
2) Using fix size Array, every index of the array is a link list itself.
The other Data structure used are:- 1) Queues for pooling booths.
 To maintain the discipline of the pooling booths and to avoid any ambiguous situation the proper queues are going to be used. 2) Stack for deletions.
The deletions are required only for some special purposes like for candidates if any candidate is not interested to participate so we can delete him. Stacks are going to be used for them to provide the undo features for the staff.
“Filing”
1) Ram is temporary memory.
2) We need to store the data permanently so the filing is used to store the data and retrieve the data from the file.
<Fstream>
1) ifstream and ofstream will be used for filing.