Question
There are 1000 students attempting x questions in a competitive examination, where x is your birthdate coded as ddmmyyyy format. For example if your birthday
There are 1000 students attempting x questions in a competitive examination, where x is your birthdate coded as ddmmyyyy format. For example if your birthday was on 11/12/2000, then x=11122000. Each student can score one mark per right answer, and a penalty of-0.5 marks per wrong answer. The negative marks increases per wrong answer as a penalty p=0.5*n, where n represents the n'th wrong answer. The questions are categorised into 5 topics, with number of questions in the categories in the ratio 10:4:3:2:1. All the questions are multiple choice questions (MCQ) type, with possibly more than one correct answer. Write a program to automatically read the answers, assign marks, and rank the students based on their performance in each of the five topic categories. Your aim should be to reduce time and space complexity, at the same time ensure accurate results.
Things to consider 1. Explain the algorithm and logic of the solution in detail. 2. Explain why you have selected this approach by performing time complexity analysis. Represent the complexity in Big O notation. 3. Show step by step explanation of the code. Include the code within the report. 4. Extensively make use of data structures. List the set of data structures used. 5. Explain when your solution works the best, and when it performs the worst. 6. Explain the algorithm with a flowchart as well as illustration (can be a hand drawing) 7. Check the grammar. Avoid spelling mistakes, spacing errors, capitilisation issues etc. 8. Make your solution unique, even if its a minor advancement from that is already there on internet and literature. Aim to come up with your own ideas.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started