Difference between revisions of "EGR 103/Concept List/F23"

From PrattWiki
Jump to navigation Jump to search
(Created page with "== Lecture 1 - 8/28 - Course Introduction == * Main class page: [http://classes.pratt.duke.edu/EGR103F23/ EGR 103L] ** Includes links to Canvas, Pundit, and Ed pages * Sakai p...")
 
Line 8: Line 8:
 
** Watch video on [https://www.coursera.org/lecture/duke-programming-web/a-seven-step-approach-to-solving-programming-problems-AEy5M A Seven Step Approach to Solving Programming Problems]
 
** Watch video on [https://www.coursera.org/lecture/duke-programming-web/a-seven-step-approach-to-solving-programming-problems-AEy5M A Seven Step Approach to Solving Programming Problems]
 
** See Seven steps of programming [https://adhilton.pratt.duke.edu/sites/adhilton.pratt.duke.edu/files/u37/iticse-7steps.pdf The Seven Steps Poster].
 
** See Seven steps of programming [https://adhilton.pratt.duke.edu/sites/adhilton.pratt.duke.edu/files/u37/iticse-7steps.pdf The Seven Steps Poster].
 +
 +
== Lecture 2 - 9/1 - Introduction to Programming ==
 +
* Seven steps of programming [https://adhilton.pratt.duke.edu/sites/adhilton.pratt.duke.edu/files/u37/iticse-7steps.pdf The Seven Steps Poster].  Also, for next Friday's class:
 +
** Watch video on [https://www.coursera.org/lecture/duke-programming-web/developing-an-algorithm-nopgq Developing an Algorithm]
 +
** Watch video on [https://www.coursera.org/lecture/duke-programming-web/a-seven-step-approach-to-solving-programming-problems-AEy5M A Seven Step Approach to Solving Programming Problems]
 +
* Almost all languages have input, output, math, conditional execution (decisions), and repetition (loops)
 +
* Problem: Consider how to decide if a number is a prime number
 +
** Some "shortcuts" for specific factors (2, 3, and 5, for example) but need to have a generalized approach
 +
** See if number is evenly divisible by any integer between 2 and the square root of the number - but how do we ask the ''computer'' to do that?
 +
* Very quick tour of Python with Spyder
 +
** Console (with history tab), info box (with variable explorer, files, and other tabs), and editing window
 +
** Pushing "play" button or hitting F5 will save the script, change the working directory, and run the script
 +
** Quick introduction to variable types: int, float, str
 +
** Quick introduction to indexing: Python is "0" indexed, meaning if there is a collection of items called x, x[0] will be the "first" item in the collection and x[N-1] where N is the total number of items will be the last item.  Also, reverse indexing, where x[-1] is the last item and x[-N] is the first item.

Revision as of 16:27, 1 September 2023

Lecture 1 - 8/28 - Course Introduction

Lecture 2 - 9/1 - Introduction to Programming

  • Seven steps of programming The Seven Steps Poster. Also, for next Friday's class:
  • Almost all languages have input, output, math, conditional execution (decisions), and repetition (loops)
  • Problem: Consider how to decide if a number is a prime number
    • Some "shortcuts" for specific factors (2, 3, and 5, for example) but need to have a generalized approach
    • See if number is evenly divisible by any integer between 2 and the square root of the number - but how do we ask the computer to do that?
  • Very quick tour of Python with Spyder
    • Console (with history tab), info box (with variable explorer, files, and other tabs), and editing window
    • Pushing "play" button or hitting F5 will save the script, change the working directory, and run the script
    • Quick introduction to variable types: int, float, str
    • Quick introduction to indexing: Python is "0" indexed, meaning if there is a collection of items called x, x[0] will be the "first" item in the collection and x[N-1] where N is the total number of items will be the last item. Also, reverse indexing, where x[-1] is the last item and x[-N] is the first item.