CSE 115. Introduction to Computer Science I
|
|
- Laurel Sullivan
- 5 years ago
- Views:
Transcription
1 CSE 115 Introduction to Computer Science I
2 Progress In UBInfinite? A. Haven't started B. Earned 3 stars in "Calling Functions" C. Earned 3 stars in "Defining Functions" D. Earned 3 stars in "Conditionals" E. Earned 1+ stars in "Module 1 PreLab" F. Earned 3 stars in "Module 1 PreLab"
3 Announcements Lab exam #1 in labs next week Need 3 stars on Python's Module 1 PreLab Available for first 55 minutes of lab Only students taking Lab Exam allowed in Baldy 21 If you want paper, UTA can provide blank sheets Bring your own pens/pencils; UTAs cannot share
4 Announcements For lab exam #1: Will need to write 3 short Python functions 1 st function should be simple 2 nd & 3 rd functions slightly more complex
5 Today's Plan Review Functions and control flow
6 Selection Statement: if Parts Of if Statement Header if keyword guard expression if a < b and a < c
7 Execution Path When Expression is True x = 12 y = 14 if z < y : z = x print(z)
8 Execution Path When Expression is False x = 12 y = 14 if z < y : print(z)
9 After if Statement print(z) Code after if statement ALWAYS executed
10 Selection Statement: if-elif-else
11 Selection Statement: if-elif-else Parts of an if-elif-else Statement if header delimiter elif header else header if a < b and a < c : print('a is the smallest') smallest = a elif b < a and b < c : print('b is the smallest') smallest = b else : print('c is the smallest') smallest = c if body delimiter elif body delimiter else body
12 Selection Execution Subgoal 1. Determine if the guard expression evaluates to True or False 2. If expression evaluates to True, run the code suite. When code suite finishes, skip to the first statement after the selection statement If expression evaluates to False, skip past the code suite
13 Execution Path When a is 5, b is 7, c is 5.2 if a < b and a < c : print('a small') sm = a print(sm)
14 Execution Path When a is 5, b is 6, c is 4.5 if a < b and a < c : elif b < c and x == 2 : else : print('weird') z = c print(sm)
15 Which Control Flow Shows an If-Elif-Else? a) b) c) d)
16 Which Control Flow Shows an If-Elif-Else? a) b) c) d)
17 Selection Writing Subgoals 1. Determine number of distinct paths needed 2. For each path, write guard expression for when that path should be executed a) List guard expressions in order from the most-restrictive to least-restrictive 3. Write the if(-elif)(-else) statement
18 Selection Statements if-elif-elif-elif No limit on number of elifs you can add Boolean expressions can be anything; no relationship required No restrictions to suites; do not need to be related else also optional, but if used else must be after the elifs Python jumps to end once suite run; at most 1 if/elif/else run
19 Today's Plan Functions and control flow
20 Function in Math Want function which takes in a single input. The function should return the sum of: the input squared; the input multiplied by 5; and the number 2. f x =
21 Function in Math Want function which takes in a single input. The function should return the sum of: the input squared; the input multiplied by 5; and the number 2. f x = x 2 + 5x + 2
22 Math to Python Now want to write this as a Python function def f(x): f x = x 2 + 5x + 2
23 Math to Python Now want to write this as a Python function f x = x 2 + 5x + 2 def f(x): return (x ** 2) + (x * 5) + 2
24 Smaller (of 2) Want function which returns smaller param (For purposes of this exercise, cannot use built-in min() function) Work with neighbors and be prepared to: explain your answer (in English) & show steps involved (in control flow)
25 Smaller (of 2) Want function which returns smaller param (For purposes of this exercise, cannot use built-in min() function) Work with neighbors and be prepared to: explain your answer (in English) & show steps involved (in control flow)
26 Smaller (of 2) One possible solution (in Python): def smaller(x, y):
27 Smaller (of 2) One possible solution (in Python): def smaller(x, y): if ( x < y ) : else :
28 Smaller (of 2) One possible solution (in Python): def smaller(x, y): if ( x < y ) : return x else :
29 Smaller (of 2) One possible solution (in Python): def smaller(x, y): if ( x < y ) : return x else : return y
30 Smaller (of 2) One possible solution (in Python): def smaller(x, y): if ( x < y ) : return x else : return y
31 Smaller (of 2) One possible solution (in Python): def smaller(x, y): if ( x < y ) : return x else : return y Mistakes happen; critical to verify code works smaller(4, 5) has value 4 smaller(5, -1) has value -1 smaller(8, 8) has value 8
32 Smaller (of 2) One possible solution (in Python): def smaller(x, y): if ( x < y ) : return x else : return y Mistakes happen; critical to verify code works smaller(4, 5) has value 4 smaller(5, -1) has value -1 smaller(8, 8) has value 8
33 Smallest (of 3) Function which returns smallest params (For learning purposes, min() still banned) Work with neighbors and be prepared to: explain your answer (in English) & show steps involved (in control flow)
34 Smallest (of 3) Function which returns smallest params (For learning purposes, min() still banned) Work with neighbors and be prepared to: explain your answer (in English) & show steps involved (in control flow)
35 Smallest (of 3) One possible solution (in Python): def smallest(x, y, z): if (x <= y <= z or x <= z <= y) : return x elif (y <= x <= z or y <= z <= x) : return y else : return z
36 Smallest (of 3) One possible solution (in Python): def smallest(x, y, z): if (x <= y <= z or x <= z <= y) : return x elif (y <= x <= z or y <= z <= x) : return y else : return z
37 Smallest (of 3) One possible solution (in Python): def smallest(x, y, z): if (x <= y <= z or x <= z <= y) : return x elif (y <= x <= z or y <= z <= x) : return y else : return z I lied; I do not like to live dangerously
38 Smallest (of 3) One possible solution (in Python): def smallest(x, y, z): if (x <= y <= z or x <= z <= y) : return x elif (y <= x <= z or y <= z <= x) : return y else : return z I lied; I do not like to live dangerously smallest(4, 395, 7) has value 4 smallest(1, 0, 74) has value 0 smallest(-1, -2, -3) has value -3
39 Smallest (of 3) "Code golf" solution def smallestv2(x, y, z): return smaller(smaller(x, y), z)
40 Smallest (of 3) "Code golf" solution
CSE 115. Introduction to Computer Science I
CSE 115 Introduction to Computer Science I Announcements Lab activites/lab exams submit regularly to autograder.cse.buffalo.edu Announcements Lab activites/lab exams submit regularly to autograder.cse.buffalo.edu
More informationComp 150 Exam 2 Overview.
Comp 150 Exam 2 Overview. Resources During the Exam The exam will be closed book, no calculators or computers. You may bring notes on two sides of 8.5x11 inch paper (either both sides of one sheet, or
More informationLecture 8: Conditionals & Control Flow (Sections ) CS 1110 Introduction to Computing Using Python
http://www.cs.cornell.edu/courses/cs1110/2018sp Lecture 8: Conditionals & Control Flow (Sections 5.1-5.7) CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner,
More informationEXAMINATION INSTRUCTIONS
Midterm exam CSE5/503 Computer Science I Spring 209 EXAMINATION INSTRUCTIONS This examination has 9 pages. If your copy is missing a page, let one of the course staff know. Before starting this test, students
More informationPart 1 (80 points) Multiple Choice Questions (20 questions * 4 points per question = 80 points)
EECS 183 Fall 2013 Exam 1 Part 1 (80 points) Closed Book Closed Notes Closed Electronic Devices Closed Neighbor Turn off Your Cell Phones We will confiscate all electronic devices that we see including
More informationControl Flow: Branching booleans and selection statements CS GMU
Control Flow: Branching booleans and selection statements CS 112 @ GMU Topics booleans selection statements: if if-else if-elif(s) if-elif(s)-else flow charts 2 Booleans Booleans - examples Booleans are
More informationCMSC 201 Computer Science I for Majors
CMSC 201 Computer Science I for Majors Lecture 02 Intro to Python Syllabus Last Class We Covered Grading scheme Academic Integrity Policy (Collaboration Policy) Getting Help Office hours Programming Mindset
More information1. What is the minimum number of bits needed to store a single piece of data representing: a. An integer between 0 and 100?
1 CS 105 Review Questions Most of these questions appeared on past exams. 1. What is the minimum number of bits needed to store a single piece of data representing: a. An integer between 0 and 100? b.
More informationCS177 Python Programming. Recitation 2 - Computing with Numbers
CS177 Python Programming Recitation 2 - Computing with Numbers Outline Data types. Variables Math library. Range Function What is data (in the context of programming)? Values that are stored and manipulated
More informationTHE AUSTRALIAN NATIONAL UNIVERSITY Final Examination November COMP1730 / COMP6730 Programming for Scientists
THE AUSTRALIAN NATIONAL UNIVERSITY Final Examination November 2016 COMP1730 / COMP6730 Programming for Scientists Study Period: 15 minutes Time Allowed: 3 hours Permitted Materials: One A4 page (1 sheet)
More informationPython lab session 1
Python lab session 1 Dr Ben Dudson, Department of Physics, University of York 28th January 2011 Python labs Before we can start using Python, first make sure: ˆ You can log into a computer using your username
More informationCS 112: Intro to Comp Prog
CS 112: Intro to Comp Prog Importing modules Branching Loops Program Planning Arithmetic Program Lab Assignment #2 Upcoming Assignment #1 Solution CODE: # lab1.py # Student Name: John Noname # Assignment:
More informationEXAMINATION INSTRUCTIONS
Midterm exam CSE115/503 Computer Science I Spring 2019 EXAMINATION INSTRUCTIONS This examination has 9 pages. If your copy is missing a page, let one of the course staff know. Before starting this test,
More informationFlow Control. So Far: Writing simple statements that get executed one after another.
Flow Control So Far: Writing simple statements that get executed one after another. Flow Control So Far: Writing simple statements that get executed one after another. Flow control allows the programmer
More information15-110: Principles of Computing, Spring 2018
15-110: Principles of Computing, Spring 2018 Programming Assignment 3 Due: Tuesday, February 6 by 9PM Note: You are responsible for protecting your solutions to the following problems from being seen by
More information61A Lecture 3. Friday, September 5
61A Lecture 3 Friday, September 5 Announcements There's plenty of room in live lecture if you want to come (but videos are still better) Please don't make noise outside of the previous lecture! Homework
More informationComputer Science 217
Computer Science 17 Midterm Exam March 5, 014 Exam Number 1 First Name: Last Name: ID: Class Time (Circle One): 1:00pm :00pm Instructions: Neatly print your names and ID number in the spaces provided above.
More information1 Truth. 2 Conditional Statements. Expressions That Can Evaluate to Boolean Values. Williams College Lecture 4 Brent Heeringa, Bill Jannen
1 Truth Last lecture we learned about the int, float, and string types. Another very important object type in Python is the boolean type. The two reserved keywords True and False are values with type boolean.
More informationConditionals and Recursion. Python Part 4
Conditionals and Recursion Python Part 4 Modulus Operator Yields the remainder when first operand is divided by the second. >>>remainder=7%3 >>>print (remainder) 1 Boolean expressions An expression that
More informationSTATS 507 Data Analysis in Python. Lecture 2: Functions, Conditionals, Recursion and Iteration
STATS 507 Data Analysis in Python Lecture 2: Functions, Conditionals, Recursion and Iteration Functions in Python We ve already seen examples of functions: e.g., type()and print() Function calls take the
More informationTHE AUSTRALIAN NATIONAL UNIVERSITY Mid Semester Examination September COMP1730 / COMP6730 Programming for Scientists
THE AUSTRALIAN NATIONAL UNIVERSITY Mid Semester Examination September 2016 COMP1730 / COMP6730 Programming for Scientists Study Period: 15 minutes Time Allowed: 2 hours Permitted Materials: One A4 page
More informationLists How lists are like strings
Lists How lists are like strings A Python list is a new type. Lists allow many of the same operations as strings. (See the table in Section 4.6 of the Python Standard Library Reference for operations supported
More informationPython review. 1 Python basics. References. CS 234 Naomi Nishimura
Python review CS 234 Naomi Nishimura The sections below indicate Python material, the degree to which it will be used in the course, and various resources you can use to review the material. You are not
More informationIntroduction to Python (All the Basic Stuff)
Introduction to Python (All the Basic Stuff) 1 Learning Objectives Python program development Command line, IDEs, file editing Language fundamentals Types & variables Expressions I/O Control flow Functions
More informationPREPARING FOR PRELIM 1
PREPARING FOR PRELIM 1 CS 1110: FALL 2012 This handout explains what you have to know for the first prelim. There will be a review session with detailed examples to help you study. To prepare for the prelim,
More informationFUNctions. Lecture 03 Spring 2018
FUNctions Lecture 03 Spring 2018 Announcements PS0 Due Tomorrow at 11:59pm WS1 Released soon, due next Friday 2/2 at 11:59pm Not quite understand a topic in lecture this week? Come to Tutoring Tomorrow
More informationCSSE 120 Introduction to Software Development Practice for Test 1 paper-and-pencil part Page 1 of 6
CSSE 120 Introduction to Software Development Practice for Test 1 paper-and-pencil part Page 1 of 6 Name: Use this quiz to help you prepare for the Paper-and-Pencil portion of Test 1. Complete it electronically
More informationControl Flow: Loop Statements
Control Flow: Loop Statements A loop repeatedly executes a of sub-statements, called the loop body. Python provides two kinds of loop statements: a for-loop and a while-loop. This exercise gives you practice
More informationVariable and Data Type I
Islamic University Of Gaza Faculty of Engineering Computer Engineering Department Lab 2 Variable and Data Type I Eng. Ibraheem Lubbad September 24, 2016 Variable is reserved a location in memory to store
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 24 Sorting Prof. Jeremy Dixon Based on slides from previous iterations of the course Surveys Blackboard Survey worth 1% of your final grade. Take a few minutes
More informationLists, loops and decisions
Caltech/LEAD Summer 2012 Computer Science Lecture 4: July 11, 2012 Lists, loops and decisions Lists Today Looping with the for statement Making decisions with the if statement Lists A list is a sequence
More informationCSCE 110: Programming I
CSCE 110: Programming I Sample Questions for Exam #1 February 17, 2013 Below are sample questions to help you prepare for Exam #1. Make sure you can solve all of these problems by hand. For most of the
More informationSelection Statement ( if )
Islamic University Of Gaza Faculty of Engineering Computer Engineering Department Lab 4 Selection Statement ( if ) Eng. Ibraheem Lubbad October 10, 2016 In this lab we will constructs program that allow
More informationCS 2316 Exam 1 Spring 2014
CS 2316 Exam 1 Spring 2014 Name : Grading TA: Integrity: By taking this exam, you pledge that this is your work and you have neither given nor received inappropriate help during the taking of this exam
More informationGetting Started. Office Hours. CSE 231, Rich Enbody. After class By appointment send an . Michigan State University CSE 231, Fall 2013
CSE 231, Rich Enbody Office Hours After class By appointment send an email 2 1 Project 1 Python arithmetic Do with pencil, paper and calculator first Idle Handin Help room 3 What is a Computer Program?
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 05 Algorithmic Thinking Last Class We Covered Decision structures One-way (using if) Two-way (using if and else) Multi-way (using if, elif, and else) Nested
More informationFinal Exam Practice Questions
Final Exam Practice Questions Note that while these questions are great practice for the final exam, they do not necessarily cover ever topic or question type that could appear on the exam. You are strongly
More informationPython - Conditional Execution
Python - Conditional Execution x = 5 X < 10? Yes Conditional Steps Program: print 'Smaller' x = 5 Output: if x < 10: X > 20? Yes print 'Smaller Smaller Finis print 'Bigger' if x > 20: print 'Bigger' print
More informationCSE 20. Lecture 4: Number System and Boolean Function. CSE 20: Lecture2
CSE 20 Lecture 4: Number System and Boolean Function Next Weeks Next week we will do Unit:NT, Section 1. There will be an assignment set posted today. It is just for practice. Boolean Functions and Number
More informationLecture 11: Iteration and For-Loops
http://www.cs.cornell.edu/courses/cs0/08sp Lecture : Iteration and For-Loops (Sections 4. and 0.3) CS 0 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner, C.
More informationClasses, Types, and Objects
Classes, Types, and Objects Lecture 6 npm run pull npm run start pollev.com/comp110 Announcements PS1 Due Friday Full EC deadline is TODAY 11:59pm Partial EC on Thurs Due Friday at 11:59pm Review Session
More informationIntroduction to Mathematical and Scientific Programming TUTORIAL WEEK 2 (MATH 1MP3) Winter 2019
TUTORIAL WEEK 2 Introduction to Mathematical and Scientific Programming (MATH 1MP3) Winter 2019 We will review: String Slicing Lists Conditionals Loops Some Examples for String Slicing A="This is an apple"
More informationFirst name (printed): a. DO NOT OPEN YOUR EXAM BOOKLET UNTIL YOU HAVE BEEN TOLD TO BEGIN.
CSE 231 F 13 Exam #1 Last name (printed): First name (printed): Form 1 X Directions: a. DO NOT OPEN YOUR EXAM BOOKLET UNTIL YOU HAVE BEEN TOLD TO BEGIN. b. This exam booklet contains 25 questions, each
More informationLab 2: Introduction to LabVIEW 8.5
Lab 2: Introduction to LabVIEW 8.5 INTRODUCTION: This lab is designed as an introduction to using LabVIEW. In this lab you will run through some tutorials to get a basic understanding of some of the LabVIEW
More informationCSE 113 A. Announcements - Lab
CSE 113 A February 21-25, 2011 Announcements - Lab Lab 1, 2, 3, 4; Practice Assignment 1, 2, 3, 4 grades are available in Web-CAT look under Results -> Past Results and if looking for Lab 1, make sure
More informationIntroduction to Programming
Introduction to Programming Python Lab 7: if Statement PythonLab7 lecture slides.ppt 14 November 2017 Ping Brennan (p.brennan@bbk.ac.uk) 1 Getting Started Create a new folder in your disk space with the
More informationCS 1110, LAB 12: SEQUENCE ALGORITHMS First Name: Last Name: NetID:
CS 1110, LAB 12: SEQUENCE ALGORITHMS http://www.cs.cornell.edu/courses/cs1110/2014fa/labs/lab12.pdf First Name: Last Name: NetID: This last lab is extremely important. It helps you understand how to construct
More informationCh.2: Loops and lists
Ch.2: Loops and lists Joakim Sundnes 1,2 Hans Petter Langtangen 1,2 Simula Research Laboratory 1 University of Oslo, Dept. of Informatics 2 Aug 29, 2018 Plan for 28 August Short quiz on topics from last
More informationCS1 Lecture 4 Jan. 23, 2019
CS1 Lecture 4 Jan. 23, 2019 First graded discussion sections this week yesterday/today 10 DS assignments worth 2 points each everyone gets one free 2-pointer. I.e. your lowest DS grade will be replaced
More informationCompSci 101 Introduction to Computer Science
CompSci 101 Introduction to Computer Science score = [10,8,10,9] Feb. 7, 2017 Prof. Rodger compsci 101, spring17 1 Announcements Reading and RQ8 due next time Assignment 3 due tonight Assignment 4 out,
More informationControl Structures 1 / 17
Control Structures 1 / 17 Structured Programming Any algorithm can be expressed by: Sequence - one statement after another Selection - conditional execution (not conditional jumping) Repetition - loops
More informationExam 1 Format, Concepts, What you should be able to do, and Sample Problems
CSSE 120 Introduction to Software Development Exam 1 Format, Concepts, What you should be able to do, and Sample Problems Page 1 of 6 Format: The exam will have two sections: Part 1: Paper-and-Pencil o
More informationTest #2 October 8, 2015
CPSC 1040 Name: Test #2 October 8, 2015 Closed notes, closed laptop, calculators OK. Please use a pencil. 100 points, 5 point bonus. Maximum score 105. Weight of each section in parentheses. If you need
More informationIntroduction to: Computers & Programming: Review prior to 1 st Midterm
Introduction to: Computers & Programming: Review prior to 1 st Midterm Adam Meyers New York University Summary Some Procedural Matters Summary of what you need to Know For the Test and To Go Further in
More informationStructure and Interpretation of Computer Programs Spring 2017 Mock Midterm 1
CS 61A Structure and Interpretation of Computer Programs Spring 2017 Mock Midterm 1 INSTRUCTIONS You have 1 hour to complete the exam. The exam is closed book, closed notes, closed computer, closed calculator,
More informationSelection statements. CSE 1310 Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington
Selection s CSE 1310 Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1 Book reference Book: The practice of Computing Using Python 2-nd edition Second hand book
More informationPython Programming: An Introduction to Computer Science
Python Programming: An Introduction to Computer Science Chapter 7 Decision Structures Python Programming, 2/e 1 Simple Decisions So far, we ve viewed programs as sequences of instructions that are followed
More informationMath 15 - Spring Homework 5.2 Solutions
Math 15 - Spring 2017 - Homework 5.2 Solutions 1. (5.2 # 14 (not assigned)) Use Prim s algorithm to construct a minimal spanning tree for the following network. Draw the minimal tree and compute its total
More informationCS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, Good Luck!
CS 303E Fall 2011 Exam 2 Solutions and Criteria November 2, 2011 Name: EID: Section Number: Friday discussion time (circle one): 9-10 10-11 11-12 12-1 2-3 Friday discussion TA(circle one): Wei Ashley Answer
More informationIn addition to the correct answer, you MUST show all your work in order to receive full credit.
In addition to the correct answer, you MUST show all your work in order to receive full credit. Questions Mark: Question1) Multiple Choice Questions /10 Question 2) Binary Trees /15 Question 3) Linked
More informationPython Boot Camp. Day 3
Python Boot Camp Day 3 Agenda 1. Review Day 2 Exercises 2.Getting input from the user, Interview Lab 3.Scopes 4.Conditionals, Mood Ring Lab 5.Recursion, Recursion Lab Day 2 Exercises Think Python Ch. 3
More informationMath 180 Written Homework Solutions Assignment #1 Due Thursday, September 4th at the beginning of your discussion class.
Math 180 Written Homework Solutions Assignment #1 Due Thursday, September 4th at the beginning of your discussion class. Directions. You are welcome to work on the following problems with other MATH 180
More informationCS 1301 Exam 1 Fall 2010
CS 1301 Exam 1 Fall 2010 Name : Grading TA: Integrity: By taking this exam, you pledge that this is your work and you have neither given nor received inappropriate help during the taking of this exam in
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 08 Lists Constants Last Class We Covered More on while loops Sentinel loops Boolean flags 2 Any Questions from Last Time? 3 Today s Objectives To learn about
More informationCS150 - Sample Final
CS150 - Sample Final Name: Honor code: You may use the following material on this exam: The final exam cheat sheet which I have provided The matlab basics handout (without any additional notes) Up to two
More informationLab1. Introduction to Python. Lab 4: Selection Statement. Eng. Mai Z. Alyazji
Islamic University of Gaza Faculty of Engineering Computer Engineering Dept. Introduction to Computers Lab (ENGG 1003) Lab1 Introduction to Python Lab 4: Selection Statement Eng. Mai Z. Alyazji In this
More informationIntroduction to Python
Introduction to Python EECS 4415 Big Data Systems Tilemachos Pechlivanoglou tipech@eecs.yorku.ca 2 Background Why Python? "Scripting language" Very easy to learn Interactive front-end for C/C++ code Object-oriented
More informationCS177 Recitation. Functions, Booleans, Decision Structures, and Loop Structures
CS177 Recitation Functions, Booleans, Decision Structures, and Loop Structures Functions Collection of instructions that perform a task as: o Printing your name and course. o Calculating the average of
More informationSCoLang - Language Reference Manual
SCoLang - Language Reference Manual Table of Contents: 1. Introduction 2. Types a. Basic Data types b. Advanced Data types 3. Lexical Convention a. Identifiers b. Keywords c. Comments d. Operators e. Punctuators
More informationSpring 2015 COP 3223 Section 4 Exam #1 Multiple Choice Version A
Spring 2015 COP 3223 Section 4 Exam #1 Multiple Choice Version A 1) What is the value of the following arithmetic expression in Python? 17//3-17%3 A) 0 B) 1 C) 2 D) 3 2) What is the output of the following
More informationCSE 115. Introduction to Computer Science I
CSE 115 Introduction to Computer Science I Note about posted slides The slides we post will sometimes contain additional slides/content, beyond what was presented in any one lecture. We do this so the
More informationC ONTROL AND H IGHER O RDER F UNCTIONS
Name: Date: Period: Name 2: Name 3: Name 4: 20 points C ONTROL AND H IGHER O RDER F UNCTIONS (Review questions from readings and labs) 1 Instructions: Complete all 9S CIENCE discussion C OMPUTER 61A questions.
More informationPYTHON NUMPY TUTORIAL CIS 581
PYTHON NUMPY TUTORIAL CIS 581 VARIABLES AND SPYDER WORKSPACE Spyder is a Python IDE that s a part of the Anaconda distribution. Spyder has a Python console useful to run commands quickly and variables
More informationCOP 3223 Section 4 Exam #1 Form A Multiple Choice Fall /27/2014
COP 3223 Section 4 Exam #1 Form A Multiple Choice Fall 2014 9/27/2014 Lecturer: Arup Guha Directions: Answer all multiple choice questions on the scantron. Each question has a single correct answer. In
More informationCS 115 Exam 3, Spring 2014
Your name: Rules You may use one handwritten 8.5 x 11 cheat sheet (front and back). This is the only resource you may consult during this exam. Explain/show work if you want to receive partial credit for
More informationCopied from: https://www.cs.hmc.edu/twiki/bin/view/cs5/lab1b on 3/20/2017
Hw 1, Part 2 (Lab): Functioning smoothly! Using built-in functions Copied from: https://www.cs.hmc.edu/twiki/bin/view/cs5/lab1b on 3/20/2017 First, try out some of Python's many built-in functions. These
More informationCS1 Lecture 13 Feb. 13, 2019
CS1 Lecture 13 Feb. 13, 2019 Exam 1, Thursday evening, 2/21, 6:30-8:00pm, W290 CB Email about make-ups will be sent tomorrow HW4 Q1 available. Q2 Q4 tomorrow. For Q1 only, Academic Honesty policy does
More informationFundamentals of Programming (Python) Control Structures. Sina Sajadmanesh Sharif University of Technology Fall 2017
Fundamentals of Programming (Python) Control Structures Sina Sajadmanesh Sharif University of Technology Some slides have been adapted from Python: How to Program 1 st Edition Outline 1. Control Structures
More informationIntroduction to Programming
Introduction to Programming Department of Computer Science and Information Systems Steve Maybank sjmaybank@dcs.bbk.ac.uk Spring 2018 Week 9: Functions 9 March 2018 Birkbeck College, U. London 1 Exercise
More informationVisualize ComplexCities
Introduction to Python Chair of Information Architecture ETH Zürich February 22, 2013 First Steps Python Basics Conditionals Statements Loops User Input Functions Programming? Programming is the interaction
More informationData 8 Final Review #1
Data 8 Final Review #1 Topics we ll cover: Visualizations Arrays and Table Manipulations Programming constructs (functions, for loops, conditional statements) Chance, Simulation, Sampling and Distributions
More informationLecture 02 Making Decisions: Conditional Execution
Lecture 02 Making Decisions: Conditional Execution 1 Flow of Control Flow of control = order in which statements are executed By default, a program's statements are executed sequentially, from top to bottom.
More informationProgramming Languages
Programming Languages Week 2 Exercises 0. a) Open an interactive Python 2 session (either in a terminal window, or in an IDE that allows small sections of code to be executed). To open a terminal window
More informationLecture #7: Recursion (and a data structure)
Lecture #7: Recursion (and a data structure) Announcements: A message from the AWE: The Association of Women in EECS is hosting a 61A party this Sunday (2/9) from 1 3PM in the Woz! Come hang out, befriend
More informationboolean Expressions Relational and Equality Operators and if-then-else Conditional Control Statement
boolean Expressions Relational and Equality Operators and if-then-else Conditional Control Statement Go to poll.unc.edu Sign-in via this website then go to pollev.com/compunc VSCode: Open Project -> View
More informationPractice with if-then-else. COMP101 Lecture 7 Spring 2018
Practice with if-then-else COMP101 Lecture 7 Spring 2018 Announcements PS01 - Due Friday at 11:59pm 3 parts, each in increasing difficulty. You will submit individually for each. Tutoring - Tomorrow from
More informationIntroduction to Scientific Python, CME 193 Jan. 9, web.stanford.edu/~ermartin/teaching/cme193-winter15
1 LECTURE 1: INTRO Introduction to Scientific Python, CME 193 Jan. 9, 2014 web.stanford.edu/~ermartin/teaching/cme193-winter15 Eileen Martin Some slides are from Sven Schmit s Fall 14 slides 2 Course Details
More informationCSc 110, Autumn Lecture 26: Assertions. Adapted from slides by Marty Stepp and Stuart Reges
CSc 110, Autumn 2017 Lecture 26: Assertions Adapted from slides by Marty Stepp and Stuart Reges Section attendance question Read a file of section attendance (see next slide): yynyyynayayynyyyayanyyyaynayyayyanayyyanyayna
More informationMachine Learning (CSE 446): Unsupervised Learning
Machine Learning (CSE 446): Unsupervised Learning Sham M Kakade c 2018 University of Washington cse446-staff@cs.washington.edu 1 / 19 Announcements HW2 posted. Due Feb 1. It is long. Start this week! Today:
More informationLecture 7. Memory in Python
Lecture 7 Memory in Python Announcements For This Lecture Readings Reread Chapter 3 No reading for Thursday Lab Work on Assignment Credit when submit A Nothing else to do Assignment Moved to Fri, Sep.
More informationCS Boolean Statements and Decision Structures. Week 6
CS 17700 Boolean Statements and Decision Structures Week 6 1 Announcements Midterm 1 is on Feb 19 th, 8:00-9:00 PM in PHYS 114 and PHYS 112 Let us know in advance about conflicts or other valid makeup
More informationVariable and Data Type I
The Islamic University of Gaza Faculty of Engineering Dept. of Computer Engineering Intro. To Computers (LNGG 1003) Lab 2 Variable and Data Type I Eng. Ibraheem Lubbad February 18, 2017 Variable is reserved
More informationINTERMEDIATE LEVEL PYTHON PROGRAMMING SELECTION AND CONDITIONALS V1.0
INTERMEDIATE LEVEL PYTHON PROGRAMMING SELECTION AND CONDITIONALS V1.0 OCTOBER 2014 Python Selection and Conditionals 1 SELECTION AND CONDITIONALS WHAT YOU MIGHT KNOW ALREADY You will probably be familiar
More informationCS111: PROGRAMMING LANGUAGE II
CS111: PROGRAMMING LANGUAGE II Computer Science Department Lecture 1(c): Java Basics (II) Lecture Contents Java basics (part II) Conditions Loops Methods Conditions & Branching Conditional Statements A
More informationCS177 Python Programming. Recita4on 2 - Compu4ng with Numbers
CS177 Python Programming Recita4on 2 - Compu4ng with Numbers Outline Data types. Variables Math library. Range Func4on What is data (in the context of programming)? Values that are stored and manipulated
More informationLecture Programming in C++ PART 1. By Assistant Professor Dr. Ali Kattan
Lecture 08-1 Programming in C++ PART 1 By Assistant Professor Dr. Ali Kattan 1 The Conditional Operator The conditional operator is similar to the if..else statement but has a shorter format. This is useful
More informationCSc 110 Sample Final Exam #1
CSc 110 Sample Final Exam #1 1. While Loop Simulation For each call of the function below, write the output that is printed: def mystery(i, j): while (i!= 0 and j!= 0): i = i // j j = (j - 1) // 2 print(str(i)
More informationCMSC201 Computer Science I for Majors
CMSC201 Computer Science I for Majors Lecture 08 Lists Constants Last Class We Covered More on while loops Sentinel loops Priming Reads Boolean flags 2 Any Questions from Last Time? 3 Today s Objectives
More informationCS1110 Lab 6 (Mar 17-18, 2015)
CS1110 Lab 6 (Mar 17-18, 2015) First Name: Last Name: NetID: The lab assignments are very important and you must have a CS 1110 course consultant tell CMS that you did the work. (Correctness does not matter.)
More informationIndividual research task. You should all have completed the research task set last week. Please make sure you hand it in today.
Lecture 6 Individual research task. You should all have completed the research task set last week. Please make sure you hand it in today. Previously Decision structures with flowcharts Boolean logic UML
More information