1. COP 3502 Intro to CIS I

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

4. Binary On, Off 0, 1

5. 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

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

11. algorithms

12. n time to solve size of problem

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

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

15. pseudocode

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

17. 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

18. more pseudocode input N1, N2

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

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

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

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

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

24. 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!”

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

26. discussion sections

27. office hours

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

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

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

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

32. exams 10%, 15%, no final

33. exams 10%, 15%, no final

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

35. Statements

36. Statements

37. Statements

38. Statements

39. Boolean Expressions

40. Boolean Expressions

41. Conditions

42. Loops

43. Loops

44. Variables

45. Functions