Outline. Conditional Statements. Logical Data in C. Logical Expressions. Relational Examples. Relational Operators
|
|
|
- Elisabeth Phillips
- 9 years ago
- Views:
Transcription
1 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 specified using logical data Outline II. Program Basics G. s 3. Binary operators relational operators ==!= < > <= >= logical operators &&! 7. Logical data H. Statements 3. If 4. If-Else matching 5. Switch default break Logical Data in C no explicit logical type int and char values can be treated as logical values two possible logical values 0 or \0 - anything - specific operators produce logical values Logical s Relational operators: operators to compare two values syntax: expr1 relop expr2 expressions must be of same type (any) Logical operators: operators to logically combine logical values produce complex combinations of conditions operators apply to logical values Relational Operators Relational Examples Operator X == Y X!= Y X < Y X > Y X <= Y X >= Y Meaning X equal to Y X not equal to Y X less than Y X greater than Y X less than or equal to Y X greater than or equal to Y A: 4 B: 3 C: 2.5 A < B 0 () A < B 1 () When chars compared, ASCII codes compared A!= a 1 () Note, expressions must be of same type But, implicit conversions will be done B > C 1 (), B converted to float 1
2 Combined s Complex combinations of operations can be used: 4 < < 5 1 () Why isn t expression evaluated as (4 < 3) + 2? Relational operators have lower precedence than arithmetic operators, higher than assignment Have left-associativity Operator Precedence > < >= <= 10 =!= 9 Complex Example 10 % 4 * 3-8 <= / * 3-8 <= / <= / <= <= <= <= 5 1 () Logical Operators Simple (relational) logical expressions or depending on values compared Compound logical expressions built out of logical combinations of simple expressions Examples: I am standing in a lecture hall AND the moon is made of green cheese is, but I am standing in a lecture hall OR the moon is made of green cheese is Logical Syntax: LogExpr1 LogicalOp LogExpr2 (&& ) LogicalOp LogExpr (!) (2 < 3) && (17!= 29) /* && - AND */ 1 && 1 /* AND */ 1 /* */ AND (&&) and OR ( ) AND (&&) of two logical expressions: resulting compound expression when both expressions OR ( ) of two logical expressions: expression when either expression Truth table: E1 E2 E1 && E2 E1 E2 1 () 1 () 1 () 1 () 1 () 0 () 0 () 1 () 0 () 1 () 0 () 1 () 0 () 0 () 0 () 0 () Logical Examples month is 2, year is 1999 (month == 2) && ((year % 4) == 0) 1 () && ((year % 4) == 0) 1 && ( 3 == 0) 1 && 0 () 0 () day is 6 (day == 0) (day == 6) 0 () (day == 6) 0 1 () 1 () 2
3 Short-Circuit Aspect && and are short-circuit operators - if the first operand determines the value, the second operand is not evaluated first operand of && is 0, result is 0 without evaluating second operand first operand of is 1, result is 1 without evaluating second operand second operand evaluated when needed Negation Arithmetic negation: - ( 4 * A * C ) Operator minus (-) negates numeric value Logical negation Logical operator (!) negates logical value E! E 1 () 0 () 0 () 1 () Example:! (3 > 4)! 0 () 1 () Complex s s can be built using arithmetic, relational and logical operators!((-5 >= -6.2) (7!= 3) && (6 == (3 + 3))) operator precedence, associativity + - (unary)! & * 15 right (typename) 14 right * / % 13 left + - (binary) 12 left < > <= >= 10 left ==!= 9 left && 5 left 4 left assignments 2 right Example!((-5 >= -6.2) (7!= 3) && (6 == (3 + 3)))!( 1 () (7!= 3) && (6 == (3 + 3)))!( 1 1 () && (6 == (3 + 3)))!( 1 1 && (6 == 6 ))!( 1 1 && 1 () )!( 1 1 () )! 1 () 0 () Decision Making Problem: input two numbers and store the largest in Big Num1: 17 Num2: 53 Big: 53 Algorithm 1. Input Num1 and Num2 2. Store largest of Num1 and Num2 in Big 2.1 Store Num1 in Big 2.2 IF Num2 > Num1 THEN store Num2 in Big IF Statement Syntax: if (LogicalExpr) Statement Program context: 1; if (LogicalExpr) 2; 3; Order of execution: LogicalExpr 1 () 0 ()
4 Flow of Execution Flow Chart for our Problem 1 input Num1 input Num2 Logical 2 Store Num1 in Big Num2 > Num1 Store Num2 in Big 3 Code for Solution int findmax(int Num1, int Num2) { int Big; Big = Num1; if (Num2 > Num1) Big = Num2; return Big; Trace of Solution Trace of findmax(17,53): Num1 Num2 Big 17 53? Big = Num1; 17 if (Num2 > Num1) Big = Num2; 53 return Big; Trace of Solution Trace of findmax(9,6): Executing > 1 Statement in an If What if you want to execute > 1 stmt in If? Num1 Num2 Big 9 6? Big = Num1; 9 if (Num2 > Num1) return Big; 1 Logical
5 Does this work? Statement1; If (LogicalExpr) Statement2; Statement3; Statement4; Statement5; > 1 Stmt in an If No, the indenting is irrelevant, section P is: If (LogicalExpr) Statement2; Statement3; Statement4; P > 1 Stmt in an If (A solution) Solution - use a compound : Statement1; If (LogicalExpr) { Statement2; Statement3; Statement4; Statement5; Statement in If Any reasonable as the single in if expression assignment function call (printf, scanf, etc.) compound if Two-Way Selection Sometimes desirable for to be executed when Logical 3 1 Logical 2 4 Two-Way Selection with If Possible to use combinations of if: Statement1; if (LogicalExpr) Statement2; if (!(LogicalExpr)) Statement3; Statement4; But not efficient 1 Logical! Logical Syntax: if (LogicalExpr) StatementA StatementB B If-Else Statement Logical A 5
6 FindMax with If-Else int findmax(int Num1, int Num2) { int Big; Big = Num1; /* 1 assign + */ if (Num2 > Num1) Big = Num2; /* 1 test + */ return Big; /* maybe 1 assign */ /* test plus 1 or 2 assigns */ int findmax(int Num1, int Num2) { int Big; if (Num2 > Num1) /* 1 test + */ Big = Num2; /* 1 assign or */ Big = Num1; /* 1 assign */ return Big; /* test plus 1 assign */ Using If-Else for Robustness float calcaverage(float sum, int count) { if (count == 0) return 0.0; return sum / count; Note return for each condition Compound Statements and If-Else if ((year % 4) == 0) { printf( Leap year\n ); numdays = 366; { printf( Not a leap year\n ); numdays = 365; Programming Tip: Compound Stmt Does not hurt to always use compound s for if, if- s if (LogicalExpr) { /* or s */ if (LogicalExpr) { /* (s) */ { /* (s) */ Easy to add s later Programming Tip: Indenting Use indenting to make code more clear indent s in function definition to clearly identify body of function indent (s) executed for if by fixed amount (2,3 chars) every time for ifs within an if indent further indent s(s) similarly may want to make {, match (on separate lines) Programming Tip: Conditions Code most likely conditions first Code positive conditions where possible Code parts of solution executed most often first 6
7 Multiway Selection Multiway Flow Chart Multiway if more than 2 alternatives Example: Student Score Message 0-55 Failing Unsatisfactory Satisfactory If-Else has two alternatives, to do multiway, string together If-Else s Score <= 55 Score <= 65 Satisfactory Failing Unsatisfactory Multiway with If-Else if (score <= 55) if (score <= 65) Indenting If-Else Combinations Multiway if- s sometimes indented: if (score <= 55) if (score <= 65) Rule for : matches most recent if Conditions Checked in Reverse Ordering Conditions Score > 65 Score > 55 Failing Satisfactory Unsatisfactory if (score > 65) if (score > 55) But must check conditions in correct order if (score > 55) if (score > 65) Score of 70 would produce Unsatisfactory 7
8 Multiway with If Statements Possible but inefficient: if (score <= 55) if ((score > 55) && (score <= 65)) if (score > 65) Program Robustness Example assumes score in interval [0,100] but doesn t check Add test: if ((score >= 0) && (score <= 100)) /* print message */ printf( Bad score: %d\n,score); Completed Code Nesting Example if ((score >= 0) && (score <= 100)) { if (score <= 55) if (score <= 65) printf( Bad score: %d\n,score); if (A > 0) if ((A % 2) == 0) S1 = S1 + A; S2 = S2 + A; if (A == 0) printf( A zero\n ); NS = NS + A; printf( All done.\n ); A == 0 NS = NS + A printf A > 0 (A % 2) == 0 S2 = S2 + A printf("all done") S1 = S1 + A Matching Else Example Matching Single Else X < 0 Easy to make mistake if (X < 0) Increment NegCount Y < 0 Increment PosCount if (Y < 0) PosCount++; NegCount++; Despite indenting, matches wrong if PosCount updated when X < 0, Y >= 0 8
9 Matching Single Else Solutions Choosing Conditions if (X < 0) if (Y < 0) PosCount++; ; /* empty */ NegCount++; if (X < 0) { if (Y < 0) PosCount++; /* compound stmt */ NegCount++; if (X >= 0) NegCount++; if (Y < 0) PosCount++; Selection Example C Statement One way X > 0 If Two way X > 0 X <= 0 Multiway 0 <= X <= <= X <= <= X <= 30 If-Else Nested If-Elses Another Multiway Method Consider another grading problem: Score Grade 9-10 A 7-8 B 5-6 C 0-4 F if ((score == 9) (score == 10)) grade = A ; if ((score == 7) (score == 8)) grade = B ; if ((score == 5) (score == 6)) grade = C ; grade = F ; Switch Statement More readable approach: switch switch (score) { case 9: case 10: grade = A ; case 7: case 8: grade = B ; case 5: case 6: grade = C ; case 0: case 1: case 2: case3: case 4: grade = F ; Switch Format switch () { case const1-1: case const1-2: case const2-1: case const2-2: default: Switch Rules must be integral type (no float) Case labels must be constant values No two case labels with same value Two case labels can be associated with same set of s Default label is not required At most one default label 9
10 Switch Rules Executing Switch Example Evaluating determine value of expression look for corresponding label if no corresponding label look for default if no corresponding label or default, do nothing execute all s from label to ALL s from label to??? switch (score) { case 9: case 10: grade = A ; case 7: case 8: grade = B ; case 5: case 6: grade = C ; score is 9: grade = A grade = B grade = C score is 7: grade = B grade = C score is 5: grade = C not quite what we want The break Statement break used to indicate a set of s is finished (and no more should be executed) syntax: break says to stop executing and go to the next (skipping any s in between) add after each set of cases default case The default case can be used to deal with robustness issues (score is < 0 or > 10) switch (score) { case 9: case 10: grade = A ; case 7: case 8: grade = B ; case 5: case 6: grade = C ; case 0: case 1: case 2: case3: case 4: grade = F ; default: printf( Bad score %d\n,score); Other Types Any integral type can be used as expression Cases must match char married; switch (married) { case S : case s : printf( single ); case D : case d : printf( divorced ); case M : case m : printf( married ); When Not to Use Switch Example: Case 0 <= X <= 100 switch (x) { case 0: case 1: case 2: case 3: case 4: case 5: case 6: case 7: case 100: Better to use nested ifs 10
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
Selection Statements
Chapter 5 Selection Statements 1 Statements So far, we ve used return statements and expression ess statements. e ts. Most of C s remaining statements fall into three categories: Selection statements:
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)
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
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
Boolean Expressions & the if Statement
Midterm Results Boolean Expressions & the if Statement September 24, 2007 Average: 91.6 Median: 94 Standard Deviation: 18.80 Maximum: 129 (out of 130) ComS 207: Programming I (in Java) Iowa State University,
Chapter 5. Selection 5-1
Chapter 5 Selection 5-1 Selection (Decision) The second control logic structure is selection: Selection Choosing between two or more alternative actions. Selection statements alter the sequential flow
Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program.
Name: Class: Date: Exam #1 - Prep True/False Indicate whether the statement is true or false. 1. Programming is the process of writing a computer program in a language that the computer can respond to
Digital System Design Prof. D Roychoudhry Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Digital System Design Prof. D Roychoudhry Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 04 Digital Logic II May, I before starting the today s lecture
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.
Conditions & Boolean Expressions
Conditions & Boolean Expressions 1 In C++, in order to ask a question, a program makes an assertion which is evaluated to either true (nonzero) or false (zero) by the computer at run time. Example: In
Boolean Expressions, Conditions, Loops, and Enumerations. Precedence Rules (from highest to lowest priority)
Boolean Expressions, Conditions, Loops, and Enumerations Relational Operators == // true if two values are equivalent!= // true if two values are not equivalent < // true if left value is less than the
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,
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)
Conditionals (with solutions)
Conditionals (with solutions) For exercises 1 to 27, indicate the output that will be produced. Assume the following declarations: final int MAX = 25, LIMIT = 100; int num1 = 12, num2 = 25, num3 = 87;
Example of a Java program
Example of a Java program class SomeNumbers static int square (int x) return x*x; public static void main (String[] args) int n=20; if (args.length > 0) // change default n = Integer.parseInt(args[0]);
I PUC - Computer Science. Practical s Syllabus. Contents
I PUC - Computer Science Practical s Syllabus Contents Topics 1 Overview Of a Computer 1.1 Introduction 1.2 Functional Components of a computer (Working of each unit) 1.3 Evolution Of Computers 1.4 Generations
JavaScript: Control Statements I
1 7 JavaScript: Control Statements I 7.1 Introduction 2 The techniques you will learn here are applicable to most high-level languages, including JavaScript 1 7.2 Algorithms 3 Any computable problem can
ASCII Encoding. The char Type. Manipulating Characters. Manipulating Characters
The char Type ASCII Encoding The C char type stores small integers. It is usually 8 bits. char variables guaranteed to be able to hold integers 0.. +127. char variables mostly used to store characters
Conditional Statements. 15-110 Summer 2010 Margaret Reid-Miller
Conditional Statements 15-110 Summer 2010 Margaret Reid-Miller Conditional statements Within a method, we can alter the flow of control (the order in which statements are executed) using either conditionals
The C++ Language. Loops. ! Recall that a loop is another of the four basic programming language structures
The C++ Language Loops Loops! Recall that a loop is another of the four basic programming language structures Repeat statements until some condition is false. Condition False True Statement1 2 1 Loops
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
Unit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.
Unit 1 Number Sense In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions. BLM Three Types of Percent Problems (p L-34) is a summary BLM for the material
Object Oriented Software Design
Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa September 14, 2011 G. Lipari (Scuola Superiore Sant Anna) Introduction
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
6 3 4 9 = 6 10 + 3 10 + 4 10 + 9 10
Lesson The Binary Number System. Why Binary? The number system that you are familiar with, that you use every day, is the decimal number system, also commonly referred to as the base- system. When you
University of Toronto Department of Electrical and Computer Engineering. Midterm Examination. CSC467 Compilers and Interpreters Fall Semester, 2005
University of Toronto Department of Electrical and Computer Engineering Midterm Examination CSC467 Compilers and Interpreters Fall Semester, 2005 Time and date: TBA Location: TBA Print your name and ID
Operator Overloading. Lecture 8. Operator Overloading. Running Example: Complex Numbers. Syntax. What can be overloaded. Syntax -- First Example
Operator Overloading Lecture 8 Operator Overloading C++ feature that allows implementer-defined classes to specify class-specific function for operators Benefits allows classes to provide natural semantics
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
Chapter 2: Elements of Java
Chapter 2: Elements of Java Basic components of a Java program Primitive data types Arithmetic expressions Type casting. The String type (introduction) Basic I/O statements Importing packages. 1 Introduction
TIP: To access the WinRunner help system at any time, press the F1 key.
CHAPTER 11 TEST SCRIPT LANGUAGE We will now look at the TSL language. You have already been exposed to this language at various points of this book. All the recorded scripts that WinRunner creates when
Output: 12 18 30 72 90 87. struct treenode{ int data; struct treenode *left, *right; } struct treenode *tree_ptr;
50 20 70 10 30 69 90 14 35 68 85 98 16 22 60 34 (c) Execute the algorithm shown below using the tree shown above. Show the exact output produced by the algorithm. Assume that the initial call is: prob3(root)
Translating to Java. Translation. Input. Many Level Translations. read, get, input, ask, request. Requirements Design Algorithm Java Machine Language
Translation Translating to Java Introduction to Computer Programming The job of a programmer is to translate a problem description into a computer language. You need to be able to convert a problem description
Introduction to Java Applications. 2005 Pearson Education, Inc. All rights reserved.
1 2 Introduction to Java Applications 2.2 First Program in Java: Printing a Line of Text 2 Application Executes when you use the java command to launch the Java Virtual Machine (JVM) Sample program Displays
UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming
UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything
Statements and Control Flow
Contents 1. Introduction 2. Types and Variables 3. Statements and Control Flow 4. Reading Input 5. Classes and Objects 6. Arrays 7. Methods 8. Scope and Lifetime 9. Utility classes 10. Introduction to
if and if-else: Part 1
if and if-else: Part 1 Objectives Write if statements (including blocks) Write if-else statements (including blocks) Write nested if-else statements We will now talk about writing statements that make
Stacks. Linear data structures
Stacks Linear data structures Collection of components that can be arranged as a straight line Data structure grows or shrinks as we add or remove objects ADTs provide an abstract layer for various operations
General Software Development Standards and Guidelines Version 3.5
NATIONAL WEATHER SERVICE OFFICE of HYDROLOGIC DEVELOPMENT Science Infusion Software Engineering Process Group (SISEPG) General Software Development Standards and Guidelines 7/30/2007 Revision History Date
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
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)
Tutorial on C Language Programming
Tutorial on C Language Programming Teodor Rus [email protected] The University of Iowa, Department of Computer Science Introduction to System Software p.1/64 Tutorial on C programming C program structure:
COMP 110 Prasun Dewan 1
COMP 110 Prasun Dewan 1 12. Conditionals Real-life algorithms seldom do the same thing each time they are executed. For instance, our plan for studying this chapter may be to read it in the park, if it
Chapter 3 Operators and Control Flow
Chapter 3 Operators and Control Flow I n this chapter, you will learn about operators, control flow statements, and the C# preprocessor. Operators provide syntax for performing different calculations or
While Loop. 6. Iteration
While Loop 1 Loop - a control structure that causes a set of statements to be executed repeatedly, (reiterated). While statement - most versatile type of loop in C++ false while boolean expression true
Phys4051: C Lecture 2 & 3. Comment Statements. C Data Types. Functions (Review) Comment Statements Variables & Operators Branching Instructions
Phys4051: C Lecture 2 & 3 Functions (Review) Comment Statements Variables & Operators Branching Instructions Comment Statements! Method 1: /* */! Method 2: // /* Single Line */ //Single Line /* This comment
Binary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
Python Evaluation Rules
Python Evaluation Rules UW CSE 160 http://tinyurl.com/dataprogramming Michael Ernst and Isaac Reynolds [email protected] August 2, 2016 Contents 1 Introduction 2 1.1 The Structure of a Python Program................................
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
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,
PROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON
PROBLEM SOLVING WITH SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON Addison Wesley Boston San Francisco New York London
Semantic Analysis: Types and Type Checking
Semantic Analysis Semantic Analysis: Types and Type Checking CS 471 October 10, 2007 Source code Lexical Analysis tokens Syntactic Analysis AST Semantic Analysis AST Intermediate Code Gen lexical errors
Tom wants to find two real numbers, a and b, that have a sum of 10 and have a product of 10. He makes this table.
Sum and Product This problem gives you the chance to: use arithmetic and algebra to represent and analyze a mathematical situation solve a quadratic equation by trial and improvement Tom wants to find
6.S096 Lecture 1 Introduction to C
6.S096 Lecture 1 Introduction to C Welcome to the Memory Jungle Andre Kessler Andre Kessler 6.S096 Lecture 1 Introduction to C 1 / 30 Outline 1 Motivation 2 Class Logistics 3 Memory Model 4 Compiling 5
Lecture 4: Writing shell scripts
Handout 5 06/03/03 1 Your rst shell script Lecture 4: Writing shell scripts Shell scripts are nothing other than les that contain shell commands that are run when you type the le at the command line. That
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
The C Programming Language course syllabus associate level
TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming
CS1010 Programming Methodology A beginning in problem solving in Computer Science. Aaron Tan http://www.comp.nus.edu.sg/~cs1010/ 20 July 2015
CS1010 Programming Methodology A beginning in problem solving in Computer Science Aaron Tan http://www.comp.nus.edu.sg/~cs1010/ 20 July 2015 Announcements This document is available on the CS1010 website
Object Oriented Software Design
Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 28, 2010 G. Lipari (Scuola Superiore Sant Anna) Introduction
Lecture Notes on Linear Search
Lecture Notes on Linear Search 15-122: Principles of Imperative Computation Frank Pfenning Lecture 5 January 29, 2013 1 Introduction One of the fundamental and recurring problems in computer science is
(Refer Slide Time: 00:01:16 min)
Digital Computer Organization Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture No. # 04 CPU Design: Tirning & Control
CS 241 Data Organization Coding Standards
CS 241 Data Organization Coding Standards Brooke Chenoweth University of New Mexico Spring 2016 CS-241 Coding Standards All projects and labs must follow the great and hallowed CS-241 coding standards.
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 :
1. Boolean Data Type & Expressions Outline. Basic Data Types. Numeric int float Non-numeric char
Boolean Data Type & Expressions Outline. Boolean Data Type & Expressions Outline 2. Basic Data Types 3. C Boolean Data Types: char or int/ Boolean Declaration 4. Boolean or Character? 5. Boolean Literal
Python Programming: An Introduction To Computer Science
Python Programming: An Introduction To Computer Science Chapter 8 Booleans and Control Structures Python Programming, 2/e 1 Objectives æ To understand the concept of Boolean expressions and the bool data
Compilers I - Chapter 4: Generating Better Code
Compilers I - Chapter 4: Generating Better Code Lecturers: Paul Kelly ([email protected]) Office: room 304, William Penney Building Naranker Dulay ([email protected]) Materials: Office: room 562 Textbook
Microsoft Excel Tips & Tricks
Microsoft Excel Tips & Tricks Collaborative Programs Research & Evaluation TABLE OF CONTENTS Introduction page 2 Useful Functions page 2 Getting Started with Formulas page 2 Nested Formulas page 3 Copying
Boolean Data Outline
1. Boolean Data Outline 2. Data Types 3. C Boolean Data Type: char or int 4. C Built-In Boolean Data Type: bool 5. bool Data Type: Not Used in CS1313 6. Boolean Declaration 7. Boolean or Character? 8.
Topic 11 Scanner object, conditional execution
Topic 11 Scanner object, conditional execution "There are only two kinds of programming languages: those people always [complain] about and those nobody uses." Bjarne Stroustroup, creator of C++ Copyright
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
Handout 1. Introduction to Java programming language. Java primitive types and operations. Reading keyboard Input using class Scanner.
Handout 1 CS603 Object-Oriented Programming Fall 15 Page 1 of 11 Handout 1 Introduction to Java programming language. Java primitive types and operations. Reading keyboard Input using class Scanner. Java
ChE-1800 H-2: Flowchart Diagrams (last updated January 13, 2013)
ChE-1800 H-2: Flowchart Diagrams (last updated January 13, 2013) This handout contains important information for the development of flowchart diagrams Common Symbols for Algorithms The first step before
Boolean Expressions 1. In C++, the number 0 (zero) is considered to be false, all other numbers are true.
Boolean Expressions Boolean Expressions Sometimes a programmer would like one statement, or group of statements to execute only if certain conditions are true. There may be a different statement, or group
Excel: Introduction to Formulas
Excel: Introduction to Formulas Table of Contents Formulas Arithmetic & Comparison Operators... 2 Text Concatenation... 2 Operator Precedence... 2 UPPER, LOWER, PROPER and TRIM... 3 & (Ampersand)... 4
Computer Programming I
Computer Programming I COP 2210 Syllabus Spring Semester 2012 Instructor: Greg Shaw Office: ECS 313 (Engineering and Computer Science Bldg) Office Hours: Tuesday: 2:50 4:50, 7:45 8:30 Thursday: 2:50 4:50,
Exercises for Design of Test Cases
Exercises for Design of Test Cases 2005-2010 Hans Schaefer Slide no. 1 Specification The system is an information system for buses, like www.nor-way.no or www.bus.is. The system has a web based interface.
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
1.00/1.001 - Session 2 Fall 2004. Basic Java Data Types, Control Structures. Java Data Types. 8 primitive or built-in data types
1.00/1.001 - Session 2 Fall 2004 Basic Java Data Types, Control Structures Java Data Types 8 primitive or built-in data types 4 integer types (byte, short, int, long) 2 floating point types (float, double)
Course Title: Software Development
Course Title: Software Development Unit: Customer Service Content Standard(s) and Depth of 1. Analyze customer software needs and system requirements to design an information technology-based project plan.
Decision Logic: if, if else, switch, Boolean conditions and variables
CS 1044 roject 3 Fall 2009 Decision Logic: if, if else, switch, Boolean conditions and variables This programming assignment uses many of the ideas presented in sections 3 through 5 of the Dale/Weems text
C Coding Style Guide. Technotes, HowTo Series. 1 About the C# Coding Style Guide. 2 File Organization. Version 0.3. Contents
Technotes, HowTo Series C Coding Style Guide Version 0.3 by Mike Krüger, [email protected] Contents 1 About the C# Coding Style Guide. 1 2 File Organization 1 3 Indentation 2 4 Comments. 3 5 Declarations.
Comp 255Q - 1M: Computer Organization Lab #3 - Machine Language Programs for the PDP-8
Comp 255Q - 1M: Computer Organization Lab #3 - Machine Language Programs for the PDP-8 January 22, 2013 Name: Grade /10 Introduction: In this lab you will write, test, and execute a number of simple PDP-8
Writing Control Structures
Writing Control Structures Copyright 2006, Oracle. All rights reserved. Oracle Database 10g: PL/SQL Fundamentals 5-1 Objectives After completing this lesson, you should be able to do the following: Identify
Grade 6 Math Circles. Binary and Beyond
Faculty of Mathematics Waterloo, Ontario N2L 3G1 The Decimal System Grade 6 Math Circles October 15/16, 2013 Binary and Beyond The cool reality is that we learn to count in only one of many possible number
COS 217: Introduction to Programming Systems
COS 217: Introduction to Programming Systems 1 Goals for Todayʼs Class Course overview Introductions Course goals Resources Grading Policies Getting started with C C programming language overview 2 1 Introductions
Chapter 14: Boolean Expressions Bradley Kjell (Revised 10/08/08)
Chapter 14: Boolean Expressions Bradley Kjell (Revised 10/08/08) The if statements of the previous chapters ask simple questions such as count
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
Let s put together a Manual Processor
Lecture 14 Let s put together a Manual Processor Hardware Lecture 14 Slide 1 The processor Inside every computer there is at least one processor which can take an instruction, some operands and produce
PL / SQL Basics. Chapter 3
PL / SQL Basics Chapter 3 PL / SQL Basics PL / SQL block Lexical units Variable declarations PL / SQL types Expressions and operators PL / SQL control structures PL / SQL style guide 2 PL / SQL Block Basic
Creating Basic Excel Formulas
Creating Basic Excel Formulas Formulas are equations that perform calculations on values in your worksheet. Depending on how you build a formula in Excel will determine if the answer to your formula automatically
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
JAVA - QUICK GUIDE. Java SE is freely available from the link Download Java. So you download a version based on your operating system.
http://www.tutorialspoint.com/java/java_quick_guide.htm JAVA - QUICK GUIDE Copyright tutorialspoint.com What is Java? Java is: Object Oriented Platform independent: Simple Secure Architectural- neutral
Lecture 1 Introduction to Java
Programming Languages: Java Lecture 1 Introduction to Java Instructor: Omer Boyaci 1 2 Course Information History of Java Introduction First Program in Java: Printing a Line of Text Modifying Our First
CompSci 125 Lecture 08. Chapter 5: Conditional Statements Chapter 4: return Statement
CompSci 125 Lecture 08 Chapter 5: Conditional Statements Chapter 4: return Statement Homework Update HW3 Due 9/20 HW4 Due 9/27 Exam-1 10/2 Programming Assignment Update p1: Traffic Applet due Sept 21 (Submit
Parallel and Distributed Computing Programming Assignment 1
Parallel and Distributed Computing Programming Assignment 1 Due Monday, February 7 For programming assignment 1, you should write two C programs. One should provide an estimate of the performance of ping-pong
5 Arrays and Pointers
5 Arrays and Pointers 5.1 One-dimensional arrays Arrays offer a convenient way to store and access blocks of data. Think of arrays as a sequential list that offers indexed access. For example, a list of
Problem Solving Basics and Computer Programming
Problem Solving Basics and Computer Programming A programming language independent companion to Roberge/Bauer/Smith, "Engaged Learning for Programming in C++: A Laboratory Course", Jones and Bartlett Publishers,
Exercise 4 Learning Python language fundamentals
Exercise 4 Learning Python language fundamentals Work with numbers Python can be used as a powerful calculator. Practicing math calculations in Python will help you not only perform these tasks, but also
Data Structure with C
Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which
