Programming and Data Structures

Size: px
Start display at page:

Download "Programming and Data Structures"

Transcription

1 Programming and Data Structures Tutorial sheet: 2 Topics: Decision Making, Looping and Branching Q 1. (a) What is wrong with the following loop while ( n <= 100) sum += n*n; Ans : It is an infinite loop. The control variable n doesn t change (b) If s is a compound statement, and e1, e2 and e2 are expressions, then what is the difference between the program fragment: for ( e1; e2; e3 ) s; and the fragment: e1; while ( e2) s; e3; Ans : There is no difference between these two fragments, unless s contains a continue statement (tricky). For example the following for statement will iterate 4 times and then terminate normally, but the while statement will be an infinite loop for (i=0; i < 4; i++) if(i == 2) continue; i=0; while (i < 4) if(i == 2) continue; i++; Q 2. Convert the following for loop into a while loop: for ( int i = 1; i <= n; i++) printf ( %d,i*i); Ans : int i= 1; while ( i <= n) printf ( %d,i*i); i++;

2 Q 3. Write the output of the following code a) main( ) Ans : for( int i = 0; i < 8; i++) b) main() int n=100, s; Ans : 68 if ( i%2 == 0) printf( %d\n,i+1); else if ( i%3 == 0) printf( %d\n,i*1); else if ( i%5 == 0) printf( %d\n,.2*i); else printf( %d,i); for(s=2; n>2; --n) s +=2; n-=2; printf( %d,s); Q 4. (a) What is wrong with the following code? printf( Enter n: ; scanf( %d,n); if(n<0) printf( That is negative. Try again.\n ); scanf( %d,n); else printf( o.k. n = %d \n,n); Ans: There is more than one statement between the if clause and the else clause. They need to be made into a compound statement by enclosing them in braces. (b) What does the variable sum compute for any value of N in the following code? int i, sum = 0; for ( i = 1 ; i < N ; i *=2) sum += i ; Ans: It computes the sum of a G.P. starting with 1 and common ratio 2 upto N terms.

3 Q 5. WAP that reads a positive integer n and then prints the following pattern ********* _******** ******* ****** ***** **** *** ** * where n is the number of lines void main() int i=0,j=0,n; printf( Enter no. of lines - ); for(i = 0; i < n ;i++) for(j = 0; j < n; j++) if( i > j) printf( _ ); else printf( * ); printf( \n ); Q 6. Find the output of the following C program int i = 20, k = 0; for (int j = 1; j < i; j = i + 4*( i / j) ) printf( %d, k ); Ans: 4 k += j < 10? 4 : 3;

4 Q 7 Write C code which reads a floating point number x and an integer n from keyboard and computes the following. x + (x+1) + (x+2) + (x+3) (x+n) Ans : #include<stdio.h> void main() float x, sum; int n,i; printf("enter value of n : "); scanf("%d",&n); printf("enter value of x : "); scanf("%f",&x); for( i = 0; i <= n; i++) sum += x+i; printf( %f, sum); Q 8. WAP to compute the sine of an angle using the following sine infinite series upto 5 decimal places sin(x) = x x 3 /3! + x 5 /5! x 7 /7! + where x is in radian. void main ( ) float x, sum, t1, t2; int i printf( Enter angle in radians : ); scanf( %d,&x); t1 = x; t2 = -1*x*x*x/3; for (sum = t1, i = 5;(t2-t1)<.00001; i += 2) sum += t1; t1=t2; t2 = -1*t2*x*x/(i*(i-1)); Q 9. Consider the evaluation of the following function: 1.5x 3, x 2 y 2x, x>2 and z 4x 100, x<40 300, x x 150, x>40 How can y and z be evaluated using conditional operator (?:). Ans: y = ( x <= 2 )? (1.5*x + 3) : 2*x ; z = ( x <= 40 )? ( ( x < 40 )? ( 4*x ) : 300 ) : ( 4.5*x );

5 Q 10. WAP to take a number from the user and check whether it is a palindrome or not. A number is a palindrome if it is the same as its reverse. Ex is a palindrome. void main( ) int n,i,sum; printf( Enter a number : ); sum=0; i = n; while(i>0) sum = ( sum*10 ) + i%10; i = i/10; if(n == sum) printf( \n%d is a palindrome.,n); else printf( \n%d is not a palindrome.,n); Q 11.WAP that plays the game Rock, Paper, Scissors. In this game, two players simultaneously say (or display a hand symbol representing) either rock, paper or scissors. The winner is the one whose choice dominates the other. The rules are: paper dominates (wraps) rock, rock dominates (breaks) scissors, and scissors dominates (cut) paper. enum Choice rock, paper, scissors ; enum Result player1, player2, tie ; void main( ) int n; Choice choice1, choice2; Result result; printf( Choose rock(0), paper(1), or scissors(2) :\n ); printf( Player #1 : ); choice1 = n; printf( Player #2 : ); choice2 = n; if( choice1 == choice2) result = tie; else if( choice1 == rock ) if( choice2 == paper) result = player2; else result = player1; else if( choice1 == paper ) if( choice2 == rock) result = player1; else result = player2; else // ( choice1 == scissors ) if( choice2 == rock ) result = player2; else result = player1; if( result == tie ) printf( \nyou tied. ); else if( result == player1 ) printf( \nplayer #1 wins. ); else if( result == player2 ) printf( \nplayer #2 wins. ); ** Alternatively one can use normal integer data type for choice and result instead of enum.

6 Q 12. Amicable numbers are found in pairs. A given pair of numbers is Amicable if the sum of the proper divisors (not including itself) of one number is equal to the other number and vice versa. For example 220 & 284 are amicable numbers First we find the proper divisors of 220: 220:1, 2, 4, 5, 10, 11, 20, 22, 44, 55, = 284 Now, 284: 1, 2, 4, 71, = 220 WAP to check that the input pair of numbers is amicable. void main( ) int n1, n2, sum1, sum2, i; printf( Enter 2 numbers : ); scanf( %d%d,&n1,&n2); sum1 = sum2 = 0; for(i = 1; i <= n1; i++) if( (n1 % i) == 0 ) sum1 += i; for(i = 1; i <= n2; i++) if( (n2 % i) == 0 ) sum2 += i; if( ( sum2 == n1 ) && ( sum1 == n2) ) printf( \n%d and %d is an amicable pair.,n1,n2); else printf( \n%d and %d is not an amicable pair.,n1,n2);

Senem Kumova Metin & Ilker Korkmaz 1

Senem Kumova Metin & Ilker Korkmaz 1 Senem Kumova Metin & Ilker Korkmaz 1 A loop is a block of code that can be performed repeatedly. A loop is controlled by a condition that is checked each time through the loop. C supports two categories

More information

Keywords are identifiers having predefined meanings in C programming language. The list of keywords used in standard C are : unsigned void

Keywords are identifiers having predefined meanings in C programming language. The list of keywords used in standard C are : unsigned void 1. Explain C tokens Tokens are basic building blocks of a C program. A token is the smallest element of a C program that is meaningful to the compiler. The C compiler recognizes the following kinds of

More information

arrays C Programming Language - Arrays

arrays C Programming Language - Arrays arrays So far, we have been using only scalar variables scalar meaning a variable with a single value But many things require a set of related values coordinates or vectors require 3 (or 2, or 4, or more)

More information

C Programming. Charudatt Kadolkar. IIT Guwahati. C Programming p.1/34

C Programming. Charudatt Kadolkar. IIT Guwahati. C Programming p.1/34 C Programming Charudatt Kadolkar IIT Guwahati C Programming p.1/34 We want to print a table of sine function. The output should look like: 0 0.0000 20 0.3420 40 0.6428 60 0.8660 80 0.9848 100 0.9848 120

More information

9 Control Statements. 9.1 Introduction. 9.2 Objectives. 9.3 Statements

9 Control Statements. 9.1 Introduction. 9.2 Objectives. 9.3 Statements 9 Control Statements 9.1 Introduction The normal flow of execution in a high level language is sequential, i.e., each statement is executed in the order of its appearance in the program. However, depending

More information

Informatica e Sistemi in Tempo Reale

Informatica e Sistemi in Tempo Reale Informatica e Sistemi in Tempo Reale Introduction to C programming Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 25, 2010 G. Lipari (Scuola Superiore Sant Anna)

More information

Colored Hats and Logic Puzzles

Colored Hats and Logic Puzzles Colored Hats and Logic Puzzles Alex Zorn January 21, 2013 1 Introduction In this talk we ll discuss a collection of logic puzzles/games in which a number of people are given colored hats, and they try

More information

1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:

1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of

More information

Beginning to Program Python

Beginning to Program Python COMP1021 Introduction to Computer Science Beginning to Program Python David Rossiter Outcomes After completing this presentation, you are expected to be able to: 1. Use Python code to do simple text input

More information

Embedded Systems. Review of ANSI C Topics. A Review of ANSI C and Considerations for Embedded C Programming. Basic features of C

Embedded Systems. Review of ANSI C Topics. A Review of ANSI C and Considerations for Embedded C Programming. Basic features of C Embedded Systems A Review of ANSI C and Considerations for Embedded C Programming Dr. Jeff Jackson Lecture 2-1 Review of ANSI C Topics Basic features of C C fundamentals Basic data types Expressions Selection

More information

MATH-0910 Review Concepts (Haugen)

MATH-0910 Review Concepts (Haugen) Unit 1 Whole Numbers and Fractions MATH-0910 Review Concepts (Haugen) Exam 1 Sections 1.5, 1.6, 1.7, 1.8, 2.1, 2.2, 2.3, 2.4, and 2.5 Dividing Whole Numbers Equivalent ways of expressing division: a b,

More information

Kids College Computer Game Programming Exploring Small Basic and Procedural Programming

Kids College Computer Game Programming Exploring Small Basic and Procedural Programming Kids College Computer Game Programming Exploring Small Basic and Procedural Programming According to Microsoft, Small Basic is a programming language developed by Microsoft, focused at making programming

More information

Sharp EL-733A Tutorial

Sharp EL-733A Tutorial To begin, look at the face of the calculator. Almost every key on the EL-733A has two functions: each key's primary function is noted on the key itself, while each key's secondary function is noted in

More information

3/13/2012. Writing Simple C Programs. ESc101: Decision making using if-else and switch statements. Writing Simple C Programs

3/13/2012. Writing Simple C Programs. ESc101: Decision making using if-else and switch statements. Writing Simple C Programs Writing Simple C Programs ESc101: Decision making using if- and switch statements Instructor: Krithika Venkataramani Semester 2, 2011-2012 Use standard files having predefined instructions stdio.h: has

More information

3. How many winning lines are there in 5x5 Tic-Tac-Toe? 4. How many winning lines are there in n x n Tic-Tac-Toe?

3. How many winning lines are there in 5x5 Tic-Tac-Toe? 4. How many winning lines are there in n x n Tic-Tac-Toe? Winning Lines in Tic-Tac-Toe 1. The standard Tic-Tac-Toe is played on a 3 x 3 board, where there are vertical winning lines, horizontal winning lines, diagonal winning lines. This is a grand total of winning

More information

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Exam Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) The JDK command to compile a class in the file Test.java is A) java Test.java B) java

More information

Sources: On the Web: Slides will be available on:

Sources: On the Web: Slides will be available on: C programming Introduction The basics of algorithms Structure of a C code, compilation step Constant, variable type, variable scope Expression and operators: assignment, arithmetic operators, comparison,

More information

Chapter One Introduction to Programming

Chapter One Introduction to Programming Chapter One Introduction to Programming 1-1 Algorithm and Flowchart Algorithm is a step-by-step procedure for calculation. More precisely, algorithm is an effective method expressed as a finite list of

More information

Near Optimal Solutions

Near Optimal Solutions Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.

More information

Lies My Calculator and Computer Told Me

Lies My Calculator and Computer Told Me Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing

More information

Graphing Calculator Workshops

Graphing Calculator Workshops Graphing Calculator Workshops For the TI-83/84 Classic Operating System & For the TI-84 New Operating System (MathPrint) LEARNING CENTER Overview Workshop I Learn the general layout of the calculator Graphing

More information

PROGRAMMING IN C PROGRAMMING IN C CONTENT AT A GLANCE

PROGRAMMING IN C PROGRAMMING IN C CONTENT AT A GLANCE PROGRAMMING IN C CONTENT AT A GLANCE 1 MODULE 1 Unit 1 : Basics of Programming Unit 2 : Fundamentals Unit 3 : C Operators MODULE 2 unit 1 : Input Output Statements unit 2 : Control Structures unit 3 :

More information

Calculator Practice: Computation with Fractions

Calculator Practice: Computation with Fractions Calculator Practice: Computation with Fractions Objectives To provide practice adding fractions with unlike denominators and using a calculator to solve fraction problems. www.everydaymathonline.com epresentations

More information

CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013

CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013 Oct 4, 2013, p 1 Name: CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013 1. (max 18) 4. (max 16) 2. (max 12) 5. (max 12) 3. (max 24) 6. (max 18) Total: (max 100)

More information

J a v a Quiz (Unit 3, Test 0 Practice)

J a v a Quiz (Unit 3, Test 0 Practice) Computer Science S-111a: Intensive Introduction to Computer Science Using Java Handout #11 Your Name Teaching Fellow J a v a Quiz (Unit 3, Test 0 Practice) Multiple-choice questions are worth 2 points

More information

Parallel Computing. Shared memory parallel programming with OpenMP

Parallel Computing. Shared memory parallel programming with OpenMP Parallel Computing Shared memory parallel programming with OpenMP Thorsten Grahs, 27.04.2015 Table of contents Introduction Directives Scope of data Synchronization 27.04.2015 Thorsten Grahs Parallel Computing

More information

Unit 5 Length. Year 4. Five daily lessons. Autumn term Unit Objectives. Link Objectives

Unit 5 Length. Year 4. Five daily lessons. Autumn term Unit Objectives. Link Objectives Unit 5 Length Five daily lessons Year 4 Autumn term Unit Objectives Year 4 Suggest suitable units and measuring equipment to Page 92 estimate or measure length. Use read and write standard metric units

More information

Student Worksheet 1 TI-15 Explorer : Finding Patterns

Student Worksheet 1 TI-15 Explorer : Finding Patterns Student Worksheet 1 W1 3 and the remainder is always 0 Use a trail and error approach and 3 to make the TI-15 present the following output displays. When you get it to work, write down the dividends (starting

More information

Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution

Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution Recall: Ch5: Discrete Probability Distributions Section 5-1: Probability Distribution A variable is a characteristic or attribute that can assume different values. o Various letters of the alphabet (e.g.

More information

Computer Science 2nd Year Solved Exercise. Programs 3/4/2013. Aumir Shabbir Pakistan School & College Muscat. Important. Chapter # 3.

Computer Science 2nd Year Solved Exercise. Programs 3/4/2013. Aumir Shabbir Pakistan School & College Muscat. Important. Chapter # 3. 2013 Computer Science 2nd Year Solved Exercise Chapter # 3 Programs Chapter # 4 Chapter # 5 Chapter # 6 Chapter # 7 Important Work Sheets Aumir Shabbir Pakistan School & College Muscat 3/4/2013 Chap #

More information

Answer: The relationship cannot be determined.

Answer: The relationship cannot be determined. Question 1 Test 2, Second QR Section (version 3) In City X, the range of the daily low temperatures during... QA: The range of the daily low temperatures in City X... QB: 30 Fahrenheit Arithmetic: Ranges

More information

Objective. Materials. TI-73 Calculator

Objective. Materials. TI-73 Calculator 0. Objective To explore subtraction of integers using a number line. Activity 2 To develop strategies for subtracting integers. Materials TI-73 Calculator Integer Subtraction What s the Difference? Teacher

More information

Bayesian Nash Equilibrium

Bayesian Nash Equilibrium . Bayesian Nash Equilibrium . In the final two weeks: Goals Understand what a game of incomplete information (Bayesian game) is Understand how to model static Bayesian games Be able to apply Bayes Nash

More information

Two-way selection. Branching and Looping

Two-way selection. Branching and Looping Control Structures: are those statements that decide the order in which individual statements or instructions of a program are executed or evaluated. Control Structures are broadly classified into: 1.

More information

The GMAT Guru. Prime Factorization: Theory and Practice

The GMAT Guru. Prime Factorization: Theory and Practice . Prime Factorization: Theory and Practice The following is an ecerpt from The GMAT Guru Guide, available eclusively to clients of The GMAT Guru. If you would like more information about GMAT Guru services,

More information

Random Fibonacci-type Sequences in Online Gambling

Random Fibonacci-type Sequences in Online Gambling Random Fibonacci-type Sequences in Online Gambling Adam Biello, CJ Cacciatore, Logan Thomas Department of Mathematics CSUMS Advisor: Alfa Heryudono Department of Mathematics University of Massachusetts

More information

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS. Christopher Heil Georgia Institute of Technology WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

More information

In this Chapter you ll learn:

In this Chapter you ll learn: Now go, write it before them in a table, and note it in a book. Isaiah 30:8 To go beyond is as wrong as to fall short. Confucius Begin at the beginning, and go on till you come to the end: then stop. Lewis

More information

Zero-knowledge games. Christmas Lectures 2008

Zero-knowledge games. Christmas Lectures 2008 Security is very important on the internet. You often need to prove to another person that you know something but without letting them know what the information actually is (because they could just copy

More information

What is a Loop? Pretest Loops in C++ Types of Loop Testing. Count-controlled loops. Loops can be...

What is a Loop? Pretest Loops in C++ Types of Loop Testing. Count-controlled loops. Loops can be... What is a Loop? CSC Intermediate Programming Looping A loop is a repetition control structure It causes a single statement or a group of statements to be executed repeatedly It uses a condition to control

More information

Brain Game. 3.4 Solving and Graphing Inequalities HOW TO PLAY PRACTICE. Name Date Class Period. MATERIALS game cards

Brain Game. 3.4 Solving and Graphing Inequalities HOW TO PLAY PRACTICE. Name Date Class Period. MATERIALS game cards Name Date Class Period Brain Game 3.4 Solving and Graphing Inequalities MATERIALS game cards HOW TO PLAY Work with another student. Shuffle the cards you receive from your teacher. Then put them face down

More information

Fundamentals of Programming

Fundamentals of Programming Fundamentals of Programming Introduction to the C language Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa February 29, 2012 G. Lipari (Scuola Superiore Sant Anna) The C language

More information

14.1. Basic Concepts of Integration. Introduction. Prerequisites. Learning Outcomes. Learning Style

14.1. Basic Concepts of Integration. Introduction. Prerequisites. Learning Outcomes. Learning Style Basic Concepts of Integration 14.1 Introduction When a function f(x) is known we can differentiate it to obtain its derivative df. The reverse dx process is to obtain the function f(x) from knowledge of

More information

Paper 1. Calculator not allowed. Mathematics test. First name. Last name. School. Remember KEY STAGE 3 TIER 5 7

Paper 1. Calculator not allowed. Mathematics test. First name. Last name. School. Remember KEY STAGE 3 TIER 5 7 Ma KEY STAGE 3 Mathematics test TIER 5 7 Paper 1 Calculator not allowed First name Last name School 2009 Remember The test is 1 hour long. You must not use a calculator for any question in this test. You

More information

CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Linda Shapiro Winter 2015

CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Linda Shapiro Winter 2015 CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Linda Shapiro Today Registration should be done. Homework 1 due 11:59 pm next Wednesday, January 14 Review math essential

More information

DNA Data and Program Representation. Alexandre David 1.2.05 adavid@cs.aau.dk

DNA Data and Program Representation. Alexandre David 1.2.05 adavid@cs.aau.dk DNA Data and Program Representation Alexandre David 1.2.05 adavid@cs.aau.dk Introduction Very important to understand how data is represented. operations limits precision Digital logic built on 2-valued

More information

This is great when speed is important and relatively few words are necessary, but Max would be a terrible language for writing a text editor.

This is great when speed is important and relatively few words are necessary, but Max would be a terrible language for writing a text editor. Dealing With ASCII ASCII, of course, is the numeric representation of letters used in most computers. In ASCII, there is a number for each character in a message. Max does not use ACSII very much. In the

More information

Simple sorting algorithms and their complexity. Bubble sort. Complexity of bubble sort. Complexity of bubble sort. Bubble sort of lists

Simple sorting algorithms and their complexity. Bubble sort. Complexity of bubble sort. Complexity of bubble sort. Bubble sort of lists Simple sorting algorithms and their complexity Bubble sort Selection sort Insertion sort Bubble sort void bubblesort(int arr[]){ int i; int j; int temp; for(i = arr.length-1; i > 0; i--){ for(j = 0; j

More information

CP Lab 2: Writing programs for simple arithmetic problems

CP Lab 2: Writing programs for simple arithmetic problems Computer Programming (CP) Lab 2, 2015/16 1 CP Lab 2: Writing programs for simple arithmetic problems Instructions The purpose of this Lab is to guide you through a series of simple programming problems,

More information

ε: Voltage output of Signal Generator (also called the Source voltage or Applied

ε: Voltage output of Signal Generator (also called the Source voltage or Applied Experiment #10: LR & RC Circuits Frequency Response EQUIPMENT NEEDED Science Workshop Interface Power Amplifier (2) Voltage Sensor graph paper (optional) (3) Patch Cords Decade resistor, capacitor, and

More information

FEEG6002 - Applied Programming 5 - Tutorial Session

FEEG6002 - Applied Programming 5 - Tutorial Session FEEG6002 - Applied Programming 5 - Tutorial Session Sam Sinayoko 2015-10-30 1 / 38 Outline Objectives Two common bugs General comments on style String formatting Questions? Summary 2 / 38 Objectives Revise

More information

Ready, Set, Go! Math Games for Serious Minds

Ready, Set, Go! Math Games for Serious Minds Math Games with Cards and Dice presented at NAGC November, 2013 Ready, Set, Go! Math Games for Serious Minds Rande McCreight Lincoln Public Schools Lincoln, Nebraska Math Games with Cards Close to 20 -

More information

So far we have considered only numeric processing, i.e. processing of numeric data represented

So far we have considered only numeric processing, i.e. processing of numeric data represented Chapter 4 Processing Character Data So far we have considered only numeric processing, i.e. processing of numeric data represented as integer and oating point types. Humans also use computers to manipulate

More information

Outline. Conditional Statements. Logical Data in C. Logical Expressions. Relational Examples. Relational Operators

Outline. Conditional Statements. Logical Data in C. Logical Expressions. Relational Examples. Relational Operators Conditional Statements For computer to make decisions, must be able to test CONDITIONS IF it is raining THEN I will not go outside IF Count is not zero THEN the Average is Sum divided by Count Conditions

More information

7 th Grade Integer Arithmetic 7-Day Unit Plan by Brian M. Fischer Lackawanna Middle/High School

7 th Grade Integer Arithmetic 7-Day Unit Plan by Brian M. Fischer Lackawanna Middle/High School 7 th Grade Integer Arithmetic 7-Day Unit Plan by Brian M. Fischer Lackawanna Middle/High School Page 1 of 20 Table of Contents Unit Objectives........ 3 NCTM Standards.... 3 NYS Standards....3 Resources

More information

Chapter 8 Selection 8-1

Chapter 8 Selection 8-1 Chapter 8 Selection 8-1 Selection (Decision) The second control logic structure is selection: Selection Choosing between two or more alternative actions. Selection statements alter the sequential flow

More information

CSI 333 Lecture 1 Number Systems

CSI 333 Lecture 1 Number Systems CSI 333 Lecture 1 Number Systems 1 1 / 23 Basics of Number Systems Ref: Appendix C of Deitel & Deitel. Weighted Positional Notation: 192 = 2 10 0 + 9 10 1 + 1 10 2 General: Digit sequence : d n 1 d n 2...

More information

B.Sc.(Computer Science) and. B.Sc.(IT) Effective From July 2011

B.Sc.(Computer Science) and. B.Sc.(IT) Effective From July 2011 NEW Detailed Syllabus of B.Sc.(Computer Science) and B.Sc.(IT) Effective From July 2011 SEMESTER SYSTEM Scheme & Syllabus for B.Sc. (CS) Pass and Hons. Course Effective from July 2011 and onwards CLASS

More information

Lecture 2 Notes: Flow of Control

Lecture 2 Notes: Flow of Control 6.096 Introduction to C++ January, 2011 Massachusetts Institute of Technology John Marrero Lecture 2 Notes: Flow of Control 1 Motivation Normally, a program executes statements from first to last. The

More information

Probabilistic Strategies: Solutions

Probabilistic Strategies: Solutions Probability Victor Xu Probabilistic Strategies: Solutions Western PA ARML Practice April 3, 2016 1 Problems 1. You roll two 6-sided dice. What s the probability of rolling at least one 6? There is a 1

More information

Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

More information

How do you compare numbers? On a number line, larger numbers are to the right and smaller numbers are to the left.

How do you compare numbers? On a number line, larger numbers are to the right and smaller numbers are to the left. The verbal answers to all of the following questions should be memorized before completion of pre-algebra. Answers that are not memorized will hinder your ability to succeed in algebra 1. Number Basics

More information

OS Lab Manual. To provide an understanding of the design aspects of operating system. Recommended Systems/Software Requirements:

OS Lab Manual. To provide an understanding of the design aspects of operating system. Recommended Systems/Software Requirements: OS Lab Manual Objective: To provide an understanding of the design aspects of operating system. Recommended Systems/Software Requirements: Intel based desktop PC with minimum of 166 MHZ or faster processor

More information

CONTENTS. Please note:

CONTENTS. Please note: CONTENTS Introduction...iv. Number Systems... 2. Algebraic Expressions.... Factorising...24 4. Solving Linear Equations...8. Solving Quadratic Equations...0 6. Simultaneous Equations.... Long Division

More information

Parallel Computing. Parallel shared memory computing with OpenMP

Parallel Computing. Parallel shared memory computing with OpenMP Parallel Computing Parallel shared memory computing with OpenMP Thorsten Grahs, 14.07.2014 Table of contents Introduction Directives Scope of data Synchronization OpenMP vs. MPI OpenMP & MPI 14.07.2014

More information

EVALUATING ACADEMIC READINESS FOR APPRENTICESHIP TRAINING Revised For ACCESS TO APPRENTICESHIP

EVALUATING ACADEMIC READINESS FOR APPRENTICESHIP TRAINING Revised For ACCESS TO APPRENTICESHIP EVALUATING ACADEMIC READINESS FOR APPRENTICESHIP TRAINING For ACCESS TO APPRENTICESHIP MATHEMATICS SKILL OPERATIONS WITH INTEGERS AN ACADEMIC SKILLS MANUAL for The Precision Machining And Tooling Trades

More information

CS177 MIDTERM 2 PRACTICE EXAM SOLUTION. Name: Student ID:

CS177 MIDTERM 2 PRACTICE EXAM SOLUTION. Name: Student ID: CS177 MIDTERM 2 PRACTICE EXAM SOLUTION Name: Student ID: This practice exam is due the day of the midterm 2 exam. The solutions will be posted the day before the exam but we encourage you to look at the

More information

Trigonometry Review with the Unit Circle: All the trig. you ll ever need to know in Calculus

Trigonometry Review with the Unit Circle: All the trig. you ll ever need to know in Calculus Trigonometry Review with the Unit Circle: All the trig. you ll ever need to know in Calculus Objectives: This is your review of trigonometry: angles, six trig. functions, identities and formulas, graphs:

More information

Approximating functions by Taylor Polynomials.

Approximating functions by Taylor Polynomials. Chapter 4 Approximating functions by Taylor Polynomials. 4.1 Linear Approximations We have already seen how to approximate a function using its tangent line. This was the key idea in Euler s method. If

More information

Techniques of Integration

Techniques of Integration CHPTER 7 Techniques of Integration 7.. Substitution Integration, unlike differentiation, is more of an art-form than a collection of algorithms. Many problems in applied mathematics involve the integration

More information

ECE 0142 Computer Organization. Lecture 3 Floating Point Representations

ECE 0142 Computer Organization. Lecture 3 Floating Point Representations ECE 0142 Computer Organization Lecture 3 Floating Point Representations 1 Floating-point arithmetic We often incur floating-point programming. Floating point greatly simplifies working with large (e.g.,

More information

Converting from Fractions to Decimals

Converting from Fractions to Decimals .6 Converting from Fractions to Decimals.6 OBJECTIVES. Convert a common fraction to a decimal 2. Convert a common fraction to a repeating decimal. Convert a mixed number to a decimal Because a common fraction

More information

BA-35 Solar Quick Reference Guide

BA-35 Solar Quick Reference Guide BA-35 Solar Quick Reference Guide Table of Contents General Information... 2 The Display... 4 Arithmetic Operations... 6 Correcting Errors... 7 Display Formats... 8 Memory Operations... 9 Math Operations...

More information

Equilibrium computation: Part 1

Equilibrium computation: Part 1 Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

More information

6. Control Structures

6. Control Structures - 35 - Control Structures: 6. Control Structures A program is usually not limited to a linear sequence of instructions. During its process it may bifurcate, repeat code or take decisions. For that purpose,

More information

Oct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8

Oct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8 ECE Department Summer LECTURE #5: Number Systems EEL : Digital Logic and Computer Systems Based on lecture notes by Dr. Eric M. Schwartz Decimal Number System: -Our standard number system is base, also

More information

Higher Education Math Placement

Higher Education Math Placement Higher Education Math Placement Placement Assessment Problem Types 1. Whole Numbers, Fractions, and Decimals 1.1 Operations with Whole Numbers Addition with carry Subtraction with borrowing Multiplication

More information

C PROGRAMMING FOR MATHEMATICAL COMPUTING

C PROGRAMMING FOR MATHEMATICAL COMPUTING UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION BSc MATHEMATICS (2011 Admission Onwards) VI Semester Elective Course C PROGRAMMING FOR MATHEMATICAL COMPUTING QUESTION BANK Multiple Choice Questions

More information

Microcontroller Systems. ELET 3232 Topic 8: Slot Machine Example

Microcontroller Systems. ELET 3232 Topic 8: Slot Machine Example Microcontroller Systems ELET 3232 Topic 8: Slot Machine Example 1 Agenda We will work through a complete example Use CodeVision and AVR Studio Discuss a few creative instructions Discuss #define and #include

More information

BCD (ASCII) Arithmetic. Where and Why is BCD used? Packed BCD, ASCII, Unpacked BCD. BCD Adjustment Instructions AAA. Example

BCD (ASCII) Arithmetic. Where and Why is BCD used? Packed BCD, ASCII, Unpacked BCD. BCD Adjustment Instructions AAA. Example BCD (ASCII) Arithmetic We will first look at unpacked BCD which means strings that look like '4567'. Bytes then look like 34h 35h 36h 37h OR: 04h 05h 06h 07h x86 processors also have instructions for packed

More information

Supplemental Worksheet Problems To Accompany: The Pre-Algebra Tutor: Volume 1 Section 1 Real Numbers

Supplemental Worksheet Problems To Accompany: The Pre-Algebra Tutor: Volume 1 Section 1 Real Numbers Supplemental Worksheet Problems To Accompany: The Pre-Algebra Tutor: Volume 1 Please watch Section 1 of this DVD before working these problems. The DVD is located at: http://www.mathtutordvd.com/products/item66.cfm

More information

grep, awk and sed three VERY useful command-line utilities Matt Probert, Uni of York grep = global regular expression print

grep, awk and sed three VERY useful command-line utilities Matt Probert, Uni of York grep = global regular expression print grep, awk and sed three VERY useful command-line utilities Matt Probert, Uni of York grep = global regular expression print In the simplest terms, grep (global regular expression print) will search input

More information

Introduction to Programming (in C++) Loops. Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC

Introduction to Programming (in C++) Loops. Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC Introduction to Programming (in C++) Loops Jordi Cortadella, Ricard Gavaldà, Fernando Orejas Dept. of Computer Science, UPC Example Assume the following specification: Input: read a number N > 0 Output:

More information

Example. Introduction to Programming (in C++) Loops. The while statement. Write the numbers 1 N. Assume the following specification:

Example. Introduction to Programming (in C++) Loops. The while statement. Write the numbers 1 N. Assume the following specification: Example Introduction to Programming (in C++) Loops Assume the following specification: Input: read a number N > 0 Output: write the sequence 1 2 3 N (one number per line) Jordi Cortadella, Ricard Gavaldà,

More information

Hewlett-Packard 17BII Tutorial

Hewlett-Packard 17BII Tutorial To begin, look at the face of the calculator. Most keys on the 17BII have two functions: a key's primary function is noted in white on the key itself, while the key's secondary function is noted in gold

More information

16. Recursion. COMP 110 Prasun Dewan 1. Developing a Recursive Solution

16. Recursion. COMP 110 Prasun Dewan 1. Developing a Recursive Solution 16. Recursion COMP 110 Prasun Dewan 1 Loops are one mechanism for making a program execute a statement a variable number of times. Recursion offers an alternative mechanism, considered by many to be more

More information

NUMBER SYSTEMS. 1.1 Introduction

NUMBER SYSTEMS. 1.1 Introduction NUMBER SYSTEMS 1.1 Introduction There are several number systems which we normally use, such as decimal, binary, octal, hexadecimal, etc. Amongst them we are most familiar with the decimal number system.

More information

Worldwide Casino Consulting Inc.

Worldwide Casino Consulting Inc. Card Count Exercises George Joseph The first step in the study of card counting is the recognition of those groups of cards known as Plus, Minus & Zero. It is important to understand that the House has

More information

AP COMPUTER SCIENCE A 2007 SCORING GUIDELINES

AP COMPUTER SCIENCE A 2007 SCORING GUIDELINES AP COMPUTER SCIENCE A 2007 SCORING GUIDELINES Question 4: Game Design (Design) Part A: RandomPlayer 4 points +1/2 class RandomPlayer extends Player +1 constructor +1/2 public RandomPlayer(String aname)

More information

LIES MY CALCULATOR AND COMPUTER TOLD ME

LIES MY CALCULATOR AND COMPUTER TOLD ME LIES MY CALCULATOR AND COMPUTER TOLD ME See Section Appendix.4 G for a discussion of graphing calculators and computers with graphing software. A wide variety of pocket-size calculating devices are currently

More information

Pseudo code Tutorial and Exercises Teacher s Version

Pseudo code Tutorial and Exercises Teacher s Version Pseudo code Tutorial and Exercises Teacher s Version Pseudo-code is an informal way to express the design of a computer program or an algorithm in 1.45. The aim is to get the idea quickly and also easy

More information

SOLVING TRIGONOMETRIC EQUATIONS

SOLVING TRIGONOMETRIC EQUATIONS Mathematics Revision Guides Solving Trigonometric Equations Page 1 of 17 M.K. HOME TUITION Mathematics Revision Guides Level: AS / A Level AQA : C2 Edexcel: C2 OCR: C2 OCR MEI: C2 SOLVING TRIGONOMETRIC

More information

Sample only. Unit 4a Lesson 1: Pop game 50 minutes. Cross-curricular links. Overview. Learning objectives. Success Criteria. Key words. 1.

Sample only. Unit 4a Lesson 1: Pop game 50 minutes. Cross-curricular links. Overview. Learning objectives. Success Criteria. Key words. 1. Cross-curricular links Unit 4a Lesson 1: Pop game 50 minutes Maths: addition, multiplication, time Overview In this lesson children will be introduced to variables and how they can be used in computer

More information

MACM 101 Discrete Mathematics I

MACM 101 Discrete Mathematics I MACM 101 Discrete Mathematics I Exercises on Combinatorics, Probability, Languages and Integers. Due: Tuesday, November 2th (at the beginning of the class) Reminder: the work you submit must be your own.

More information

Programming Languages CIS 443

Programming Languages CIS 443 Course Objectives Programming Languages CIS 443 0.1 Lexical analysis Syntax Semantics Functional programming Variable lifetime and scoping Parameter passing Object-oriented programming Continuations Exception

More information

What are the place values to the left of the decimal point and their associated powers of ten?

What are the place values to the left of the decimal point and their associated powers of ten? The verbal answers to all of the following questions should be memorized before completion of algebra. Answers that are not memorized will hinder your ability to succeed in geometry and algebra. (Everything

More information

Basic Proof Techniques

Basic Proof Techniques Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

More information

Ch. 13.2: Mathematical Expectation

Ch. 13.2: Mathematical Expectation Ch. 13.2: Mathematical Expectation Random Variables Very often, we are interested in sample spaces in which the outcomes are distinct real numbers. For example, in the experiment of rolling two dice, we

More information