1 / 45

Intro to CIS I

COP 3502. Intro to CIS I. 70% cop 3502 students who have no prior cs experience . Binary. On, Off 0, 1. ASCII. A B C D E F G H I J K L M

eldon
Télécharger la présentation

Intro to CIS 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. COP 3502 Intro to CIS I

  2. 70% cop 3502 students who have no prior cs experience

  3. Binary On, Off 0, 1

  4. ASCII A B C D E F G H I J K L M • 66 67 68 69 70 71 72 73 74 75 76 77 N O P Q R S T U V W X Y Z 78 79 80 81 82 83 84 85 86 87 88 89 90

  5. Introduction to problem solving algorithmically and computationally as well as the art of programming

  6. algorithms

  7. n time to solve size of problem

  8. n n/2 time to solve size of problem

  9. n n/2 time to solve log n size of problem

  10. pseudocode

  11. n n/2 time to solve log n size of problem

  12. Pseudocode • Stand up and assign yourself a “1” • Find another person and combine numbers, assigning yourself the new sum • The shorter person sits down while the tallest goes back to step 2

  13. more pseudocode input N1, N2

  14. more pseudocode input N1, N2 SUM  N1 + N2

  15. more pseudocode input N1, N2 SUM  N1 + N2 AVG  SUM/2

  16. more pseudocode input N1, N2 SUM  N1 + N2 AVG  SUM/2 print AVG

  17. more pseudocode input N1, N2, N3 SUM  N1 + N2 SUM  SUM + N3 AVG  SUM/3 print AVG

  18. more pseudocode SUM  0 for each n in N SUM  SUM + n AVG  SUM/size(N) print AVG

  19. more pseudocode SUM  0 for each n in N SUM  SUM + n AVG  SUM/size(N) if AVG > 80 print “Good job!” else print “Too much Facebook!”

  20. lectures M, W, F 10:40-11:30 e119 M, W, F 11:45-12:35 a101

  21. discussion sections

  22. office hours

  23. course structure • Introduction • Working with Numbers • Working with Objects • Working with Words • Working with Games • Working with the Web

  24. books • Think Java: Learn to Think Like a Computer Scientist • Introduction to Programming Using Java, 6th edition • Thinking in Java, 3rd edition

  25. problem sets 7 total, late days, increasing challenge and worth

  26. problem sets • Scratch – 3% • Crytography – 5% • Googol Maps – 7% • Game of Fifteen – 11% • Spell-checker – 13% • Maryo – 17% • Twizzler – 19%

  27. exams 10%, 15%, no final

  28. exams 10%, 15%, no final

  29. website http://www.cop3502.com syllabus, lecture notes, lecture recordings, office hours, problem sets, etc.

  30. Statements

  31. Statements

  32. Statements

  33. Statements

  34. Boolean Expressions

  35. Boolean Expressions

  36. Conditions

  37. Loops

  38. Loops

  39. Variables

  40. Functions

More Related