ECSE 321 Assignment 2
|
|
- Baldric George
- 6 years ago
- Views:
Transcription
1 ECSE 321 Assignment 2 Instructions: This assignment is worth a total of 40 marks. The assignment is due by noon (12pm) on Friday, April 5th The preferred method of submission is to submit a written hardcopy of your answers to the assignment box located at the second floor of Trottier building. The assignment is to be completed individually. You may discuss solutions with classmates, but the final work you submit must be written by you in your own words. Late assignments are subject to a penalty of 5% of the maximum available marks per day late. All late assignments are to be submitted in the instructor s mailbox, located in McConnell 633, and a message should also be sent to instructor and TA that the assignment is there. Question 1 Designing by Contract (9 Marks) Based on the following description of the class Stack, write out some skeleton Java code using Contract4J syntax to define invariant, precondition, and postcondition rules. Recall that Contract4J uses @Post, and it also uses the variable $return to denote the value returned by a method. In Contract4J, you can also use the variable $old in a postcondition to refer to a value before the method is called, you can use the variable $this to refer to the current instance of a class, and you can use the variable $args[i] to refer to the ith argument of a method. For example, a postcondition for a method incrementby(int amount) could ( $this.value = $old($this.value) + $args[0] ). A Stack is a datastructure for last-in first-out storage of Items. Stack has five public methods: isempty() returns a boolean that is true if the stack is empty and false otherwise count() returns an integer with the number of items in the stack top() returns the topmost Item on the stack without removing it push(item) pushes a new Item onto the top of the stack pop() returns the topmost Item on the stack and removes it Write a skeleton for class Stack that has two invariants (hint: the value returned by isempty() should always be consistent with count(); also, what is the value range of count()?), and isempty() has one postcondition, top() has one precondition, push() has three postconditions, and pop() has one precondition and one postcondition. public class Stack ( (isempty()) == (count() == 0) ( count() >= 0 ( $return == (count() == 0) ) public boolean isempty() {... public int count() { 1/6
2 @Pre ( count() > 0 ) // could also be!isempty() public Item top() ( count() = $old(count()) + 1 ( top() = $args[0] (!isempty() ) public void push(item newitem) ( count() > 0 ( count() = $old(count()) - 1 ) public Item pop() { Question 2: Black-box Testing (14 Marks) We have a new marking system that takes a.in file as an argument and produces a sorted.out file as specified below. Input File: The input file format is as follows. Each line will contain the data for a single student. The input will contain the following fields. A semicolon separates each field. Input fields: Student number (9 digit number) Month of Birth (As a 3 character case insensitive string e.g. Jan, FEB, mar,... Dec) Date of Birth (1-31, but must be valid for the month) First name (String of letters without numbers) First letter of surname (Letter) Number of missed lectures (0-26) Slept during one or more lectures (true/false, written as T or F) Example: Student number: Month of Birth: May Date of Birth: 26 First name: Kevin First letter of surname: C Number of missed lectures: 0 Never slept during lectures. Input line corresponding to the example: ;May;26;Kevin;C;0;F If any input row is invalid, the program should print a warning message and continue with the next record. If the program encounters a more serious problem (e.g., unable to open input file), it will print an error message and exit gracefully. Output File: The output file format is as follows. Each line will contain the data for a single student. The output will contain the following fields. Each field is separated by a semicolon. 2/6
3 Output fields: Student number (9 digit number) Assignment 1 mark: (0-5) Assignment 2 mark: (0-25) Assignment 3 mark: (0-10) Exam mark: (0-60) Final grade: [F, D, C, B-, B, B+, A-, A] Comment: (String of arbitrary length) Example: Student number: Assignment 1 mark: 5 Assignment 2 mark: 25 Assignment 3 mark: 10 Exam mark: 60 Final grade: A Comment: Excellent. Output line corresponding to the example: ;5;25;10;60;A;Excellent Questions: 1) What is the range of possible legitimate inputs for this system? (7 marks) Solution: - Student number: integers to Month of birth: strings Jan, Feb, Mar, Apr, May, Jun, Jul, Aug, Sep, Oct, Nov, Dec (not case sensitive) - Date of birth: 1 to 31 (valid for the month) - First name: all possible combination of strings [A, Z] [a, z] of any size - First letter of surname: exactly one character from [A, Z] [a, z] - Number of missed lectures: integer 0 to 26 - Slept during one or more lectures: string T or F 2) Derive input test-cases for the program using boundary value analysis. (7 marks) Solution: Test studentid: - (blank); May; 26; Kevin; C; 0; T - tt; May; 26; Kevin; C; 0; T - 998; May; 26; Kevin; C; 0; T ; May; 26; Kevin; C; 0; T ; May; 26; Kevin; C; 0; T Test month: ; (blank); 26; Kevin; C; 0; T ; 05; 26; Kevin; C; 0; T ; TTT; 26; Kevin; C; 0; T ; February; 26; Kevin; C; 0; T ; Feb; 26; Kevin; C; 0; T 3/6
4 Test day: ; Jan; (blank); Kevin; C; 0; T ; Jan; 0; Kevin; C; 0; T ; Jan; -1; Kevin; C; 0; T ; Feb; 30; Kevin; C; 0; T ; Feb; 31; Kevin; C; 0; T ; Apr; 31; Kevin; C; 0; T ; Jun; 31; Kevin; C; 0; T ; Sep; 31; Kevin; C; 0; T ; Nov; 31; Kevin; C; 0; T ; Dec; 32; Kevin; C; 0; T ; Jan; o; Kevin; C; 0; T Test firstname: ; Feb; 26; (blank); C; 0; T ; Feb; 26; Kevin7; C; 0; T ; Feb; 26; Kevin#; C; 0; T ; Feb; 26; 999; C; 0; T Test first letter of last name: ; Feb; 26; Kevin; (blank); 0; T ; Feb; 26; Kevin; 9; 0; T ; Feb; 26; Kevin; #; 0; T ; Feb; 26; Kevin; w ; 0; T ; Feb; 26; Kevin; TT; 0; T Test number of missed lectures: ; Feb; 26; Kevin; C; (blank); T ; Feb; 26; Kevin; C; -1; T ; Feb; 26; Kevin; C; e; T ; Feb; 26; Kevin; C; 27; T Test slept during lecture: ; Feb; 26; Kevin; C; 0; (blank) ; Feb; 26; Kevin; C; 0; ; Feb; 26; Kevin; C; 0; L ; Feb; 26; Kevin; C; 0; false ; Feb; 26; Kevin; C; 0;, Problem 3 White-Box Testing (17 marks) Consider the following pseudo-code for a method that reads from a file that contains one floating-point value on each line, computes the maximum and minimum values encountered, and then displays information about the range. void findmaxmin(list scorelist) { int numberofscores = 0; float maxscore = NegativeInfinity; float minscore = PositiveInfinity; 1 float nextscore; Iterator iterator = scorelist.iterator(); 4/6
5 2 while (iterator.hasnext()) { nextscore = scorelist.next(); if (nextscore > maxscore) { maxscore = nextscore; if (nextscore < minscore) { minscore = nextscore; 5 7 numberofscores++; 8 9 if (numberofscores < 1) { System.out.println( No scores found in score list ); else { System.out.println(numberOfScores + total scores found in score list ); System.out.println( The maximum score is + maxscore); System.out.println( The minimum score is + minscore); a. Identify and label each conditional statement and each contiguous block of code (sequence of statements that always execute together). You may mark these directly on the code above [5 marks] Solution: see above b. Draw a logic flow diagram (flow chart) for this method in the space below. [6 marks] Solution: see diagram in the next page c. What is the smallest number of test cases that must be specified in order to test each path through this method? Justify your answer by describing each test in the space provided. [6 marks] Solution: 5 tests are sufficient. File is empty; for the path 1->2->9->10 File with one score (e.g. 50); for the path 1->2->3->4->5->6->7->8->9->11 File with two scores in increasing order (e.g. 50, 100), for the path 1->2->3->4->5->6->8- >9->11 File with two scores in decreasing order (e.g. 50, 20), for the path 1->2->3->4->6->7->8- >9->11 File with three scores where the last score is the median (e.g. 50, 20, 30), for the path 1- >2->3->4->6->8->9->11 Note that the paths 1->2->3.->9->10 are infeasible, i.e. you cannot at the same time enter the while loop (block 2) and make the if statement of block 9 be true. 5/6
6 Start End 6/6
Excel Functions & Tables
Excel Functions & Tables SPRING 2016 Spring 2016 CS130 - EXCEL FUNCTIONS & TABLES 1 Review of Functions Quick Mathematics Review As it turns out, some of the most important mathematics for this course
More informationCS Programming I: Arrays
CS 200 - Programming I: Arrays Marc Renault Department of Computer Sciences University of Wisconsin Madison Fall 2017 TopHat Sec 3 (PM) Join Code: 719946 TopHat Sec 4 (AM) Join Code: 891624 Array Basics
More informationKing Abdulaziz University Faculty of Computing and Information Technology Computer Science Department
King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department CPCS202, 1 st Term 2016 (Fall 2015) Program 5: FCIT Grade Management System Assigned: Thursday, December
More informationLecture 10: Boolean Expressions
Lecture 10: Boolean Expressions CS1068+ Introductory Programming in Python Dr Kieran T. Herley Department of Computer Science University College Cork 2017-2018 KH (12/10/17) Lecture 10: Boolean Expressions
More informationDATE OF BIRTH SORTING (DBSORT)
DATE OF BIRTH SORTING (DBSORT) Release 3.1 December 1997 - ii - DBSORT Table of Contents 1 Changes Since Last Release... 1 2 Purpose... 3 3 Limitations... 5 3.1 Command Line Parameters... 5 4 Input...
More informationCMIS 102 Hands-On Lab
CMIS 10 Hands-On Lab Week 8 Overview This hands-on lab allows you to follow and experiment with the critical steps of developing a program including the program description, analysis, test plan, and implementation
More informationCS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018
Name: USC NetID (e.g., ttrojan): CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018 There are 7 problems on the exam, with 59 points total available. There are 10 pages to the exam (5 pages double-sided),
More informationSection 1.2: What is a Function? y = 4x
Section 1.2: What is a Function? y = 4x y is the dependent variable because it depends on what x is. x is the independent variable because any value can be chosen to replace x. Domain: a set of values
More informationLecture 6. Drinking. Nested if. Nested if s reprise. The boolean data type. More complex selection statements: switch. Examples.
// Simple program to show how an if- statement works. import java.io.*; Lecture 6 class If { static BufferedReader keyboard = new BufferedReader ( new InputStreamReader( System.in)); public static void
More informationCSE 341 Section Handout #6 Cheat Sheet
Cheat Sheet Types numbers: integers (3, 802), reals (3.4), rationals (3/4), complex (2+3.4i) symbols: x, y, hello, r2d2 booleans: #t, #f strings: "hello", "how are you?" lists: (list 3 4 5) (list 98.5
More informationAnnouncements. Lab Friday, 1-2:30 and 3-4:30 in Boot your laptop and start Forte, if you brought your laptop
Announcements Lab Friday, 1-2:30 and 3-4:30 in 26-152 Boot your laptop and start Forte, if you brought your laptop Create an empty file called Lecture4 and create an empty main() method in a class: 1.00
More informationCSE P 501 Exam 8/5/04
Name There are 7 questions worth a total of 65 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. You may refer to the following references: Course
More informationYou must include this cover sheet. Either type up the assignment using theory4.tex, or print out this PDF.
15-122 Assignment 4 Page 1 of 12 15-122 : Principles of Imperative Computation Fall 2012 Assignment 4 (Theory Part) Due: Thursday, October 18, 2012 at the beginning of lecture Name: Andrew ID: Recitation:
More informationSTUDENT LESSON A12 Iterations
STUDENT LESSON A12 Iterations Java Curriculum for AP Computer Science, Student Lesson A12 1 STUDENT LESSON A12 Iterations INTRODUCTION: Solving problems on a computer very often requires a repetition of
More informationCS 367: Introduction to Data Structures Midterm Sample Questions
LAST NAME (PRINT): FIRST NAME (PRINT): CS 367: Introduction to Data Structures Midterm Sample Questions Friday, July 14 th 2017. 100 points (26% of final grade) Instructor: Meena Syamkumar 1. Fill in these
More informationCS 211 Programming Practicum Spring 2017
Due: Tuesday, 3/28/17 at 11:59 pm Infix Expression Evaluator Programming Project 5 For this lab, write a JAVA program that will evaluate an infix expression. The algorithm REQUIRED for this program will
More informationThis report is based on sampled data. Jun 1 Jul 6 Aug 10 Sep 14 Oct 19 Nov 23 Dec 28 Feb 1 Mar 8 Apr 12 May 17 Ju
0 - Total Traffic Content View Query This report is based on sampled data. Jun 1, 2009 - Jun 25, 2010 Comparing to: Site 300 Unique Pageviews 300 150 150 0 0 Jun 1 Jul 6 Aug 10 Sep 14 Oct 19 Nov 23 Dec
More informationHistory. used in early Mac development notable systems in Pascal Skype TeX embedded systems
Overview The Pascal Programming Language (with material from tutorialspoint.com) Background & History Features Hello, world! General Syntax Variables/Data Types Operators Conditional Statements Functions
More informationCSE 142, Autumn 2007 Midterm Exam, Friday, November 2, 2007
CSE 142, Autumn 2007 Midterm Exam, Friday, November 2, 2007 Name: Section: Student ID #: TA: Rules: You have 50 minutes to complete this exam. You may receive a deduction if you keep working after the
More informationContract-based Programming in Ada 2012 A Tutorial
Contract-based Programming in Ada 2012 A tutorial on how to use the Ada 2012 features for specifying detailed, checked contracts for types and subprograms 1. Contracts document constraints on how types
More informationSyntax and Variables
Syntax and Variables What the Compiler needs to understand your program, and managing data 1 Pre-Processing Any line that starts with # is a pre-processor directive Pre-processor consumes that entire line
More informationData Types. 9. Types. a collection of values and the definition of one or more operations that can be performed on those values
Data Types 1 data type: a collection of values and the definition of one or more operations that can be performed on those values C++ includes a variety of built-in or base data types: short, int, long,
More informationEssentials. Week by. Week. All About Data. Algebra Alley
> Week by Week MATHEMATICS Essentials Algebra Alley Jack has 0 nickels and some quarters. If the value of the coins is $.00, how many quarters does he have? (.0) What s The Problem? Pebble Pebble! A pebble
More informationHigh Performance Computing
High Performance Computing MPI and C-Language Seminars 2009 Photo Credit: NOAA (IBM Hardware) High Performance Computing - Seminar Plan Seminar Plan for Weeks 1-5 Week 1 - Introduction, Data Types, Control
More information4. ENCOUNTER DATA PROCESSING PROCEDURES A. General Information
A. General Information A. Reporting encounter data is a shared obligation of IEHP and Providers. CMS/DHCS has mandated encounter data report formats and reporting timelines with which IEHP is required
More informationCOMP322 - Introduction to C++ Lecture 01 - Introduction
COMP322 - Introduction to C++ Lecture 01 - Introduction Robert D. Vincent School of Computer Science 6 January 2010 What this course is Crash course in C++ Only 14 lectures Single-credit course What this
More informationSECONDARY SCHOOL, L-IMRIEĦEL HALF YEARLY EXAMINATIONS 2016/2017
SECONDARY SCHOOL, L-IMRIEĦEL HALF YEARLY EXAMINATIONS 2016/2017 YEAR: 10 Computing Time: 1½ Hr. Name: Class: Instructions: 1. Answer all the questions in the space provided on this paper. 2. Calculators
More informationExam 2 ITEC 120 Principles of Computer Science I Spring: 2017
Exam 2 ITEC 120 Principles of Computer Science I Spring: 2017 I will abide by the Radford University Honor Code. Name Signature On this exam, you may NOT use already written methods such as Character class
More informationCS111: PROGRAMMING LANGUAGE II
CS111: PROGRAMMING LANGUAGE II Computer Science Department Lecture 1(c): Java Basics (II) Lecture Contents Java basics (part II) Conditions Loops Methods Conditions & Branching Conditional Statements A
More informationType Definition. C Types. Derived. Function Array Pointer Structure Union Enumerated. EE 1910 Winter 2017/18
Enum and Struct Type Definition C Types Derived Function Array Pointer Structure Union Enumerated 2 tj Type Definition Typedef Define a new Type Inherits members and operations from a standard or previously
More informationTopics. Chapter 5. Equality Operators
Topics Chapter 5 Flow of Control Part 1: Selection Forming Conditions if/ Statements Comparing Floating-Point Numbers Comparing Objects The equals Method String Comparison Methods The Conditional Operator
More informationProgramming Languages. Function-Closure Idioms. Adapted from Dan Grossman's PL class, U. of Washington
Programming Languages Function-Closure Idioms Adapted from Dan Grossman's PL class, U. of Washington More idioms We know the rule for lexical scope and function closures Now what is it good for A partial
More informationEECS2301. Example. Testing 3/22/2017. Linux/Unix Part 3. for SCRIPT in /path/to/scripts/dir/* do if [ -f $SCRIPT -a -x $SCRIPT ] then $SCRIPT fi done
Warning: These notes are not complete, it is a Skelton that will be modified/add-to in the class. If you want to us them for studying, either attend the class or get the completed notes from someone who
More informationYou must include this cover sheet. Either type up the assignment using theory3.tex, or print out this PDF.
15-122 Assignment 3 Page 1 of 12 15-122 : Principles of Imperative Computation Fall 2012 Assignment 3 (Theory Part) Due: Thursday, October 4 at the beginning of lecture. Name: Andrew ID: Recitation: The
More informationPlease note that if you write the mid term in pencil, you will not be allowed to submit a remark request.
University of Toronto CSC148 Introduction to Computer Science Fall 2001 Mid Term Test Section L5101 Duration: 50 minutes Aids allowed: none Make sure that your examination booklet has 8 pages (including
More informationBANGLADESH UNIVERSITY OF PROFESSIONALS ACADEMIC CALENDAR FOR MPhil AND PHD PROGRAM 2014 (4 TH BATCH) PART I (COURSE WORK)
BANGLADESH UNIVERSITY OF PROFESSIONALS ACADEMIC CALENDAR FOR MPhil AND PHD PROGRAM 2014 (4 TH BATCH) DAY Soci-Economic and Political History of Bangladesh PART I (COURSE WORK) 1 ST SEMESTER 2 ND SEMESTER
More informationCSE 247 Data Structures and Algorithms Fall Exam I
CSE 247 Data Structures and Algorithms Fall 2016 Given: 29 February 2016 Exam I Due: End of session This exam is closed-book, closed-notes. No electronic devices or resources of any kind are allowed. The
More informationComputer Science II Data Structures
Computer Science II Data Structures Instructor Sukumar Ghosh 201P Maclean Hall Office hours: 10:30 AM 12:00 PM Mondays and Fridays Course Webpage homepage.cs.uiowa.edu/~ghosh/2116.html Course Syllabus
More informationCMPE/SE 135 Object-Oriented Analysis and Design
Course and Contact Information San José State University Department of Computer Engineering CMPE/SE 135 Object-Oriented Analysis and Design Instructor: Ron Mak Office Location: ENG 250 Email: ron.mak@sjsu.edu
More informationMcGill University School of Computer Science COMP-202A Introduction to Computing 1
McGill University School of Computer Science COMP-202A Introduction to Computing 1 Midterm Exam Thursday, October 26, 2006, 18:00-20:00 (6:00 8:00 PM) Instructors: Mathieu Petitpas, Shah Asaduzzaman, Sherif
More informationCS 1110 Prelim 1 March 7th, 2013
Last Name: First Name: Cornell NetID, all caps: Circle your lab: Tu 12:20 Tu 1:25 Tu 2:30 Tu 3:35 W 12:20 W 1:25 W 2:30 W 3:35 CS 1110 Prelim 1 March 7th, 2013 It is a violation of the Academic Integrity
More informationCS 323 Lecture 1. Design and Analysis of Algorithms. Hoeteck Wee
{ CS 323 Lecture 1 } Design and Analysis of Algorithms Hoeteck Wee hoeteck@cs.qc.cuny.edu http://cs323.qwriting.org/ Algorithmic ideas are pervasive APPLICATIONS. Economics, auctions and game theory Biology,
More informationCSE 143, Winter 2010 Midterm Exam Wednesday February 17, 2010
CSE 143, Winter 2010 Midterm Exam Wednesday February 17, 2010 Personal Information: Name: Section: Student ID #: TA: You have 50 minutes to complete this exam. You may receive a deduction if you keep working
More informationADVANCED SPREADSHEET APPLICATIONS (07)
(07) CONTESTANT ID# START TIME END TIME Financial Services Events Sponsored by the American Institute of Certified Public Accounts TOTAL POINTS (300) Failure to adhere to any of the following rules will
More informationAsks for clarification of whether a GOP must communicate to a TOP that a generator is in manual mode (no AVR) during start up or shut down.
# Name Duration 1 Project 2011-INT-02 Interpretation of VAR-002 for Constellation Power Gen 185 days Jan Feb Mar Apr May Jun Jul Aug Sep O 2012 2 Start Date for this Plan 0 days 3 A - ASSEMBLE SDT 6 days
More informationSoftware and Programming 1
Software and Programming 1 Lab 1: Introduction, HelloWorld Program and use of the Debugger 17 January 2019 SP1-Lab1-2018-19.pptx Tobi Brodie (tobi@dcs.bbk.ac.uk) 1 Module Information Lectures: Afternoon
More informationLecture Notes: ESC 101
Lecture Notes: ESC 101 Date: 26/02/2008 // Program to Display calendar of a given month import java.util.scanner; class Year int year; Year() this.year=2000; Year(int y) year=(y>1900)? y:1900; //if year
More informationACORN.COM CS 1110 SPRING 2012: ASSIGNMENT A1
ACORN.COM CS 1110 SPRING 2012: ASSIGNMENT A1 Due to CMS by Tuesday, February 14. Social networking has caused a return of the dot-com madness. You want in on the easy money, so you have decided to make
More informationMidterm Exam 2 CS 455, Spring 2011
Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2011 March 31, 2011 There are 6 problems on the exam, with 50 points total available. There are 7 pages to the exam, including this one;
More informationCS 211 Programming Practicum Fall 2018
Due: Wednesday, 11/7/18 at 11:59 pm Infix Expression Evaluator Programming Project 5 For this lab, write a C++ program that will evaluate an infix expression. The algorithm REQUIRED for this program will
More informationAdministrivia. Last modified: Fri Aug 25 10:59: CS61B: Lecture #2 1
Administrivia Please make sure you have obtained a Unix account. If you are a concurrent enrollment student not yet on our lists, please tell a TA sothatwecanhaveyouaddedtothoseeligibletoreceiveanaccount.
More informationOhad Barzilay and Oranit Dror
The String Class Represents a character string (e.g. "Hi") Implicit constructor: String quote = "Hello World"; string literal All string literals are String instances Object has a tostring() method More
More information1.00 Introduction to Computers and Engineering Problem Solving. Final Examination - May 19, 2004
1.00 Introduction to Computers and Engineering Problem Solving Final Examination - May 19, 2004 Name: E-mail Address: TA: Section: You have 3 hours to complete this exam. For coding questions, you do not
More informationCSE 331 Midterm Exam 2/13/12
Name There are 10 questions worth a total of 100 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. The exam is closed book, closed notes, closed
More informationPrelim 1. Solution. CS 2110, 14 March 2017, 7:30 PM Total Question Name Short answer
Prelim 1. Solution CS 2110, 14 March 2017, 7:30 PM 1 2 3 4 5 Total Question Name Short answer OO Recursion Loop invariants Max 1 36 33 15 15 100 Score Grader 1. Name (1 point) Write your name and NetID
More informationDictionaries. Looking up English words in the dictionary. Python sequences and collections. Properties of sequences and collections
Looking up English words in the dictionary Comparing sequences to collections. Sequence : a group of things that come one after the other Collection : a group of (interesting) things brought together for
More informationCompSci 105 S2 C - ASSIGNMENT TWO -
CompSci 105 S2 C - ASSIGNMENT TWO - The work done on this assignment must be your own work. Think carefully about any problems you come across, and try to solve them yourself before you ask anyone else
More informationtypedef int Array[10]; String name; Array ages;
Morteza Noferesti The C language provides a facility called typedef for creating synonyms for previously defined data type names. For example, the declaration: typedef int Length; Length a, b, len ; Length
More informationEE 352 Lab 3 The Search Is On
EE 352 Lab 3 The Search Is On Introduction In this lab you will write a program to find a pathway through a maze using a simple (brute-force) recursive (depth-first) search algorithm. 2 What you will learn
More informationCS 455 Midterm 2 Fall 2017 [Bono] Nov. 7, 2017
Name: USC NetID (e.g., ttrojan): CS 455 Midterm 2 Fall 2017 [Bono] Nov. 7, 2017 There are 6 problems on the exam, with 62 points total available. There are 10 pages to the exam (5 pages double-sided),
More information( &% class MyClass { }
Recall! $! "" # ' ' )' %&! ( &% class MyClass { $ Individual things that differentiate one object from another Determine the appearance, state or qualities of objects Represents any variables needed for
More informationCS113: Lecture 3. Topics: Variables. Data types. Arithmetic and Bitwise Operators. Order of Evaluation
CS113: Lecture 3 Topics: Variables Data types Arithmetic and Bitwise Operators Order of Evaluation 1 Variables Names of variables: Composed of letters, digits, and the underscore ( ) character. (NO spaces;
More informationINFORMATION TECHNOLOGY SPREADSHEETS. Part 1
INFORMATION TECHNOLOGY SPREADSHEETS Part 1 Page: 1 Created by John Martin Exercise Built-In Lists 1. Start Excel Spreadsheet 2. In cell B1 enter Mon 3. In cell C1 enter Tue 4. Select cell C1 5. At the
More informationFunctional Programming. Lecture 2: Algebra
Functional Programming by Łukasz Stafiniak Email: lukstafi@gmail.com, lukstafi@ii.uni.wroc.pl Web: www.ii.uni.wroc.pl/~lukstafi Lecture 2: Algebra Algebraic Data Types and some curious analogies 1 A Glimpse
More informationESC101 : Fundamental of Computing
ESC101 : Fundamental of Computing End Semester Exam 19 November 2008 Name : Roll No. : Section : Note : Read the instructions carefully 1. You will lose 3 marks if you forget to write your name, roll number,
More informationCMPS115 Winter 2004 Exam #2 OPEN BOOK/NOTE WORK ALONE (NO TEAMS) COVERS: Lectures 6 17
1. Coupling Example (20 pts) Given a set a modules that print or store student status reports, with data-flow connections as shown in the diagram and table below (arrow direction is In flow, and Out flow
More informationCSE 143 SAMPLE MIDTERM
CSE 143 SAMPLE MIDTERM 1. (5 points) In some methods, you wrote code to check if a certain precondition was held. If the precondition did not hold, then you threw an exception. This leads to robust code
More informationCOMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz
COMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz The in-class quiz is intended to give you a taste of the midterm, give you some early feedback about
More informationIntroduction to OOP with Java. Instructor: AbuKhleif, Mohammad Noor Sep 2017
Introduction to OOP with Java Instructor: AbuKhleif, Mohammad Noor Sep 2017 Lecture 03: Control Flow Statements: Selection Instructor: AbuKhleif, Mohammad Noor Sep 2017 Instructor AbuKhleif, Mohammad Noor
More informationCSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012
CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012 Name: This exam consists of 7 problems on the following 6 pages. You may use your single- side hand- written 8 ½ x 11 note sheet during the
More informationCS 211 Programming Practicum Spring 2018
Due: Thursday, 4/5/18 at 11:59 pm Infix Expression Evaluator Programming Project 5 For this lab, write a C++ program that will evaluate an infix expression. The algorithm REQUIRED for this program will
More informationIntroduction to Computer Science II (ITI 1121) Midterm Examination
Introduction to Computer Science II (ITI 1121) Midterm Examination Instructor: Marcel Turcotte February 2008, duration: 2 hours Identification Student name: Student number: Signature: Instructions 1. 2.
More informationWhy Design by Contract! CS 619 Introduction to OO Design and Development. Design by Contract. Fall 2012
Why Design by Contract What s the difference with Testing? CS 619 Introduction to OO Design and Development Design by Contract Fall 2012 Testing tries to diagnose (and cure) defects after the facts. Design
More information3. EXCEL FORMULAS & TABLES
Winter 2019 CS130 - Excel Formulas & Tables 1 3. EXCEL FORMULAS & TABLES Winter 2019 Winter 2019 CS130 - Excel Formulas & Tables 2 Cell References Absolute reference - refer to cells by their fixed position.
More informationProject 1: Implementation of the Stack ADT and Its Application
Project 1: Implementation of the Stack ADT and Its Application Dr. Hasmik Gharibyan Deadlines: submit your files via handin by midnight (end of the day) on Thursday, 10/08/15. Late submission: submit your
More informationUAE PUBLIC TRAINING CALENDAR
UAE 102-R8.3 Primavera P6 Professional Fundamentals Rel 8.3 5 Abu Dhabi 4-Jan 8-Jan 19.5 106-R8.3 Primavera P6 Professional Advanced Rel8.3 3 Dubai 18-Jan 20-Jan 13.0 PMI-SP01 SP) Certification) 5 Abu
More informationCS 1803 Pair Homework 3 Calculator Pair Fun Due: Wednesday, September 15th, before 6 PM Out of 100 points
CS 1803 Pair Homework 3 Calculator Pair Fun Due: Wednesday, September 15th, before 6 PM Out of 100 points Files to submit: 1. HW3.py This is a PAIR PROGRAMMING Assignment: Work with your partner! For pair
More informationLecture 1 Getting Started with SAS
SAS for Data Management, Analysis, and Reporting Lecture 1 Getting Started with SAS Portions reproduced with permission of SAS Institute Inc., Cary, NC, USA Goals of the course To provide skills required
More informationYOU ARE ALLOWED TO HAVE ONLY THE FOLLOWING ON YOUR DESK OR WORKTABLE:
PRINT YOUR NAME: KEY I have not looked at anyone else s paper, and I have not obtained unauthorized help in completing this exam. Also, I have adhered to and upheld all standards of honesty as stated in
More informationLecture 14. Dynamic Memory Allocation
Copyright 1996 David R. Hanson Computer Science 126, Fall 1996 14-1 Lecture 14. Dynamic Memory Allocation The number of variables and their sizes are determined at compile-time before a program runs /*
More informationUse the scantron sheet to enter the answer to questions (pages 1-6)
Use the scantron sheet to enter the answer to questions 1-100 (pages 1-6) Part I. Mark A for True, B for false. (1 point each) 1. Abstraction allow us to specify an object regardless of how the object
More informationMath 180 Written Homework Solutions Assignment #1 Due Thursday, September 4th at the beginning of your discussion class.
Math 180 Written Homework Solutions Assignment #1 Due Thursday, September 4th at the beginning of your discussion class. Directions. You are welcome to work on the following problems with other MATH 180
More informationAnnouncements. 1. Forms to return today after class:
Announcements Handouts (3) to pick up 1. Forms to return today after class: Pretest (take during class later) Laptop information form (fill out during class later) Academic honesty form (must sign) 2.
More informationBCIS 3630 Dr. GUYNES SPRING 2018 TUESDAY SECTION [JAN version] GRADER COURSE WEBSITE
COURSE WEBSITE http://www.steveguynes.com/bcis3630/bcis3630/default.html Instructor: Dr. Guynes Office: BLB 312H Phone: (940) 565-3110 Office Hours: By Email Email: steve.guynes@unt.edu TEXTBOOK: Starting
More informationCS 314 Exam 2 Spring 2018
Points off 1 2 3 4 5 Total off CS 314 Exam 2 Spring 2018 Your Name Your UTEID Circle your TA's Name: Aish Anthony Chris Dayanny Hailey Ivan Jacob Joseph Lucas Shelby Instructions: 1. There are 5 questions
More informationQuestion 1. tmp = Stack() # Transfer every item from stk onto tmp. while not stk.is_empty(): tmp.push(stk.pop())
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 informationClaremont McKenna College Computer Science
Claremont McKenna College Computer Science CS 51 Handout 4: Problem Set 4 February 10, 2011 This problem set is due 11:50pm on Wednesday, February 16. As usual, you may hand in yours until I make my solutions
More informationData Structures. BSc in Computer Science University of New York, Tirana. Assoc. Prof. Marenglen Biba 1-1
Data Structures BSc in Computer Science University of New York, Tirana Assoc. Prof. Marenglen Biba 1-1 General info Course : Data Structures (3 credit hours) Instructor : Assoc. Prof. Marenglen Biba Office
More informationCSE 131 Introduction to Computer Science Fall Exam II
CSE 131 Introduction to Computer Science Fall 2013 Given: 6 November 2013 Exam II Due: End of session This exam is closed-book, closed-notes, no electronic devices allowed. The exception is the cheat sheet
More informationHow It All Stacks Up - or - Bar Charts with Plotly. ISC1057 Janet Peterson and John Burkardt Computational Thinking Fall Semester 2016
* How It All Stacks Up - or - Bar Charts with Plotly ISC1057 Janet Peterson and John Burkardt Computational Thinking Fall Semester 2016 In a game of poker, players bet by tossing chips into the center
More informationCS61BL: Data Structures & Programming Methodology Summer 2014
CS61BL: Data Structures & Programming Methodology Summer 2014 Instructor: Edwin Liao Midterm 2 July 30, 2014 Name: Student ID Number: Section Time: TA: Course Login: cs61bl-?? Person on Left: Possibly
More informationCIMA Asia. Interactive Timetable Live Online
CIMA Asia Interactive Timetable 2017 2018 Live Online Version 1 Information last updated 09 October 2017 Please note: Information and dates in this timetable are subject to change. CIMA Cert BA Course
More informationProblem Set 5 Due: Friday, November 2
CS231 Algorithms Handout # 19 Prof. Lyn Turbak October 26, 2001 Wellesley College Problem Set 5 Due: Friday, November 2 Important: On Friday, Nov. 2, you will receive a take-home midterm exam that is due
More informationIntroduction to Computer Science II (CSI 1101)
Introduction to Computer Science II (CSI 1101) Professor: M. Turcotte February 2002, duration: 75 minutes Identification Student name: last name: Section: Student number: initials: Signature: Instructions
More informationCOS 226 Midterm Exam, Spring 2009
NAME: login ID: precept: COS 226 Midterm Exam, Spring 2009 This test is 10 questions, weighted as indicated. The exam is closed book, except that you are allowed to use a one page cheatsheet. No calculators
More informationMidterm Exam 2 CS 455, Spring 2015
Name: USC NetId (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2015 April 7, 2015 There are 7 problems on the exam, with 60 points total available. There are 8 pages to the exam, including this one; make
More informationData Structure and Algorithm Homework #1 Due: 1:20pm, Tuesday, March 21, 2017 TA === Homework submission instructions ===
Data Structure and Algorithm Homework #1 Due: 1:20pm, Tuesday, March 21, 2017 TA email: dsa1@csie.ntu.edu.tw === Homework submission instructions === For Problem 1-3, please put all your solutions in a
More informationMIDTERM REVIEW. midterminformation.htm
MIDTERM REVIEW http://pages.cpsc.ucalgary.ca/~tamj/233/exams/ midterminformation.htm 1 REMINDER Midterm Time: 7:00pm - 8:15pm on Friday, Mar 1, 2013 Location: ST 148 Cover everything up to the last lecture
More informationCSIS 10B Lab 2 Bags and Stacks
CSIS 10B Lab 2 Bags and Stacks Part A Bags and Inheritance In this part of the lab we will be exploring the use of the Bag ADT to manage quantities of data of a certain generic type (listed as T in the
More informationTypes, Operators and Expressions
Types, Operators and Expressions CSE 2031 Fall 2011 9/11/2011 5:24 PM 1 Variable Names (2.1) Combinations of letters, numbers, and underscore character ( _ ) that do not start with a number; are not a
More information