Practice Question. Omar Khan / Atif Alvi. October 10, 2016
|
|
- Willis Young
- 5 years ago
- Views:
Transcription
1 Practice Question Omar Khan / Atif Alvi October 10,
2
3 Chapter 1 Loops 1.1 While Loop Iterating through a string 1. Print the first 10 integers 1 i = 0 2 n = 10 3 while i<n: 4 print (i) 5 i = i print () 2. Print the first 10 integers in a row. : 1 i = 0 2 while i<n: 3 print (i, end =",") 4 i = i print () 3
4 3. Write code that prints the following pattern on the screen: * * * * * : 1 i = 1 2 while i<n: 3 j = 0 4 while j < i: 5 print (".", end =" ") 6 j = j print () 8 i = i print () 4. Write code that prints the following pattern on the screen: * : 1 i = 1 2 while i <=n: 3 j = 0 4 while j < i: 5 if j ==0 or j==i -1 or i==n: 4
5 6 print ("*", end =" ") 7 else : 8 print (" ", end =" ") 9 j = j print () 11 i = i print () 5. Write code to print the following pattern. You have to use nested while loops. * * * * : 1 i = 1 2 while i<n: 3 j = 0 4 while j < i %5: 5 print ("*", end =" ") 6 j = j print () 8 i = i print () 5
6
7 Chapter 2 Functions 1. Write a function isodd that return a True value if the input to it is an odd number and False value if the input number is even 1 def isodd (n): 2 return n %2==1 2. Write a function oddsinrange that takes two number l and u as input (you can assume that l u) and returns the number of odd number in the range l - u (l and u inclusive). Use the isodd function defined above. 1 def oddsinrange (l, u): 2 count = 0 3 while l < u: 4 if isodd (l): 5 count = count l = l return count 3. Write a function max4 that takes 4 numbers as input and returns the value of the largest. 1 def max4 (a, b, c, d): 2 maxval = a 3 if b > maxval : 4 maxval = b 5 if c > maxval : 6 maxval = c 7 if d > maxval : 8 maxval = d 9 return maxval 7
8 4. Write a function isprime that takes a positive integer as input and determines if the given number is a prime or not 1 def isprime (n): 2 if n <= 0 : 3 print (" Please use positive integers as input only ") 4 if n == 1 or n == 2: 5 return True 6 range = int (n /2) 7 i = 2 8 while i <= range : 9 if n %2==0: 10 return False 11 i = i return True 5. Write a function called dicen that takes a number n as input. The function when called should simulate the roll of a dice n times and return the ration of the times that the roll came up with the number 6 1 from random import randint 2 def dicen (n): 3 i = 0 4 count = 0 5 while i<n: 6 dice = randint (1,6) 7 if dice1 == 6: 8 count = count i = i return count / n 6. Write a function called dicesumratio that takes two positive integers n and total as input, simulates the roll of a pair of dice n times and returns the following ratio: 1 from random import randint 2 def dicesumratio (n, total ): 3 i = 0 4 count = 0 5 while i<n: 6 dice1 = randint (1,6) times that the sum of a roll is equal to total n 8
9 7 dice2 = randint (1,6) 8 if ( dice1 + dice2 ) == total : 9 count = count i = i return count / n Which sum do you expect to come up most often in a roll of a pair of dice? Can you write code that experimentally supports your answer? 7. Given the function below, show what values are printed for f(0), f(1), f(10). Describe the execution steps. 1 def f(a): 2 if a < 0: 3 return -1 4 n = a 5 while n > 0: 6 if n%2 == 0: 7 n = n //2 8 print (n) 9 elif n == 1: 10 print (n) 11 return 1 12 else : 13 n = 3 * n print (n) 15 return 0 a) For f(0) neither the condition for the if statement nor the condition for the while statement are true so the function just returns 0. b) For f(1) we enter the while loop and skip the condition with the if part and go into the body of the elif part. A value of 1 is printed and the function returns a value of 1 also. c) For f(10) the following evaluations take palce: i. n is even so n=n//2 is evaluated n becomes 5 and 5 is printed ii. In the next iteration of the while loop n is odd so n = 3 * n + 1 is evaluated n becomes gets printed iii. n is even so n=n//2 is evaluated n becomes 8 and 8 is printed iv. n is even so n=n//2 is evaluated n becomes 4 and 4 is printed v. n is now going to remain even until it becomes 1 at which point 1 gets printed and the function returns a value of 1. 9
10 The following thus gets printed:
11 Chapter 3 Strings 3.1 Iterative Questions Iterating through a string 1. Write a function called printstr that takes a string as an input parameter and prints out each element of the list on a separate line. 3 ways to do it are : 1 def printstr ( str ): 2 for c in str : 3 print (c) 1 def printstr ( str ): 2 for i in range ( len ( str )): 3 print ( str [i]) 1 def printstr ( str ): 2 i=0 3 while i<len ( str ): 4 print ( str [i]) 5 i = i + 1 Generating new strings from old 1. Write a function called punctuated that takes string s and a character c as input and prints a string that is the same as the input string s but with the character c between each adjacent letter 1 def punctuated (str, c): 2 for i in range ( len ( str ) -1): 11
12 3 print ( str [i], end =c) 4 print ( str [ -1]) Sample run 1 >>> punctuated ( Python, - ) 2 P-y-t-h-o-n 2. Write a function called rtnpunctuated that takes string str and a character c as input and returns a string that is the same as the input string str but with the character c between each adjacent letter 1 def punctuated (str, c): 2 rtnstr = 3 for i in range ( len ( str ) -1): 4 rtnstr = rtnstr + str [ i] + c 5 rtnstr = rtnstr + str [ i] 6 return rtnstr Sample run 1 >>> punctuated ( Python, - ) 2 P-y-t-h-o-n 3. Write a function called rtnsubstr that takes a string s and two integers starti and stopi as an input parameters and returns the substring represented by indices starti and stopi. 1 def rtnsubstr (s, starti, stopi ): 2 rtnstr = 3 for i in range ( starti, stopi +1) : 4 rtnstr = rtnstr + s[i] 5 return rtnstr Sample run 1 >>> rtnsubstr ( abracadabra, 3, 7) 2 acada 4. Write a function called prntfirstn that takes an integer n and a string as input and prints the first n characters of the string. If the string has fewer than n characters then print the message input list does not have enough elements. 12
13 1 def prntfirstn (n, str ): 2 if len ( str )<n: 3 print (" input string does not have enough elements ") 4 else : 5 for i in range (n): 6 print ( str [i]) 5. Write a function called prntlastn that takes an integer n and a str as input and prints the Last n members of the string. If the string has fewer than n elements then print the message input string does not have enough elements. 2 ways: 1 def prntlastn (n, str ): 2 if len ( str )<n: 3 print (" the input string does not have enough elements ") 4 else : 5 first = len ( str )-n 6 for i in range (first, len ( str )): 7 print ( str [i]) 1 def prntlastn (n, str ): 2 if len ( str )<n: 3 print (" the input string does not have enough elements ") 4 else : 5 first = len ( str )-n 6 for e in str [ first :]: 7 print (e) 6. Write a function prtrstr that prints the given string in reverse order. 1 def prtrlst ( str ): 2 i = len ( str ) -1 3 while i >=0: 4 print ( str [i], end = ) 5 i = i Write a function removechar that takes a string and a character as input and returns a string with all the instances of the character removed. 13
14 1 def removechar (istr, ic): 2 rstr = 3 for c in istr : 4 if c!= ic: 5 rstr = rstr + c 6 return rstr 8. Write a function replacechar that takes a string and two characters as input and returns a string with all the instances of the first character replaced by the second character. 1 def replacechar (istr, c1, c2): 2 rstr = 3 for c in istr : 4 if c== c1: 5 rstr = rstr + c2 6 else : 7 rstr = rstr + c 8 return rstr String Analysis 1. Write a function noofwords that takes a string and returns the number of words in that string. Words may be separated by multiple spaces! Do not use split. 1 def noofwords ( istr ): 2 readingaword = False 3 totalwords = 0 4 for c in istr : 5 if c == : 6 if readingaword : 7 readingaword = False 8 else : 9 if not readingaword : 10 readingaword = True 11 totalwords = totalwords return totalwords 14
15 Chapter 4 Lists 4.1 Iterative Questions Iterating through a list 1. Iterate through the members of a list. 3 ways: 1 lst = [1, a, " astring ", [1,2,3]] 2 for m in lst : 3 print (m) 1 lst = [1, a, " astring ", [1,2,3]] 2 for i in range ( len ( lst )): 3 print ( lst [i]) 1 lst = [1, a, " astring ", [1,2,3]] 2 i=0 3 while i<len ( lst ): 4 print ( lst [i]) 5 i=i+1 2. Write a function minmax That prints both the minimum and the max values contained in a list of number. 1 def minmax ( lst ): 2 min = lst [0] 3 max = lst [0] 4 for n in lst : 5 if n<min : 6 min = n 15
16 7 if n>max : 8 max = n 9 print (" Min : ", min ) 10 print (" Max : ", max ) 3. Write a function that takes a list of numbers and a number n as input and generates a new list consisting of all the number in the given list that are greater than n. 1 def greatern (lst, n): 2 rlst = [] 3 for i in lst : 4 if i>n: 5 rlst. append (i) 6 return rlst Mutating lists 1. Write a function squarelist that takes a list of numbers as input and applies the square function to each member of the list : 1 def squarelist ( lst ): 2 for i in range ( len ( lst )): 3 lst [i] = lst [i ]**2 Forming new lists 1. Write a function firstnsqs that takes a number n as input and return a list of the squares of the the first n integers. : 1 def firstnsqs (n): 2 rlst = [] 3 for i in range (1, n +1) : 4 rlst. append (i **2) 5 return rlst 2. Write a function strtolist that takes a string as input and returns a list of all the characters in the string. : 1 def strtolist ( str ): 2 rlst = [] 3 for s in str : 4 rlst. append (s) 5 return rlst 16
Python 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 informationAddis Ababa University, Amist Kilo July 5, 2011 Algorithms and Programming for High Schoolers. Lab 2
Addis Ababa University, Amist Kilo July 5, 2011 Algorithms and Programming for High Schoolers Lab 2 Exercise 1: In my high school, students were given letter grades based on their numerical scores. Here
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 informationANS:
Math 15-Spring 17-Final Exam Solutions 1. Consider the following definition of the symbol. Definition. Let x and y be integers. Write x y if 5x + 7y = 11k for some integer k. (a) Show that 1 4, 2 8, and
More informationChapter 1 Summary. Chapter 2 Summary. end of a string, in which case the string can span multiple lines.
Chapter 1 Summary Comments are indicated by a hash sign # (also known as the pound or number sign). Text to the right of the hash sign is ignored. (But, hash loses its special meaning if it is part of
More informationChapter 5 Conditional and Iterative Statements. Statement are the instructions given to the computer to perform any kind of action.
Chapter 5 Conditional and Iterative Statements Statement Statement are the instructions given to the computer to perform any kind of action. Types of Statement 1. Empty Statement The which does nothing.
More informationSpring 2017 CS 1110/1111 Exam 2
Spring 2017 CS 1110/1111 Exam 2 Bubble in your computing ID in the footer of this page. We use an optical scanner to read it, so fill in the bubbles darkly. If you have a shorter ID, leave some rows blank.
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 informationMidterm 1 Review. Important control structures. Important things to review. Functions Loops Conditionals
Midterm 1 Review Important control structures Functions Loops Conditionals Important things to review Binary numbers Boolean operators (and, or, not) String operations: len, ord, +, *, slice, index List
More informationCommon Loop Algorithms 9/21/16 42
Common Loop Algorithms 9/21/16 42 Common Loop Algorithms 1. Sum and Average Value 2. Coun4ng Matches 3. Promp4ng un4l a Match Is Found 4. Maximum and Minimum 5. Comparing Adjacent Values 9/21/16 43 Sum
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 informationCPSC 217 Midterm (Python 3 version)
CPSC 217 Midterm (Python 3 version) Duration: 60 minutes 7 March 2011 This exam has 81 questions and 14 pages. This exam is closed book. No notes, books, calculators or electronic devices, or other assistance
More informationStructure and Interpretation of Computer Programs
CS 6A Fall 25 Structure and Interpretation of Computer Programs Midterm 2 Solutions INSTRUCTIONS You have 2 hours to complete the exam. The exam is closed book, closed notes, closed computer, closed calculator,
More informationBasic Python Revision Notes With help from Nitish Mittal
Basic Python Revision Notes With help from Nitish Mittal HELP from Documentation dir(module) help() Important Characters and Sets of Characters tab \t new line \n backslash \\ string " " or ' ' docstring
More information3.4. FOR-LOOPS 65. for <v a r i a b l e > in < sequence >:
3.4. FOR-LOOPS 65 3.4 For-loops In the previous section we looked at while-loops, Python s basic looping structure. There is a second loop construct in Python called a for-loop. This is more specialized.
More information3/12/2018. Structures. Programming in C++ Sequential Branching Repeating. Loops (Repetition)
Structures Programming in C++ Sequential Branching Repeating Loops (Repetition) 2 1 Loops Repetition is referred to the ability of repeating a statement or a set of statements as many times this is necessary.
More informationModule 04: Lists. Topics: Lists and their methods Mutating lists Abstract list functions Readings: ThinkP 8, 10. CS116 Fall : Lists
Module 04: Lists Topics: Lists and their methods Mutating lists Abstract list functions Readings: ThinkP 8, 10 1 Consider the string method split >>> name = "Harry James Potter" >>> name.split() ['Harry',
More informationSpring 2017 CS 1110/1111 Exam 1
CS 1110/1111 Spring 2017 Exam 1 page 1 of 6 Spring 2017 CS 1110/1111 Exam 1 Bubble in your computing ID in the footer of this page. We use an optical scanner to read it, so fill in the bubbles darkly.
More informationIntroduction to programming using Python
Introduction to programming using Python Matthieu Choplin matthieu.choplin@city.ac.uk http://moodle.city.ac.uk/ Session 4 1 Objectives To come back on the notion of object and type. To introduce to the
More informationSequence types. str and bytes are sequence types Sequence types have several operations defined for them. Sequence Types. Python
Python Sequence Types Sequence types str and bytes are sequence types Sequence types have several operations defined for them Indexing Python Sequence Types Each element in a sequence can be extracted
More informationModule 06. Topics: Iterative structure in Python Readings: ThinkP 7. CS116 Spring : Iteration
Module 06 Topics: Iterative structure in Python Readings: ThinkP 7 1 In Python, repetition can be recursive def count_down_rec(x): ''' Produces the list [x, x-1, x-2,..., 1,0] count_down:nat->(listof Nat)'''
More information\n is used in a string to indicate the newline character. An expression produces data. The simplest expression
Chapter 1 Summary Comments are indicated by a hash sign # (also known as the pound or number sign). Text to the right of the hash sign is ignored. (But, hash loses its special meaning if it is part of
More informationAll written answers are limited to their question boxes. Make sure all answers are easily legible.
All written answers are limited to their question boxes. Make sure all answers are easily legible. 1. (1 point) Print your name and email id. 2. (2 points) What makes functions so important? Ability to
More informationCSC A20H3 S 2011 Test 1 Duration 90 minutes Aids allowed: none. Student Number:
CSC A20H3 S 2011 Test 1 Duration 90 minutes Aids allowed: none Last Name: Lecture Section: L0101 Student Number: First Name: Instructor: Bretscher Do not turn this page until you have received the signal
More informationCS 1110: Introduction to Computing Using Python Loop Invariants
CS 1110: Introduction to Computing Using Python Lecture 21 Loop Invariants [Andersen, Gries, Lee, Marschner, Van Loan, White] Announcements Prelim 2 conflicts due by midnight tonight Lab 11 is out Due
More informationMidterm Exam 2A Principles of Computing Fall November 10, 2014
Midterm Exam 2A 15110 Principles of Computing Fall 2014 November 10, 2014 Name: Andrew ID: Lab section: Instructions Answer each question neatly in the space provided. There are 6 questions totaling 28
More informationCS 61A Interpreters, Tail Calls, Macros, Streams, Iterators. Spring 2019 Guerrilla Section 5: April 20, Interpreters.
CS 61A Spring 2019 Guerrilla Section 5: April 20, 2019 1 Interpreters 1.1 Determine the number of calls to scheme eval and the number of calls to scheme apply for the following expressions. > (+ 1 2) 3
More informationPractical Questions CSCA48 Week 6
Practical Questions CSCA48 Week 6 Trace the following functions with a variety of input, and describe their functionality in a single sentence. 1. def mystery(n): if n == 4: result = n result = 2 * mystery(n+1)
More informationMidterm Exam 2B Answer key
Midterm Exam 2B Answer key 15110 Principles of Computing Fall 2015 April 6, 2015 Name: Andrew ID: Lab section: Instructions Answer each question neatly in the space provided. There are 6 questions totaling
More informationPython as a First Programming Language Justin Stevens Giselle Serate Davidson Academy of Nevada. March 6th, 2016
Python as a First Programming Language Justin Stevens Giselle Serate Davidson Academy of Nevada Under Supervision of: Dr. Richard Kelley Chief Engineer, NAASIC March 6th, 2016 Science Technology Engineering
More informationList comprehensions (and other shortcuts) UW CSE 160 Spring 2015
List comprehensions (and other shortcuts) UW CSE 160 Spring 2015 Three Ways to Define a List Explicitly write out the whole thing: squares = [0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100] Write a loop to create
More informationThe Big Python Guide
The Big Python Guide Big Python Guide - Page 1 Contents Input, Output and Variables........ 3 Selection (if...then)......... 4 Iteration (for loops)......... 5 Iteration (while loops)........ 6 String
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 informationControl and Environments Fall 2017 Discussion 1: August 30, 2017 Solutions. 1 Control. If statements. Boolean Operators
CS 61A Control and Environments Fall 2017 Discussion 1: August 30, 2017 Solutions 1 Control Control structures direct the flow of logic in a program. For example, conditionals (if-elif-else) allow a program
More informationMore on Strings & Arrays
More on Strings & Arrays 02-201 Indexing Strings Strings work like arrays in some ways: Strings have fixed length. You can find the length of string s with len(s). You can access elements of string s with
More informationIntroduction to Concepts in Functional Programming. CS16: Introduction to Data Structures & Algorithms Spring 2017
Introduction to Concepts in Functional Programming CS16: Introduction to Data Structures & Algorithms Spring 2017 Outline Functions State Functions as building blocks Higher order functions Map Reduce
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 informationQuestion 1. Part (a) Part (b) December 2013 Final Examination Marking Scheme CSC 108 H1F. [13 marks] [4 marks] Consider this program:
Question 1. Part (a) [4 marks] Consider this program: [13 marks] def square(x): (number) -> number Write what this program prints, one line per box. There are more boxes than you need; leave unused ones
More information(Python) Chapter 3: Repetition
(Python) Chapter 3: Repetition 3.1 while loop Motivation Using our current set of tools, repeating a simple statement many times is tedious. The only item we can currently repeat easily is printing the
More informationShort Answer Questions (40 points)
CS 1112 Fall 2017 Test 2 Page 1 of 6 Short Answer Questions (40 points) 1. TRUE FALSE You have very legibly printed your name and email id below. Name = EMAILD = 2. TRUE FALSE On my honor, I pledge that
More informationFunctionally Modular. Self-Review Questions
Functionally Modular 5 Self-Review Questions Self-review 5.1 Which names are local, which are global and which are built-in in the following code fragment? Global names: Built-in names: space_invaders
More informationCSC148 Fall 2017 Ramp Up Session Reference
Short Python function/method descriptions: builtins : input([prompt]) -> str Read a string from standard input. The trailing newline is stripped. The prompt string, if given, is printed without a trailing
More informationThere are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read.
There are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read. 1. Write a function named largestadjacentsum that iterates
More informationLoops / Repetition Statements
Loops / Repetition Statements Repetition statements allow us to execute a statement multiple times Often they are referred to as loops C has three kinds of repetition statements: the while loop the for
More informationLISTS WITH PYTHON. José M. Garrido Department of Computer Science. May College of Computing and Software Engineering Kennesaw State University
LISTS WITH PYTHON José M. Garrido Department of Computer Science May 2015 College of Computing and Software Engineering Kennesaw State University c 2015, J. M. Garrido Lists with Python 2 Lists with Python
More informationIssue with Implementing PrimeSieve() in Go
Slices 02-201 Issue with Implementing PrimeSieve() in Go func PrimeSieve(n int) [n+1]bool { var iscomposite [n+1]bool //ERROR! biggestprime := 2 for biggestprime < n for i:=2; i
More informationLecture 11: while loops CS1068+ Introductory Programming in Python. for loop revisited. while loop. Summary. Dr Kieran T. Herley
Lecture 11: while loops CS1068+ Introductory Programming in Python Dr Kieran T. Herley Python s while loop. Summary Department of Computer Science University College Cork 2017-2018 KH (24/10/17) Lecture
More informationProgramming Training
Programming Training Main Points: - Working with Functions in Python - Problems with Numbers. - Discuss some important algorithms - Primality - Digits - Greatest Common Divisor Python Repetitions. while
More informationTypes, lists & functions
Week 2 Types, lists & functions Data types If you want to write a program that allows the user to input something, you can use the command input: name = input (" What is your name? ") print (" Hello "+
More informationChapter 5 Conditional and Iterative Statements (Part-II) To carry out repetitive task, python provides following iterative/looping statements:
Chapter 5 Conditional and Iterative Statements (Part-II) Iterative Statements To carry out repetitive task, python provides following iterative/looping statements: 1. Conditional loop while (condition
More informationFundamentals of Programming (Python) Getting Started with Programming
Fundamentals of Programming (Python) Getting Started with Programming Ali Taheri Sharif University of Technology Some slides have been adapted from Python Programming: An Introduction to Computer Science
More informationUTORid: Lecture Section: (circle one): L0101 (MWF10) L0201 (MWF11) Instructor: Jacqueline Smith Jen Campbell
CSC 108H1 F 2017 Midterm Test Duration 50 minutes Aids allowed: none Last Name: UTORid: First Name: Lecture Section: (circle one): L0101 (MWF10) L0201 (MWF11) Instructor: Jacqueline Smith Jen Campbell
More informationStructure and Interpretation of Computer Programs
CS 6A Fall 05 Structure and Interpretation of Computer Programs Final INSTRUCTIONS You have hours to complete the exam. The exam is closed book, closed notes, closed computer, closed calculator, except
More informationTitle As It Is In the Proceedings Include Only If Paper Has a Subtitle. F. Author S. Another Freie Universität Berlin
Title As It Is In the Proceedings Include Only If Paper Has a Subtitle F. Author S. Another Freie Universität Berlin Conference on Fabulous Presentations 2003 Outline Motivation The Basic Problem That
More informationDynamic Programming. An Introduction to DP
Dynamic Programming An Introduction to DP Dynamic Programming? A programming technique Solve a problem by breaking into smaller subproblems Similar to recursion with memoisation Usefulness: Efficiency
More informationOverview of List Syntax
Lists and Sequences Overview of List Syntax x = [0, 0, 0, 0] Create list of length 4 with all zeroes x 4300112 x.append(2) 3 in x x[2] = 5 x[0] = 4 k = 3 Append 2 to end of list x (now length 5) Evaluates
More informationCS 61A Control and Environments Spring 2018 Discussion 1: January 24, Control. If statements. Boolean Operators
CS 61A Control and Environments Spring 2018 Discussion 1: January 24, 2018 1 Control Control structures direct the flow of logic in a program. For example, conditionals (if-elif-else) allow a program to
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 informationOutline. 1 If Statement. 2 While Statement. 3 For Statement. 4 Nesting. 5 Applications. 6 Other Conditional and Loop Constructs 2 / 19
Control Flow 1 / 19 Outline 1 If Statement 2 While Statement 3 For Statement 4 Nesting 5 Applications 6 Other Conditional and Loop Constructs 2 / 19 If Statement Most computations require different actions
More informationSequence Types FEB
Sequence Types FEB 23-25 2015 What we have not learned so far How to store, organize, and access large amounts of data? Examples: Read a sequence of million numbers and output these in sorted order. Read
More informationFall 2018 Discussion 8: October 24, 2018 Solutions. 1 Introduction. 2 Primitives
CS 6A Scheme Fall 208 Discussion 8: October 24, 208 Solutions Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write
More informationSCHEME 7. 1 Introduction. 2 Primitives COMPUTER SCIENCE 61A. October 29, 2015
SCHEME 7 COMPUTER SCIENCE 61A October 29, 2015 1 Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write Scheme programs,
More informationStudent Number: Comments are not required except where indicated, although they may help us mark your answers.
CSC 108H5 F 2018 Midterm Test Duration 90 minutes Aids allowed: none Student Number: utorid: Last Name: First Name: Do not turn this page until you have received the signal to start. (Please fill out the
More informationMidterm I Practice Problems
15-112 Midterm I Practice Problems Name: Section: andrewid: This PRACTICE midterm is not meant to be a perfect representation of the upcoming midterm! You are responsible for knowing all material covered
More informationStructure and Interpretation of Computer Programs
CS 61A Fall 2016 Structure and Interpretation of Computer Programs Final INSTRUCTIONS You have 3 hours to complete the exam. The exam is closed book, closed notes, closed computer, closed calculator, except
More informationPython: common syntax
Lab 09 Python! Python Intro Main Differences from C++: True and False are capitals Python floors (always down) with int division (matters with negatives): -3 / 2 = -2 No variable data types or variable
More informationControl and Environments Fall 2017 Discussion 1: August 30, Control. If statements. Boolean Operators
CS 61A Control and Environments Fall 2017 Discussion 1: August 30, 2017 1 Control Control structures direct the flow of logic in a program. For example, conditionals (if-elif-else) allow a program to skip
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 informationCS205: Scalable Software Systems
CS205: Scalable Software Systems Lecture 3 September 5, 2016 Lecture 3 CS205: Scalable Software Systems September 5, 2016 1 / 19 Table of contents 1 Quick Recap 2 Type of recursive solutions 3 Translating
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 informationPython for Finance. Control Flow, data structures and first application (part 2) Andras Niedermayer
Python for Finance Control Flow, data structures and first application (part 2) Andras Niedermayer Outline 1 Control Flow 2 Modules 3 Data types and structures. Working with arrays and matrices. 4 Numpy
More informationAdvanced Python. Executive Summary, Session 1
Advanced Python Executive Summary, Session 1 OBJECT: a unit of data of a particular type with characteristic functionality (i.e., methods and/or use with operators). Everything in Python is an object.
More informationStatements 2. a operator= b a = a operator b
Statements 2 Outline Note: i=i+1 is a valid statement. Don t confuse it with an equation i==i+1 which is always false for normal numbers. The statement i=i+1 is a very common idiom: it just increments
More informationGWC Lesson 9 Partner Work and Comprehension
GWC Lesson 9 Partner Work and Comprehension "Many ideas grow better when transplanted into another mind than the one where they sprang up." Oliver Wendell Holmes Oliver Wendell Holmes was an American physician,
More informationCHAPTER 2.2 CONTROL STRUCTURES (ITERATION) Dr. Shady Yehia Elmashad
CHAPTER 2.2 CONTROL STRUCTURES (ITERATION) Dr. Shady Yehia Elmashad Outline 1. C++ Iterative Constructs 2. The for Repetition Structure 3. Examples Using the for Structure 4. The while Repetition Structure
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 informationmith College Computer Science Week 9 CSC111 - Fall 2018 Dominique Thiébaut
mith College Computer Science Week 9 CSC111 - Fall 2018 Dominique Thiébaut dthiebaut@smith.edu Dealing with Exceptions (Chapter 7.4) Defining Classes (Chapter 10) # getinput: returns an integer larger
More informationFlow Control: Branches and loops
Flow Control: Branches and loops In this context flow control refers to controlling the flow of the execution of your program that is, which instructions will get carried out and in what order. In the
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 informationConditional Expressions and Decision Statements
Conditional Expressions and Decision Statements June 1, 2015 Brian A. Malloy Slide 1 of 23 1. We have introduced 5 operators for addition, subtraction, multiplication, division, and exponentiation: +,
More informationCS-141 Final Exam Review December 8, 2017 Presented by the RIT Computer Science Community
CS-141 Final Exam Review December 8, 2017 Presented by the RIT Computer Science Community http://csc.cs.rit.edu Python Basics 1. Although most in the industry will be reasonably forgiving when it comes
More informationCS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University
CS 112 Introduction to Computing II Wayne Snyder Department Boston University Today: Administrivia and Motivation Administrative Matters: Review of course design and course policies Motivation: Two Algorithms
More informationRECURSION 7. 1 Recursion COMPUTER SCIENCE 61A. October 15, 2012
RECURSION 7 COMPUTER SCIENCE 61A October 15, 2012 1 Recursion We say a procedure is recursive if it calls itself in its body. Below is an example of a recursive procedure to find the factorial of a positive
More informationScheme as implemented by Racket
Scheme as implemented by Racket (Simple view:) Racket is a version of Scheme. (Full view:) Racket is a platform for implementing and using many languages, and Scheme is one of those that come out of the
More informationNested Loops ***** ***** ***** ***** ***** We know we can print out one line of this square as follows: System.out.
Nested Loops To investigate nested loops, we'll look at printing out some different star patterns. Let s consider that we want to print out a square as follows: We know we can print out one line of this
More informationCOGS 119/219 MATLAB for Experimental Research. Fall 2016 Week 1 Built-in array functions, Data types.m files, begin Flow Control
COGS 119/219 MATLAB for Experimental Research Fall 2016 Week 1 Built-in array functions, Data types.m files, begin Flow Control .m files We can write the MATLAB commands that we type at the command window
More informationPLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science
PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science DECEMBER 2013 EXAMINATIONS CSC 108 H1F Instructors: Craig and Gries Duration 3 hours PLEASE HAND IN Examination Aids: None Student Number:
More informationLecture #21: Search and Sets. Last modified: Wed Mar 9 15:44: CS61A: Lecture #21 1
Lecture #21: Search and Sets Last modified: Wed Mar 9 15:44:55 2016 CS61A: Lecture #21 1 Announcements My office hours this Thursday (only) are 3 4PM. Homework 5 to be released later today. Many problems
More informationComp Exam 1 Overview.
Comp 170-400 Exam 1 Overview. Resources During the Exam The exam will be closed book, no calculators or computers, except as a word processor. In particular no Python interpreter running in a browser or
More informationPYTHON MOCK TEST PYTHON MOCK TEST III
http://www.tutorialspoint.com PYTHON MOCK TEST Copyright tutorialspoint.com This section presents you various set of Mock Tests related to Python. You can download these sample mock tests at your local
More informationYork University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes
York University AK/ITEC 1620 3.0 OBJECT-BASED PROGRAMMING Midterm Test Sample Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes This exam is closed textbook(s) and closed notes. Use of any electronic
More informationA453 Task 1: Analysis: Problem: Solution:
: Analysis: Problem: The problem I need to solve is that I need to design, code, and test a program that simulates a dice throw of a 4, 6, or 12 sided die and outputs the result before repeating the process
More informationUNIT-II NUMBER THEORY
UNIT-II NUMBER THEORY An integer n is even if, and only if, n equals twice some integer. i.e. if n is an integer, then n is even an integer k such that n =2k An integer n is odd if, and only if, n equals
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationStructure and Interpretation of Computer Programs
CS 6A Fall 206 Structure and Interpretation of Computer Programs Final Solutions INSTRUCTIONS You have hours to complete the exam. The exam is closed book, closed notes, closed computer, closed calculator,
More informationSpring 2017 CS 1110/1111 Exam 3
Spring 2017 CS 1110/1111 Exam 3 Bubble in your computing ID, top to bottom, in the footer of this page. We use an optical scanner to read it, so fill in the bubbles darkly. If you have a shorter ID, leave
More informationThe Practice of Computing Using PYTHON. Chapter 4. Working with Strings. Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
The Practice of Computing Using PYTHON William Punch Richard Enbody Chapter 4 Working with Strings 1 Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Sequence of Characters We
More informationPython for Non-programmers
Python for Non-programmers A Gentle Introduction 2 Yann Tambouret Scientific Computing and Visualization Information Services & Technology Boston University 111 Cummington St. yannpaul@bu.edu Winter 2013
More informationCOMP 202. Programming With Iterations. CONTENT: The WHILE, DO and FOR Statements. COMP Loops 1
COMP 202 Programming With Iterations CONTENT: The WHILE, DO and FOR Statements COMP 202 - Loops 1 Repetition Statements Repetition statements or iteration allow us to execute a statement multiple times
More informationCS-141 Final Exam Review May 16, 2015 Presented by the RIT Computer Science Community
CS-141 Final Exam Review May 16, 2015 Presented by the RIT Computer Science Community http://csc.cs.rit.edu Python Basics 1. Although most in the industry will be reasonably forgiving when it comes to
More information