#archap 1 * LectureNotes. +LectureNotes(in title : String, in n : int, in coursename : String)
|
|
- Arlene Shields
- 5 years ago
- Views:
Transcription
1 King Saud University College of Computer and Information Sciences Department of Computer Science CSC113 Computer Programming II Midterm 2 Exam Spring 2018 Exercise1: «interface» CourseMaterial +displaymaterial() +printmaterial() -title : String Document +Document(in title : String, in n : int) +getdocsize() : double +getdocnbpages() : int #archap 1 * Chapter -title : String -nbpages : int -size : double +Chapter(in title : String, in nbpages : int, in size : double) +gettitle() : String +getsize() : double +getnbpages() : int +display() +print() -editor : String TextBook +TextBook(in title : String, in n : int, in editor : String) +geteditor() : String -coursename : String LectureNotes +LectureNotes(in title : String, in n : int, in coursename : String) Class Chapter : title: the title of the chapter. nbpages: the number of pages of the chapter. size: the size in kilo-bytes of the chapter. Chapter(title: String, nbpages: int, size: double): constructor. gettitle(), getsize() and getnbpages() : getters. display(): this method displays all attributes of the chapter. print(): this method prints the chapter.
2 Interface CourseMaterial : displaymaterial(): this method displays all the attributes of the Document (TextBook or LectureNotes) as well as its chapters. printmaterial(): this method prints the chapters of the Document as follows: o For Text Books, it prints the chapter entitled Introduction only. o For Lecture Notes, it prints all chapters. Class Document : title: the title of the document. Document(title: String, n: int): constructor. The parameter n defines the maximum number of chapters of the Document. getdocsize(): this method returns the total size of all chapters of the Document. getdocnbpages(): this method returns the total number of pages of all chapters of the Document. Class TextBook : editor: the editor name of the textbook. TextBook(title: String, n: int, editor: String): constructor. geteditor(): getter. QUESTION: Translate into Java code: 1. The interface CourseMaterial, 2. the class Document and 3. the class TextBook. 2
3 public interface CourseMaterial { public void displaymaterial(); public void printmaterial();./3 public abstract class Document implements CourseMaterial { +1./17 private String title; protected Chapter archap[]; protected int nbchap; public Document(String t,int n) {./2 title = t; archap = new Chapter[n]; nbchap = 0; public void displaymaterial(){./3 System.out.println(title); for (int i = 0; i < nbchap; i++) archap[i].display(); public double getdocsize() {./4 double totalsize = 0.0; for (int i = 0; i < nbchap; i++) totalsize += archap[i].getsize(); return totalsize; public int getdocnbpages() {./4 int totalnbp = 0; for (int i = 0; i < nbchap; i++) totalnbp += archap[i].getnbpages(); return totalnbp; public class TextBook extends Document { private String editor; public TextBook(String t,int n, String e) { super(t, n); editor = e; 0./2 public void displaymaterial() {./2 super.displaymaterial(); System.out.println(editor); public void printmaterial() {./4 for (int i = 0; i < nbchap; i++) { if (archap[i].gettitle().equals("introduction")) { archap[i].print(); return;./1 3
4 public String geteditor() { return editor; 4
5 Exercise 2: Let s consider the same class Document described in exercise 1. «interface» CourseMaterial +displaymaterial() +printmaterial() FolderEx2 -name : string -path : String +FolderEx2(in name : String, in path : String, in size : int) +largesttextbook() : Document +avgtextbooksize(in e : String) : Double -arrdoc 1 * -title : String Document +Document(in title : String, in n : int) +getdocsize() : double +getdocnbpages() : int Class FolderEx2: name: the name of the folder. path: the path of the folder. FolderEx2 (name: String, path: String, size: int): constructor. The parameter size defines the maximum number of documents in the folder. largesttextbook(): this method returns the Document of type TextBook having the largest total number of pages. avgtextbooksize( e: String): this method returns the average Document size of all TextBooks edited by the editor e. QUESTION: Translate into Java code the class FolderEx2. 5
6 public class FolderEx2 {./21 private String name; private String path; private Document ardoc[]; private int nbdoc; public FolderEx2(String s, String p, int size) { name = s; path = p;./2 ardoc = new Document[size]; nbdoc = 0; public Document largesttextbook() { Document res = null;./7 for (int i = 0; i < nbdoc; i++) { if (ardoc[i] instanceof TextBook) { if (res == null ardoc[i].getdocnbpages()>res.getdocnbpages())./1 res = ardoc[i]; return res; public double avgtextbooksize(string e) { double total = 0.0; int nb = 0; 1 for (int i = 0; i < nbdoc; i++) { if ( ardoc[i] instanceof TextBook && ((TextBook) ardoc[i]).geteditor().equals(e)) { /1+1 nb ++; total += ardoc[i].getdocsize(); if (nb > 0) return total / nb; else return 0.0; 6
7 Exercise 3: Let s consider the same class Document described in exercise 1. «interface» CourseMaterial +displaymaterial() +printmaterial() * FolderEx3 -name : string -path : String +FolderEx3(in name : String, in path : String, in size : int) +display() +getfolderlsize() : double -subfolders 1 -arrdoc 1 * -title : String Document +Document(in title : String, in n : int) +getdocsize() : double +getdocnbpages() : int Class FolderEx3: name: the name of the folder. path: the path of the folder. FolderEx3 (name: String, path: String, size: int): constructor. The parameter size defines the maximum number of documents in the folder. display(): this method displays both; all documents and subfolders of the folder. getfoldersize(): this method returns the total size of the folder calculated as follows: Total size of the folder = size _ of _ Documents size _ of _ subfolders QUESTION: Translate into Java code the class FolderEx3. 7
8 public class FolderEx3 { 9 private String name; private String path; private Document ardoc[]; private int nbdoc; private FolderEx3 subfolders[]; private int nbsubfolders; public FolderEx3(String s, String p, int size) { name = s; path = p;./4 ardoc = new Document[size]; nbdoc = 0; subfolders = new FolderEx3[10]; nbsubfolders = 0; public void display() { Document res = null;./5 for (int i = 0; i < nbdoc; i++) { ardoc[i].displaymaterial(); for (int i = 0; i < nbsubfolders; i++) { subfolders[i].display(); public double getfoldersize() { double totals = 0.0;./6 for (int i = 0; i < nbdoc; i++) { totals += ardoc[i].getdocsize(); for (int i = 0; i < nbsubfolders; i++) { totals += subfolders[i].getfoldersize(); return totals; 8
Objectives: Lab Exercise 1 Part 1. Sample Run. Part 2
Objectives: king Saud University College of Computer &Information Science CSC111 Lab Object I All Sections - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
More informationSample file. Practice Exam One COMPUTER SCIENCE A SECTION I. Directions: Determine the answer to each of the following questions or incomplete
Practice Exam One / Level A Diagnostic Test 5 Practice Exam One COMPUTER SCIENCE A SECTION I Time 1 hour and 15 minutes Number of questions 40 Percent of total grade 50 Directions: Determine the answer
More informationModel-based Software Engineering (02341, Spring 2017) Ekkart Kindler
Model-based Software Engineering (02341, Spring 2017) Code snippets (week 2) Ecore model from T01 3 Generated Code // All comments and imports deleted! package dk.dtu.compute.mbse.petrinet; Interface only
More informationAL GHURAIR UNIVERSITY College of Computing. Objectives: Examples: if Single-Selection Statement CSC 209 JAVA I. week 3- Control Statements: Part I
AL GHURAIR UNIVERSITY College of Computing CSC 209 JAVA I week 3- Control Statements: Part I Objectives: To use the if and if...else selection statements to choose among alternative actions. To use the
More informationCOMP-202: Foundations of Programming. Lecture 12: Linked List, and File I/O Sandeep Manjanna, Summer 2015
COMP-202: Foundations of Programming Lecture 12: Linked List, and File I/O Sandeep Manjanna, Summer 2015 Announcements Assignment 4 is posted and Due on 29 th of June at 11:30 pm. Course Evaluations due
More informationCS 170 Java Programming 1. Week 13: Classes, Testing, Debugging
CS 170 Java Programming 1 Week 13: Classes, Testing, Debugging What s the Plan? Short lecture for makeup exams Topic 1: A Little Review How to create your own user-defined classes Defining instance variables,
More informationUniversity of Massachusetts Amherst, Electrical and Computer Engineering
University of Massachusetts Amherst, Electrical and Computer Engineering ECE 122 Midterm Exam 1 Makeup Answer key March 2, 2018 Instructions: Closed book, Calculators allowed; Duration:120 minutes; Write
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 informationCSC 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 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 informationLab Exercise 1. Objectives: Part 1. Introduction
Objectives: king Saud University College of Computer &Information Science CSC111 Lab Object II All Sections - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
More informationCSE115 Introduction to Computer Science I Coding Exercise #7 Retrospective Fall 2017
This week the main activity was a quiz activity, with a structure similar to our Friday lecture activities. The retrospective for the quiz is in Quiz-07- retrospective.pdf This retrospective explores the
More informationRecitation 3 Class and Objects
1.00/1.001 Introduction to Computers and Engineering Problem Solving Recitation 3 Class and Objects Spring 2012 1 Scope One method cannot see variables in another; Variables created inside a block: { exist
More informationCS 116 Week 8 Page 1
CS 116 Week 8: Outline Reading: 1. Dale, Chapter 11 2. Dale, Lab 11 Objectives: 1. Mid-term exam CS 116 Week 8 Page 1 CS 116 Week 8: Lecture Outline 1. Mid-term Exam CS 116 Week 8 Page 2 CS 116 Week 8:
More informationCS 113 MIDTERM EXAM 2 SPRING 2013
CS 113 MIDTERM EXAM 2 SPRING 2013 There are 18 questions on this test. The value of each question is: 1-15 multiple choice (3 pts) 17 coding problem (15 pts) 16, 18 coding problems (20 pts) You may get
More informationCOMP 401 Spring 2014 Midterm 1
COMP 401 Spring 2014 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 informationYork University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes
York University AK/ITEC 1620 3.0 OBJECT-BASED PROGRAMMING Midterm Test Sample Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes This exam is closed textbook(s) and closed notes. Use of any electronic
More informationKing Saud University College of Computer and Information Sciences Computer Science Department
King Saud University College of Computer and Information Sciences Computer Science Department Course Code: CSC 111 Course Title: Introduction to Programming Semester: Fall 2017-2018 Exercises Cover Sheet:
More informationCMSC 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 informationEECS168 Exam 3 Review
EECS168 Exam 3 Review Exam 3 Time: 2pm-2:50pm Monday Nov 5 Closed book, closed notes. Calculators or other electronic devices are not permitted or required. If you are unable to attend an exam for any
More informationCOS 226 Algorithms and Data Structures Fall Midterm
COS 226 Algorithms and Data Structures Fall 2017 Midterm This exam has 10 questions (including question 0) worth a total of 55 points. You have 0 minutes. This exam is preprocessed by a computer, so please
More informationRevising CS-M41. Oliver Kullmann Computer Science Department Swansea University. Robert Recorde room Swansea, December 13, 2013.
Computer Science Department Swansea University Robert Recorde room Swansea, December 13, 2013 How to use the revision lecture The purpose of this lecture (and the slides) is to emphasise the main topics
More informationCSCI 111 Midterm Spring 2014
CSCI 111 Midterm Spring 2014 Question Number Point Value 1 40 2 20 3 15 4 25 Total 100 Points Awarded Name Student Id Lab Section 50 Minutes If I can t read your handwriting I have to count it wrong Keep
More informationThis exam is open book. Each question is worth 3 points.
This exam is open book. Each question is worth 3 points. Page 1 / 15 Page 2 / 15 Page 3 / 12 Page 4 / 18 Page 5 / 15 Page 6 / 9 Page 7 / 12 Page 8 / 6 Total / 100 (maximum is 102) 1. Are you in CS101 or
More informationCSC324 Principles of Programming Languages
CSC324 Principles of Programming Languages http://mcs.utm.utoronto.ca/~324 November 21, 2018 Last Class Types terminology Haskell s type system Currying Defining types Value constructors Algebraic data
More informationEncapsulation. Mason Vail Boise State University Computer Science
Encapsulation Mason Vail Boise State University Computer Science Pillars of Object-Oriented Programming Encapsulation Inheritance Polymorphism Abstraction (sometimes) Object Identity Data (variables) make
More informationCSC 1052 Algorithms & Data Structures II: Linked Lists Revisited
CSC 1052 Algorithms & Data Structures II: Linked Lists Revisited Professor Henry Carter Spring 2018 Recap Recursion involves defining a solution based on smaller versions of the same solution Three components:
More informationName:... ID:... class A { public A() { System.out.println( "The default constructor of A is invoked"); } }
KSU/CCIS/CS CSC 113 Final exam - Fall 12-13 Time allowed: 3:00 Name:... ID:... EXECRICE 1 (15 marks) 1.1 Write the output of the following program. Output (6 Marks): class A public A() System.out.println(
More informationAssociate Professor Dr. Raed Ibraheem Hamed
Associate Professor Dr. Raed Ibraheem Hamed University of Human Development, College of Science and Technology Computer Science Department 2015 2016 1 What this Lecture is about: Stack Structure Stack
More informationReadings for This Lecture
Lecture 4 Classes Readings for This Lecture Section 1.4, 1.5 in text Section 3.1 in text Plive activities referenced in the text Please look at lecture summaries online Handouts are short version Presentation
More informationClasses and Objects 3/28/2017. How can multiple methods within a Java class read and write the same variable?
Peer Instruction 8 Classes and Objects How can multiple methods within a Java class read and write the same variable? A. Allow one method to reference a local variable of the other B. Declare a variable
More informationCOMP 250 Winter 2011 Reading: Java background January 5, 2011
Almost all of you have taken COMP 202 or equivalent, so I am assuming that you are familiar with the basic techniques and definitions of Java covered in that course. Those of you who have not taken a COMP
More informationG51PRG: Introduction to Programming Second semester
G51PRG: Introduction to Programming Second semester Lecture 7 Natasha Alechina School of Computer Science & IT nza@cs.nott.ac.uk Previous lecture es interfaces collections hierarchy in Java Lecture 7:
More informationMore on Arrays CS 16: Solving Problems with Computers I Lecture #13
More on Arrays CS 16: Solving Problems with Computers I Lecture #13 Ziad Matni Dept. of Computer Science, UCSB Announcements Homework #12 due today No homework assigned today!! Lab #7 is due on Monday,
More informationCS24 Week 4 Lecture 1
CS24 Week 4 Lecture 1 Kyle Dewey Overview Additional use of const in C++ List ADT Array Lists Linked Lists Additional Use of const We ve seen const already in two positions: What is pointed to is constant
More informationMidterm Exam CS 251, Intermediate Programming March 12, 2014
Midterm Exam CS 251, Intermediate Programming March 12, 2014 Name: NetID: Answer all questions in the space provided. Write clearly and legibly, you will not get credit for illegible or incomprehensible
More informationIntroduction to Programming Using Java (98-388)
Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;
More informationAnatomy of a Method. HW3 is due Today. September 15, Midterm 1. Quick review of last lecture. Encapsulation. Encapsulation
Anatomy of a Method September 15, 2006 HW3 is due Today ComS 207: Programming I (in Java) Iowa State University, FALL 2006 Instructor: Alexander Stoytchev Midterm 1 Next Tuesday Sep 19 @ 6:30 7:45pm. Location:
More informationPart 1 Dr King Book Exercises 1 12 pp
CSc2010 Week 10 Lab Part 1 Dr King Book Exercises 1 12 pp 122-124 1. Suppose that we decide to model a soft-drink can as an object. a) List three significant items that will be part of the state of a soft-drink
More informationAnnouncements for the Class
Lecture 2 Classes Announcements for the Class Readings Section 1.4, 1.5 in text Section 3.1 in text Optional: PLive CD that comes with text References in text Assignment Assignment 1 due next week Due
More informationName CS 110 Practice Midterm Exam (Adapted from the Spring 98 Midterm; last modified 26 April 2016 (fixed 2 typos in 2017))
Name CS 110 Practice Midterm Exam (Adapted from the Spring 98 Midterm; last modified 26 April 2016 (fixed 2 typos in 2017)) Instructions: closed books, closed notes, open minds, 1 hour 15 minute time limit.
More informationAP 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 informationCIT Special final examination
CIT 590-2016 Special final examination Name (please write your official name) PennID Number Note that your PennID number is the 8 digit bold number on your penn card. DO NOT START WRITING (aside from name
More informationDepartment of Networks College of Bardarash Technical Institute DUHOK Polytechnic University Subject: Programming Fundamental by JAVA Course Book
1 Department of Networks College of Bardarash Technical Institute DUHOK Polytechnic University Subject: Programming Fundamental by JAVA Course Book Year 1 Lecturer's name: MSc. Sami Hussein Ismael Academic
More informationProgramming Languages and Techniques (CIS120)
Programming Languages and Techniques (CIS120) Lecture 24 March 18, 2016 The Java ASM What is the value of ans at the end of this program? Counter[] a = { new Counter(), new Counter() ; Counter[] b = {
More informationISY00245 Principles of Programming. Module 7
ISY00245 Principles of Programming Module 7 Module 7 Loops and Arrays Introduction This week we have gone through some of the concepts in your lecture, and will be putting them in to practice (as well
More informationCSC 240 Computer Science III Spring 2018 Midterm Exam. Name
CSC 240 Computer Science III Spring 2018 Midterm Exam Name Page Points Score 2 9 4-6 53 7-10 38 Total 100 1 P age 1. Tracing programs (1 point each value): For each snippet of Java code on the left, write
More informationCS 302 Week 9. Jim Williams
CS 302 Week 9 Jim Williams This Week P2 Milestone 3 Lab: Instantiating Classes Lecture: Wrapper Classes More Objects (Instances) and Classes Next Week: Spring Break Will this work? Double d = new Double(10);
More informationReal-Time Operating Systems M. Course Syllabus, Spring 2013
Real-Time Operating Systems M Course Syllabus, Spring 2013 (For all students who passed the 2nd Midterm) NOTE: it is always possible to opt for the complete exam, even if the 2nd Midterm was successful.
More information(More) Fun with Pointers and Linked Lists! CS 16: Solving Problems with Computers I Lecture #17
(More) Fun with Pointers and Linked Lists! CS 16: Solving Problems with Computers I Lecture #17 Ziad Matni Dept. of Computer Science, UCSB Administrative Homework situation: Labs: NO MORE HOMEWORK! J Lab10
More informationA web-based IDE for Java
A web-based IDE for Java Software Engineering Laboratory By: Supervised by: Marcel Bertsch Christian Estler Dr. Martin Nordio Prof. Dr. Bertrand Meyer Student Number: 09-928-896 Content 1 Introduction...3
More information1.00 Introduction to Computers and Engineering Problem Solving. Quiz 1 March 7, 2003
1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 7, 2003 Name: Email Address: TA: Section: You have 90 minutes to complete this exam. For coding questions, you do not need to
More informationCSC 207H Fall L Java Quiz Duration 25 minutes Aids allowed: none
CSC 207H Fall L0101 2011 Java Quiz Duration 25 minutes Aids allowed: none Last Name: Student Number: First Name: (Please fill out the identification section above and read the instructions below.) Good
More informationCSC116: Introduction to Computing - Java
CSC116: Introduction to Computing - Java Course Information Introductions Website Syllabus Computers First Java Program Text Editor Helpful Commands Java Download Intro to CSC116 Instructors Course Instructor:
More informationAlgorithms & Datastructures Laboratory Exercise Sheet 1
Algorithms & Datastructures Laboratory Exercise Sheet 1 Wolfgang Pausch Heiko Studt René Thiemann Tomas Vitvar
More informationcoe318 Lab 1 Introduction to Netbeans and Java
coe318 Lab 1 Week of September 12, 2016 Objectives Lean how to use the Netbeans Integrated Development Environment (IDE). Learn how to generate and write formatted API documentation. Add a constructor,
More informationCSCI 136 Programming Exam #2 Fundamentals of Computer Science II Spring 2012
CSCI 136 Programming Exam #2 Fundamentals of Computer Science II Spring 2012 This part of the exam is like a mini- programming assignment. You will create a program, compile it, and debug it as necessary.
More informationExercise 12 Initialization December 16, 2016
Concepts of Object-Oriented Programming AS 2016 Exercise 12 Initialization December 16, 2016 Task 1 Consider a Java class Vector, representing a 2 dimensional vector: public class Vector { public Number!
More informationCS 209 Sec. 52 Spring, 2006 Lab 5: Classes Instructor: J.G. Neal
CS 209 Sec. 52 Spring, 2006 Lab 5: Classes Instructor: J.G. Neal Objectives. To gain experience with: 1. The definition and use of a class to represent a real-world type of entity (an employee). 2. Adding
More informationObject Oriented Programming. Java-Lecture 1
Object Oriented Programming Java-Lecture 1 Standard output System.out is known as the standard output object Methods to display text onto the standard output System.out.print prints text onto the screen
More informationRelease Date:!4/12/1434 H (Wed 9/10/2013) Due Date:!! 18/12/1434 H (Wed 23/10/2013)
King Saud University College of Computer & Information Sciences Computer Science Department CSC 111 sections 31209, 31212 Homework 2 Release Date:!4/12/1434 H (Wed 9/10/2013) Due Date:!! 18/12/1434 H (Wed
More informationCS 101 Exam 2 Spring Id Name
CS 101 Exam 2 Spring 2005 Email Id Name This exam is open text book and closed notes. Different questions have different points associated with them. Because your goal is to maximize your number of points,
More informationNo Aids Allowed. Do not turn this page until you have received the signal to start.
CSC 148H Midterm Fall 2007 St. George Campus Duration 50 minutes Student Number: Family Name: Given Name: No Aids Allowed. Do not turn this page until you have received the signal to start. # 1: /10 #
More informationCS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011
CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011 What is your name?: This test has the following sections: I. True/False... 60 points; (30 questions, 2 points each) II.
More informationCentral Washington University Department of Computer Science Course Syllabus
Central Washington University Department of Computer Science Course Syllabus CS 110: Programming Fundamentals I December 27, 2015 1 Course Information Course Information Lecture: Mo,Tu,We: 10:00AM - 10:50AM,
More informationCOMPUTER SCIENCE A SECTION II
COMPUTER SCIENCE A SECTION II Time 1 hour and 4 minutes Number of questions 4 Percent of total score 0 Directions: SHOW ALL YOUR WORK. REMEMBER THAT PROGRAM SEGMENTS ARE TO BE WRITTEN IN JAVA. Notes: Assume
More informationCSC116: Introduction to Computing - Java
CSC116: Introduction to Computing - Java Intro to CSC116 Course Information Introductions Website Syllabus Computers First Java Program Text Editor Helpful Commands Java Download Course Instructor: Instructors
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 informationCS445 Week 9: Lecture
CS445 Week 9: Lecture Objectives: To discuss the solution of the midterm and answer any doubts about grading issues. Also, during the discussion, refresh the topics from the first part of the course. Reading
More informationPrelim 1 Solutions. CS 2110, March 10, 2015, 5:30 PM Total Question True False. Loop Invariants Max Score Grader
Prelim 1 Solutions CS 2110, March 10, 2015, 5:30 PM 1 2 3 4 5 Total Question True False Short Answer Recursion Object Oriented Loop Invariants Max 20 15 20 25 20 100 Score Grader The exam is closed book
More informationAl Imam Mohammad Ibn Saud Islamic University College of Computer and Information Sciences Computer Science Department
Al Imam Mohammad Ibn Saud Islamic University College of Computer and Information Sciences Computer Science Department Privileges: Course Title: Computer Programming 1 Course Code: CS140 Course Instructors:
More informationCITS1001 week 4 Grouping objects
CITS1001 week 4 Grouping objects Arran Stewart March 20, 2018 1 / 31 Overview In this lecture, we look at how can group objects together into collections. Main concepts: The ArrayList collection Processing
More informationMIDTERM EXAM THURSDAY MARCH
Week 6 Assignments: Program 2: is being graded Program 3: available soon and due before 10pm on Thursday 3/14 Homework 5: available soon and due before 10pm on Monday 3/4 X-Team Exercise #2: due before
More informationCOMP-202: Foundations of Programming. Lecture 26: Review; Wrap-Up Jackie Cheung, Winter 2016
COMP-202: Foundations of Programming Lecture 26: Review; Wrap-Up Jackie Cheung, Winter 2016 Announcements Final is scheduled for Apr 21, 2pm 5pm GYM FIELD HOUSE Rows 1-21 Please submit course evaluations!
More informationLecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue
Lecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue General Loops in Java Look at other loop constructions Very common while loop: do a loop a fixed number of times (MAX in the example) int
More informationSAMPLE EXAM Exam 2 Computer Programming 230 Dr. St. John Lehman College City University of New York Thursday, 5 November 2009
SAMPLE EXAM Exam 2 Computer Programming 230 Dr. St. John Lehman College City University of New York Thursday, 5 November 2009 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your grade
More informationSchool of Informatics, University of Edinburgh
CS1Ah Lecture Note 17 Case Study: Using Arrays This note has three main aims: 1. To illustrate the use of arrays introduced in Lecture Note 16, on a slightly larger example. 2. To introduce the idea of
More informationLecture 10: Interfaces
Accelerating Information Technology Innovation http://aiti.mit.edu Lecture 10: Interfaces AITI Nigeria Summer 2012 University of Lagos. Interfaces An interface in Java is special type A class with only
More informationProgramming Fundamentals II (C++ II) Final Exam June 17 th, Sun, 2007
Programming Fundamentals II (C++ II) Final Exam June 17 th, Sun, 2007 NAME:...Number:... Question 1 Define class section that has the following attributes: coursename, coursenumber as integer, credithours
More informationCS61B, Summer 2002 Exam #1 Barath Raghavan
CS61B, Summer 2002 Exam #1 Barath Raghavan Weight: 20 points Directions: Do not discuss this exam with those who have not taken it. You have two hours to complete this exam. The exam is open book, open
More informationCSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationCSC207 Quiz 1 Solutions Monday 6 February 2017, 12:15 PM. 1. (A) (B) (C) (D) (E) 7. Nothing, does not run true false
CSC207 Quiz 1 Solutions Monday 6 February 2017, 12:15 PM Student Number: Circle the lecture section in which you are enrolled L0101 (WF12) L0201 (WF1) L5101 (W6) Please indicate your answers in the table
More informationExam 2. CSC 121 MW Class. Lecturer: Howard Rosenthal. April 25, 2016
Your Name: Exam 2. CSC 121 MW Class Lecturer: Howard Rosenthal April 25, 2016 The following questions (or parts of questions) in numbers 1-7 are all worth 3 points each. 1. Answer the following as true
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 informationComputer Sciences 302 Exam 2 Information & Sample Exam
Computer Sciences 302 Exam 2 Information & Sample Exam Below you ll find information about the second midterm exam and sample exam questions. This sample is intended to be similar in length and difficulty
More informationCSC 210 COMPUTER SCIENCE II
CSC 210 COMPUTER SCIENCE II PRESENTED AND APPROVED: NOVEMBER 2, 2012 EFFECTIVE: FALL 2013-14 Prefix & Number CSC 210 Course : Computer Science II Purpose of this submission: New Course New Change/Updated
More informationObject Oriented Design: Identifying Objects
Object Oriented Design: Identifying Objects Review What did we do in the last lab? What did you learn? What classes did we use? What objects did we use? What is the difference between a class and an object?
More informationCOMP 524 Spring 2018 Midterm Thursday, March 1
Name PID COMP 524 Spring 2018 Midterm Thursday, March 1 This exam is open note, open book and open computer. It is not open people. You are to submit this exam through gradescope. Resubmissions have been
More informationCS 455 Midterm Exam 1 Fall 2010 [Bono] Sept. 29, 2010
Name: USC loginid (e.g., ttrojan): CS 455 Midterm Exam 1 Fall 2010 [Bono] Sept. 29, 2010 There are 4 problems on the exam, with 55 points total available. There are 7 pages to the exam, including this
More informationKing Saud University Collage of Computer and Information Siences Lab Exam: Monday 15/12/2014
+ display( ):void + tax( ):double - make : String - VIN : String - price : double {Interface Features Car + Car (c: Car) + Car(m: String, v: String, p: double) + display():void * 1 # name : String # location
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 informationYork University AS/AK/ITEC INTRODUCTION TO DATA STRUCTURES. Midterm Sample I. Examiner: S. Chen Duration: One Hour and 30 Minutes
York University AS/AK/ITEC 2620 3.0 INTRODUCTION TO DATA STRUCTURES Midterm Sample I Examiner: S. Chen Duration: One Hour and 30 Minutes This exam is closed textbook(s) and closed notes. Use of any electronic
More informationTicket Machine Project(s)
Ticket Machine Project(s) Understanding the basic contents of classes Produced by: Dr. Siobhán Drohan (based on Chapter 2, Objects First with Java - A Practical Introduction using BlueJ, David J. Barnes,
More informationCSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationCSCI 102L - Data Structures Midterm Exam #1 Fall 2011
Print Your Name: Page 1 of 8 Signature: Aludra Loginname: CSCI 102L - Data Structures Midterm Exam #1 Fall 2011 (10:00am - 11:12am, Wednesday, October 5) Instructor: Bill Cheng Problems Problem #1 (24
More informationInformatik II. Andreas Bärtschi, Andreea Ciuprina, Felix Friedrich, Patrick Gruntz, Hermann Lehner, Max Rossmannek, Chris Wendler FS 2018
1 Informatik II Übung 4 Andreas Bärtschi, Andreea Ciuprina, Felix Friedrich, Patrick Gruntz, Hermann Lehner, Max Rossmannek, Chris Wendler FS 2018 Program Today 2 1 Feedback of last exercise 2 Repetition
More informationTopic 7: Algebraic Data Types
Topic 7: Algebraic Data Types 1 Recommended Exercises and Readings From Haskell: The craft of functional programming (3 rd Ed.) Exercises: 5.5, 5.7, 5.8, 5.10, 5.11, 5.12, 5.14 14.4, 14.5, 14.6 14.9, 14.11,
More informationObjects and Iterators
Objects and Iterators Can We Have Data Structures With Generic Types? What s in a Bag? All our implementations of collections so far allowed for one data type for the entire collection To accommodate a
More informationWeb-CAT submission URL: CAT.woa/wa/assignments/eclipse
King Saud University College of Computer & Information Science CSC111 Lab10 Arrays II All Sections ------------------------------------------------------------------- Instructions Web-CAT submission URL:
More informationEncapsulation. Administrative Stuff. September 12, Writing Classes. Quick review of last lecture. Classes. Classes and Objects
Administrative Stuff September 12, 2007 HW3 is due on Friday No new HW will be out this week Next Tuesday we will have Midterm 1: Sep 18 @ 6:30 7:45pm. Location: Curtiss Hall 127 (classroom) On Monday
More information