Question 7

We have ‘n’ patients and ‘m’ problems. The problems are of boolean type. Eg diabetes problem would be ‘T’ if a patient has it or ‘F’ otherwise. Suggest the data structure you would store this scenario on?
Q: We have a set of problems {diabetes, liver disease, kidney disease} find all the patients who have at least the 3 problems from the set.
The number of patients can be huge (n).
The number of problems not comparatively huge (m).
Which would be the best data structure to store these kind of records, so that we have a better search time.

[advanced_iframe securitykey=”undefined” src=”https://code.kodnest.com/” width=”100%” height=”600″]

KodNest Training New Batch is starting on 02nd November 2020. Attend one week free demo classes.Register Now

New Report

Close