1 / 4

CompSci 6 Introduction to Computer Science

CompSci 6 Introduction to Computer Science. November 3, 2011 Prof. Rodger. Announcements. No Reading for next time Assignment 5 coming out soon! Today More on dictionaries Finish APT. Problem:.

ljoel
Download Presentation

CompSci 6 Introduction to Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CompSci 6Introduction to Computer Science November 3, 2011 Prof. Rodger

  2. Announcements • No Reading for next time • Assignment 5 coming out soon! • Today • More on dictionaries • Finish APT

  3. Problem: • Suppose we get data which is a list of strings, each string is the top three songs one student likes in the order 1,2,3. songs = ["Hey Jude:Let it be:Day Tripper", "Let it be:Drive my car:Hey Jude", "I want to hold your hand:DayTripper:Help!", "Born to run:Thunderroad:She's the one", "Hungry heart:Theriver:Born to run", "The river:Thunderroad:Drive my car", "Angie:Start me up:Ruby Tuesday", "Born to run:Angie:Drive my car"]

  4. Problem: • What type of dictionary should we build? • Answer questions: • Which is the most popular first place song? • Which is the most popular song (unweighted)? • Which is the most popular song weighted (3 points top song, 2 points 2cd song, 1 point last song).

More Related