Suppose you want to attend as many distinct shows as possible. The list of the shows on that day is released every evening. You do not know what shows will be on sale in the future. Your goal is to design an online algorithm that chooses what shows to attend every day. The algorithm should maximize the number of shows you attend. Please, keep in mind that you do not want to attend the same show twice.
Formally, on day t, your algorithm receives set St with the list of shows available on that day. The algorithm may choose a show from the list St and buy a ticket to this show. The goal of the algorithm is to maximize the number of distinct shows you attend.
Design a 2-competitive deterministic online algorithm and analyze its performance.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Fu
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of