1. REVIEW Phase-1 P-QUIZ TEAM APP 1).HARSHA-13BCE072
2).SANKHADEEP-13BCE0243
3).NEEHAR-13BCE0311
4).SHIVANESH-13BCE0397
5).SATWASTA-13BCE0497
6).RAJAT SHARMA-13BCE0706

2. ABSTRACT
The name of our app is P-Quiz (P for PROJECT). The app is designed in a colorful way (inspired from flat design) and also highly interactive to the user. App consists of totally 7 pages. The first page will ask the register number of the user and if he/she enter his/her register number, this will be saved and when he/she opens the app again it won’t ask the register number again. The next page will explain the rules of the quiz and after that user has to select the topic he wants to play, then the quiz will start. Each quiz will have 15 questions which are selected randomly from the question bank based on the category the user selected. A correct answer carries 20 marks and a wrong one carries -5. User has only 10 seconds to answer each question. After completing the quiz, the app will display the score and it will be stored. User can also view his overall statistics from the statistics page.

3. P-QUIZ
For the Project , we thought of developing an android app which consists of a question bank of around 500 questions .
The problem is selecting random questions without repetition. So, to solve this we used the Queues in data structure concepts

4. FEATURES It is also called FIFO ( FIRST IN FIRST OUT ) .
Items enter the Queue from the front and leave it from the rear .
It can be implemented using array or even link-list .
It can be linear or circular .
It is a sequential data structure .
It does not have a specific capacity .

5. HOW THE APP WORKS
First we designed a website using HTML5, CSS3, JS and many frameworks and then using Cordova Phonegap build we converted the webpage into an android app .
To select a random question without repetition we used queue data structure. Using default random function in JS we generated one random number between 0-N and we stored the random number in the checkArray() and we enqueued the question object into the queue and while generating another random number it will check the checkArray() whether the number is already there or not and the process is repeated till the end of quiz.
And for storing the register number and score we didn’t use any backend but we used HTML5 Local Storage API.

6. CONS OF EXISTING METHOD
The Queue cannot be readily searchable .
It is difficult for the questions to be chosen randomly
The questions can only be extracted in order to avoid any repeat .
Processing time is more consuming .
Non sequential access is horribly slow in queues and is therefore less efficient .

7. POSSIBLE SOLUTIONS Efficient Randomized Web-Cache Replacement
DFS ( DEPTH FIRST SEARCH ) is a more space efficient process .

8. USES Useful for testing their data structure knowledge.
User can analyze his topic wise results.
Questions are challenging and interesting.
No Internet connection is required.
App is highly interactive.

9. EXAMPLES OF SAME CONCEPT USED
queue, used by SMTP servers to process incoming and outgoing into a FIFO buffer, or placing deferred mail into a non-linear waiting buffer
A-Steal Job scheduling algorithm .
Intel's Threading Building Blocks (TBB) library for parallel programming.
Discrete Event Schedulation
Bandwidth management

10. THANK YOU