with Ada.Text_IO; with Ada.Integer_Text_IO; with Ada.IO_Exceptions; procedure Assign11 is

Size: px
Start display at page:

Download "with Ada.Text_IO; with Ada.Integer_Text_IO; with Ada.IO_Exceptions; procedure Assign11 is"

Transcription

1 with Ada.Text_IO; with Ada.Integer_Text_IO; with Ada.IO_Exceptions; procedure Assign11 is DNA pattern matcher written by John McCormick, April 2013 This program counts the number of times a pattern of nucleotides occurs in a text file and the number of lines in that file. A pattern may NOT extend over multiple lines. Valid nucleotide symbols are A, C, G, and T (or their lowercase equivalents) Invalid nucleotide symbols in the data file and in the pattern entered at the keyboard are ignored. Assumptions Pattern contains at least one nucleotide and no more than 10,000 nucleotides The name of the data file contains no more than 80 characters No line in the data file contains more than 10,000 nucleotides Input From Keyboard Name of data file Pattern of nucleotides From Data file Lines of nucleotides Output (to screen) Number of lines processed The pattern Number of pattern matches detected Types for arrays of nucleotides type Nucleotide is (A, C, G, T); type Nucleotide_Array is array (Positive range <>) of Nucleotide; subtype Index_Range is Integer range _000; subtype Length_Range is Integer range 0.. Index_Range'Last; subtype Line_Array is Nucleotide_Array (Index_Range); package Nucleotide_IO is new Ada.Text_IO.Enumeration_IO (Enum => Nucleotide);

2 procedure Prepare_Input_File (Prompt : in String; File : out Ada.Text_IO.File_Type) is This procedure prompts the user for a file name and opens that file for input Preconditions : File is not open Postconditins : File is open for input Keyboard reading marker is advanced to the next line subtype File_Name_String is String (1.. 80); File_Name : File_Name_String; The input file name Last : Natural; Number of characters in File_Name Get a valid input file name Each iteration, get one name Validation_Loop : Ada.Text_IO.Put_Line (Prompt); Ada.Text_IO.Get_Line (Item => File_Name, Last => Last); Advance reading marker if necessary if Last = File_Name'Last then Ada.Text_IO.Skip_Line; Validation_Block : Handles case of non-existent file Ada.Text_IO.Open (File => File, Mode => Ada.Text_IO.In_File, Name => File_Name (1.. Last)); exit Validation_Loop; exception when Ada.IO_Exceptions.Name_Error => Ada.Text_IO.Put ("Cannot find a file called """ & File_Name (1.. Last)); Ada.Text_IO.Put_Line (""", please try again"); end Validation_Block; end Validation_Loop;

3 end Prepare_Input_File; procedure Get_Nucleotides (File : in Ada.Text_IO.File_Type; Item : out Nucleotide_Array; Last : out Natural) is Reads one line of nucleotides from File. Any invalid nucleotides are ignored Preconditions : File is open for input Postconditions : Item contains the nucleotides from the current line Last contains the index of the last nucleotide in array Item If there are no nucleotides in Item, Last is set to Item'First - 1 The reading marker is left on the line terminator Char : Character; One character from the input Last := Item'First - 1; Initialize array index Get all the nucleotides on a line Each iteration, get one nucleotide Input_Loop : exit Input_Loop when Ada.Text_IO.End_Of_Line (File); Ada.Text_IO.Get (File => File, Item => Char); case Char is when 'A' 'a' => Item (Last) := A; when 'C' 'c' => Item (Last) := C; when 'G' 'g' => Item (Last) := G; when 'T' 't' => Item (Last) := T; when others =>

4 null; end case; end Input_Loop; end Get_Nucleotides; function Count_Matches (Pattern : in Nucleotide_Array; Line : in Nucleotide_Array) return Natural is Preconditions : Pattern'Length > 0 Postconditions : Returns the number of times Pattern occurs in Line Result : Natural; The answer First : Positive; Line slice Last : Positive; indices Result := 0; Check for all occurrences of Pattern in Line Each iteration, check the pattern against one part of the Line The part is Line (First.. Last) First := Line'First; Last := First + Pattern'Length - 1; exit when Last > Line'Last; Check if the pattern matches at the current position if Line (First.. Last) = Pattern then Result := Result + 1; Move on to the next part of Line First := First + 1; end ; return Result; end Count_Matches;

5 procedure Search_File (File : in Ada.Text_IO.File_Type; Pattern : in Nucleotide_Array; Lines : out Natural; Matches : out Natural) is Searches for occurrences of Pattern in File Preconditions : File is open Pattern'Length > 0 Postconditions : Lines is the number of lines in File Matches is the number of pattern matches found in File Line (data and length) Line : Line_Array; Line_Length : Length_Range; Initialize counters Lines := 0; Matches := 0; Process all of the lines in the input file Each iteration, search for the pattern in one line Line_Loop : exit Line_Loop when Ada.Text_IO.End_Of_File (File); Get one line of nucleotides Get_Nucleotides (File => File, Item => Line, Last => Line_Length); Advance reading marker to next line if not Ada.Text_IO.End_Of_File (File) then Ada.Text_IO.Skip_Line (File); Update the two counters Lines := Lines + 1; Matches := Matches + Count_Matches (Pattern => Pattern, end Line_Loop; end Search_File; Line => Line (1.. Line_Length));

6 procedure Display_Results (Lines : in Natural; Matches : in Natural; Pattern : in Nucleotide_Array) is Display the number of lines processed, the pattern, and the number of pattern matches found, Preconditions : None Postconditions : All parameter values are displayed Ada.Integer_Text_IO.Put (Item => Lines, Width => 1); Ada.Text_IO.Put_Line (" lines processed."); Ada.Text_IO.Put ("The pattern "); Display the pattern Each iteration, display one nucleotide of the pattern for Index in Pattern'Range Nucleotide_IO.Put (Item => Pattern (Index), Width => 1); end ; Ada.Text_IO.Put (" was found "); Ada.Integer_Text_IO.Put (Item => Matches, Width => 1); if Matches = 1 then Ada.Text_IO.Put_Line (" time."); else Ada.Text_IO.Put_Line (" times."); end Display_Results; - Nucleotide_File : Ada.Text_IO.File_Type; Input file Pattern : Line_Array; Pattern (data and length) Pattern_Length : Length_Range; Lines_Processed : Natural; Matches_Found : Natural; Counters (results)

7 Prepare the file for input Prepare_Input_File (Prompt => "Please enter the name of the file of nucleotides", File => Nucleotide_File); Get the Pattern Each iteration, get one line from the user Ada.Text_IO.Put_Line ("Please enter a pattern of nucleotides on a single line"); Get_Nucleotides (File => Ada.Text_IO.Standard_Input, Item => Pattern, Last => Pattern_Length); exit when Pattern_Length > 0; Ada.Text_IO.Put_Line ("You must enter at least one valid nucleotide"); Ada.Text_IO.Skip_Line; end ; Search the File for pattern Matches Search_File (File => Nucleotide_File, Pattern => Pattern (1.. Pattern_Length), Lines => Lines_Processed, Matches => Matches_Found); Done with file Ada.Text_IO.Close (Nucleotide_File); Display the results Display_Results (Lines => Lines_Processed, Matches => Matches_Found, Pattern => Pattern (1.. Pattern_Length)); end Assign11;

In the case above, only the x:= x+1 statement is executed and the result is 4;

In the case above, only the x:= x+1 statement is executed and the result is 4; C-10 1. For X = 3 Case 1. IF x >= 0 THEN x:= x+1; ELSIF x >=1 THEN x := x + 2; END IF; In the case above, only the x:= x+1 statement is executed and the result is 4; Case 2. IF x >= 0 THEN x := x + 1;

More information

Note: The enumerations range from 0 to (number_of_elements_in_enumeration 1).

Note: The enumerations range from 0 to (number_of_elements_in_enumeration 1). C8-1 Algorithm 1. Use a subtype to represent the numbers for months 2. Use an enumeration to represent the named months 3. Use an enumeration to represent the roman months 4. Get the inputs from the user

More information

Aerospace Software Engineering

Aerospace Software Engineering 16.35 Aerospace Software Engineering Ada 95: subtypes, enumeration types, functions, packages, exception handling September 30/2002 Prof. I. K. Lundqvist kristina@mit.edu 16.35 September 30/2002 Prof.

More information

Different kinds of resources provided by a package

Different kinds of resources provided by a package Collection of resources Resources could include types, functions, procedures, object (data) declarations, even other packages Encapsulated in one unit Compiled on its own Compilation order: Library unit

More information

Count increments by 20 when I is even and decrements by 5 when I is odd.

Count increments by 20 when I is even and decrements by 5 when I is odd. C11 Solutions 1. Count := 1; FOR I in 1.. 10 LOOP If I MOD 2 = 0 THEN FOR J in 1.. 10 LOOP Count:= Count + 2; END LOOP; ELSE FOR J in 1.. 5 LOOP Count := Count 1; END LOOP; END IF; END LOOP; Count = 76.

More information

Input Space Partitioning

Input Space Partitioning CMPT 473 Software Quality Assurance Input Space Partitioning Nick Sumner Recall Testing involves running software and comparing observed behavior against expected behavior Select an input, look at the

More information

An Introduction to Ada's Predefined Packages

An Introduction to Ada's Predefined Packages John McCormick Fall 2004 An Introduction to Ada's Predefined Packages The Annexes of the Ada Reference Manual (ARM) provides descriptions of the packages that every conforming Ada compiler vendor must

More information

A collision is said to occur when two or more keys hash to the same index location.

A collision is said to occur when two or more keys hash to the same index location. Problem Set #8 Solutions Problem 1-9 points Given the tree below, traverse the tree a. Inorder : a/b c * d*e / f + g b. Preorder: * - / a b c / * d e + f g c. Postorder a b / c d e * f g + / * * - / /

More information

Ada LOOP statement allows for repetition of a sequence of statements Three forms of a LOOP statement FOR loop_specification LOOP...

Ada LOOP statement allows for repetition of a sequence of statements Three forms of a LOOP statement FOR loop_specification LOOP... ! "# $ % Ada statement allows for repetition of a sequence of statements Three forms of a statement FOR loop_specification WHILE condition FOR loop is used when executing a specific number of iterations

More information

Input Space Partitioning

Input Space Partitioning CMPT 473 Software Quality Assurance Input Space Partitioning Nick Sumner - Fall 2014 With material from Patrick Lam, Jeff Offutt Recall Testing involves running software and comparing observed behavior

More information

CS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam

CS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam Seat Number Name CS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam This is a closed book exam. Answer all of the questions on the question paper in the space provided. If

More information

Sequential Search (Searching Supplement: 1-2)

Sequential Search (Searching Supplement: 1-2) (Searching Supplement: 1-2) A sequential search simply involves looking at each item in an array in turn until either the value being searched for is found or it can be determined that the value is not

More information

LAB 11: METHODS. CPCS The Lab Note Lab 11 Page 1. Statement Purpose:

LAB 11: METHODS. CPCS The Lab Note Lab 11 Page 1. Statement Purpose: Statement Purpose: The purpose of this Lab. is to practically familiarize student with how to write the common code once and reuse it without rewriting it using the concept of Methods. Activity Outcomes:

More information

Name Section: M/W T/TH Number Definition Matching (6 Points)

Name Section: M/W T/TH Number Definition Matching (6 Points) Name Section: M/W T/TH Number Definition Matching (6 Points) 1. (6 pts) Match the words with their definitions. Choose the best definition for each word. Event Counter Iteration Counter Loop Flow of Control

More information

CPE 112 Spring 2015 Exam II (100 pts) March 4, Definition Matching (8 Points)

CPE 112 Spring 2015 Exam II (100 pts) March 4, Definition Matching (8 Points) Name Definition Matching (8 Points) 1. (8 pts) Match the words with their definitions. Choose the best definition for each word. Relational Expression Iteration Counter Count-controlled loop Loop Flow

More information

Lecture 7 Tao Wang 1

Lecture 7 Tao Wang 1 Lecture 7 Tao Wang 1 Objectives In this chapter, you will learn about: Interactive loop break and continue do-while for loop Common programming errors Scientists, Third Edition 2 while Loops while statement

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

Name Section: M/W T/TH Number Definition Matching (8 Points)

Name Section: M/W T/TH Number Definition Matching (8 Points) Name Section: M/W T/TH Number Definition Matching (8 Points) 1. (8 pts) Match the words with their definitions. Choose the best definition for each word. Iteration Counter Event Counter Loop Abstract Step

More information

Introduction to Computers and Programming

Introduction to Computers and Programming Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 12 April 14 2004 The goal of an engineer is to retire without having caused any major catastrophe -Dilbert 2 Today Program robustness

More information

Chapter 8. Statement-Level Control Structures

Chapter 8. Statement-Level Control Structures Chapter 8 Statement-Level Control Structures Levels of Control Flow Within expressions Among program units Among program statements Copyright 2012 Addison-Wesley. All rights reserved. 1-2 Control Structure

More information

ECE264 Spring 2013 Exam 1, February 14, 2013

ECE264 Spring 2013 Exam 1, February 14, 2013 ECE264 Spring 2013 Exam 1, February 14, 2013 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing it.

More information

Lecture 2. CS118 Term planner. Refinement. Recall our first Java program. Program skeleton GCD. For your first seminar. For your second seminar

Lecture 2. CS118 Term planner. Refinement. Recall our first Java program. Program skeleton GCD. For your first seminar. For your second seminar 2 Lecture 2 CS118 Term planner For your first seminar Meet at CS reception Bring The Guide Bring your CS account details Finish the problem sheet in your own time Talk to each other about the questions

More information

Unified Engineering Fall 2004

Unified Engineering Fall 2004 Massachusetts Institute of Technology Department of Aeronautics and Astronautics Cambridge, MA 02139 Unified Engineering Fall 2004 Problem Set #3 Solutions C&P PSET 3 Solutions 1. 12

More information

A sample print out is: is is -11 key entered was: w

A sample print out is: is is -11 key entered was: w Lab 9 Lesson 9-2: Exercise 1, 2 and 3: Note: when you run this you may need to maximize the window. The modified buttonhandler is: private static class ButtonListener implements ActionListener public void

More information

Optimal Table Lookup for Reserved Words in Ada

Optimal Table Lookup for Reserved Words in Ada Optimal Table Lookup for Reserved Words in Ada John A. Trono Saint Michael's College One Winooski Park Colchester, VT 05439 jtrono@smcvt.edu Preamble Recently a colleague wanted to include a section on

More information

Computer Programming, I. Laboratory Manual. Experiment #6. Loops

Computer Programming, I. Laboratory Manual. Experiment #6. Loops Think Twice Code Once The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2005 Khaleel I. Shaheen Computer Programming, I Laboratory Manual Experiment #6

More information

Problem Set 5 Solutions

Problem Set 5 Solutions Problem Set 5 Solutions Problem 1 Part 1: Merge Sort is a sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence.

More information

CS Spring 05 - MidTerm

CS Spring 05 - MidTerm CS1411-160 - Spring 05 - MidTerm March 8, 2005 1. When working at the keyboard, the user generates a newline character by pressing the Enter or Return key. 2. In the design of a flag-controlled loop, the

More information

CHAPTER 3 BASIC INSTRUCTION OF C++

CHAPTER 3 BASIC INSTRUCTION OF C++ CHAPTER 3 BASIC INSTRUCTION OF C++ MOHD HATTA BIN HJ MOHAMED ALI Computer programming (BFC 20802) Subtopics 2 Parts of a C++ Program Classes and Objects The #include Directive Variables and Literals Identifiers

More information

Computer Programming

Computer Programming Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty Department of Computer Science and Engineering Session: Merge Sort in C++ and Its Analysis Dr. Deepak B. Phatak & Dr. Supratik Chakraborty,

More information

Shell programming. Introduction to Operating Systems

Shell programming. Introduction to Operating Systems Shell programming Introduction to Operating Systems Environment variables Predened variables $* all parameters $# number of parameters $? result of last command $$ process identier $i parameter number

More information

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017 Your Name: Final Exam. CSC 121 Fall 2017 Lecturer: Howard Rosenthal Dec. 13, 2017 The following questions (or parts of questions) in numbers 1-17 are all worth 2 points each. The programs have indicated

More information

Lecture Notes: Hoare Logic

Lecture Notes: Hoare Logic Lecture Notes: Hoare Logic 17-654/17-754: Analysis of Software Artifacts Jonathan Aldrich (jonathan.aldrich@cs.cmu.edu) Lecture 3 1 Hoare Logic The goal of Hoare logic is to provide a formal system for

More information

CS31 Discussion 1E. Jie(Jay) Wang Week3 Oct.12

CS31 Discussion 1E. Jie(Jay) Wang Week3 Oct.12 CS31 Discussion 1E Jie(Jay) Wang Week3 Oct.12 Outline Problems from Project 1 Review of lecture String, char, stream If-else statements Switch statements loops Programming challenge Problems from Project

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

P.G.TRB - COMPUTER SCIENCE. c) data processing language d) none of the above

P.G.TRB - COMPUTER SCIENCE. c) data processing language d) none of the above P.G.TRB - COMPUTER SCIENCE Total Marks : 50 Time : 30 Minutes 1. C was primarily developed as a a)systems programming language b) general purpose language c) data processing language d) none of the above

More information

Section 2.2 Your First Program in Java: Printing a Line of Text

Section 2.2 Your First Program in Java: Printing a Line of Text Chapter 2 Introduction to Java Applications Section 2.2 Your First Program in Java: Printing a Line of Text 2.2 Q1: End-of-line comments that should be ignored by the compiler are denoted using a. Two

More information

causing a set of statements (the body) to be executed repeatedly. C++ provides three control structures to support iteration (or looping).

causing a set of statements (the body) to be executed repeatedly. C++ provides three control structures to support iteration (or looping). 1 causing a set of statements (the body) to be executed repeatedly. C++ provides three control structures to support iteration (or looping). Before considering specifics we define some general terms that

More information

Unified Engineering Spring 2005

Unified Engineering Spring 2005 Massachusetts Institute of Technology Department of Aeronautics and Astronautics Cambridge, MA 02139 Unified Engineering Spring 2005 Problem Set #7 Solutions Problem C1. Understanding.ali files With the

More information

COMP 4/6262: Programming UNIX

COMP 4/6262: Programming UNIX COMP 4/6262: Programming UNIX Lecture 12 shells, shell programming: passing arguments, if, debug March 13, 2006 Outline shells shell programming passing arguments (KW Ch.7) exit status if (KW Ch.8) test

More information

Acceptance Test Plan. for WAVED. Version 3.0. Prepared By: Sean Bluestein, Kristian Calhoun, Keith Horrocks, Steven Nguyen, Hannah Pinkos

Acceptance Test Plan. for WAVED. Version 3.0. Prepared By: Sean Bluestein, Kristian Calhoun, Keith Horrocks, Steven Nguyen, Hannah Pinkos Acceptance Test Plan for WAVED Version 3.0 Prepared By: Sean Bluestein, Kristian Calhoun, Keith Horrocks, Steven Nguyen, Hannah Pinkos Advisor: Kurt Schmidt Stakeholder: Climate Central 2 Table of Contents

More information

CS 1110: Introduction to Computing Using Python Loop Invariants

CS 1110: Introduction to Computing Using Python Loop Invariants CS 1110: Introduction to Computing Using Python Lecture 21 Loop Invariants [Andersen, Gries, Lee, Marschner, Van Loan, White] Announcements Prelim 2 conflicts due by midnight tonight Lab 11 is out Due

More information

Flow Control: Branches and loops

Flow Control: Branches and loops Flow Control: Branches and loops In this context flow control refers to controlling the flow of the execution of your program that is, which instructions will get carried out and in what order. In the

More information

Computer Programming I - Unit 5 Lecture page 1 of 14

Computer Programming I - Unit 5 Lecture page 1 of 14 page 1 of 14 I. The while Statement while, for, do Loops Note: Loop - a control structure that causes a sequence of statement(s) to be executed repeatedly. The while statement is one of three looping statements

More information

Outline. iterator review iterator implementation the Java foreach statement testing

Outline. iterator review iterator implementation the Java foreach statement testing Outline iterator review iterator implementation the Java foreach statement testing review: Iterator methods a Java iterator only provides two or three operations: E next(), which returns the next element,

More information

Top Down Design. 2. Design Methodology

Top Down Design. 2. Design Methodology Top Down Design 1 A solution method where the problem is broken down into smaller subproblems, which in turn are broken down into smaller problems until each subproblem can be solved in a few steps. (Also

More information

LAB 5, THE HIDDEN DELIGHTS OF LINKED LISTS

LAB 5, THE HIDDEN DELIGHTS OF LINKED LISTS LAB 5, THE HIDDEN DELIGHTS OF LINKED LISTS Questions are based on the Main and Savitch review questions for chapter 5 in the Exam Preparation section of the webct course page. In case you haven t observed

More information

Getting started with Java

Getting started with Java Getting started with Java by Vlad Costel Ungureanu for Learn Stuff Programming Languages A programming language is a formal constructed language designed to communicate instructions to a machine, particularly

More information

Introduction to Software Testing Chapter 4 Input Space Partition Testing

Introduction to Software Testing Chapter 4 Input Space Partition Testing Introduction to Software Testing Chapter 4 Input Space Partition Testing Paul Ammann & Jeff Offutt http://www.cs.gmu.edu/~offutt/ softwaretest/ Ch. 4 : Input Space Coverage Four Structures for Modeling

More information

Computer Science CSC324 Wednesday February 13, Homework Assignment #3 Due: Thursday February 28, 2013, by 10 p.m.

Computer Science CSC324 Wednesday February 13, Homework Assignment #3 Due: Thursday February 28, 2013, by 10 p.m. Computer Science CSC324 Wednesday February 13, 2013 St. George Campus University of Toronto Homework Assignment #3 Due: Thursday February 28, 2013, by 10 p.m. Silent Policy A silent policy takes effect

More information

C How to Program, 6/e by Pearson Education, Inc. All Rights Reserved.

C How to Program, 6/e by Pearson Education, Inc. All Rights Reserved. C How to Program, 6/e 1992-2010 by Pearson Education, Inc. 1992-2010 by Pearson Education, Inc. 1992-2010 by Pearson Education, Inc. This chapter serves as an introduction to the important topic of data

More information

EE 109 Lab 8a Conversion Experience

EE 109 Lab 8a Conversion Experience EE 109 Lab 8a Conversion Experience 1 Introduction In this lab you will write a small program to convert a string of digits representing a number in some other base (between 2 and 10) to decimal. The user

More information

EECE.2160: ECE Application Programming Spring 2018 Programming Assignment #6: Using Arrays to Count Letters in Text Due Wednesday, 4/4/18, 11:59:59 PM

EECE.2160: ECE Application Programming Spring 2018 Programming Assignment #6: Using Arrays to Count Letters in Text Due Wednesday, 4/4/18, 11:59:59 PM Spring 2018 Programming Assignment #6: Using Arrays to Count Letters in Text Due Wednesday, 4/4/18, 11:59:59 PM 1. Introduction In this program, you will practice working with arrays. Your program will

More information

CP5_6 The problems in this problem set cover lectures C5 and C6. 1. a. What are doubly linked lists? What is the record declaration for a node in a doubly linked list? head 10 11 13 Figure 1. Sample Doubly

More information

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017 Your Name: Final Exam. CSC 121 Fall 2017 Lecturer: Howard Rosenthal Dec. 13, 2017 The following questions (or parts of questions) in numbers 1-17 are all worth 2 points each. The programs have indicated

More information

Reasoning about programs

Reasoning about programs Reasoning about programs Last time Coming up This Thursday, Nov 30: 4 th in-class exercise sign up for group on moodle bring laptop to class Final projects: final project presentations: Tue Dec 12, in

More information

Last time. Reasoning about programs. Coming up. Project Final Presentations. This Thursday, Nov 30: 4 th in-class exercise

Last time. Reasoning about programs. Coming up. Project Final Presentations. This Thursday, Nov 30: 4 th in-class exercise Last time Reasoning about programs Coming up This Thursday, Nov 30: 4 th in-class exercise sign up for group on moodle bring laptop to class Final projects: final project presentations: Tue Dec 12, in

More information

CSCI 1061U Programming Workshop 2. C++ Basics

CSCI 1061U Programming Workshop 2. C++ Basics CSCI 1061U Programming Workshop 2 C++ Basics 1 Learning Objectives Introduction to C++ Origins, Object-Oriented Programming, Terms Variables, Expressions, and Assignment Statements Console Input/Output

More information

Column_Major_Display: For I in For J in Location_In_Array := I + (J-1)*3 Display Element in Array(Location_In_Array) New_Line

Column_Major_Display: For I in For J in Location_In_Array := I + (J-1)*3 Display Element in Array(Location_In_Array) New_Line C-14 Solutions 1. Package Design Data Structures An array of nine integers Subprograms Function to accept 9 integers Procedure to display the array in row major order Procedure to display the array in

More information

Dipl. Ing. Mario Blunk. Buchfinkenweg Erfurt / Germany. Phone + 49 (0)

Dipl. Ing. Mario Blunk. Buchfinkenweg Erfurt / Germany. Phone + 49 (0) Dipl. Ing. Mario Blunk Buchfinkenweg 3 99097 Erfurt / Germany Phone + 49 (0) 361 6022 5184 Email info@blunk-electronic.de Web www.blunk-electronic.de Doc. Vers. 2018-11-19 About Ada Programming Language

More information

A Practical Approach to Programming With Assertions

A Practical Approach to Programming With Assertions A Practical Approach to Programming With Assertions Ken Bell Christian-Albrechts Universität Kiel Department of Computer Science and Applied Mathematics Real-Time Systems and Embedded Systems Group July

More information

Problem Solving With Loops

Problem Solving With Loops To appreciate the value of loops, take a look at the following example. This program will calculate the average of 10 numbers input by the user. Without a loop, the three lines of code that prompt the

More information

CSC Java Programming, Fall Java Data Types and Control Constructs

CSC Java Programming, Fall Java Data Types and Control Constructs CSC 243 - Java Programming, Fall 2016 Java Data Types and Control Constructs Java Types In general, a type is collection of possible values Main categories of Java types: Primitive/built-in Object/Reference

More information

DNHI Homework 3 Solutions List, Stacs and Queues

DNHI Homework 3 Solutions List, Stacs and Queues Solutions List, Stacs and Queues Problem 1 Given the IntegerQueue ADT below state the return value and show the content of the, initially empty, queue of Integer objects after each of the following operations.

More information

TOP-DOWN PROCEDURAL PROGRAMMING

TOP-DOWN PROCEDURAL PROGRAMMING TOP-DOWN PROCEDURAL PROGRAMMING Top-down programming is an incremental strategy where you implement the most general modules first and work towards implementing those that provide specific functionality.

More information

(3-1) Functions II H&K Chapter 3. Instructor - Andrew S. O Fallon CptS 121 (September 5, 2018) Washington State University

(3-1) Functions II H&K Chapter 3. Instructor - Andrew S. O Fallon CptS 121 (September 5, 2018) Washington State University (3-1) Functions II H&K Chapter 3 Instructor - Andrew S. O Fallon CptS 121 (September 5, 2018) Washington State University Overview of Functions (1) A block of code or unit that generally performs one task

More information

DECLARATIONS. Character Set, Keywords, Identifiers, Constants, Variables. Designed by Parul Khurana, LIECA.

DECLARATIONS. Character Set, Keywords, Identifiers, Constants, Variables. Designed by Parul Khurana, LIECA. DECLARATIONS Character Set, Keywords, Identifiers, Constants, Variables Character Set C uses the uppercase letters A to Z. C uses the lowercase letters a to z. C uses digits 0 to 9. C uses certain Special

More information

Massachusetts Institute of Technology. Problem Set 2 Solutions

Massachusetts Institute of Technology. Problem Set 2 Solutions Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Department of Mechanical Engineering 6.050J/2.110J Information and Entropy Spring 2004 Problem Set 2 Solutions

More information

Processes. OS Structure. OS Structure. Modes of Execution. Typical Functions of an OS Kernel. Non-Kernel OS. COMP755 Advanced Operating Systems

Processes. OS Structure. OS Structure. Modes of Execution. Typical Functions of an OS Kernel. Non-Kernel OS. COMP755 Advanced Operating Systems OS Structure Processes COMP755 Advanced Operating Systems An OS has many parts. The Kernel is the core of the OS. It controls the execution of the system. Many OS features run outside of the kernel, such

More information

CMSC 433 Section 0101 Fall 2012 Midterm Exam #1

CMSC 433 Section 0101 Fall 2012 Midterm Exam #1 Name: CMSC 433 Section 0101 Fall 2012 Midterm Exam #1 Directions: Test is closed book, closed notes. Answer every question; write solutions in spaces provided. Use backs of pages for scratch work. Good

More information

Chapter 2: Introduction to C++

Chapter 2: Introduction to C++ Chapter 2: Introduction to C++ Copyright 2010 Pearson Education, Inc. Copyright Publishing as 2010 Pearson Pearson Addison-Wesley Education, Inc. Publishing as Pearson Addison-Wesley 2.1 Parts of a C++

More information

Dept. of CSE, IIT KGP

Dept. of CSE, IIT KGP Control Flow: Looping CS10001: Programming & Data Structures Pallab Dasgupta Professor, Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Types of Repeated Execution Loop: Group of

More information

2D Syntax. Version October 30, 2017

2D Syntax. Version October 30, 2017 2D Syntax Version 6.11 October 30, 2017 #lang 2d package: 2d-test The 2d language installs #2d reader support in the readtables, and then chains to the reader of another language that is specified immediately

More information

Chapter 2: Special Characters. Parts of a C++ Program. Introduction to C++ Displays output on the computer screen

Chapter 2: Special Characters. Parts of a C++ Program. Introduction to C++ Displays output on the computer screen Chapter 2: Introduction to C++ 2.1 Parts of a C++ Program Copyright 2009 Pearson Education, Inc. Copyright 2009 Publishing Pearson as Pearson Education, Addison-Wesley Inc. Publishing as Pearson Addison-Wesley

More information

dnaseq.py Introduction to Algorithms Recitation 9b October 12, 2011

dnaseq.py Introduction to Algorithms Recitation 9b October 12, 2011 dnaseq.py 1 # Maps integer keys to a set of arbitrary values. 2 class Multidict: 3 # Initializes a new multi-value dictionary, and adds any key-value # 2-tuples in the iterable sequence pairs to the data

More information

Introduction to String Manipulation

Introduction to String Manipulation Introduction to Computer Programming Introduction to String Manipulation CSCI-UA.0002 What is a String? A String is a data type in the Python programming language A String can be described as a "sequence

More information

Question 1. Part (a) [2 marks] error: assignment of read-only variable x ( x = 20 tries to modify a constant) Part (b) [1 mark]

Question 1. Part (a) [2 marks] error: assignment of read-only variable x ( x = 20 tries to modify a constant) Part (b) [1 mark] Note to Students: This file contains sample solutions to the term test together with the marking scheme and comments for each question. Please read the solutions and the marking schemes and comments carefully.

More information

Work with External Data in SPSS or Excel Format - Open SPSS data

Work with External Data in SPSS or Excel Format - Open SPSS data Work with External Data in SPSS or Excel Format - Open SPSS data Contents WORK WITH EXTERNAL DATA IN SPSS OR EXCEL FORMAT - OPEN SPSS DATA... 1 Open an Excel file... 1 Create new External File... 2 Save

More information

Largest Online Community of VU Students

Largest Online Community of VU Students WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students MIDTERM EXAMINATION SEMESTER FALL 2003 CS301-DATA STRUCTURE Total Marks:86 Duration: 60min Instructions

More information

CPE Summer 2015 Exam I (150 pts) June 18, 2015

CPE Summer 2015 Exam I (150 pts) June 18, 2015 Name Closed notes and book. If you have any questions ask them. Write clearly and make sure the case of a letter is clear (where applicable) since C++ is case sensitive. You can assume that there is one

More information

Introduction to C# Applications

Introduction to C# Applications 1 2 3 Introduction to C# Applications OBJECTIVES To write simple C# applications To write statements that input and output data to the screen. To declare and use data of various types. To write decision-making

More information

Islamic University Gaza Engineering Faculty Department of Computer Engineering ECOM 2125: Assembly Language LAB. Lab # 8. Conditional Processing

Islamic University Gaza Engineering Faculty Department of Computer Engineering ECOM 2125: Assembly Language LAB. Lab # 8. Conditional Processing Islamic University Gaza Engineering Faculty Department of Computer Engineering ECOM 2125: Assembly Language LAB Lab # 8 Conditional Processing April, 2014 1 Assembly Language LAB Unconditional Jump The

More information

FORM 2 (Please put your name and form # on the scantron!!!!)

FORM 2 (Please put your name and form # on the scantron!!!!) CS 161 Exam 2: FORM 2 (Please put your name and form # on the scantron!!!!) True (A)/False(B) (2 pts each): 1. Recursive algorithms tend to be less efficient than iterative algorithms. 2. A recursive function

More information

9691 COMPUTING. 9691/22 Paper 2 (Written Paper), maximum raw mark 75

9691 COMPUTING. 9691/22 Paper 2 (Written Paper), maximum raw mark 75 CAMBRIDGE INTERNATIONAL EXAMINATIONS Cambridge International Advanced Subsidiary and Advanced Level MARK SCHEME for the May/June 2015 series 9691 COMPUTING 9691/22 Paper 2 (Written Paper), maximum raw

More information

AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS

AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS PAUL L. BAILEY Abstract. This documents amalgamates various descriptions found on the internet, mostly from Oracle or Wikipedia. Very little of this

More information

C++ Programming: From Problem Analysis to Program Design, Fourth Edition. Chapter 5: Control Structures II (Repetition)

C++ Programming: From Problem Analysis to Program Design, Fourth Edition. Chapter 5: Control Structures II (Repetition) C++ Programming: From Problem Analysis to Program Design, Fourth Edition Chapter 5: Control Structures II (Repetition) Objectives In this chapter, you will: Learn about repetition (looping) control structures

More information

Principles of Testing and Analysis. COMP 4004 Fall Notes Adapted from Dr. A. Williams

Principles of Testing and Analysis. COMP 4004 Fall Notes Adapted from Dr. A. Williams Principles of Testing and Analysis COMP 4004 Fall 2008 Notes Adapted from Dr. A. Williams Software Quality Assurance Lec 3 1 Principles of Testing and Analysis Sensitivity Redundancy Restriction Partition

More information

Introduction to Computers and Programming. Structured data types

Introduction to Computers and Programming. Structured data types Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 16 Reading: FK pp. 367-384, 415-420, 214-217 Oct 8 2003 Structured data types So far: scalar (single value) data types structured

More information

Computer Science & Information Technology (CS) Rank under AIR 100. Examination Oriented Theory, Practice Set Key concepts, Analysis & Summary

Computer Science & Information Technology (CS) Rank under AIR 100. Examination Oriented Theory, Practice Set Key concepts, Analysis & Summary GATE- 2016-17 Postal Correspondence 1 C-Programming Computer Science & Information Technology (CS) 20 Rank under AIR 100 Postal Correspondence Examination Oriented Theory, Practice Set Key concepts, Analysis

More information

switch case Logic Syntax Basics Functionality Rules Nested switch switch case Comp Sci 1570 Introduction to C++

switch case Logic Syntax Basics Functionality Rules Nested switch switch case Comp Sci 1570 Introduction to C++ Comp Sci 1570 Introduction to C++ Outline 1 Outline 1 Outline 1 switch ( e x p r e s s i o n ) { case c o n s t a n t 1 : group of statements 1; break ; case c o n s t a n t 2 : group of statements 2;

More information

Programming Using C Homework 5

Programming Using C Homework 5 Programming Using C Homework 5 1. In this problem you will simulate the execution of a computer s CPU. The computer that we will simulate has 32 bytes of addressable memory (each byte is uniquely addressed).

More information

Review: Hoare Logic Rules

Review: Hoare Logic Rules Review: Hoare Logic Rules wp(x := E, P) = [E/x] P wp(s;t, Q) = wp(s, wp(t, Q)) wp(if B then S else T, Q) = B wp(s,q) && B wp(t,q) Proving loops correct First consider partial correctness The loop may not

More information

1 Short Answer (5 Points Each)

1 Short Answer (5 Points Each) 1 Short Answer (5 Points Each) 1. What are the three types of programming errors? Briefly describe each of them. Syntax Error: An error in the program code due to misuse of the programming language. Run-time

More information

Project 6: Extracting Data from PDB Files

Project 6: Extracting Data from PDB Files : Extracting Data from PDB Files Overview In this assignment, your Perl program will let a user get information about a macromolecule represented by a PDB le whose pathname is specied on the command line.

More information

A linked list. Subtopic: Linked lists. List-node structure type. Array implementation of a linked list. Inserting into a sorted collection

A linked list. Subtopic: Linked lists. List-node structure type. Array implementation of a linked list. Inserting into a sorted collection Subtopic: Linked lists A linear structure, like an array Composed of self-referential nodes Operations: insert, delete, traverse Array implementation Dynamic-allocation implementation David Keil 1/03 1

More information

In Delphi script, when values are assigned to variables, the colon-equal operator is used; :=

In Delphi script, when values are assigned to variables, the colon-equal operator is used; := Statements and Operators Old Content - visit altium.com/documentation Modified by on 13-Sep-2017 Parent page: DelphiScript DelphiScript Statements A statement in DelphiScript is considered as simple when

More information

int n = 10; int sum = 10; while (n > 1) { sum = sum + n; n--; } cout << "The sum of the integers 1 to 10 is " << sum << endl;

int n = 10; int sum = 10; while (n > 1) { sum = sum + n; n--; } cout << The sum of the integers 1 to 10 is  << sum << endl; Debugging Some have said that any monkey can write a program the hard part is debugging it. While this is somewhat oversimplifying the difficult process of writing a program, it is sometimes more time

More information

Features of C. Portable Procedural / Modular Structured Language Statically typed Middle level language

Features of C. Portable Procedural / Modular Structured Language Statically typed Middle level language 1 History C is a general-purpose, high-level language that was originally developed by Dennis M. Ritchie to develop the UNIX operating system at Bell Labs. C was originally first implemented on the DEC

More information

while Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College

while Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College while Loops Lecture 13 Sections 5.8-5.9 Robb T. Koether Hampden-Sydney College Wed, Sep 26, 2018 Robb T. Koether (Hampden-Sydney College) while Loops Wed, Sep 26, 2018 1 / 25 1 while Loops 2 Input Loops

More information

Spark verification features

Spark verification features Spark verification features Paul Jackson School of Informatics University of Edinburgh Formal Verification Spring 2018 Adding specification information to programs Verification concerns checking whether

More information