brief course intro math review growable array analysis
play

Brief Course Intro Math Review Growable Array Analysis And in d - PowerPoint PPT Presentation

Pick up an in-class quiz from the table near the door Brief Course Intro Math Review Growable Array Analysis And in d intro ro t to da daily ily qu quiz izzes, w , wort rth 5 5% of gra rade de: Q : Q1 Roll call:


  1. Pick up an in-class quiz from the table near the door Brief Course Intro Math Review Growable Array Analysis

  2. And in d intro ro t to da daily ily qu quiz izzes, w , wort rth 5 5% of gra rade de: Q : Q1  Roll call: ◦ Pronunciations and nicknames ◦ Where you live on campus ◦ You’ll share more with classmates on discussion forum  Matt: ◦ Here since 2005 (but in Zambia in 2011-2012) ◦ Taught CSSE120, 120 Robotics, 220, 221, 230, Image Recognition, Android, Cryptography, Fractals, Mechatronics, Robotics senior design

  3. You ou s show ow Topic ic I d I do You d u do You p practi tice ce off Homework Tests Analysis sets Explain, Listen, follow, show, do read, quiz Major Tests, Programming programs project

  4. Q2 Q2-3  Recall from the syllabus ◦ Work hard ◦ Take initiative in learning  Read the text, search Javadocs, come for help ◦ Focus while in this class ◦ Start early and plan for no all-nighters  Two assignments each week: 1 homework set and 1 major program ◦ Never give or use someone else’s answers

  5. Q4-8 Q4  http://www.rose- hulman.edu/class/csse/csse230/201420/Schedule/Schedule.htm: schedule, assignments, room #s!  www.piazza.com, not email: homework questions ◦ If you email, we’ll usually reply, “Great question! Please post it to Piazza”  moodle.rose-hulman.edu: gradebook, written assignment pdf turn-in

  6. ≥ • java.lang.Math , provides the static methods floor() and ceil()

  7. Q9-10 Q9 10 ≥ Memorize this formula! The sum can also be 6 ∑ Exercise: What is ? i written 2 3 𝑏 𝑜+1 − 1 = i 𝑏 − 1 This will be useful for today's Growable Arrays exercise!

  8. Q11 11-12 Memorize this formula! 40 ∑ Also useful for today's Exercise: What is ? i Growable Arrays exercise! = 21 i

  9. Q13 13-14, t , turn rn in in for (i=n-1; i>0; i--) { find the largest element among a[0] ... a[i] ; exchange the largest element with a[i] ; } • How many comparisons of array elements are done? • How many times are array elements copied? (When en yo you think yo you hav ave the an e answer ers, com ompare re w with ith a a pa part rtner)

  10. An exercise in doubling, done by pairs of students

  11. Orig riginal a l arra rray siz ize = = 5 We don't know in advance how many strings there will be Grow whe hen n neces ecessary How d does s resize() work? What at i is the m main " "overhead ad c cost st" o of resizing? g?

  12.  Work with a partner  Hand in the document before you leave today if possible  Get help as needed from me and the assistants.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend