1 / 24

CSC 490 - Senior Seminar I

CSC 490 - Senior Seminar I. This is your most important class!. CSC 490 - Senior Seminar I. This is your most important class!. CSC 490 - Senior Seminar I. Wassn4 due. sassn0 dates …. CSC 490 - Senior Seminar I. NTO text. chapter 25

ralph-osborne
Download Presentation

CSC 490 - Senior Seminar I

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. CSC 490 - Senior Seminar I This is your most important class!

  2. CSC 490 - Senior Seminar I This is your most important class!

  3. CSC 490 - Senior Seminar I Wassn4 due sassn0 dates …

  4. CSC 490 - Senior Seminar I NTO text chapter 25 first read (abstraction)second read (cognition)refer to supplemental texts

  5. CSC 490 - Senior Seminar I Fast Multiplication but first … “regular” multiplication

  6. CSC 490 - Senior Seminar I How do computers multiply? hardware does it …

  7. CSC 490 - Senior Seminar I people memorize rules to do multiplication …

  8. CSC 490 - Senior Seminar I consider a problem 123 * 57 a) break up by column b) perform rules c) add partial results

  9. CSC 490 - Senior Seminar I 123 * 57 ---- 861 615 ---- 7011

  10. CSC 490 - Senior Seminar I as multiplication problem increases in size … time to execute (time complexity) also increases

  11. CSC 490 - Senior Seminar I 743,116 * 4,199 ------- 6,688,044 66,880,440 74,311,600 +2,972,464,000 ------------- 3,120,344,084

  12. CSC 490 - Senior Seminar I is it linear? O(n) no, time complexity O(n2)

  13. CSC 490 - Senior Seminar I consider binary addition requires n two-bit additions time O(n)

  14. CSC 490 - Senior Seminar I rules of binary addition 0 + 0 = 00 0 + 1 = 01 1 + 0 = 01 1 + 1 = 10

  15. CSC 490 - Senior Seminar I do these rules of binary addition always hold true? yes, it is an algorithm

  16. CSC 490 - Senior Seminar I the process of addition does not require “thought” it is an algorithm

  17. CSC 490 - Senior Seminar I to solve the general problem requires a full adder 3 inputs 2 outputs

  18. CSC 490 - Senior Seminar I consider binary multiplication

  19. CSC 490 - Senior Seminar I rules of multiplications 0 * 0 = 0 0 * 1 = 0 1 * 0 = 0 1 * 1 = 1

  20. CSC 490 - Senior Seminar I 1010 * 1011 ------ 1011 1011 0000 + 1011 ----------- 1101110

  21. CSC 490 - Senior Seminar I time complexity of binary multiplication O(n2 + 2n -1) O(n2)

  22. CSC 490 - Senior Seminar I Fast Multiplication why would we want to speed it up?

  23. CSC 490 - Senior Seminar I Is it possible to get multiplication to O(n)? gut reaction? …

  24. CSC 490 - Senior Seminar I NTO … fast multiplication …

More Related