Max iteration: Min iteration: Max iteration: Min iteration: Max iteration: Min iteration:
|
|
- April Cook
- 5 years ago
- Views:
Transcription
1 Midterm Review Optional Worksheet 1. T/F 1. Numbers, booleans, and arrays are value types. 2. Value types have fields. 3. A constructor has no return type. 4. Classes define all properties and functions of an object. 5. The mod operator shows the remainder when two numbers are divided. 2. Given the following loops, what are the maximum and minimum numbers of iterations that each loop performs? function loop1(num: number): boolean { // assume num is a whole number < 3 for (let i: number = num; i < 10; i++) { if (i % 2 === 0) { return true; return false; function loop2(input: number): number { for (let i: number = 10; i >= 0; i--) { if (input < 0) { return input + 1; return input; Max iteration: Min iteration: function loop3(input: number): number { for (let i: number = 1; i < 10; i = i * 2) { if (input < 0) { input++; return input; Max iteration: Min iteration: Max iteration: Min iteration: 3. Given the following class, which constructions of a Rectangle object are valid? For those that are invalid, explain why. class Rectangle { length: number; width: number; color: string; name: string undefined; constructor(length: number, width: number, color: string, name?: string) { this.length = length; this.width = width; this.color = color; this.name = name;
2 (a). let a: Rectangle = new Rectangle(4, 2, green, myrectangle); (b). let b: Rectangle = new Rectangle(6, 3); (c). let c: Rectangle = new Rectangle(9, 4, orange, red ); (d). let d: Rectangle = new Rectangle(5, 2, blue, null); (e). let e: Rectangle = new Rectangle( green, 4, 5); (f). let f: Rectangle = new Rectangle(c.length, c.width, purple, f ); (g). Write your own construction of a Rectangle object below. 4. Consider the following code and answer the questions below. let hee: number = 4; let haw: number = hee; hee += 4; print("hee: " + hee); //a print("haw: " + haw); //b let haa: string[] = ["hello", "goodbye"]; let hoo: string[] = haa; haa[2] = "howdy"; hoo[1] = "hola"; print("hoo: " + hoo); //c print("haa: " + haa); //d a. What would be printed to the console at the line with the commented a? b. What would be printed to the console at the line with the commented b? c. What would be printed to the console at the line with the commented c? d. What would be printed to the console at the line with the commented d?
3 5. Draw the visualization depicted below. a. Draw a linked list of the following farm animals in the order they are given Rat Chicken Pig Cow Horse b. Redraw it after the following code runs. Assume head is the head Node variable of this linked list and we are given functions that we implemented in problem set 4. head.next = head.next.next; head = head.next; last(head).next = head; 6. Given the program below, answer the questions. class Person { constructor(name: string, age?: number) { this.name = name; if (age === undefined) { this.age = 0; else { this.age = age; age: number; name: string; celebratebirthday(who: Person): Person { return who.havebirthday(); havebirthday(): Person { this.age++; return this; function main() { let p1 = new Person( JC, 18); let p2 = new Person( Kit ); let name1: string = p1.havebirthday().name; let name2: string = p1.celebratebirthday(p2).havebirthday().name; let name3: string = p1.celebratebirthday(p2).celebratebirthday(p2).name; After the main function runs, write down the actual values stored in the following variables. name1 name2 name3 p1.age p2.age
4 7. class Node { data: string = ""; next: Node null = null; constructor(data: string) { this.data = data; tostring(): string { if (this.next === null) { return this.data + "-> null"; else { return this.data + "->" + this.next.tostring(); let first: Node = new Node("first"); let a: Node = new Node("a"); let b: Node = new Node("b"); let c: Node = new Node("c"); let d: Node = new Node("d"); let e: Node = new Node("e"); let f: Node = new Node("f"); Given the class to the left, fill in the boxes with the data of each Node, and then write out what will be printed on the bottom line. Node variable name a Output: b c d e f Node data a = b; a.next = c; c.data = f.data; c.next = f; d.next = b; e = d; e.data = a.data; first.next = e; b.next = c; c.next = f; print(first.tostring());
5 8. class Baz { arr: number[]; /* Implement part A here */ /* Implement part B here */ a. Create a constructor that takes in an array of numbers and assigns that array to the arr property (no initial value). b. Given the class to the left, implement a method named getsumodds that returns the sum of all the odd numbers in the arr property (Hint: use the modulo operator). c. Create a new object named foo of type Baz whose arr property is an array of the numbers 0 through 9. d. Print out the value returned by calling getsumodds on the foo object. /* Implement part C here */ /* Implement part D here */
6 Solution 1. FFTTT 2. 2,1; 11, 1; 4, 4; 3. invalid, invalid, valid, invalid, invalid, valid, ex: let g: Rectangle = new Rectangle(6, 3, black, g ); or: let g: Rectangle = new Rectangle(6, 3, black ); 4. 8; 4; hello,hola,howdy; hello,hola,howdy 5. (a) rat -> chicken -> pig -> cow -> horse -> null (b) pig -> cow -> horse -> (back to pig) 6. JC, Kit, Kit, 19, 4 7. b, b, f, b, b, f Output: first->b->b->f->f-> null 8. class Baz { arr: number[]; /* Implement part A here */ constructor(arr: number[]) { this.arr = arr; /* Implement part B here */ getsumodds(): number { let sum: number = 0; for (let i: number = 0; i < this.arr.length; i++) { if (this.arr[i] % 2 === 1) { sum += this.arr[i]; return sum; /* Implement part C here */ let foo: Baz = new Baz([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]); /* Implement part D here */ print(foo.getsumodds());
OOP, null, Graphics. Brooks Townsend
OOP, null, Graphics Brooks Townsend Value types vs Reference Types Value Types Simple data types, ex: string, number, boolean Reference Types Complex data types, ex: arrays, classes/objects Value types
More informationSolution to Test of Computer Science 203x Level Score: / 100 Time: 100 Minutes
Solution to Test of Computer Science 203x Level Score: / 100 Time: 100 Minutes PART I: Multiple Choice (3 points each) Note: The correct answer can be any combination of A, B, C, D. Example, Sample Question:
More informationClosed Computer and Book 1 Double-sided sheet of notes allowed staple to your test when done
CSIS-10B FINAL REVIEW Closed Computer and Book 1 Double-sided sheet of notes allowed staple to your test when done The test may cover any of these topics-- Topics covered since Test 2: Iterators Dictionaries
More informationCMP-326 Exam 2 Spring 2018 Total 120 Points Version 1
Version 1 5. (10 Points) What is the output of the following code: int total = 0; int i = 0; while( total < 90 ) { switch( i ) { case 0: total += 30; i = 1; break; case 1: i = 2; total -= 15; case 2: i
More informationJavaScript for C# Programmers Kevin
JavaScript for C# Programmers Kevin Jones kevin@rocksolidknowledge.com @kevinrjones http://www.github.com/kevinrjones Agenda Types Basic Syntax Objects Functions 2 Basics 'C' like language braces brackets
More informationCOMP200 INHERITANCE. OOP using Java, from slides by Shayan Javed
1 1 COMP200 INHERITANCE OOP using Java, from slides by Shayan Javed 2 Inheritance Derive new classes (subclass) from existing ones (superclass). Only the Object class (java.lang) has no superclass Every
More informationIntroduction: Abstract Data Types and Java Review
Introduction: Abstract Data Types and Java Review Computer Science E-22 Harvard Extension School David G. Sullivan, Ph.D. Welcome to Computer Science E-22! We will study fundamental data structures. ways
More informationMidterm 2 A. 10 Questions. While some questions may seem familiar to practice problems, there are likely to be subtle
Name email Midterm 2 A 10 Questions. While some questions may seem Midterm familiar 2 to A practice problems, there are likely to be subtle 10 Questions. While some questions may seem familiar to practice
More informationAdministrivia. Simple data types
Administrivia Lists, higher order procedures, and symbols 6.037 - Structure and Interpretation of Computer Programs Mike Phillips (mpp) Massachusetts Institute of Technology Project 0 was due today Reminder:
More informationCourse Outline. Introduction to java
Course Outline 1. Introduction to OO programming 2. Language Basics Syntax and Semantics 3. Algorithms, stepwise refinements. 4. Quiz/Assignment ( 5. Repetitions (for loops) 6. Writing simple classes 7.
More informationCSE 131S Introduction to Computer Science Summer SON Exam III
CSE 131S Introduction to Computer Science Summer SON 2014 Given: 6 August 2014 Exam III Due: 90 minutes after starting This exam is closed-book, closed-notes, no electronic devices allowed except for downloading
More informationCMSC132 Summer 2018 Midterm 1. Solution
CMSC132 Summer 2018 Midterm 1 Solution First Name (PRINT): Last Name (PRINT): Instructions This exam is a closed-book and closed-notes exam. Total point value is 100 points. The exam is a 80 minutes exam.
More informationSection 05: Midterm Review
Section 05: Midterm Review 1. Asymptotic Analysis (a) Applying definitions For each of the following, choose a c and n 0 which show f(n) O(g(n)). Explain why your values of c and n 0 work. (i) f(n) = 5000n
More informationCS231 - Spring 2017 Linked Lists. ArrayList is an implementation of List based on arrays. LinkedList is an implementation of List based on nodes.
CS231 - Spring 2017 Linked Lists List o Data structure which stores a fixed-size sequential collection of elements of the same type. o We've already seen two ways that you can store data in lists in Java.
More information1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4'
Practice questions: 1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4' 2. Will System.out.println((char)4) display 4? a. Yes b. No 3. The expression "Java
More informationCSE 131 Introduction to Computer Science Fall Exam III
CSE 131 Introduction to Computer Science Fall 2013 Exam III Given: 13 December 2013 Due: End of exam period This exam is closed-book, closed-notes, no electronic devices allowed. The exception is the cheat
More informationName: Student Workbook. Class:
Name: Student Workbook Class: Workbook v0.9 Brought to you by the Bootstrap team: Emma Youndtsmith Emmanuel Schanzer Kathi Fisler Joe Politz Shriram Krishnamurthi Visual Design: Colleen Murphy Bootstrap
More informationControl Structures. A program can proceed: Sequentially Selectively (branch) - making a choice Repetitively (iteratively) - looping
Control Structures A program can proceed: Sequentially Selectively (branch) - making a choice Repetitively (iteratively) - looping Conditional Execution if is a reserved word The most basic syntax for
More informationJavaScript: Objects, Methods, Prototypes
JavaScript: Objects, Methods, Prototypes Computer Science and Engineering College of Engineering The Ohio State University Lecture 22 What is an Object? Property: a key/value pair (aka "name"/value) Object:
More informationCommon Misunderstandings from Exam 1 Material
Common Misunderstandings from Exam 1 Material Kyle Dewey Stack and Heap Allocation with Pointers char c = c ; char* p1 = malloc(sizeof(char)); char** p2 = &p1; Where is c allocated? Where is p1 itself
More informationCS171 Midterm Exam. October 29, Name:
CS171 Midterm Exam October 29, 2012 Name: You are to honor the Emory Honor Code. This is a closed-book and closed-notes exam. You have 50 minutes to complete this exam. Read each problem carefully, and
More informationSoftware Development Techniques. December Sample Examination Paper. Time: 3 hours
Software Development Techniques December 2015 Sample Examination Paper Answer ALL questions. Clearly cross out surplus answers. Time: 3 hours The maximum mark for this paper is 100. Any reference material
More informationCIS 120 Programming Languages and Techniques. Midterm II. November 12, 2010
CIS 120 Programming Languages and Techniques Midterm II November 12, 2010 Name: Pennkey: Scores: 1 2 3 4 5 6 Total (50 max) 1. (14 points) Pages 7 to 9 define a simplified version of the Java Collection
More informationPractice Midterm 2 CMPS 12A Fall 2017
1.) Determine the output of the following program. public class Question1{ Car x = new Car("gray", 100000); Car y = new Car("red", 125000); Car z = new Car("blue", 150000); x = y; roadtrip(x); z = x; System.out.println(z.mileage);
More informationLabVIEW Case and Loop Structures ABE 4423/6423 Dr. Filip To Ag and Bio Engineering, Mississippi State University
LabVIEW Case and Loop Structures ABE 4423/6423 Dr. Filip To Ag and Bio Engineering, Mississippi State University Recap Previous Homework Following Instruction Create a Pressure Conversion VI that takes
More informationSFPL Reference Manual
1 SFPL Reference Manual By: Huang-Hsu Chen (hc2237) Xiao Song Lu(xl2144) Natasha Nezhdanova(nin2001) Ling Zhu(lz2153) 2 1. Lexical Conventions 1.1 Tokens There are six classes of tokes: identifiers, keywords,
More informationName: Bootstrap:Reactive. Class:
Name: Bootstrap:Reactive Class: Workbook v0.9 Brought to you by the Bootstrap team: Emma Youndtsmith Emmanuel Schanzer Kathi Fisler Joe Politz Shriram Krishnamurthi Visual Design: Colleen Murphy Bootstrap
More informationDefault Parameters and Shapes. Lecture 18
Default Parameters and Shapes Lecture 18 Announcements PS04 - Deadline extended to October 31st at 6pm MT1 Date is now Tuesday 11/14 Warm-up Question #0: If there are 15 people and you need to form teams
More informationIST311. Advanced Issues in OOP: Inheritance and Polymorphism
IST311 Advanced Issues in OOP: Inheritance and Polymorphism IST311/602 Cleveland State University Prof. Victor Matos Adapted from: Introduction to Java Programming: Comprehensive Version, Eighth Edition
More informationName CIS 201 Midterm II: Chapters 1-8
Name CIS 201 Midterm II: Chapters 1-8 December 15, 2010 Directions: This is a closed book, closed notes midterm. Place your answers in the space provided. The point value for each question is indicated.
More informationMidterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total.
Midterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total. Name: ID: Problem 1) (8 points) For the following code segment, what are the values of i, j, k, and d, after the segment
More informationCS 1331 Exam 1 ANSWER KEY
CS 1331 Exam 1 Fall 2016 ANSWER KEY Failure to properly fill in the information on this page will result in a deduction of up to 5 points from your exam score. Signing signifies you are aware of and in
More informationIntroduction to Typed Racket. The plan: Racket Crash Course Typed Racket and PL Racket Differences with the text Some PL Racket Examples
Introduction to Typed Racket The plan: Racket Crash Course Typed Racket and PL Racket Differences with the text Some PL Racket Examples Getting started Find a machine with DrRacket installed (e.g. the
More informationAssignment 19 Deadline: Nov pm COSC211 CRN15376 Session 15 (Nov. 7)
This in-class assignment has 3 points in total. Every bug costs 0.1-0.3 based on its severity. The deadline for this assignment is Thursday, Nov. 8, NOON, 12 pm. Note: Make sure your console output is
More information: Advanced Programming Final Exam Summer 2008 June 27, 2008
15-111 : Advanced Programming Final Exam Summer 2008 June 27, 2008 Name: Andrew ID: Answer the questions in the space provided following each question. We must be able to clearly understand your answer.
More informationCOMP 401 Spring 2013 Midterm 1
COMP 401 Spring 2013 Midterm 1 I have not received nor given any unauthorized assistance in completing this exam. Signature: Name: PID: Please be sure to put your PID at the top of each page. This page
More informationObjectives. Introduce the core C# language features class Main types variables basic input and output operators arrays control constructs comments
Basics Objectives Introduce the core C# language features class Main types variables basic input and output operators arrays control constructs comments 2 Class Keyword class used to define new type specify
More informationCS 1331 Exam 1. Fall Failure to properly fill in the information on this page will result in a deduction of up to 5 points from your exam score.
CS 1331 Exam 1 Fall 2016 Name (print clearly): GT account (gpburdell1, msmith3, etc): Section (e.g., B1): Signature: Failure to properly fill in the information on this page will result in a deduction
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination October 9, Name: KEY
CSC 1051 Algorithms and Data Structures I Midterm Examination October 9, 2014 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the
More informationSample midterm 1 #1. Problem 1 (What will Scheme print?).
Sample midterm 1 #1 Problem 1 (What will Scheme print?). What will Scheme print in response to the following expressions? If an expression produces an error message, you may just say error ; you don t
More informationCSIS 10A Practice Final Exam Name:
CSIS 10A Practice Final Exam Name: Multiple Choice: Each question is worth 2 points. Circle the letter of the best answer for the following questions. 1. For the following declarations: int area; String
More informationCMPT-166: Sample Midterm
CMPT 166, Fall 2016, Surrey Sample Midterm 1 Page 1 of 11 CMPT-166: Sample Midterm Last name exactly as it appears on your student card First name exactly as it appears on your student card Student Number
More informationJavaScript Lecture 2
JavaScript Lecture 2 Waterford Institute of Technology May 5, 2016 John Fitzgerald Waterford Institute of Technology, JavaScriptLecture 2 1/28 JavaScript Introduction Topics discussed this presentation
More informationRAJALAKSHMI ENGINEERING COLLEGE Thandalam, Chennai Department of Computer Science and Engineering CS17201 DATA STRUCTURES Unit-II-Assignment
RAJALAKSHMI ENGINEERING COLLEGE Thandalam, Chennai 602 105 Department of Computer Science and Engineering CS17201 DATA STRUCTURES Unit-II-Assignment Reg. No. : Name : Year : Branch: Section: I. Choose
More informationREFERENCE MATERIALS. Assignment, Display, and Input Evaluates expression and assigns the result to the variable a.
a expression Assignment, Display, and Input Evaluates expression and assigns the result to the variable a. DISPLAY (expression) Displays the value of expression, followed by a space. INPUT () Accepts a
More informationFind the area and perimeter of these shapes: Draw another shape with area a smaller perimeter. a larger perimeter.
Find the area and perimeter of these shapes: Draw another shape with area a smaller perimeter. Draw another shape with area a larger perimeter. but with but with Page 1 Perimeter 10cm 2cm 5cm An equilateral
More informationCIS Fall Data Structures Midterm exam 10/16/2012
CIS 2168 2012 Fall Data Structures Midterm exam 10/16/2012 Name: Problem 1 (30 points) 1. Suppose we have an array implementation of the stack class, with ten items in the stack stored at data[0] through
More informationThis midterm has about 4 questions more than the actual midterm of 200 pts will have
C Sc 227 Practice Midterm Name 246 points This midterm has about 4 questions more than the actual midterm of 200 pts will have 1. Write a checkmark to the right of any assertion in the following test method
More informationNATIONAL UNIVERSITY OF SINGAPORE
NATIONAL UNIVERSITY OF SINGAPORE SCHOOL OF COMPUTING TERM TEST #1 Semester 1 AY2006/2007 CS1101X/Y/Z PROGRAMMING METHODOLOGY 16 September 2006 Time Allowed: 60 Minutes INSTRUCTIONS 1. This question paper
More informationSebastiano
Sebastiano Armeli @sebarmeli http://html5hub.com/wp-content/uploads/2013/11/es6-hiway-sign.png Sebastiano Armeli @sebarmeli ES6 History 199 199 199 199 199 200 200 5 6 7 8 9 0 3 JSScript ECMA-262 Ed.2
More informationChapter 6: Inheritance
Chapter 6: Inheritance EECS 1030 moodle.yorku.ca State of an object final int WIDTH = 3; final int HEIGTH = 4; final int WEIGHT = 80; GoldenRectangle rectangle = new GoldenRectangle(WIDTH, HEIGHT, WEIGHT);
More informationMidterm 1 Study Guide
Midterm 1 Study Guide Else-if, loops (while, for, and for-each), arrays, interfaces, and ADTs (List, Set, and Map). While loops and else-if Use the LateNightAtRams class below and the Student class at
More informationReview. Primitive Data Types & Variables. String Mathematical operators: + - * / % Comparison: < > <= >= == int, long float, double boolean char
Review Primitive Data Types & Variables int, long float, double boolean char String Mathematical operators: + - * / % Comparison: < > = == 1 1.3 Conditionals and Loops Introduction to Programming in
More informationJava Arrays (review) Linked Lists (preview)
Java Arrays (review) Linked Lists (preview) 1 Array Agenda What is an array Declaration of an array Instantiation of an array Accessing array element Array length Multi-dimensional array 2 What is an Array?
More informationCIS 120 Programming Languages and Techniques. Midterm II. November 12, Answer key
CIS 120 Programming Languages and Techniques Midterm II November 12, 2010 Answer key 1. (14 points) Pages 7 to 9 define a simplified version of the Java Collection interface (the SimpleCollection and SimpleIterator
More informationCSCI 212 Second Midterm Exam Spring
QUEENS COLLEGE Department of Computer Science CSCI 212 Second Midterm Exam Spring 2018 04.30.18 Instructor: Krishna Mahavadi 08.00am 08.50am, Monday, April 30, 2018 1. Read the following code. (10 pts)
More informationChapter 12 Supplement: Recursion with Java 1.5. Mr. Dave Clausen La Cañada High School
Chapter 12 Supplement: Recursion with Java 1.5 La Cañada High School Recursion: Definitions Recursion The process of a subprogram (method) calling itself. A clearly defined stopping state must exist. The
More informationCSE120 Wi18 Final Review
CSE120 Wi18 Final Review Practice Question Solutions 1. True or false? Looping is necessary for complex programs. Briefly explain. False. Many loops can be explicitly written out as individual statements
More informationCS 251 Intermediate Programming Java Basics
CS 251 Intermediate Programming Java Basics Brooke Chenoweth University of New Mexico Spring 2018 Prerequisites These are the topics that I assume that you have already seen: Variables Boolean expressions
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 informationCS 1301 Ch 8, Handout 2
CS 1301 Ch 8, Handout 2 This section discusses the split and match methods of the String class, regular expressions, and creating objects from strings, and command line arguments. The split Method 1. The
More informationJava GUI Test #1 Solutions 7/10/2015
SI@UCF Java GUI Test #1 Solutions 7/10/2015 1) (12 pts) Jimmy's box for crayons has dimensions L x W x H. Each crayon he puts in has a height of exactly H. Thus, he stands each crayon up in the box forming
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 Summer 2001 Mid Term Test Section L0101 Duration: 50 minutes Aids allowed: none Make sure that your examination booklet has 8 pages (including
More informationCSCI 1301: Introduction to Computing and Programming Summer 2018 Lab 07 Classes and Methods
Introduction This lab introduces you to additional concepts of Object Oriented Programming (OOP), arguably the dominant programming paradigm in use today. In the paradigm, a program consists of component
More informationPractice Midterm 1. Problem Points Score TOTAL 50
CS 120 Software Design I Spring 2019 Practice Midterm 1 University of Wisconsin - La Crosse February 25 NAME: Do not turn the page until instructed to do so. This booklet contains 10 pages including the
More informationLinked Lists. .. and other linked structures. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR
1 Linked Lists.. and other linked structures Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Dynamic memory allocation: review typedef struct { int hitemp;
More informationImplementing non-static features
Implementing non-static features Problem Implement the Rectangle class. What have we done so far? attributes constructors accessors mutators getarea tostring scale equals compareto Duplicates What will
More informationCIS 110 Introduction to Computer Programming Spring 2016 Midterm
CIS 110 Introduction to Computer Programming Spring 2016 Midterm Name: Recitation # (e.g., 201): Pennkey (e.g., eeaton): My signature below certifies that I have complied with the University of Pennsylvania
More information(6) The specification of a name with its type in a program. (7) Some memory that holds a value of a given type.
CS 7A - Fall 2016 - Midterm 1 10/20/16 Write responses to questions 1 and 2 on this paper or attach additional sheets, as necessary For all subsequent problems, use separate paper Do not use a computer
More informationWYSE Academic Challenge State Finals Computer Science 2007 Solution Set
WYSE Academic Challenge State Finals Computer Science 2007 Solution Set 1. Correct answer: C. a) PGP is for encrypting documents, traditionally used for email. b) SSH is used to gain secure access to a
More informationCSE 143 Lecture 20. Circle
CSE 143 Lecture 20 Abstract classes Circle public class Circle { private double radius; public Circle(double radius) { this.radius = radius; public double area() { return Math.PI * radius * radius; public
More informationCMSC132 Summer 2018 Midterm 1
CMSC132 Summer 2018 Midterm 1 First Name (PRINT): Last Name (PRINT): Instructions This exam is a closed-book and closed-notes exam. Total point value is 100 points. The exam is a 80 minutes exam. Please
More informationMidterm Exam. 5. What is the character - (minus) used for in JavaScript? Give as many answers as you can.
First Name Last Name CSCi 90.3 March 23, 2010 Midterm Exam Instructions: For multiple choice questions, circle the letter of the one best choice unless the question explicitly states that it might have
More informationCS Week 13. Jim Williams, PhD
CS 200 - Week 13 Jim Williams, PhD This Week 1. Team Lab: Instantiable Class 2. BP2 Strategy 3. Lecture: Classes as templates BP2 Strategy 1. M1: 2 of 3 milestone tests didn't require reading a file. 2.
More informationMidterm Test II Object Oriented Programming in Java Computer Science, University of Windsor Fall 2014 Time 2 hours. Answer all questions
Midterm Test II 60-212 Object Oriented Programming in Java Computer Science, University of Windsor Fall 2014 Time 2 hours Answer all questions Name : Student Id # : Only an unmarked copy of a textbook
More informationSCHOOL OF COMPUTING, ENGINEERING AND MATHEMATICS SEMESTER 2 EXAMINATIONS 2014/2015 CI101/CI101H. Programming
s SCHOOL OF COMPUTING, ENGINEERING AND MATHEMATICS SEMESTER 2 EXAMINATIONS 2014/2015 CI101/CI101H Programming Time allowed: THREE hours Answer: ALL questions Items permitted: Items supplied: There is no
More informationYEAH Hours. January , 7-8 PM Jared Wolens
YEAH Hours January 23 2017, 7-8 PM Jared Wolens YEAH Hours? Held after each assignment is released Future dates to be scheduled soon Review + Assignment Tips Plan for today: lecture review, assignment
More informationCPSC 310, Practice Midterm Questions ( 100 points )
CPSC 310, Practice Midterm Questions ( 100 points ) True/False, 2 points each. 1. (T/F, if false explain why) In McConnell s Productive work analysis, he claimed that early attention to process could help
More informationCOMPUTER SCIENCE PAPER 1
COMPUTER SCIENCE PAPER 1 (THEORY) (Maximum Marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time.)
More informationBB4W. KS3 Programming Workbook INTRODUCTION TO. BBC BASIC for Windows. Name: Class:
KS3 Programming Workbook INTRODUCTION TO BB4W BBC BASIC for Windows Name: Class: Resource created by Lin White www.coinlea.co.uk This resource may be photocopied for educational purposes Introducing BBC
More information[TAP:AXETF] Inheritance
[TAP:AXETF] Inheritance What makes the latter better? A. Less room for error B. Easier to understand the global structure C. All of the above D. None of the above E. Whatever 1 Administrative Details Lab
More informationIntroduction to Java https://tinyurl.com/y7bvpa9z
Introduction to Java https://tinyurl.com/y7bvpa9z Eric Newhall - Laurence Meyers Team 2849 Alumni Java Object-Oriented Compiled Garbage-Collected WORA - Write Once, Run Anywhere IDE Integrated Development
More informationComputer 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 informationCIS 110 Introduction To Computer Programming. February 29, 2012 Midterm
CIS 110 Introduction To Computer Programming February 29, 2012 Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University of Pennsylvania
More informationcs61amt2_4 CS 61A Midterm #2 ver March 2, 1998 Exam version: A Your name login: cs61a- Discussion section number TA's name
CS 61A Midterm #2 ver1.03 -- March 2, 1998 Exam version: A Your name login: cs61a- Discussion section number TA's name Look at the edge of your seat. Write your ROOM, seat row and number. Your row number
More informationBoot Camp JavaScript Sioux, March 31, 2011
Boot Camp JavaScript http://rix0r.nl/bootcamp Sioux, March 31, 2011 Agenda Part 1: JavaScript the Language Short break Part 2: JavaScript in the Browser History May 1995 LiveScript is written by Brendan
More informationRemedial classes. G51PRG: Introduction to Programming Second semester Lecture 2. Plan of the lecture. Classes and Objects. Example: Point class
G51PRG: Introduction to Programming Second semester Lecture 2 Remedial classes Monday 3-5 in A32 Contact Yan Su (yxs) Ordinary labs start on Tuesday Natasha Alechina School of Computer Science & IT nza@cs.nott.ac.uk
More information+ Inheritance. Sometimes we need to create new more specialized types that are similar to types we have already created.
+ Inheritance + Inheritance Classes that we design in Java can be used to model some concept in our program. For example: Pokemon a = new Pokemon(); Pokemon b = new Pokemon() Sometimes we need to create
More informationChapter 3 Classes & Objects
1 Chapter 3 Classes & Objects Question 1: Given the code below, 1. public class Try 3. private static int sum = 20; 4. public static void main(string args[]) 5. { 6. Try t1 = new Try(); 7. Try.sum++; 8.
More informationCS 1302 Chapter 9 (Review) Object & Classes
CS 1302 Chapter 9 (Review) Object & Classes Reference Sections 9.2-9.5, 9.7-9.14 9.2 Defining Classes for Objects 1. A class is a blueprint (or template) for creating objects. A class defines the state
More informationHello, World! EMT1111: Logic and Problem Solving Fall 2016 Dr. Mendoza
Hello, World! EMT1111: Logic and Problem Solving Fall 2016 Dr. Mendoza LESSON 4 (Labs): Python Overview IV SIMPLE PYTHON PROGRAMS II Lab Assignment 1 (poem2.py) Put the blocks below into the correct order
More informationOutline. Introduction to Programming (in C++) Algorithms on sequences. Reasoning about loops: Invariants. Maximum of a sequence. Maximum of a sequence
Outline Introduction to Programming (in C++) Algorithms on sequences. Reasoning about loops: Invariants. Algorithms on sequences Treat-all algorithms Search algorithms Reasoning about loops: invariants
More informationSCHEME 8. 1 Introduction. 2 Primitives COMPUTER SCIENCE 61A. March 23, 2017
SCHEME 8 COMPUTER SCIENCE 61A March 2, 2017 1 Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write Scheme programs,
More informationExplain the significance of using a computer programming language. Describe the basic template of the Monogame framework.
I can Explain the significance of using a computer programming language. Describe the basic template of the Monogame framework. A series of steps (actions) performed in a specific order Specifies The ACTIONS
More informationOOP Subtyping. Lecture 20
OOP Subtyping Lecture 20 Announcements WS05 - Posted yesterday, due Wednesday 11/8 at 11:59pm Explores recursion and object-oriented programming fundamentals Warm-up: What is printed? interface Transform
More informationLinked Lists. References and objects
Linked Lists slides created by Marty Stepp http://www.cs.washington.edu/143/ Modified by Sarah Heckman Reading: RS Chapter 16 References and objects In Java, objects and arrays use reference semantics.
More informationIntroduction to Computer Science II CS S-20 Linked Lists III
Introduction to Computer Science II CS112-2012S-20 Linked Lists III David Galles Department of Computer Science University of San Francisco 20-0: Linked List Previous Practical Example: removeat(int index)
More informationFunctions in Scheme. From Scheme to Java. Functions in Java. Functions in Java. method that is in the class // Determines whether it s < n lbs
From Scheme to Java So far, we ve translated data definitions: ; A snake is ; (make-snake sym num sym) (define-struct snake (name weight food)) class Snake { String name; double weight; String food; Snake(String
More informationFinal Exam. Kenneth J. Goldman December 18, Name: Student ID Number: Signature:
Washington University CSE131. Computer Science I Final Exam Kenneth J. Goldman December 18, 2007 Name: Student ID Number: Signature: Directions: This exam is closed book and closed notes. No electronic
More informationRuby: Introduction, Basics
Ruby: Introduction, Basics Computer Science and Engineering College of Engineering The Ohio State University Lecture 3 Ruby vs Java: Similarities Imperative and object-oriented Classes and instances (ie
More information