tag:blogger.com,1999:blog-580038470227970026.post9164570256809307638..comments2023-10-20T01:36:56.638-07:00Comments on Macteki Guide on Java Programming: The Game of Video PokerIvan Mactekihttp://www.blogger.com/profile/10134941584335281634noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-580038470227970026.post-23889411568687237312011-10-24T10:26:24.500-07:002011-10-24T10:26:24.500-07:00Hi Ivan,
Can u pls provide the answer to the follo...Hi Ivan,<br />Can u pls provide the answer to the following ques:<br /><br />In a university, students can enroll in different courses. A student may enroll for more than one course. Both students and courses can be identified by IDs given to them. Design a data structure to store students, courses, and the student-course relationships. You can use arrays, lists, stacks, trees, graphs, etc. or come up with your own data structures. Give the running times, in Big O notation, for the following operations for your data structure and justify the answers: a) Return all students in a list. b) Return all courses in a list. c) Return all courses in a list for a given student. d) Return all students in a list for a given course.<br /><br />Thanks in advance!Omnikhttps://www.blogger.com/profile/02051671668426774310noreply@blogger.com