Why do computers store all information as binary numbers? (B) This requires no translation of data after it is entered by the user.

Size: px
Start display at page:

Download "Why do computers store all information as binary numbers? (B) This requires no translation of data after it is entered by the user."

Transcription

1 Week2 Quizzes (Aug30- Sept1) L4 Quiz 1 Why do computers store all information as binary numbers? (A) This is easier to use than base 10 numbers. (B) This requires no translation of data after it is entered by the user. (C) This only requires 2 memory states. (D) This helps memories be small.

2 L4 Quiz 2 The Central Processing Unit (CPU) does all the following except... (A) Fetches instructions and data from memory (B) Stores large quantities of data (C) Performs computations on the data based on the instructions (D) Sends results to output devices

3 L5 Sept 8 th Why def is not a valid Python name? A) the name is too short B) the name contains only lower case characters C) def is a Python reserved word

4 L6 Sept. 8 th A color is gray when: A) the red component is the same as the green one B) the red component is the same as the blue one C) the blue component is the same as the green one D) all the components have the same value

5 L7 Sept. 15 th Which of the following assertion about pictures is false? A) A picture has two dimensions: Width and Height B) A picture is the main memory representation of an image file C) A picture is a matrix of pixels D) A picture is a matrix of colors

6 L8 Sept. 20 th Consider the following function: def decreasered(pict): allpixels = getpixels(pict) for p in allpixels: value = getred(p) setred(p, value*0.5) Which of the following statements about it is false: A) you must load the function in the JES command area before executing it B) pict is an input parameter C) you cannot print the variable value in the JES command area after you execute the function D) the function decreasered decreases the red component of each pixel of the picture pict E) the function decreasered decreases the red component of the last pixel (i.e. bottommost, rightmost) of the picture pict

7 L10 Sept. 27 th print range(10,1,-5) will print : A) the empty sequence [] B) [10, 5, 1] C) [10, 5] D) will result in an error because the last parameter can not be negative

8 Oct 6th quiz Assume you have a picture with width 200 and height 60. We want to rotate the picture left by 180 degrees and then scale up the picture of a factor 5.Which dimensions should the have the empty picture we will use? A Newpict = makeemptypicture (200, 60) B Newpict = makeemptypicture (1000, 300) C Newpict = makeemptypicture (60, 200) D Newpict = makeemptypicture (300, 1000)

9 Oct 6th quiz The volume of a sound: A) depends on the frequency of the wave B) depends on the wavelength C) depends on the sampling rate D) depends on the amplitude of the wave

10 Oct 18th quiz The frequency of a sound wave: A) depends on the sampling rate B) depends on the amplitude of the wave C) is measured in DB D) is measured in number of cycles per second

11 Oct 25th What does the following function does? def myfunc(source): len = getlength(source) / target = makeemptysound(len) targetindex = 0 for sourceindex in range(0, getlength( source), 2): value = getsamplevalueat( source, sourceindex) setsamplevalueat( target, targetindex, value) targetindex = targetindex + 1 play(target) return target A) doubles the volume of a sound B) halves the volume of a sound C) doubles the frequency of a sound D) halves the frequency of a sound

12 Oct 27th quiz Consider the following function: def myfunc(): cont1=0 for x in range(0, 10): count1 = count1 + i return The function above: A) will cause an error when it is loaded B) will return 0 C) will return 45 D) will return None

13 Nov 1st quiz Consider the following function: def myfunc(): cont1=0 for x in range(0, 10): count1 = count1 + x If you want to assign to a variable (result) the output produced by the function above (i.e. result = myfunc()) : A) you do not need to change anything in the function B) you must add a return statement: return C) you must add a return statement: return count1 D) you must add an input parameter count1

14 Nov 8th quiz Suppose we have a string test: >>> test="this is a test." Which of the following statements will NOT result in an error? i) print test.startswith(this) ii) print startswith(test) iii) print test.startswith( this ) iv) print test.startswith( this ) A) only iii) B) iii) and iv) C) ii) D) none of them

15 Nov 10th quiz Which of the following command results in a JES error? A) print "Mark" + "Mark" B) print "Mark" + 2 C) print "MarkMark" D) print "Mark" * 2

16 Nov 15th quiz Given the following URL: Which of the following statements is WRONG? 1) http is the protocol used 2) web.ics.purdue.edu is the path to the resource 3) web.ics.purdue.edu is the domain name 4) /~cs180/fall2010cs177/recitation_slides/rec1.ppt is the path to the resource A) 1 B) 2 C) 3 D) 4

17 Nov 22nd quiz What is an HTTP server? A) a software that transforms domain names into IP addresses B) another name used to indicate a Web server C) a software that displays HTML pages D) none of the above

18 Nov 29th quiz Consider the two algorithms of slide 36 of Chapter14 Which of the following statements is the correct one? A) they have the same complexity because they both implement a sampling algorithm B) they have the same complexity: O(n**2) C) they have the same complexity: O(n) D) copybarbsfacelarger() has complexity O(n**2) and half(filename) has complexity O(n).

19 Dec 1st quiz If you want to grab a web page content from a Python program, which Python module you should import? A) none B) the os module C) the random module D) the urrlib module

20 Dec 6st quiz Suppose we have a string test: >>> test = "this" Which of the following statements will NOT result in an error? i) print isalpha(this) ii) print isalpha(test) iii) print test.isalpha( this ) iv) print test.isalpha() A) only iv) B) iii) and iv) C) ii) D) none of them

CS 177 Fall 2010 Exam II

CS 177 Fall 2010 Exam II There are 25 single choice questions. Each one is worth 4 points. The total score for the exam is 100. Answer the questions on the bubble sheet given. Fill in the Instructor, Course, Signature, Test, and

More information

CS 177 Fall 2010 Final Exam

CS 177 Fall 2010 Final Exam There are 50 single choice questions. Each one is worth 4 points. The total score for the exam is 200 points. Answer the questions on the bubble sheet given. Fill in the Instructor, Course, Signature,

More information

CS 100 Python commands, computing concepts, and algorithmic approaches for final Fall 2015

CS 100 Python commands, computing concepts, and algorithmic approaches for final Fall 2015 CS 100 Python commands, computing concepts, and algorithmic approaches for final Fall 2015 These pages will NOT BE INCLUDED IN THE MIDTERM. print - Displays a value in the command area - Examples: - print

More information

CS 1124 Media computation. Lecture 9.1, October 20, 2008 Steve Harrison

CS 1124 Media computation. Lecture 9.1, October 20, 2008 Steve Harrison CS 1124 Media computation Lecture 9.1, October 20, 2008 Steve Harrison Where were we? Backwards (in 3 ways) Strings Where were we? Backwards (in 3 ways) Strings Backwards (1) Reverse the samples: recipe

More information

Chapter 7: Modifying Samples in a Range

Chapter 7: Modifying Samples in a Range Chapter 7: Modifying Samples in a Range Knowing where we are in the sound More complex operations require us to know where we are in the sound, which sample Not just process all the samples exactly the

More information

CS 107 Practice Final Exam Spring Instructions: closed books, closed notes, open minds, 2 hour time limit. There are 4 sections.

CS 107 Practice Final Exam Spring Instructions: closed books, closed notes, open minds, 2 hour time limit. There are 4 sections. Name CS 107 Practice Final Exam Spring 2016 Instructions: closed books, closed notes, open minds, 2 hour time limit. There are 4 sections. Part I: Definitions and Theory Part II: Binary, Logic, and Gates

More information

More Binary Search Trees AVL Trees. CS300 Data Structures (Fall 2013)

More Binary Search Trees AVL Trees. CS300 Data Structures (Fall 2013) More Binary Search Trees AVL Trees bstdelete if (key not found) return else if (either subtree is empty) { delete the node replacing the parents link with the ptr to the nonempty subtree or NULL if both

More information

More BSTs & AVL Trees bstdelete

More BSTs & AVL Trees bstdelete More BSTs & AVL Trees bstdelete if (key not found) return else if (either subtree is empty) { delete the node replacing the parents link with the ptr to the nonempty subtree or NULL if both subtrees are

More information

8/16/12. Computer Organization. Architecture. Computer Organization. Computer Basics

8/16/12. Computer Organization. Architecture. Computer Organization. Computer Basics Computer Organization Computer Basics TOPICS Computer Organization Data Representation Program Execution Computer Languages 1 2 Architecture Computer Organization n central-processing unit n performs the

More information

UNIT 5B Binary Search

UNIT 5B Binary Search 205/09/30 UNIT 5B Binary Search Course Announcements Written exam next week (Wed. Oct 7 ) Practice exam available on the Resources page Exam reviews: Sunday afternoon; watch Piazza for times and places

More information

CS Lecture 19: Loop invariants

CS Lecture 19: Loop invariants CS 1110 Lecture 19: Loop invariants Announcements Prelim 2 conflicts Today (April 2) is two weeks before the prelim, and the deadline for submitting prelim conflicts. Instructor travel This week and the

More information

2nd Paragraph should make a point (could be an advantage or disadvantage) and explain the point fully giving an example where necessary.

2nd Paragraph should make a point (could be an advantage or disadvantage) and explain the point fully giving an example where necessary. STUDENT TEACHER WORKING AT GRADE TERM TARGET CLASS YEAR TARGET The long answer questions in this booklet are designed to stretch and challenge you. It is important that you understand how they should be

More information

15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2

15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2 15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2 Name Section Directions: Answer each question neatly in the space provided. Please read each question carefully. You have 50 minutes for this exam. No electronic

More information

Admin. How's the project coming? After these slides, read chapter 13 in your book. Quizzes will return

Admin. How's the project coming? After these slides, read chapter 13 in your book. Quizzes will return Recursion CS 1 Admin How's the project coming? After these slides, read chapter 13 in your book Yes that is out of order, but we can read it stand alone Quizzes will return Tuesday Nov 29 th see calendar

More information

Colour and Number Representation. From Hex to Binary and Back. Colour and Number Representation. Colour and Number Representation

Colour and Number Representation. From Hex to Binary and Back. Colour and Number Representation. Colour and Number Representation Colour and Number Representation From Hex to Binary and Back summary: colour representation easy: replace each hexadecimal "digit" with the corresponding four binary digits using the conversion table examples:

More information

CSC236H Lecture 5. October 17, 2018

CSC236H Lecture 5. October 17, 2018 CSC236H Lecture 5 October 17, 2018 Runtime of recursive programs def fact1(n): if n == 1: return 1 else: return n * fact1(n-1) (a) Base case: T (1) = c (constant amount of work) (b) Recursive call: T

More information

CSE 8A Lecture 13. Reading for next class: Today s topics: Finish PSA 6: Chromakey! DUE TUESDAY Interm exam 3 next Friday. Sounds!

CSE 8A Lecture 13. Reading for next class: Today s topics: Finish PSA 6: Chromakey! DUE TUESDAY Interm exam 3 next Friday. Sounds! CSE 8A Lecture 13 Reading for next class: 8.4-8.5 Today s topics: Sounds! Finish PSA 6: Chromakey! DUE TUESDAY Interm exam 3 next Friday CSE 8a Exam #3 Study Hints 1) Reading Quizzes (2/4-2/15) Omit 2/6/13

More information

Computer Basics 1/24/13. Computer Organization. Computer systems consist of hardware and software.

Computer Basics 1/24/13. Computer Organization. Computer systems consist of hardware and software. Hardware and Software Computer Basics TOPICS Computer Organization Data Representation Program Execution Computer Languages Computer systems consist of hardware and software. Hardware includes the tangible

More information

CS 43: Computer Networks. HTTP September 10, 2018

CS 43: Computer Networks. HTTP September 10, 2018 CS 43: Computer Networks HTTP September 10, 2018 Reading Quiz Lecture 4 - Slide 2 Five-layer protocol stack HTTP Request message Headers protocol delineators Last class Lecture 4 - Slide 3 HTTP GET vs.

More information

Introduction to Programming with JES

Introduction to Programming with JES Introduction to Programming with JES Titus Winters & Josef Spjut October 6, 2005 1 Introduction First off, welcome to UCR, and congratulations on becoming a Computer Engineering major. Excellent choice.

More information

Announcements. Project 2 due next Monday. Next Tuesday is review session; Midterm 1 on Wed., EE 129, 8:00 9:30pm

Announcements. Project 2 due next Monday. Next Tuesday is review session; Midterm 1 on Wed., EE 129, 8:00 9:30pm Project 2 due next Monday Next Tuesday is review session; Announcements Midterm 1 on Wed., EE 129, 8:00 9:30pm Project 3 to be posted Oct. 3 (next Wed) Preparing for the Midterm: Review Chapters 3-6 of

More information

Standard Plus Player. User Guide. i-tech Company LLC TOLL FREE: (888) WEB:

Standard Plus Player. User Guide. i-tech Company LLC TOLL FREE: (888) WEB: Standard Plus Player User Guide i-tech Company LLC TOLL FREE: (888) 483-2418 EMAIL: info@itechlcd.com WEB: www.itechlcd.com 1. INTRODUCTION OF THE Standard Plus PLAYER... 3 2. MAIN MENU... 4 2.1 START

More information

CS 1124 Media computation. Lecture 10.2 October 29, 2008 Steve Harrison

CS 1124 Media computation. Lecture 10.2 October 29, 2008 Steve Harrison CS 1124 Media computation Lecture 10.2 October 29, 2008 Steve Harrison Virtual machines interpreted, compiled and virtual machines Why do we write programs? One reason we write programs is to be able to

More information

Lecture 10: Boolean Expressions

Lecture 10: Boolean Expressions Lecture 10: Boolean Expressions CS1068+ Introductory Programming in Python Dr Kieran T. Herley Department of Computer Science University College Cork 2017-2018 KH (12/10/17) Lecture 10: Boolean Expressions

More information

Links Menu (Blogroll) Contents: Links Widget

Links Menu (Blogroll) Contents: Links Widget 45 Links Menu (Blogroll) Contents: Links Widget As bloggers we link to our friends, interesting stories, and popular web sites. Links make the Internet what it is. Without them it would be very hard to

More information

CS 323 Lecture 1. Design and Analysis of Algorithms. Hoeteck Wee

CS 323 Lecture 1. Design and Analysis of Algorithms. Hoeteck Wee { CS 323 Lecture 1 } Design and Analysis of Algorithms Hoeteck Wee hoeteck@cs.qc.cuny.edu http://cs323.qwriting.org/ Algorithmic ideas are pervasive APPLICATIONS. Economics, auctions and game theory Biology,

More information

Computer Basics 1/6/16. Computer Organization. Computer systems consist of hardware and software.

Computer Basics 1/6/16. Computer Organization. Computer systems consist of hardware and software. Hardware and Software Computer Basics TOPICS Computer Organization Data Representation Program Execution Computer Languages Computer systems consist of hardware and software. Hardware includes the tangible

More information

CURRICULUM MAPPING FORM

CURRICULUM MAPPING FORM Aug. or Jan. I. Pod Casting 2 Sept. or Feb. II. A. Introduce Audacity Software 1. Create sound projects using Audacity software 2. Use Video Cameras to create scenes 3. Splice Video and Sound to create

More information

Media Computation Module

Media Computation Module Media Computation Module Last Updated: May 4, 2011 1 Module Name Media Computation 2 Scope Media Computation is a new type of introductory Computer Science class created to provide a path for those interested

More information

CS Boolean Statements and Decision Structures. Week 6

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

Chapter 4 Notes. Creating Tables in a Website

Chapter 4 Notes. Creating Tables in a Website Chapter 4 Notes Creating Tables in a Website Project for Chapter 4 Statewide Realty Web Site Chapter Objectives Define table elements Describe the steps used to plan, design, and code a table Create a

More information

Technology to put your digital fabric printing business online. User Manual

Technology to put your digital fabric printing business online. User Manual 3440 Pawleys Loop N, Stevens Plantation, St. Cloud, FL 34769 USA webinfo@dpinnovations.com tel +1 888 552 1730 Technology to put your digital fabric printing business online User Manual Introduction The

More information

T02 Tutorial Slides for Week 2

T02 Tutorial Slides for Week 2 T02 Tutorial Slides for Week 2 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 19 September, 2017

More information

1010 2?= ?= CS 64 Lecture 2 Data Representation. Decimal Numbers: Base 10. Reading: FLD Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9

1010 2?= ?= CS 64 Lecture 2 Data Representation. Decimal Numbers: Base 10. Reading: FLD Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 CS 64 Lecture 2 Data Representation Reading: FLD 1.2-1.4 Decimal Numbers: Base 10 Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Example: 3271 = (3x10 3 ) + (2x10 2 ) + (7x10 1 ) + (1x10 0 ) 1010 10?= 1010 2?= 1

More information

Binary search trees. We can define a node in a search tree using a Python class definition as follows: class SearchTree:

Binary search trees. We can define a node in a search tree using a Python class definition as follows: class SearchTree: Binary search trees An important use of binary trees is to store values that we may want to look up later. For instance, a binary search tree could be used to store a dictionary of words. A binary search

More information

CSc 110, Autumn 2016 Lecture 7: Graphics. Adapted from slides by Marty Stepp and Stuart Reges

CSc 110, Autumn 2016 Lecture 7: Graphics. Adapted from slides by Marty Stepp and Stuart Reges CSc 110, Autumn 2016 Lecture 7: Graphics Adapted from slides by Marty Stepp and Stuart Reges Graphical objects We will draw graphics in Python using a new kind of object: DrawingPanel: A window on the

More information

Creating an Image Gallery Asset in OU Campus 4/23/15

Creating an Image Gallery Asset in OU Campus 4/23/15 Creating an Image Gallery Asset in OU Campus 4/23/15 IMPORTANT: To create a new image gallery, you must first crop all of your images to the same dimensions and save them to a folder on your computer.

More information

3. EXCEL FORMULAS & TABLES

3. EXCEL FORMULAS & TABLES Winter 2019 CS130 - Excel Formulas & Tables 1 3. EXCEL FORMULAS & TABLES Winter 2019 Winter 2019 CS130 - Excel Formulas & Tables 2 Cell References Absolute reference - refer to cells by their fixed position.

More information

Syllabus CSCI 405 Operating Systems Fall 2018

Syllabus CSCI 405 Operating Systems Fall 2018 Syllabus CSCI 405 Operating Systems Fall 2018 1.0 General Information Class Time: Monday/Wednesday/Friday 11:00 AM - 11:50 AM Class Location: 317 Thompson Instructor: Dr. Deepti Joshi; Office: 224 Thompson;

More information

CS 361 Data Structures & Algs Lecture 11. Prof. Tom Hayes University of New Mexico

CS 361 Data Structures & Algs Lecture 11. Prof. Tom Hayes University of New Mexico CS 361 Data Structures & Algs Lecture 11 Prof. Tom Hayes University of New Mexico 09-28-2010 1 Last Time Priority Queues & Heaps Heapify (up and down) 1: Preserve shape of tree 2: Swaps restore heap order

More information

Abstract Data Types Chapter 1

Abstract Data Types Chapter 1 Abstract Data Types Chapter 1 Part Two Bags A bag is a basic container like a shopping bag that can be used to store collections. There are several variations: simple bag grab bag counting bag 2 Bag ADT

More information

CSC 108H1 F 2009 Test 1 Duration 35 minutes Aids allowed: none. Student Number:

CSC 108H1 F 2009 Test 1 Duration 35 minutes Aids allowed: none. Student Number: CSC 108H1 F 2009 Test 1 Duration 35 minutes Aids allowed: none Last Name: Student Number: First Name: Lecture Section: L0102 Instructor: Gries Do not turn this page until you have received the signal to

More information

Table-Based Web Pages

Table-Based Web Pages Table-Based Web Pages Web Authoring and Design Benjamin Kenwright Outline What do we mean by Table-Based Web Sites? Review Table Tags/Structure Tips/Debugging/Applications Summary Review/Discussion Submissions/Quizzes/GitHub

More information

Com S 321 Problem Set 3

Com S 321 Problem Set 3 Com S 321 Problem Set 3 1. A computer has a main memory of size 8M words and a cache size of 64K words. (a) Give the address format for a direct mapped cache with a block size of 32 words. (b) Give the

More information

GREENWOOD PUBLIC SCHOOL DISTRICT AP Calculus AB Pacing Guide FIRST NINE WEEKS

GREENWOOD PUBLIC SCHOOL DISTRICT AP Calculus AB Pacing Guide FIRST NINE WEEKS AP Calculus AB FIRST NINE WEEKS 1 Aug. 6-10 5 Introduction to Course Classroom Expectations/Syllabus/Overview Course Requirements/Administer Learning Styles Inventories 1 Limits Estimate limits from graphs

More information

Computer Science 1000: Part #3. Binary Numbers

Computer Science 1000: Part #3. Binary Numbers Computer Science 1000: Part #3 Binary Numbers COMPUTER ORGANIZATION: AN OVERVIEW AN HISTORICAL INTERLUDE REPRESENTING NUMBERS IN BINARY REPRESENTING TEXT, SOUND, AND PICTURES IN BINARY Computer Organization:

More information

Topic 7: Algebraic Data Types

Topic 7: Algebraic Data Types Topic 7: Algebraic Data Types 1 Recommended Exercises and Readings From Haskell: The craft of functional programming (3 rd Ed.) Exercises: 5.5, 5.7, 5.8, 5.10, 5.11, 5.12, 5.14 14.4, 14.5, 14.6 14.9, 14.11,

More information

Lab 7: Python Loops and Images 1

Lab 7: Python Loops and Images 1 Lab 7: Python Loops and Images 1 Objectives to use while loops and for loops to further explore image and pixel features to further understand and practice using parameters in functions Copy the Lab 7

More information

Go to Components > Unite Nivo Slider Pro (near the bottom) Click on Edit Slides to the right of Front Page Rotator

Go to Components > Unite Nivo Slider Pro (near the bottom) Click on Edit Slides to the right of Front Page Rotator Calgary Journal Online Visual Editors The visual editors are responsible for: Creating the main, top rotating images on the website Creating Photo Galleries Inserting audio and video files Front Page Set-up

More information

Lab 2: Booleans, Strings, Random Numbers, Recursion, Variables, Input function

Lab 2: Booleans, Strings, Random Numbers, Recursion, Variables, Input function Lab 2: Booleans, Strings, Random Numbers, Recursion, Variables, Input function Due: Mar13 (Note that this is a 2-week lab) This lab must be done using paired partners. You should choose a different partner

More information

Chapter 3. Image Processing Methods. (c) 2008 Prof. Dr. Michael M. Richter, Universität Kaiserslautern

Chapter 3. Image Processing Methods. (c) 2008 Prof. Dr. Michael M. Richter, Universität Kaiserslautern Chapter 3 Image Processing Methods The Role of Image Processing Methods (1) An image is an nxn matrix of gray or color values An image processing method is algorithm transforming such matrices or assigning

More information

CMSC 201 Spring 2017 Lab 05 Lists

CMSC 201 Spring 2017 Lab 05 Lists CMSC 201 Spring 2017 Lab 05 Lists Assignment: Lab 05 Lists Due Date: During discussion, February 27th through March 2nd Value: 10 points (8 points during lab, 2 points for Pre Lab quiz) This week s lab

More information

Enterprise Portal Train the Trainer User Manual WEB PARTS

Enterprise Portal Train the Trainer User Manual WEB PARTS Enterprise Portal Train the Trainer User Manual WEB PARTS Version 1.2.1 Date: January 31, 2012 Table of Contents Table of Contents... 2 1 I Need To... 3 2 Media Web Part... 10 3 Content Editor... 15 4

More information

CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG

CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 14: OCT. 25TH INSTRUCTOR: JIAYIN WANG 1 Notice Assignments No new homework this week. Please make up the homework 1 5 & class exercises this week.

More information

Archive of past papers, solutions and homeworks for MATH 110, Discrete Mathematics, Fall 2012, Laurence Barker

Archive of past papers, solutions and homeworks for MATH 110, Discrete Mathematics, Fall 2012, Laurence Barker Archive of past papers, solutions and homeworks for MATH 110, Discrete Mathematics, Fall 2012, Laurence Barker version: 15 January 2013 Source file: arch110fall12.tex page 2: Handout 1, Course specification.

More information

File Input/Output. Learning Outcomes 10/8/2012. CMSC 201 Fall 2012 Instructor: John Park Lecture Section 01. Discussion Sections 02-08, 16, 17

File Input/Output. Learning Outcomes 10/8/2012. CMSC 201 Fall 2012 Instructor: John Park Lecture Section 01. Discussion Sections 02-08, 16, 17 CMSC 201 Fall 2012 Instructor: John Park Lecture Section 01 1 Discussion Sections 02-08, 16, 17 Adapted from slides by Sue Evans et al. 2 Learning Outcomes Become familiar with input and output (I/O) from

More information

Introduction to Computer Science Web Development

Introduction to Computer Science Web Development Introduction to Computer Science Web Development Flavio Esposito http://cs.slu.edu/~esposito/teaching/1080/ Lecture 12 Lecture Outline Background property and subproperties Position Elements by Floating

More information

Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Invitation to Computer Science, C++ Version, Third Edition

Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Invitation to Computer Science, C++ Version, Third Edition Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition Objectives In this chapter, you will learn about: The binary numbering

More information

Final Examination CSE 100 UCSD (Practice)

Final Examination CSE 100 UCSD (Practice) Final Examination UCSD (Practice) RULES: 1. Don t start the exam until the instructor says to. 2. This is a closed-book, closed-notes, no-calculator exam. Don t refer to any materials other than the exam

More information

Chapter 2 Bits, Data Types, and Operations

Chapter 2 Bits, Data Types, and Operations Chapter 2 Bits, Data Types, and Operations Original slides from Gregory Byrd, North Carolina State University Modified by Chris Wilcox, S. Rajopadhye Colorado State University How do we represent data

More information

CS 177 Week 15 Recitation Slides. Review

CS 177 Week 15 Recitation Slides. Review CS 177 Week 15 Recitation Slides Review 1 Announcements Final Exam on Friday Dec. 18 th STEW 183 from 1 3 PM Complete your online review of your classes. Your opinion matters!!! Project 6 due Just kidding

More information

Section 1.2: What is a Function? y = 4x

Section 1.2: What is a Function? y = 4x Section 1.2: What is a Function? y = 4x y is the dependent variable because it depends on what x is. x is the independent variable because any value can be chosen to replace x. Domain: a set of values

More information

CS 115 Lecture 8. Selection: the if statement. Neil Moore

CS 115 Lecture 8. Selection: the if statement. Neil Moore CS 115 Lecture 8 Selection: the if statement Neil Moore Department of Computer Science University of Kentucky Lexington, Kentucky 40506 neil@cs.uky.edu 24 September 2015 Selection Sometime we want to execute

More information

RD Grade Math Unit 1 Dates: Aug 3 rd - Sept 1 st. Alignment to Indiana Academic Standards: Topics A-F Alignment:

RD Grade Math Unit 1 Dates: Aug 3 rd - Sept 1 st. Alignment to Indiana Academic Standards: Topics A-F Alignment: 3 RD Grade Math Unit 1 Dates: Aug 3 rd - Sept 1 st 3.C.2 Represent the concept of multiplication of whole numbers with the following models: equalsized groups, arrays, area models, and equal "jumps" on

More information

CSC148 Intro. to Computer Science

CSC148 Intro. to Computer Science CSC148 Intro. to Computer Science Lecture 10: BST Recursive Delete, Efficiency of Algorithms Amir H. Chinaei, Summer 2016 Office Hours: R 10-12 BA4222 ahchinaei@cs.toronto.edu http://www.cs.toronto.edu/~ahchinaei/

More information

I-Carver CNC Project Computer Directions. Rob MacIlreith Last Update Oct 2017

I-Carver CNC Project Computer Directions. Rob MacIlreith Last Update Oct 2017 I-Carver CNC Project Computer Directions Rob MacIlreith Last Update Oct 2017 READ THIS ENTIRE SLIDE FIRST Make sure you follow all the directions carefully. Mistakes in programming your design can be disastrous

More information

MyLearn. Domain Administrators User Guide

MyLearn. Domain Administrators User Guide MyLearn Domain Administrators User Guide 3/10/2016 Contents About MyLearn... 1 Logging In as a Domain Administrator... 1 Using Compatibility Mode... 2 Creating Courses with the WYSIWYG Editor... 3 Inserting

More information

CSC 172 Data Structures and Algorithms. Fall 2017 TuTh 3:25 pm 4:40 pm Aug 30- Dec 22 Hoyt Auditorium

CSC 172 Data Structures and Algorithms. Fall 2017 TuTh 3:25 pm 4:40 pm Aug 30- Dec 22 Hoyt Auditorium CSC 172 Data Structures and Algorithms Fall 2017 TuTh 3:25 pm 4:40 pm Aug 30- Dec 22 Hoyt Auditorium Announcement Coming week: Nov 19 Nov 25 No Quiz No Workshop No New Lab Monday and Tuesday: regular Lab

More information

Website Training Part 2. Administration of the Website

Website Training Part 2. Administration of the Website Rotary Websites: Websites Club, Website Training Part 2 Administration of the Website Club Admin To login first click here Enter your username and password and then click Log In If you have forgotten your

More information

Progress Report of Final Year Project

Progress Report of Final Year Project Progress Report of Final Year Project Project Title: Design and implement a face-tracking engine for video William O Grady 08339937 Electronic and Computer Engineering, College of Engineering and Informatics,

More information

that system. weighted value associated with it. numbers. a number. the absence of a signal. MECH 1500 Quiz 2 Review Name: Class: Date:

that system. weighted value associated with it. numbers. a number. the absence of a signal. MECH 1500 Quiz 2 Review Name: Class: Date: Name: Class: Date: MECH 1500 Quiz 2 Review True/False Indicate whether the statement is true or false. 1. The decimal system uses the number 9 as its base. 2. All digital computing devices perform operations

More information

CMPSCI 105 Midterm Exam Solution Key. Fall 2013 October 17, Professor William T. Verts

CMPSCI 105 Midterm Exam Solution Key. Fall 2013 October 17, Professor William T. Verts CMPSCI 105 Midterm Exam Solution Key Fall 2013 October 17, 2013 Professor William T. Verts 15 Points (1 point each) Fill in your answer into the box at the left side of each question. Show your work

More information

Positioning in CSS: There are 5 different ways we can set our position:

Positioning in CSS: There are 5 different ways we can set our position: Positioning in CSS: So you know now how to change the color and style of the elements on your webpage but how do we get them exactly where we want them to be placed? There are 5 different ways we can set

More information

Digital Media. Daniel Fuller ITEC 2110

Digital Media. Daniel Fuller ITEC 2110 Digital Media Daniel Fuller ITEC 2110 Daily Question: Which statement is True? 5 + 5 = 10 1 + 1 = 10 F + 1 = 10 Email answer to DFullerDailyQuestion@gmail.com Subject Line: ITEC2110-26 First, some mac

More information

Physics 1C, Summer 2011 (Session 1) Practice Midterm 2 (50+4 points) Solutions

Physics 1C, Summer 2011 (Session 1) Practice Midterm 2 (50+4 points) Solutions Physics 1C, Summer 2011 (Session 1) Practice Midterm 2 (50+4 points) s Problem 1 (5x2 = 10 points) Label the following statements as True or False, with a one- or two-sentence explanation for why you chose

More information

More About Factoring Trinomials

More About Factoring Trinomials Section 6.3 More About Factoring Trinomials 239 83. x 2 17x 70 x 7 x 10 Width of rectangle: Length of rectangle: x 7 x 10 Width of shaded region: 7 Length of shaded region: x 10 x 10 Area of shaded region:

More information

9/8/2016. Characteristics of multimedia Various media types

9/8/2016. Characteristics of multimedia Various media types Chapter 1 Introduction to Multimedia Networking CLO1: Define fundamentals of multimedia networking Upon completion of this chapter students should be able to define: 1- Multimedia 2- Multimedia types and

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

CIS 580, Machine Perception, Spring 2015 Homework 1 Due: :59AM

CIS 580, Machine Perception, Spring 2015 Homework 1 Due: :59AM CIS 580, Machine Perception, Spring 2015 Homework 1 Due: 2015.02.09. 11:59AM Instructions. Submit your answers in PDF form to Canvas. This is an individual assignment. 1 Camera Model, Focal Length and

More information

CSE 115. Introduction to Computer Science I

CSE 115. Introduction to Computer Science I CSE 115 Introduction to Computer Science I Road map Review HTTP Web API's JSON in Python Examples Python Web Server import bottle @bottle.route("/") def any_name(): response = "" response

More information

SuprCloakr v1.2s. Documentation. Author: tech_09

SuprCloakr v1.2s. Documentation. Author: tech_09 SuprCloakr v1.2s Documentation Author: tech_09 http://www.suprcloakr.com Contents Installation... 3 Global settings... 4 Creating a campaign... 5 Cloak what?... 5 Cloak who?... 6 Cloak How?... 7 Installation

More information

Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras

Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 02 Lecture 06 Virtual Memory Hello. In this video, we

More information

CSc 110, Autumn Lecture 26: Assertions. Adapted from slides by Marty Stepp and Stuart Reges

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

CSc 110, Spring 2018 Lecture 9: Parameters, Graphics and Random. Adapted from slides by Marty Stepp and Stuart Reges

CSc 110, Spring 2018 Lecture 9: Parameters, Graphics and Random. Adapted from slides by Marty Stepp and Stuart Reges CSc 110, Spring 2018 Lecture 9: Parameters, Graphics and Random Adapted from slides by Marty Stepp and Stuart Reges Exercise: multiple parameters def main(): print_number(4, 9) print_number(17, 6) print_number(8,

More information

5 Control Reference! "! # $ # % " &

5 Control Reference! ! # $ # %  & 5 2 Control Definition Parts Reference Controls are the functional components of the parts which contain them. A control is called by either the Operation Parameter (must be enabled) or by a program. If

More information

CS Lab 8. Part 1 - Basics of File I/O

CS Lab 8. Part 1 - Basics of File I/O CS 105 - Lab 8 Today, you will be doing a lot with files! We will start with the basics of reading and writing and then expand upon the pixel value work that you did in a previous lab by working on image

More information

Java Comparable interface

Java Comparable interface Java Comparable interface Recall that to define a binary search tree, the elements that we are considering must be comparable to each other, meaning that there must be a well-defined ordering. For strings

More information

Microsoft Technical Training Public Class Schedules Year 2019

Microsoft Technical Training Public Class Schedules Year 2019 Microsoft Technical Training View Class Schedules by Categories Below 1. Windows Server 2016 2. Windows Server 2012 3. Azure Windows 10 Skype for Business 2015 Power BI 4. SQL Server 5. Exchange Server

More information

CS113: Lecture 3. Topics: Variables. Data types. Arithmetic and Bitwise Operators. Order of Evaluation

CS113: Lecture 3. Topics: Variables. Data types. Arithmetic and Bitwise Operators. Order of Evaluation CS113: Lecture 3 Topics: Variables Data types Arithmetic and Bitwise Operators Order of Evaluation 1 Variables Names of variables: Composed of letters, digits, and the underscore ( ) character. (NO spaces;

More information

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Quiz I

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Quiz I Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.858 Fall 2010 Quiz I All problems are open-ended questions. In order to receive credit you must answer

More information

EE368 Project: Visual Code Marker Detection

EE368 Project: Visual Code Marker Detection EE368 Project: Visual Code Marker Detection Kahye Song Group Number: 42 Email: kahye@stanford.edu Abstract A visual marker detection algorithm has been implemented and tested with twelve training images.

More information

CMS and e-commerce Solutions. version 1.0. Please, visit us at: or contact directly by

CMS and e-commerce Solutions. version 1.0. Please, visit us at:   or contact directly by Homepage Content Slider for Magento User Guide version 1.0 created by IToris IToris Table of contents 1. Introduction... 3 1.1. Purpose... 3 2. Installation and License... 3 2.1. System Requirements...

More information

K5 Portal User Guide

K5 Portal User Guide FUJITSU Cloud Service K5 K5 Portal User Guide Version 2.6 FUJITSU LIMITED Preface Purpose of This Document This guide describes the operating procedures for the services provided by FUJITSU Cloud Service

More information

Motic Images Plus 3.0 ML Software. Windows OS User Manual

Motic Images Plus 3.0 ML Software. Windows OS User Manual Motic Images Plus 3.0 ML Software Windows OS User Manual Motic Images Plus 3.0 ML Software Windows OS User Manual CONTENTS (Linked) Introduction 05 Menus and tools 05 File 06 New 06 Open 07 Save 07 Save

More information

Space Details. Available Pages

Space Details. Available Pages Space Details Key: confhelp Name: Confluence Help Description: Creator (Creation Date): ljparkhi (Aug 14, 2008) Last Modifier (Mod. Date): ljparkhi (Aug 14, 2008) Available Pages Working with Pages Document

More information

CS1110. Lecture 1: Final review session. Review materials See website for a version of last year s final with conventions redone to match this year.

CS1110. Lecture 1: Final review session. Review materials See website for a version of last year s final with conventions redone to match this year. CS1110 Lecture 1: Final review session Announcements Review materials See website for a version of last year s final with conventions redone to match this year. Slides by D. Gries, L. Lee, S. Marschner,

More information

ETGG1801 Game Programming Foundations I Andrew Holbrook Fall Lecture 0 - Introduction to Computers 1

ETGG1801 Game Programming Foundations I Andrew Holbrook Fall Lecture 0 - Introduction to Computers 1 ETGG1801 Game Programming Foundations I Andrew Holbrook Fall 2013 Lecture 0 - Introduction to Computers 1 Introduction to Computers Vacuum Tubes and Transistors Electrically-controlled switches Logic Gates

More information

CPSC 301: Computing in the Life Sciences Winter , Term 2. Practice Questions

CPSC 301: Computing in the Life Sciences Winter , Term 2. Practice Questions CPSC 301: Computing in the Life Sciences Winter 2015 2016, Term 2 Practice Questions Note: These questions are for you to practice for the final exam. The format and coverage of the final questions may

More information

Course Syllabus. NTM 2415 Cisco TCP/IP Routing Protocols & Router Configuration Cisco Networking Academy Cisco Semesters 1 & 2 Online Spring 2015

Course Syllabus. NTM 2415 Cisco TCP/IP Routing Protocols & Router Configuration Cisco Networking Academy Cisco Semesters 1 & 2 Online Spring 2015 Course Syllabus Important Information: Although this is listed and done as an online class, it is NOT an official WSU online class. It is through Canvas but not WSU s Canvas so it doesn t connect to grades

More information

Welcome Back! Without further delay, let s get started! First Things First. If you haven t done it already, download Turbo Lister from ebay.

Welcome Back! Without further delay, let s get started! First Things First. If you haven t done it already, download Turbo Lister from ebay. Welcome Back! Now that we ve covered the basics on how to use templates and how to customise them, it s time to learn some more advanced techniques that will help you create outstanding ebay listings!

More information