MATH 1MP3 Homework #4 Due: 11:59pm, Wednesday, March 6.

Size: px
Start display at page:

Download "MATH 1MP3 Homework #4 Due: 11:59pm, Wednesday, March 6."

Transcription

1 MATH 1MP3 Homework #4 Due: 11:59pm, Wednesday, March 6. Important notes: To start the assignment, download the Jupyter notebook file assignment 4 template.ipynb found here: ipynb You might need to copy the above url and paste it into a browser to download the file. Your assignment must be submitted as a Jupyter notebook file called yourmacid assignment 4.ipynb, where yourmacid is replaced with your macid from your McMaster address. Since my McMaster address is valeriot@mcmaster.ca then the file that I would submit would be valeriot assignment 4.ipynb. You must submit this file to the homework #4 Dropbox on the MATH 1MP3 Avenue to Learn site. There are four separate questions in this assignment, but your solutions will be contained in the single Jupyter notebook file that you will submit. The solution to each question consists of python code that implements the functions described in each question, plus appropriate docstrings. To complete your assignment, place your code for each question as indicated in the template. Do not alter any other part of the assignment 4 template.ipynb file and do not add python code in any other parts of the file that you submit. 1

2 To see an example of what is expected, look over the solutions to homework assignments #2 and #3. The code that you enter cannot contain any import statements. The template already has import math and import string statements in cells where they might be needed (but you don t need to use the functions and constants from these modules). The functions should use the return statement to return the result of the function call, so print statements should not occur in the code that you produce. While developing and testing your code, it might be helpful to use print statements, but they should be removed before submitting your solution. Note that the template contains several print statements that when executed will test your code. Any file that is submitted for grading that does not conform to the above specifications will lead to a grade of 0 on the assignment. Before submitting your solution, you should make sure that it runs properly. To do this, you can open it in the Jupyter notebook server that comes installed with Anaconda, or you can use the McMaster Jupyter server, by going to the website ca/. You may want to use the Spyder IDE, or some other IDE to develop your code before entering it into the Jupyter notebook that you submit. The file assignment 4 template.ipynb contains six cells, one for each part of the assignment questions. At the start of each cell is the function definition, followed by a placeholder docstring entry. At the end of each cell are some print statements that when executed will print out the results of running your code on a few test cases. Do not remove, alter, or add to these print statements. For each question, you should include a suitable docstring in the appropriate place. Your docstrings should have the same format as those that appear in the solutions for assignments #2 and #3. This is the numpy docstring format. Note that for functions that have filenames as arguments, then you do not need to provide examples in your docstrings. 2

3 Carefully read over each of the following four questions. Once you have produced code for a given question, you should run it in the Jupyter server or on your IDE on the test cases provided to make sure that it is working properly. You should also try out your code on other test cases of your own design. Your grade for each question will depend on whether or not your code correctly handles not just the test cases provided in the template, but other test cases that will be run on your solutions. Points will also be awarded based on the quality of the docstrings that you provide for each function. Do not leave this until the last minute, since you might encounter computer/internet/avenue issues. Late assignments will not be accepted. All work submitted for grading must be your own. You may discuss homework problems and related material with other students, but you must not submit work copied from others or from the internet. Question #1 a) Write a function long strings that has one argument: file name that is a string that is the name of a text file. The file will consist of a number of lines of text, and each line will consist of a number of strings, separated by one or more space characters. The command long strings(file name) should return a set that contains all of the longest strings that are found in the file. Note that the strings found in the lines of the file may consist of any nonwhitespace characters, including letters, digits, and punctuation symbols. If the file only consists of lines that contain spaces, then the function should return the empty set. For example, if the file question 1.txt consists of the following five lines of text: If there are two arguments, they must be strings of equal length, and in the resulting dictionary, each character!! in x will be mapped to the characters at the same #positi%on! in y. If there is a third arg,!ument, it 3

4 must be a string, whose characters will be mapped to None in the result. then long strings( question 1.txt ) should return the set { #positi%on!, arg,!ument,, character!!, dictionary, }, since each of the strings in this set have length 11 and no string in the file has a longer length. To test your code on the file question 1.txt you can download it here: Be sure that this file, or any other text file that you test your code on is located in the same folder/directory as your jupyter notebook or python code. Your code should close any files that it opens before returning any values. Hint: You will probably want to use the string functions.strip() and.split() to help identify the strings in the file that should be considered. Question #1 b) This question is similar to the previous one and you should be able to modify your code from the previous question for this one. Write a function long words that has one argument: file name that is a string that is the name of a text file. The file will consist of a number of lines of text, and each line will consist of a number of strings, separated by one or more space characters. The command long words(file name) should return a set that contains all of the longest words that are obtained from strings found in the file. For the purposes of this exercise, a word is obtained from a string by stripping away any trailing punctuation symbols, as long as the only remaining characters are alphabetic, upper or lower case. For example, after stripping away the trailing punctuation symbols the string "abc!$,?" gives rise to the word "abc". Since the string "$a,b!c??" contains non-alphabetic characters, even after stripping away the trailing punctuation symbols, then it does not give rise to a word, in this sense. If the file only consists of lines that contain spaces or does not contain any words, then the function should return the empty set. For example, long words( question 1.txt ) should return the set { characters, characters, dictionary }, where the file question 1.txt is from the previous question. This is because both of these words were obtained by stripping away any trailing punctuation symbols from strings found in the file and no other words obtained from the file are longer than these 4

5 three. You should consider strings that consists of the same sequence of letters, but with different capitalizations, to be different words. For example, in the test file, the words characters and characters should both appear in the set. To test your code on the file question 1.txt you can download it here: Be sure that this file, or any other text file that you test your code on is located in the same folder/directory as your jupyter notebook or python code. Hint: You should consider using the string string.punctuation. It consists of all of the punctuation characters recognized by python. Question #2 Write a function grade stats that has two arguments: file name that is a string that is the name of a text file that contains the grades for the students in some course, and col that is a column number, with default value of 1. Each line of the file begins with the (first) name of a student, followed by a sequence of strings that are supposed to represent integers that lie between 0 and 100, inclusive. The elements of each line are separated by blank space " ". The function should compute the average and median values of the valid numbers that appear in the specified column. Any string that appears in the specified column that does not represent an integer that lies between 0 and 100 inclusive, should be disregarded. If there are no valid numbers in the specified column, then the function should return no value. The statement return None will accomplish this. Note that you should not return the string "None", but rather the python None object. If the specified column contains strings that represent integers between 0 and 100, then the function should return a tuple of length 3 that consists of, in order: the average of the numbers in the column, rounded to 2 decimal places, the median of the numbers in the column, and the highest grade in the column. To test your code, you can use the file grades.txt that can be downloaded here: Since the first column of this file does not contain any valid integer entries, then grade stats( grades.txt, 0) should return no value. On the other hand, grade stats( grades.txt ) should return the tuple (71.14, 78.0, 5

6 96) and grade stats( grades.txt, 5) should return the tuple (41.85, 48, 60). Both columns 1 and 5 contain some non-valid entries. Note: To compute the average of a non-empty list of numbers, you can first sum the entries in the list (using the sum function) and then divide by the length of the list. The median of a sorted list of numbers of odd length is equal to the value of the middle entry of the list, while the median of a sorted list of numbers of even length is equal to the average of the two middle entries of the list. Question #3 Produce a function prime factors dict that has one integer variable n that is assumed to be greater than 1. The function will return a dictionary with keys the integers from 2 to n, inclusive, and with values the set of prime factors of each key. So, the command prime factors dict(8) will return the dictionary {2 : {2}, 3 : {3}, 4 : {2}, 5 : {5}, 6 : {2, 3}, 7 : {7}, 8 : {2}} Note that even though the prime number 2 appears twice in the prime factorization of 4, it only appears once in the set of its prime divisors. The function smallest divisor is available to use in your code. This function has one integer argument n that is greater than 1. It will return the smallest integer divisor of n that is greater than 1. So smallest divisor(35) will return the integer 5 and smallest divisor(23) will return 23. Note that in all cases, this function will return a prime number and that smallest divisor(n) will return the number n if and only if n is a prime number. The code for this function appears at the top of the question #3 cell. You may find it useful in solving this question, but you are not required to use it. Hint: If n is the product of the integers c and d, then the set of prime divisors of n is equal to the union of the set of prime divisors of c and the set of prime divisors of d. Question #4 Write a function power function that has two arguments k, a number, and tol, a number with default value 1e-6. This function will return a function 6

7 of one variable f(x) that approximates the value of the number (1 + x) k within the specified tolerance, for values of x between 0 and 1, excluding 1. The approximation should be produced using the series expansion that Sir Isaac Newton discovered in He showed that for k a real number and x a number with 0 x < 1, (1 + x) k is equal to 1+kx+ k(k 1) x 2 + 2! k(k 1)(k 2) x ! k(k 1)(k 2) (k n + 1) x n + n! For details on this discovery, consult Section of Dr. James Stewart s Calculus text or just look up the Binomial Theorem on the internet. Note that the above series actually holds for all x strictly between -1 and 1. Your function should compute, in sequence, the terms of the above series and keep a running total of them. Once a term s size is less than or equal to the specified tolerance, then the current total will be an accurate enough approximation to (1 + x) k, and this is the value that f(x) should return. So, the statement f = power function(1/3) will assign to the variable f the one argument function that computes (1 + x) (1/3), accurate to So f(0.5) will return the value , the cube root of 1.5. Note: You cannot just make use of the built in exponentiation function in your code to directly compute the value of (1 + x) k. No credit will be given for doing this. Of course, you may compute x n for integer values of n with the expression x ** n. You do not need to worry about the behaviour of the function produced for values of x that do not lie in the interval [0, 1). Hint: Study the example of the sine function that was worked out in class. The code for this question can be closely modelled on the sine function code. It can be downloaded from the week #5 section of the course website. Note that to compute the nth term in the series from the previous term, you just need to multiply it by (k n+1)x. So, you need not directly compute factorials n in your code (but you may). 7

CS 2316 Individual Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 18th, before 11:55 PM Out of 100 points

CS 2316 Individual Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 18th, before 11:55 PM Out of 100 points CS 2316 Individual Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 18th, before 11:55 PM Out of 100 points Files to submit: 1. HW4.py This is an INDIVIDUAL assignment! Collaboration at a

More information

CS Homework 4 Employee Ranker. Due: Wednesday, February 8th, before 11:55 PM Out of 100 points. Files to submit: 1. HW4.py.

CS Homework 4 Employee Ranker. Due: Wednesday, February 8th, before 11:55 PM Out of 100 points. Files to submit: 1. HW4.py. CS 216 Homework 4 Employee Ranker Due: Wednesday, February 8th, before 11: PM Out of 0 points Files to submit: 1. HW4.py This is an INDIVIDUAL assignment! Collaboration at a reasonable level will not result

More information

CMSC 201 Fall 2016 Homework 6 Functions

CMSC 201 Fall 2016 Homework 6 Functions CMSC 201 Fall 2016 Homework 6 Functions Assignment: Homework 6 Functions Due Date: Wednesday, October 26th, 2016 by 8:59:59 PM Value: 40 points Collaboration: For Homework 6, collaboration is not allowed

More information

CS 1803 Individual Homework 2 Conditionals & Loops Due: Wednesday, February 2 nd, before 6 PM Out of 100 points

CS 1803 Individual Homework 2 Conditionals & Loops Due: Wednesday, February 2 nd, before 6 PM Out of 100 points CS 1803 Individual Homework 2 Conditionals & Loops Due: Wednesday, February 2 nd, before 6 PM Out of 100 points Files to submit: 1. HW2.py This is an INDIVIDUAL assignment! Collaboration at a reasonable

More information

CS 1803 Pair Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 29th, before 6 PM Out of 100 points

CS 1803 Pair Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 29th, before 6 PM Out of 100 points CS 1803 Pair Homework 4 Greedy Scheduler (Part I) Due: Wednesday, September 29th, before 6 PM Out of 100 points Files to submit: 1. HW4.py This is a PAIR PROGRAMMING Assignment: Work with your partner!

More information

Activity Overview A basic introduction to the many features of the calculator function of the TI-Nspire

Activity Overview A basic introduction to the many features of the calculator function of the TI-Nspire TI-Nspire Activity: An Introduction to the TI-Nspire Calculator Function By: Leigh T Baker Activity Overview A basic introduction to the many features of the calculator function of the TI-Nspire Concepts

More information

ENGR 102 Engineering Lab I - Computation

ENGR 102 Engineering Lab I - Computation ENGR 102 Engineering Lab I - Computation Learning Objectives by Week 1 ENGR 102 Engineering Lab I Computation 2 Credits 2. Introduction to the design and development of computer applications for engineers;

More information

6.S189 Homework 2. What to turn in. Exercise 3.1 Defining A Function. Exercise 3.2 Math Module.

6.S189 Homework 2. What to turn in. Exercise 3.1 Defining A Function. Exercise 3.2 Math Module. 6.S189 Homework 2 http://web.mit.edu/6.s189/www/materials.html What to turn in Checkoffs 3, 4 and 5 are due by 5 PM on Monday, January 15th. Checkoff 3 is over Exercises 3.1-3.2, Checkoff 4 is over Exercises

More information

Solve the matrix equation AX B for X by using A.(1-3) Use the Inverse Matrix Calculator Link to check your work

Solve the matrix equation AX B for X by using A.(1-3) Use the Inverse Matrix Calculator Link to check your work Name: Math 1324 Activity 9(4.6)(Due by Oct. 20) Dear Instructor or Tutor, These problems are designed to let my students show me what they have learned and what they are capable of doing on their own.

More information

CSci 1113, Fall 2015 Lab Exercise 4 (Week 5): Write Your Own Functions. User Defined Functions

CSci 1113, Fall 2015 Lab Exercise 4 (Week 5): Write Your Own Functions. User Defined Functions CSci 1113, Fall 2015 Lab Exercise 4 (Week 5): Write Your Own Functions User Defined Functions In previous labs, you've encountered useful functions, such as sqrt() and pow(), that were created by other

More information

CSE 21 Spring 2016 Homework 5. Instructions

CSE 21 Spring 2016 Homework 5. Instructions CSE 21 Spring 2016 Homework 5 Instructions Homework should be done in groups of one to three people. You are free to change group members at any time throughout the quarter. Problems should be solved together,

More information

CS2 Practical 1 CS2A 22/09/2004

CS2 Practical 1 CS2A 22/09/2004 CS2 Practical 1 Basic Java Programming The purpose of this practical is to re-enforce your Java programming abilities. The practical is based on material covered in CS1. It consists of ten simple programming

More information

Number System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value

Number System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value 1 Number System Introduction In this chapter, we will study about the number system and number line. We will also learn about the four fundamental operations on whole numbers and their properties. Natural

More information

CS150 Sample Final. Name: Section: A / B

CS150 Sample Final. Name: Section: A / B CS150 Sample Final Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1) the final

More information

Discrete Structures. Fall Homework3

Discrete Structures. Fall Homework3 Discrete Structures Fall 2015 Homework3 Chapter 5 1. Section 5.1 page 329 Problems: 3,5,7,9,11,15 3. Let P(n) be the statement that 1 2 + 2 2 + +n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. a)

More information

CPSC 217 Assignment 4

CPSC 217 Assignment 4 CPSC 217 Assignment 4 Due: Friday December 8, 2017 at 11:55pm Weight: 7% Sample Solution Length: Approximately 130 lines (No comments and no code for the A+ part) Individual Work: All assignments in this

More information

Math 155. Measures of Central Tendency Section 3.1

Math 155. Measures of Central Tendency Section 3.1 Math 155. Measures of Central Tendency Section 3.1 The word average can be used in a variety of contexts: for example, your average score on assignments or the average house price in Riverside. This is

More information

examples from first year calculus (continued), file I/O, Benford s Law

examples from first year calculus (continued), file I/O, Benford s Law examples from first year calculus (continued), file I/O, Benford s Law Matt Valeriote 5 February 2018 Grid and Bisection methods to find a root Assume that f (x) is a continuous function on the real numbers.

More information

CSCI 4210 Operating Systems CSCI 6140 Computer Operating Systems Project 1 (document version 1.3) Process Simulation Framework

CSCI 4210 Operating Systems CSCI 6140 Computer Operating Systems Project 1 (document version 1.3) Process Simulation Framework CSCI 4210 Operating Systems CSCI 6140 Computer Operating Systems Project 1 (document version 1.3) Process Simulation Framework Overview This project is due by 11:59:59 PM on Thursday, October 20, 2016.

More information

Name: Teacher: Form: LEARNER JOURNAL. Set: Mathematics. Module 2 END OF YEAR TARGET: GCSE TARGET:

Name: Teacher: Form: LEARNER JOURNAL. Set: Mathematics. Module 2 END OF YEAR TARGET: GCSE TARGET: Name: Teacher: Form: Set: LEARNER JOURNAL Mathematics Module 2 END OF YEAR TARGET: GCSE TARGET: MODULE 2 use a number line to represent negative numbers use inequalities with negative numbers compare and

More information

September 11, Unit 2 Day 1 Notes Measures of Central Tendency.notebook

September 11, Unit 2 Day 1 Notes Measures of Central Tendency.notebook Measures of Central Tendency: Mean, Median, Mode and Midrange A Measure of Central Tendency is a value that represents a typical or central entry of a data set. Four most commonly used measures of central

More information

UNIT 1: INTEGERS Definition Absolute Value of an integer How to compare integers

UNIT 1: INTEGERS Definition Absolute Value of an integer How to compare integers UNIT 1: INTEGERS 1.1. Definition Integers are the set of whole numbers and their opposites. The number line is used to represent integers. This is shown below. The number line goes on forever in both directions.

More information

2018 Pummill Relay problem statement

2018 Pummill Relay problem statement 2018 Pummill Relays CS Problem: Minimum Spanning Tree Missouri State University For information about the Pummill Relays CS Problem, please contact: KenVollmar@missouristate.edu, 417-836-5789 Suppose there

More information

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers Contents STRAND B: Number Theory Unit 7 Number System and Bases Student Text Contents Section 7. Number System 7.2 Binary Numbers 7.3 Adding and Subtracting Binary Numbers 7.4 Multiplying Binary Numbers

More information

Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or

Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or elements of the set. a) Use capital letters to stand for sets

More information

General Instructions. You can use QtSpim simulator to work on these assignments.

General Instructions. You can use QtSpim simulator to work on these assignments. General Instructions You can use QtSpim simulator to work on these assignments. Only one member of each group has to submit the assignment. Please Make sure that there is no duplicate submission from your

More information

CE151 ASSIGNMENT

CE151 ASSIGNMENT Set by: Mike Sanderson Credit: 20% of total module mark Deadline: 11.59.59, Monday 8 December Submission of this assignment will be via the online submission system; your programs may be tested during

More information

Types, lists & functions

Types, 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 information

Standardized Tests: Best Practices for the TI-Nspire CX

Standardized Tests: Best Practices for the TI-Nspire CX The role of TI technology in the classroom is intended to enhance student learning and deepen understanding. However, efficient and effective use of graphing calculator technology on high stakes tests

More information

Lab Manual. Program Design and File Structures (P): IT-219

Lab Manual. Program Design and File Structures (P): IT-219 Lab Manual Program Design and File Structures (P): IT-219 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical / program Lab

More information

CS264: Homework #1. Due by midnight on Thursday, January 19, 2017

CS264: Homework #1. Due by midnight on Thursday, January 19, 2017 CS264: Homework #1 Due by midnight on Thursday, January 19, 2017 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. See the course site for submission

More information

CMSC 201 Spring 2017 Project 1 Number Classifier

CMSC 201 Spring 2017 Project 1 Number Classifier CMSC 201 Spring 2017 Project 1 Number Classifier Assignment: Project 1 Number Classifier Due Date: Design Document: Saturday, March 11th, 2017 by 8:59:59 PM Project: Friday, March 17th, 2017 by 8:59:59

More information

Math 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. 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 information

CS Homework 4 Lifeguard Employee Ranker. Due: Tuesday, June 3rd, before 11:55 PM Out of 100 points. Files to submit: 1. HW4.py.

CS Homework 4 Lifeguard Employee Ranker. Due: Tuesday, June 3rd, before 11:55 PM Out of 100 points. Files to submit: 1. HW4.py. CS 2316 Homework 4 Lifeguard Employee Ranker Due: Tuesday, June 3rd, before 11: PM Out of 100 points Files to submit: 1. HW4.py This is an PAIR assignment! This is a pair programming problem! You are expected

More information

Math 202 Test Problem Solving, Sets, and Whole Numbers 19 September, 2008

Math 202 Test Problem Solving, Sets, and Whole Numbers 19 September, 2008 Math 202 Test Problem Solving, Sets, and Whole Numbers 19 September, 2008 Ten questions, each worth the same amount. Complete six of your choice. I will only grade the first six I see. Make sure your name

More information

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.

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

Lecture Notes, CSE 232, Fall 2014 Semester

Lecture Notes, CSE 232, Fall 2014 Semester Lecture Notes, CSE 232, Fall 2014 Semester Dr. Brett Olsen Week 11 - Number Theory Number theory is the study of the integers. The most basic concept in number theory is divisibility. We say that b divides

More information

University of Washington CSE 140 Data Programming Winter Final exam. March 11, 2013

University of Washington CSE 140 Data Programming Winter Final exam. March 11, 2013 University of Washington CSE 140 Data Programming Winter 2013 Final exam March 11, 2013 Name: Section: UW Net ID (username): This exam is closed book, closed notes. You have 50 minutes to complete it.

More information

Math 96--Radicals #1-- Simplify; Combine--page 1

Math 96--Radicals #1-- Simplify; Combine--page 1 Simplify; Combine--page 1 Part A Number Systems a. Whole Numbers = {0, 1, 2, 3,...} b. Integers = whole numbers and their opposites = {..., 3, 2, 1, 0, 1, 2, 3,...} c. Rational Numbers = quotient of integers

More information

ENCM 339 Fall 2017 Lecture Section 01 Lab 9 for the Week of November 20

ENCM 339 Fall 2017 Lecture Section 01 Lab 9 for the Week of November 20 page 1 of 9 ENCM 339 Fall 2017 Lecture Section 01 Lab 9 for the Week of November 20 Steve Norman Department of Electrical & Computer Engineering University of Calgary November 2017 Lab instructions and

More information

Bulgarian Math Olympiads with a Challenge Twist

Bulgarian Math Olympiads with a Challenge Twist Bulgarian Math Olympiads with a Challenge Twist by Zvezdelina Stankova Berkeley Math Circle Beginners Group September 0, 03 Tasks throughout this session. Harder versions of problems from last time appear

More information

UNIVERSITY OF TORONTO SCARBOROUGH. Fall 2015 EXAMINATIONS. CSC A20H Duration 3 hours. No Aids Allowed

UNIVERSITY OF TORONTO SCARBOROUGH. Fall 2015 EXAMINATIONS. CSC A20H Duration 3 hours. No Aids Allowed Student Number: Last Name: First Name: UNIVERSITY OF TORONTO SCARBOROUGH Fall 2015 EXAMINATIONS CSC A20H Duration 3 hours No Aids Allowed Do not turn this page until you have received the signal to start.

More information

1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1

1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1 Asymptotics, Recurrence and Basic Algorithms 1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1 2. O(n) 2. [1 pt] What is the solution to the recurrence T(n) = T(n/2) + n, T(1)

More information

MAS212 Assignment #1 (2018): Rational approximations

MAS212 Assignment #1 (2018): Rational approximations MAS212 Assignment #1 (2018): Rational approximations Dr Sam Dolan (sdolan@sheffieldacuk) In this assignment you will use Python to find rational approximations to real numbers such as π, 2 and the golden

More information

Fundamentals: Expressions and Assignment

Fundamentals: Expressions and Assignment Fundamentals: Expressions and Assignment A typical Python program is made up of one or more statements, which are executed, or run, by a Python console (also known as a shell) for their side effects e.g,

More information

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus) Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.

More information

a b c d a b c d e 5 e 7

a b c d a b c d e 5 e 7 COMPSCI 230 Homework 9 Due on April 5, 2016 Work on this assignment either alone or in pairs. You may work with different partners on different assignments, but you can only have up to one partner for

More information

CISC 181 Lab 2 (100 pts) Due: March 7 at midnight (This is a two-week lab)

CISC 181 Lab 2 (100 pts) Due: March 7 at midnight (This is a two-week lab) CISC 181 Lab 2 (100 pts) Due: March 7 at midnight (This is a two-week lab) This lab may be done individually or with a partner. Working with a partner DOES NOT mean, you do the evens, and I ll do the odds.

More information

CS 237 Fall 2018, Homework 08 Solution

CS 237 Fall 2018, Homework 08 Solution CS 237 Fall 2018, Homework 08 Solution Due date: Thursday November 8th at 11:59 pm (10% off if up to 24 hours late) via Gradescope General Instructions Please complete this notebook by filling in solutions

More information

The Pretest will consist of 30 different questions ranging from Geometry and Algebra and will be one hour long.

The Pretest will consist of 30 different questions ranging from Geometry and Algebra and will be one hour long. MATH OLYMPICS Procedures: 1. A limit of two (2) students from each team may register for this competition. Each student competes individually, so collaboration is not permitted. 2. This competition will

More information

Summer Math Packet for Students Going Into Pre-algebra 8

Summer Math Packet for Students Going Into Pre-algebra 8 Summer Math Packet for Students Going Into Pre-algebra 8 Purpose: The purpose of this packet is to review skills that are necessary for the student to have attained in order to be successful in the math

More information

You must bring your ID to the exam.

You must bring your ID to the exam. Com S 227 Spring 2017 Topics and review problems for Exam 2 Monday, April 3, 6:45 pm Locations, by last name: (same locations as Exam 1) A-E Coover 2245 F-M Hoover 2055 N-S Physics 0005 T-Z Hoover 1213

More information

Test 1 Review Questions with Solutions

Test 1 Review Questions with Solutions CS3510 Design & Analysis of Algorithms Section A Test 1 Review Questions with Solutions Instructor: Richard Peng Test 1 in class, Wednesday, Sep 13, 2017 Main Topics Asymptotic complexity: O, Ω, and Θ.

More information

CSE 21 Spring 2016 Homework 5. Instructions

CSE 21 Spring 2016 Homework 5. Instructions CSE 21 Spring 2016 Homework 5 Instructions Homework should be done in groups of one to three people. You are free to change group members at any time throughout the quarter. Problems should be solved together,

More information

CS261: HOMEWORK 2 Due 04/13/2012, at 2pm

CS261: HOMEWORK 2 Due 04/13/2012, at 2pm CS261: HOMEWORK 2 Due 04/13/2012, at 2pm Submit six *.c files via the TEACH website: https://secure.engr.oregonstate.edu:8000/teach.php?type=want_auth 1. Introduction The purpose of HW2 is to help you

More information

CS 1803 Individual Homework 2 Conditionals & Loops Due: Wednesday, September 8th, before 6 PM Out of 100 points

CS 1803 Individual Homework 2 Conditionals & Loops Due: Wednesday, September 8th, before 6 PM Out of 100 points CS 1803 Individual Homework 2 Conditionals & Loops Due: Wednesday, September 8th, before 6 PM Out of 100 points Files to submit: 1. HW2.py This is an INDIVIDUAL assignment! Collaboration at a reasonable

More information

You will not be tested on JUnit or the Eclipse debugger. The exam does not cover interfaces.

You will not be tested on JUnit or the Eclipse debugger. The exam does not cover interfaces. Com S 227 Fall 2016 Topics and review problems for Exam 2 Thursday, November 10, 6:45 pm Locations, by last name: (same locations as Exam 1) A-C Curtiss 0127, first floor only D-N Hoover 2055 O-Z Troxel

More information

CS 3204 Operating Systems Programming Project #2 Job / CPU Scheduling Dr. Sallie Henry Spring 2001 Due on February 27, 2001.

CS 3204 Operating Systems Programming Project #2 Job / CPU Scheduling Dr. Sallie Henry Spring 2001 Due on February 27, 2001. CS 3204 Operating Systems Programming Project #2 Job / CPU Scheduling Dr. Sallie Henry Spring 2001 Due on February 27, 2001. 23:59:59 PM Design and implement a program that simulates some of the job scheduling,

More information

Problem Y A limit 1 second. Zigzag

Problem Y A limit 1 second. Zigzag Problem Y A limit second Zigzag Your Ph.D. thesis on properties of integer sequences is coming along nicely. Each chapter is on a di erent type of sequence. The first covers arithmetic sequences. Subsequently

More information

Measures of Central Tendency

Measures of Central Tendency Page of 6 Measures of Central Tendency A measure of central tendency is a value used to represent the typical or average value in a data set. The Mean The sum of all data values divided by the number of

More information

Chapter 1. Math review. 1.1 Some sets

Chapter 1. Math review. 1.1 Some sets Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric

More information

15 Wyner Statistics Fall 2013

15 Wyner Statistics Fall 2013 15 Wyner Statistics Fall 2013 CHAPTER THREE: CENTRAL TENDENCY AND VARIATION Summary, Terms, and Objectives The two most important aspects of a numerical data set are its central tendencies and its variation.

More information

Computer Science 236 Fall Nov. 11, 2010

Computer Science 236 Fall Nov. 11, 2010 Computer Science 26 Fall Nov 11, 2010 St George Campus University of Toronto Assignment Due Date: 2nd December, 2010 1 (10 marks) Assume that you are given a file of arbitrary length that contains student

More information

Math 214 Introductory Statistics Summer Class Notes Sections 3.2, : 1-21 odd 3.3: 7-13, Measures of Central Tendency

Math 214 Introductory Statistics Summer Class Notes Sections 3.2, : 1-21 odd 3.3: 7-13, Measures of Central Tendency Math 14 Introductory Statistics Summer 008 6-9-08 Class Notes Sections 3, 33 3: 1-1 odd 33: 7-13, 35-39 Measures of Central Tendency odd Notation: Let N be the size of the population, n the size of the

More information

Week 0. Net Salary =Earnings- deductions; Read the employee number, Basic Print employee Number, Earnings,Deductions and Net salary.

Week 0. Net Salary =Earnings- deductions; Read the employee number, Basic Print employee Number, Earnings,Deductions and Net salary. Week 0. 1. Write a C program that evaluate the following expressions. Assume suitable values for various variables and print the left hand side variable. a) D=ut+1/2 ut 2 b) B=a*e kt c) P=RT/v d) Val=ax

More information

Introduction to Scientific Python, CME 193 Jan. 9, web.stanford.edu/~ermartin/teaching/cme193-winter15

Introduction 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 information

Number Theory Open, Round 1 Test #101

Number Theory Open, Round 1 Test #101 Number Theory Open, Round 1 Test #101 1. Write your 6-digit ID# in the I.D. NUMBER grid, left-justified, and bubble. Check that each column has only one number darkened. 2. In the EXAM NO. grid, write

More information

CURRICULUM STRUCTURE Topics Covered Term 1: Term 2: Term 3:

CURRICULUM STRUCTURE Topics Covered Term 1: Term 2: Term 3: CURRICULUM STRUCTURE Topics Covered Term 1: Term 2: Term 3: Year 7 The four operations Place value Ordering numbers Inverse operations Perimeter and area of shapes Fractions and Decimals Order of operations

More information

HOMEWORK 8. M. Neumann. Due: THU 29 MAR PM. Getting Started SUBMISSION INSTRUCTIONS

HOMEWORK 8. M. Neumann. Due: THU 29 MAR PM. Getting Started SUBMISSION INSTRUCTIONS CSE427S HOMEWORK 8 M. Neumann Due: THU 29 MAR 2018 1PM Getting Started Update your SVN repository. When needed, you will find additional materials for homework x in the folder hwx. So, for the current

More information

Downloaded from Chapter 2. Functions

Downloaded from   Chapter 2. Functions Chapter 2 Functions After studying this lesson, students will be able to: Understand and apply the concept of module programming Write functions Identify and invoke appropriate predefined functions Create

More information

82 2 Loops and Lists. Exercise 2.6: Compute energy levels in an atom The n-th energy level for an electron in a Hydrogen atom is given by

82 2 Loops and Lists. Exercise 2.6: Compute energy levels in an atom The n-th energy level for an electron in a Hydrogen atom is given by 82 2 Loops and Lists 2.7 Exercises Exercise 2.1: Make a Fahrenheit-Celsius conversion table Write a Python program that prints out a table with Fahrenheit degrees 0; 10; 20; : : : ; 100 in the first column

More information

(b) If a heap has n elements, what s the height of the tree?

(b) If a heap has n elements, what s the height of the tree? CISC 5835 Algorithms for Big Data Fall, 2018 Homework Assignment #4 1 Answer the following questions about binary tree and heap: (a) For a complete binary tree of height 4 (we consider a tree with just

More information

Module 2 Congruence Arithmetic pages 39 54

Module 2 Congruence Arithmetic pages 39 54 Module 2 Congruence Arithmetic pages 9 5 Here are some excellent websites that can help you on this topic: http://mathcentral.uregina.ca/qq/database/qq.09.98/kupper1.html http://nrich.maths.org/public.viewer.php?obj_id=50

More information

CS264: Homework #4. Due by midnight on Wednesday, October 22, 2014

CS264: Homework #4. Due by midnight on Wednesday, October 22, 2014 CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions

More information

Programming Assignment 6: Famous Scientists Diving Competition

Programming Assignment 6: Famous Scientists Diving Competition Page 1 of 5 Programming Assignment 6: Famous Scientists Diving Competition COP 3014 - Spring Term 2010 Point Value: 100 points Project Due Date: Wednesday April 21, 2010 at 11:59 PM NO programs will be

More information

ü 1.1 Getting Started

ü 1.1 Getting Started Chapter 1 Introduction Welcome to Mathematica! This tutorial manual is intended as a supplement to Rogawski's Calculus textbook and aimed at students looking to quickly learn Mathematica through examples.

More information

Data Structure and Algorithm Homework #6 Due: 5pm, Friday, June 14, 2013 TA === Homework submission instructions ===

Data Structure and Algorithm Homework #6 Due: 5pm, Friday, June 14, 2013 TA   === Homework submission instructions === Data Structure and Algorithm Homework #6 Due: 5pm, Friday, June 14, 2013 TA email: dsa1@csie.ntu.edu.tw === Homework submission instructions === For Problem 1, submit your source codes, a Makefile to compile

More information

MAT 4199C/5107 Second Homework Assignment Due 13 Feb by 1:00pm

MAT 4199C/5107 Second Homework Assignment Due 13 Feb by 1:00pm Marks: LAST NAME: First name: Student number: MAT 4199C/5107 Second Homework Assignment Due 13 Feb. 2019 by 1:00pm Instructions: The question labelled (U) is for undergraduate students only, while question

More information

CS 2316 Pair 1: Homework 3 Enigma Fun Due: Wednesday, February 1st, before 11:55 PM Out of 100 points

CS 2316 Pair 1: Homework 3 Enigma Fun Due: Wednesday, February 1st, before 11:55 PM Out of 100 points CS 2316 Pair 1: Homework 3 Enigma Fun Due: Wednesday, February 1st, before 11:55 PM Out of 100 points Files to submit: HW3.py This is a PAIR PROGRAMMING assignment: Work with your partner! For pair programming

More information

Math 250A (Fall 2009) - Lab I: Estimate Integrals Numerically with Matlab. Due Date: Monday, September 21, INSTRUCTIONS

Math 250A (Fall 2009) - Lab I: Estimate Integrals Numerically with Matlab. Due Date: Monday, September 21, INSTRUCTIONS Math 250A (Fall 2009) - Lab I: Estimate Integrals Numerically with Matlab Due Date: Monday, September 21, 2009 4:30 PM 1. INSTRUCTIONS The primary purpose of this lab is to understand how go about numerically

More information

Homework 5. Due Friday, March 1 at 5:00 PM

Homework 5. Due Friday, March 1 at 5:00 PM WRITTEN PROBLEMS Homework 5 Due Friday, March at 5:00 PM I think we can all agree that junior high is filled with embarrassing and awkward and downright humiliating moments, right? - Lizzie McGuire Handing

More information

2.) = 7.) Find the unit rate of 6 miles in 20 minutes. 4.) 6 8 = 8.) Put in simplified exponential form (8 3 )(8 6 )

2.) = 7.) Find the unit rate of 6 miles in 20 minutes. 4.) 6 8 = 8.) Put in simplified exponential form (8 3 )(8 6 ) Warm Up Do you remember how to... 1.) 3 + 9 = Wobble Chairs: Braden, Weston, & Avalon 6.) Put 3,400,000 in scientific notation? 2.) 2 + 8 = 7.) Find the unit rate of 6 miles in 20 minutes. 3.) 2 17 = 4.)

More information

Module 7 Highlights. Mastered Reviewed. Sections ,

Module 7 Highlights. Mastered Reviewed. Sections , Sections 5.3 5.6, 6.1 6.6 Module 7 Highlights Andrea Hendricks Math 0098 Pre-college Algebra Topics Degree & leading coeff. of a univariate polynomial (5.3, Obj. 1) Simplifying a sum/diff. of two univariate

More information

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1 Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,

More information

Assignment 7: Due Wednesday May 11 at 6pm UPDATES on Monday May 9

Assignment 7: Due Wednesday May 11 at 6pm UPDATES on Monday May 9 CS1110 Spring 2016 Assignment 7: Due Wednesday May 11 at 6pm UPDATES on Monday May 9 You must work either on your own or with one partner. If you work with a partner, you and your partner must first register

More information

If m = f(m), m is said to be perfect; if m < f(m), m is said to be abundant; if m > f(m), m is said to be deficient.

If m = f(m), m is said to be perfect; if m < f(m), m is said to be abundant; if m > f(m), m is said to be deficient. Problem 1: Abundant Numbers For any natural number (i.e., nonnegative integer) m, let f(m) be the sum of the positive divisors of m, not including m itself. As examples, f(28) = 1 + 2 + 4 + 7 + 14 = 28,

More information

Webinar Series. Introduction To Python For Data Analysis March 19, With Interactive Brokers

Webinar Series. Introduction To Python For Data Analysis March 19, With Interactive Brokers Learning Bytes By Byte Academy Webinar Series Introduction To Python For Data Analysis March 19, 2019 With Interactive Brokers Introduction to Byte Academy Industry focused coding school headquartered

More information

Mathematics Background

Mathematics Background Finding Area and Distance Students work in this Unit develops a fundamentally important relationship connecting geometry and algebra: the Pythagorean Theorem. The presentation of ideas in the Unit reflects

More information

Exercise 1.1. Page 1 of 22. Website: Mobile:

Exercise 1.1. Page 1 of 22. Website:    Mobile: Question 1: Exercise 1.1 Use Euclid s division algorithm to find the HCF of: (i) 135 and 225 Since 225 > 135, we apply the division lemma to 225 and 135 to obtain 225 = 135 1 + 90 Since remainder 90 0,

More information

CS150 Sample Final Solution

CS150 Sample Final Solution CS150 Sample Final Solution Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1)

More information

Ch.1 Introduction. Why Machine Learning (ML)?

Ch.1 Introduction. Why Machine Learning (ML)? Syllabus, prerequisites Ch.1 Introduction Notation: Means pencil-and-paper QUIZ Means coding QUIZ Why Machine Learning (ML)? Two problems with conventional if - else decision systems: brittleness: The

More information

Warm-Up Up Exercises. Use this diagram for Exercises If PR = 12 and m R = 19, find p. ANSWER If m P = 58 and r = 5, find p.

Warm-Up Up Exercises. Use this diagram for Exercises If PR = 12 and m R = 19, find p. ANSWER If m P = 58 and r = 5, find p. Warm-Up Up Exercises Use this diagram for Exercises 1 4. 1. If PR = 12 and m R = 19, find p. ANSWER 11.3 2. If m P = 58 and r = 5, find p. ANSWER 8.0 Warm-Up Up Exercises Use this diagram for Exercises

More information

Introduction to Modular Arithmetic

Introduction to Modular Arithmetic Randolph High School Math League 2014-2015 Page 1 1 Introduction Introduction to Modular Arithmetic Modular arithmetic is a topic residing under Number Theory, which roughly speaking is the study of integers

More information

Black Problem 2: Huffman Compression [75 points] Next, the Millisoft back story! Starter files

Black Problem 2: Huffman Compression [75 points] Next, the Millisoft back story! Starter files Black Problem 2: Huffman Compression [75 points] Copied from: https://www.cs.hmc.edu/twiki/bin/view/cs5/huff manblack on 3/15/2017 Due: 11:59 PM on November 14, 2016 Starter files First, here is a set

More information

Randomized Algorithms: Selection

Randomized Algorithms: Selection Randomized Algorithms: Selection CSE21 Winter 2017, Day 25 (B00), Day 16 (A00) March 15, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Selection Problem: WHAT Given list of distinct integers a 1, a 2,,

More information

User Manual Mail Merge

User Manual Mail Merge User Manual Mail Merge Version: 1.0 Mail Merge Date: 27-08-2013 How to print letters using Mail Merge You can use Mail Merge to create a series of documents, such as a standard letter that you want to

More information

Honors Computer Science Python Mr. Clausen Programs 4A, 4B, 4C, 4D, 4E, 4F

Honors Computer Science Python Mr. Clausen Programs 4A, 4B, 4C, 4D, 4E, 4F PROGRAM 4A Full Names (25 points) Honors Computer Science Python Mr. Clausen Programs 4A, 4B, 4C, 4D, 4E, 4F This program should ask the user for their full name: first name, a space, middle name, a space,

More information

Midterm Exam 2B Answer key

Midterm 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 information

Encryption à la Mod Name

Encryption à la Mod Name Rock Around the Clock Part Encryption à la Mod Let s call the integers,, 3,, 5, and the mod 7 encryption numbers and define a new mod 7 multiplication operation, denoted by, in the following manner: a

More information

HW 4 HINTS. 1. Chapter 6

HW 4 HINTS. 1. Chapter 6 HW 4 HINTS 1. Chapter 6 ***IMPORTANT GENERAL GUIDELINE*** When running commands inside loops and conditional statements, in general ALL output should be suppressed by placing a semicolon at the of the

More information