Jawwal System (Linked Lists)
|
|
- Angela Quinn
- 5 years ago
- Views:
Transcription
1 Islamic University of Gaza Faculty of Engineering Computer Engineering Department Data Structures & Algorithms (ECOM 3312) Objective Assignment 1 Jawwal System (Linked Lists) Learn how to implement the functionality of linked lists. Program Description Guess what? Jawwal has lowered the calling rates for students to (0.12 NIS) for one minute; so this means more saving for you! To keep students happy, accounts are now postpaid. Students start with a balance of 50 NIS, and each time they pay their bill, they get another 50 NIS to use. Additionally, now the system can save unlimited records of outbound calls. Therefore, if a user calls 60 friends during a billing period, all calls will be saved. Of course, once the bill is paid, the call history is reset for the next month. For this program, you will implement a basic simulation of this Jawwal system. Students will make accounts, make calls, pay their bills, and more. You will create one linked-list, which will be used to manage all of the accounts (each node of the linked list will be an object of type Student). For the outbound call history, there is now unlimited call history saved during each bill period. How will you implement this? Each Student object will also have another reference, which will refer to a linked list of Call object. There Call objects are the actual outbound calls that were made. Each call object simply stores the number that was called, the duration, and the address of the next node in the list of calls. Please see the UML diagrams at the end of this write-up for more explanation. You will use File I/O to read commands from a file and then print the output to a file. Example commands are ADDACCOUNT, MAKECALL, PAYBILL, etc. then depending on the command, you will either add a new account, process a phone call, search for a student account, and more. But instead of printing to the console window (screen), you will print to an output file. *Sample input and output files have been provided for you.
2 The commands to be implemented are as follows: 1. ADDACCOUNT This command will be followed by the following information in the input file: a student ID (a non-negative integer), first name, last name, and a String representing the new phone number (ex: ). When you process this command, you should make a new Student object, and then you should scan, from the file, the student ID, the first and last name of the student, and the new phone number. *Note: all new accounts receive a free initial balance of 50 NIS for subscribing to the service. Finally, you must insert this object into the linked-list based on the sorted order of the student ID number. Example: If the following line was in the input file: ADDACCOUNT Mohammed Ahmed This would be the output: Command: ADDACCOUNT Name: Mohammed Ahmed Student ID: Phone Number: Balance: 50NIS 2. MAKECALL This command will be followed by a student ID, a non-negative integer and number of call minutes, a non-negative integer value, and a String representing the number that was called. If the record is found in the JawwalAccounts linkedlist and if that record has enough balance for the desired call minutes, it sould be executed and a message printed to output file (see sample output file). The call rate is fixed at the rate of 0.12 NIS/minute. If the ID of the calling student is not found in the linked list OR if the student does not have enough balance for one minute, an error message should be printed. Additionally, if the student has some balance, but not enough to complete the call, the call should be processed, but the length of the call will be limited based on the balance of the customer. A message should be printed stating that the call was terminated due to insufficient balance. (see sample output file). Each Student object have a reference to a Linked Lists Call objects, Calls. Each Call object will store the information of one call (the number and duration). After a call is successfully made, an Call object should be created and then inserted into the linked-list of Call objects. You should insert into the END of this list. To do this, you
3 can either traverse or you can use a tail reference pointer. Because the Call objects are stored in a linked list, this means you can store an unlimited number of calls in the history. Also, once a student pays his/her bill, the linked-list must be reset (make it empty), so it can start recording the history of calls for the new billing period. (see input/output examples for more details). 3. PAYBILL record is found in the JawwalAccounts linked-list, the bill will be paid, the balance will be reset to 50NIS, and the call history will be reset. If the ID is not found, an error message should be printed instead. (see input/output examples for more details). 4. PAYBILLS This command will have nothing else on the line. ALL accounts that have a balance less than the Call rate (0.12 NIS) will get paid. The balance will be reset to 50NIS, and the call history will be reset. 5. DELETEACCOUNT record is found in JawwalAccounts linked-list, it should be deleted and a message printed to output file. If the ID is not found, as error message should be printed instead. (see sample output file). 6. SEARCH record is found, it is printed to the file. If it is not found, an error message should be printed instead. 7. DISPLAYDETAILS This command will be followed by an integer value, the student ID, and it will display all calls details (called number will duration). If the student ID is not found in the linked list, an error message should be printed instead (see sample output file). 8. QUIT This command will not have any other information after it (in the input file). When you scan this command, the program should print a message to the file and then quit. For this program, you will create five classes: Student.java: this class will be used to create objects of type Student. Each Student object will store all the needed information for one student in a specific account (ID, first name, last name, mobile number, etc.). These Student objects will be added (and deleted) from linked list based on the commands from the input file.
4 Call.java: this call will be used to create objects of type Call. Each Call object will store the information for one call (number and duration). These Call objects will be added to the linked list, Calls. Calls.java: this class is the very basic Linked List, which is used to store nodes of type Call. Each Students object has a reference variable, which refers to an object of type Calls. This is a linked list of Call objects. JawwalAccounts.java: this is the main Linked List class! You will use this class to make one object of type JawwalAccounts. Again, this is the actual linked-list class. This is the class that will have the head and will include all the methods that are used to operate on a linked-list of Student objects. Jawwal.java: this is the class that will contain main method.
5 Implementation: For this program, you will create four classes (UML diagram shown below) and the main: Student.java private int ID; private String firstname; private String lastname; private String phonenumber; private double balance; private Calls calls; private int numcalled; private String[] textednumbers; private int numtexted; private static int numstudents = 0; private Student next; Call.java private String number; private int callduration; private Call next; Call() // one or more constructors This is the class for the nodes of the Calls linked list Each Call object is one node of this list Student() // one or more constructors This is the class for the nodes of the JawwalAccounts linked list Each Student object is one node of this list JawwalAccounts.java Calls.java private Student head; JawwalAccounts() // one or more constructor All necessary methods for linked-list operations This is the main linked list class This linked list will store objects of type Student Each Student object is one node of this list private Call head; private Call tail; Calls() // one or more constructor All necessary methods for linked-list operations This is the 2 nd linked list class This linked list will store objects of type Call
King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department
King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department CPCS204, 3 rd Term 2014 (Summer) Program 2: FCIT Mobily (Linked Lists) Assigned: Wednesday, June 18
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 CPCS204, 2 nd Term 2014 Program 5: FCITbook Assigned: Thursday, May 1 st, 2014 Due: Thursday, May 15
More informationProject#1: Grade Book
Project#1: Grade Book Objective Making Classes and Objects from these Classes. Also, practice making an array of objects and manipulating/using the data inside said array. Program Description This program
More informationComputer Programming: C++
The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2003 Muath i.alnabris Computer Programming: C++ Experiment #7 Arrays Part II Passing Array to a Function
More informationData Structures and Algorithms
Data Structures and Algorithms First Semester 2017/2018 Linked Lists Eng. Anis Nazer Linked List ADT Is a list of nodes Each node has: data (can be any thing, int, char, Person, Point, day,...) link to
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 CPCS204, 2 nd Term 2014 Program 2: KAU Grade Book (Linked Lists) Assigned: Thursday, February 20 th,
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 CPCS204, 3 rd Term 2014 (Summer) Program1: FCIT Samba Bank Assigned: Wednesday June 11 th, 2014 Due:
More informationComputer Programming: C++
The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2003 Muath i.alnabris Computer Programming: C++ Experiment #3 Loops Part I Contents Introduction For-Loop
More informationCMSC 341 Lecture 7 Lists
CMSC 341 Lecture 7 Lists Today s Topics Linked Lists vs Arrays Nodes Using Linked Lists Supporting Actors (member variables) Overview Creation Traversal Deletion UMBC CMSC 341 Lists 2 Linked Lists vs Arrays
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 CPCS204, 1 st Term 2014 Program 2: FCIT Baqalah Assigned: Thursday, September 26 th, 2013 Due: Wednesday,
More informationB-Trees. Based on materials by D. Frey and T. Anastasio
B-Trees Based on materials by D. Frey and T. Anastasio 1 Large Trees n Tailored toward applications where tree doesn t fit in memory q operations much faster than disk accesses q want to limit levels of
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 CPCS204, 1 st Term 2014 Program 1: FCIT Baqalah Assigned: Monday, February 10 th, 2014 Due: Thursday,
More informationComputer Programming: C++
The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2003 Muath i.alnabris Computer Programming: C++ Experiment #4 Loops Part II Contents Loop Control Statement
More informationReading Input from Text File
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Lab 5 Reading Input from Text File Eng. Mohammed Alokshiya November 2, 2014 The simplest
More informationCS32 Discussion Sec.on 1B Week 2. TA: Zhou Ren
CS32 Discussion Sec.on 1B Week 2 TA: Zhou Ren Agenda Copy Constructor Assignment Operator Overloading Linked Lists Copy Constructors - Motivation class School { public: }; School(const string &name); string
More informationArrays. Eng. Mohammed Abdualal
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Created by Eng: Mohammed Alokshiya Modified by Eng: Mohammed Abdualal Lab 9 Arrays
More informationLinked Lists. College of Computing & Information Technology King Abdulaziz University. CPCS-204 Data Structures I
College of Computing & Information Technology King Abdulaziz University CPCS-204 Data Structures I What are they? Abstraction of a list: i.e. a sequence of nodes in which each node is linked to the node
More informationProgramming Paradigms Written Exam (6 CPs)
Programming Paradigms Written Exam (6 CPs) 31.01.2018 First name Student number Last name Signature Instructions for Students Write your name and student number on the exam sheet and on every solution
More informationCSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am
CSE 143 Final Exam Part 1 - August 18, 2011, 9:40 am Name Student ID # Section TA Name The exam is closed book, closed notes, closed devices, except that you may have a 5x8 card with handwritten notes
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms. Final Examination
University of Waterloo Department of Electrical and Computer Engineering ECE 250 Data Structures and Algorithms Instructor: Douglas Wilhelm Harder Time: 2.5 hours Aides: none 14 pages Final Examination
More informationLinked List using a Sentinel
Linked List using a Sentinel Linked List.h / Linked List.h Using a sentinel for search Created by Enoch Hwang on 2/1/10. Copyright 2010 La Sierra University. All rights reserved. / #include
More informationComputer Programming, I. Laboratory Manual. Final Exam Solution
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 Final Exam Solution
More informationData Structures & Algorithms
A 1. What are the basic components of a linked list? A. Head and tail are the only important components B. Data members for the information to be stored and a link to the next item C. Generic class because
More informationBuilding a social network
Objects and classes Building a social network Suppose you're in the year 2004 and had this great idea... of a website where people could spend countless hours uploading personal information, writing messages
More informationECE 250 Data Structures and Algorithms MID-TERM EXAMINATION B /13:30-14:50 MC-4021/RCH-211
ECE 250 Data Structures and Algorithms MID-TERM EXAMINATION B 2011-02-15/13:30-14:50 MC-4021/RCH-211 Instructions: There are 63 marks. It will be marked out of 55. No aides. Turn off all electronic media
More informationEXAMINATION FOR THE DIPLOMA IN INFORMATION TECHNOLOGY; YEAR 2
FACULTY OF SCIENCE AND TECHNOLOGY EXAMINATION FOR THE DIPLOMA IN INFORMATION TECHNOLOGY; YEAR 2 SAMPLE QUESTION Question 1 A class called TV is required by a programmer who is writing software for a retail
More informationDo not write in this area TOTAL. Maximum possible points: 75
Name: Student ID: Instructor: Borja Sotomayor Do not write in this area 1 2 3 4 5 6 7 TOTAL Maximum possible points: 75 This homework assignment is divided into two parts: one related to the fundamental
More informationObject Oriented Design
Object Oriented Design Chapter 12 continue 12.6 Case Study: Payroll System Using Polymorphism This section reexamines the CommissionEmployee- BasePlusCommissionEmployee hierarchy that we explored throughout
More informationLesson Plan. Subject: OBJECT ORIENTED PROGRAMMING USING C++ :15 weeks (From January, 2018 to April,2018)
Lesson Plan Name of the Faculty Discipline Semester :Mrs. Reena Rani : Computer Engineering : IV Subject: OBJECT ORIENTED PROGRAMMING USING C++ Lesson Plan Duration :15 weeks (From January, 2018 to April,2018)
More informationComputer Engineering 1 (1E3)
Faculty of Engineering, Mathematics and Science School of Computer Science & Statistics Engineering Trinity Term 2017 Junior Freshman Examinations Computer Engineering 1 (1E3) DD MMM YYYY Venue 14.00 16.00
More informationAP Programming - Chapter 20 Lecture page 1 of 17
page 1 of 17 Advanced Data Structures Introduction: The main disadvantage with binary search is that it requires that the array remain sorted. Keeping an array sorted requires an insertion every time an
More informationExam Duration: 2hrs and 30min Software Design
Exam Duration: 2hrs and 30min. 433-254 Software Design Section A Multiple Choice (This sample paper has less questions than the exam paper The exam paper will have 25 Multiple Choice questions.) 1. Which
More informationCall The Project Dynamic-Memory
1 2 2 Call The Project Dynamic-Memory 4 4 Copy-Paste Main # include "Utilities.hpp" int main(int argc, char * argv[]) { short int *PtrNo; (*PtrNo) = 5; printf ("(*PtrNo) = %d\n", (*PtrNo)); } getchar();
More informationIntroduction to Computing II (ITI 1121) FINAL EXAMINATION
Université d Ottawa Faculté de génie École de science informatique et de génie électrique University of Ottawa Faculty of Engineering School of Electrical Engineering and Computer Science Identification
More informationCPSC 35 Midterm Exam
CPSC 35 Midterm Exam Fall 2007 10:30-11:20am, Wednesday 7 November Closed book exam NAME: Problem Max Obtained 1 15 2 20 3 20 4 20 5 25 Total 100 1 15 points Problem 1: For each of the following three
More informationBEng (Hons) Telecommunications. Examinations for 2016 / Semester 2
BEng (Hons) Telecommunications Cohort: BTEL/15/FT Examinations for 2016 / Semester 2 Resit Examination for BTEL/12/FT & BTEL/14/FT MODULE: Programming for Engineers MODULE CODE: PROG1114C Duration: 3 Hours
More informationJava. Programming: Chapter Objectives. Why Is Repetition Needed? Chapter 5: Control Structures II. Program Design Including Data Structures
Chapter 5: Control Structures II Java Programming: Program Design Including Data Structures Chapter Objectives Learn about repetition (looping) control structures Explore how to construct and use count-controlled,
More informationCOMP 103 Introduction to Data Structures and Algorithms
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:..................... EXAMINATIONS 2005 END-YEAR COMP 103 Introduction to Data
More informationOperating Systems Lab
Operating Systems Lab Islamic University Gaza Engineering Faculty Department of Computer Engineering Fall 2012 ECOM 4010: Operating Systems Lab Eng: Ahmed M. Ayash Lab # 3 Fork() in C and C++ programming
More informationComp Intermediate Programming EXAM #1 February 16, 2004 Rice University - Instructors: Cox & Nguyen
Instructions 1. This exam is conducted under the Rice Honor Code. It is a closed-notes, closed-book exam. 2. Fill in your name on every page of the exam. 3. If you forget the name of a Java class or method,
More information3/1/2016 Copyrights reserved 1
1 2 How to create a fee term? 3 Go to Fees dropdown menu and click on Fee Terms How to create a fee term? 4 Now the page will redirected to fee term page as shown below. How to create a fee term? 5 Click
More informationDesigning Classes. Appendix D. Slides by Steve Armstrong LeTourneau University Longview, TX 2007, Prentice Hall
Designing Classes Appendix D Slides by Steve Armstrong LeTourneau University Longview, TX 2007, Prentice Hall Chapter Contents Encapsulation Specifying Methods Java Interfaces Writing an Interface Implementing
More informationMULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR
STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR FIFTH SEMESTER FINAL EXAMINATION, 2014/2015 SESSION PSD2023 ALGORITHM & DATA STRUCTURE DSEW-E-F-2/13 25 MAY 2015 9.00 AM
More informationIntroduction To C#.NET
Introduction To C#.NET Microsoft.Net was formerly known as Next Generation Windows Services(NGWS).It is a completely new platform for developing the next generation of windows/web applications. However
More informationObject Oriented Programming
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Lab 11 Object Oriented Programming Eng. Mohammed Alokshiya December 16, 2014 Object-oriented
More informationImplementation. Learn how to implement the List interface Understand the efficiency trade-offs between the ArrayList and LinkedList implementations
Readings List Implementations Chapter 20.2 Objectives Learn how to implement the List interface Understand the efficiency trade-offs between the ArrayList and LinkedList implementations Additional references:
More informationEXAM Computer Science 1 Part 1
Maastricht University Faculty of Humanities and Science Department of Knowledge Engineering EXAM Computer Science 1 Part 1 Block 1.1: Computer Science 1 Code: KEN1120 Examiner: Kurt Driessens Date: Januari
More informationLaboratorio di Algoritmi e Strutture Dati
Laboratorio di Algoritmi e Strutture Dati Guido Fiorino guido.fiorino@unimib.it aa 2013-2014 2 Linked lists (of int) We focus on linked lists for integers; let us start with a class that defines a node
More informationComputer Programming : C++
The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2003 Muath i.alnabris Computer Programming : C++ Experiment #1 Basics Contents Structure of a program
More informationStudent WebAdvisor Training Manual
Student WebAdvisor Training Manual Contents Logging into WebAdvisor..2 Registering for a Class Section..4 Paying on My Account. 9 Dropping a Class Section 12 1 Logging into WebAdvisor STEPS 1. Click the
More informationConstant Member Functions
Constant Member Functions Does not modify its calling object Declared with keyword const When const appears in the parameter list, e.g., int setnum (const int num) the function is prevented from modifying
More informationECE 242. Data Structures
ECE 242 Data Structures Lecture 21 Binary Search Trees Overview Problem: How do I represent data so that no data value is present more than once? Sets: three different implementations Ordered List Binary
More informationEng. Mohammed S. Abdualal
Islamic University of Gaza Faculty of Engineering Computer Engineering Dept. Computer Programming Lab (ECOM 2114) Created by Eng: Mohammed Alokshiya Modified by Eng: Mohammed Abdualal Lab 3 Selections
More informationProcess Document Viewing Customer Accounts
Date Modified 6/17/2008 Concept The Student Financials Customer Accounts page provides access to financial and scholastic data about a student. Charges, Payments, Anticipated Financial Aid, Payment Plan,
More informationSpring 2008 Data Structures (CS301) LAB
Spring 2008 Data Structures (CS301) LAB Objectives The objectives of this LAB are, o Enabling students to implement Singly Linked List practically using c++ and adding more functionality in it. o Enabling
More informationFaculty of Engineering Computer Engineering Department Islamic University of Gaza C++ Programming Language Lab # 6 Functions
Faculty of Engineering Computer Engineering Department Islamic University of Gaza 2013 C++ Programming Language Lab # 6 Functions C++ Programming Language Lab # 6 Functions Objective: To be familiar with
More informationData Structures (CS301) LAB
Data Structures (CS301) LAB Objectives The objectives of this LAB are, o Enabling students to implement Doubly Linked List practically using c++ and adding more functionality in it. Introduction to Singly
More informationModule Contact: Dr Gavin Cawley, CMP Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2017-18 PROGRAMMING 1 CMP-4008Y Time allowed: 2 hours Answer FOUR questions. All questions carry equal weight. Notes are
More informationCSCI 136 Data Structures & Advanced Programming. Lecture 12 Fall 2018 Profs Bill & Jon
CSCI 136 Data Structures & Advanced Programming Lecture 12 Fall 2018 Profs Bill & Jon Last Time Assertions SLL Improvements Tail pointers Circularly Linked Lists Doubly Linked Lists Practice with recursion
More informationexamines every node of a list until a matching node is found, or until all nodes have been examined and no match is found.
A examines every node of a list until a matching node is found, or until all nodes have been examined and no match is found. For very long lists that are frequently searched, this can take a large amount
More informationTest 1 SOLUTIONS. June 10, Answer each question in the space provided or on the back of a page with an indication of where to find the answer.
Test 1 SOLUTIONS June 10, 2010 Total marks: 34 Name: Student #: Answer each question in the space provided or on the back of a page with an indication of where to find the answer. There are 4 questions
More informationObject Oriented Programming (II)
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Created by Eng: Mohammed Alokshiya Modified by Eng: Mohammed Abdualal Lab 11 Object
More informationThis test is OPEN Textbook and CLOSED notes. The use of computing and/or communicating devices is NOT permitted.
University of Toronto Faculty of Applied Science and Engineering ECE 244F PROGRAMMING FUNDAMENTALS Fall 2013 Midterm Test Examiners: T.S. Abdelrahman, V. Betz, M. Stumm and H. Timorabadi Duration: 110
More informationHomework 3 Grade Database Management Due Date
Homework 3 Grade Database Management Due Date Project Statement This assignment is meant to grant you further C experience inside a full Linux environment. You will be designing software that creates a
More informationLab Session # 3 Conditional Statements. ALQUDS University Department of Computer Engineering
2013/2014 Programming Fundamentals for Engineers Lab Lab Session # 3 Conditional Statements ALQUDS University Department of Computer Engineering Objective: Our objective for today s lab session is to introduce
More informationProgramming II (CS300)
1 Programming II (CS300) Chapter 07: Linked Lists MOUNA KACEM mouna@cs.wisc.edu Spring 2019 Linked Lists 2 Introduction Linked List Abstract Data Type SinglyLinkedList ArrayList Keep in Mind Introduction:
More informationLCA Maths Department
Name: LCA Maths Department Unit 9 Foundation Check-in test 1 Calculator Q1. GH. Write down the coordinates of the points G and H, and the coordinates of the midpoint of Q2. On the grid, mark with a cross
More information8. Binary Search Tree
8 Binary Search Tree Searching Basic Search Sequential Search : Unordered Lists Binary Search : Ordered Lists Tree Search Binary Search Tree Balanced Search Trees (Skipped) Sequential Search int Seq-Search
More informationCS 61B Summer 2005 (Porter) Midterm 2 July 21, SOLUTIONS. Do not open until told to begin
CS 61B Summer 2005 (Porter) Midterm 2 July 21, 2005 - SOLUTIONS Do not open until told to begin This exam is CLOSED BOOK, but you may use 1 letter-sized page of notes that you have created. Problem 0:
More informationCS 216 Exam 1 Fall SOLUTION
CS 216 Exam 1 Fall 2004 - SOLUTION Name: Lab Section: Email Address: Student ID # This exam is closed note, closed book. You will have an hour and fifty minutes total to complete the exam. You may NOT
More informationUnit 3. C++ Language II. Takayuki Dan Kimura. Unbounded Queue. Extension of Queue Data Type. Static Members. Base and Derived Classes (Inheritance)
Unit 3 C++ Language II Object Oriented Programming in C++ Takayuki Dan Kimura Unbounded Queue Extension of Queue Data Type Static Members Base and Derived Classes (Inheritance) Virtual Functions Polymorphism
More informationFinal Exam 90 minutes Eng. Mohammed S. F. Abdual Al
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2124) Final Exam 90 minutes Eng. Mohammed S. F. Abdual Al Student name Student ID Please
More informationOOP++ CSE219, Computer Science III Stony Brook University
OOP++ CSE219, Computer Science III Stony Brook University http://www.cs.stonybrook.edu/~cse219 What is memory? A giant array of bytes 0xffffffff Stack Segment How do we assign data to/get data from memory?
More informationLoops. Eng. Mohammed Abdualal. Islamic University of Gaza. Faculty of Engineering. Computer Engineering Department
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Created by Eng: Mohammed Alokshiya Modified by Eng: Mohammed Abdualal Lab 6 Loops
More informationPreview 11/1/2017. Constant Objects and Member Functions. Constant Objects and Member Functions. Constant Objects and Member Functions
Preview Constant Objects and Constant Functions Composition: Objects as Members of a Class Friend functions The use of Friend Functions Some objects need to be modifiable and some do not. A programmer
More informationMobile App:IT. Methods & Classes
Mobile App:IT Methods & Classes WHAT IS A METHOD? - A method is a set of code which is referred to by name and can be called (invoked) at any point in a program simply by utilizing the method's name. -
More informationIntermediate STEMSEL Project 7 Combination Lock
Intermediate STEMSEL Project 7 Combination Lock Problem We want to make an electronic lock using our STEMSEL boards. How can we use it to make a combination lock? Background As writer Allan Poe said, everyone
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 informationICOM 4035 Data Structures. Dr. Manuel Rodríguez Martínez Electrical and Computer Engineering Department
ICOM 4035 Data Structures Dr. Manuel Rodríguez Martínez Electrical and Computer Engineering Department Readings Chapter 17 of textbook: Linked Lists ICOM 4035 Dr. Manuel Rodriguez Martinez 2 What is missing?
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 informationEng. Mohammed Abdualal
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Created by Eng: Mohammed Alokshiya Modified by Eng: Mohammed Abdualal Lab 4 Characters
More informationComputer Programming, I. Laboratory Manual. Experiment #5. Strings & Text Files Input
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 #5
More informationDo not turn over this examination paper until instructed to do so. Answer all questions.
IB Computer Science HL Paper 2 - Mock Exam - Dec 2017 (1/8) COMPUTER SCIENCE HIGHER LEVEL PAPER 2 MOCK EXAM 1 hour 20 minutes INSTRUCTIONS TO CANDIDATES Do not turn over this examination paper until instructed
More informationProgramming Assignment 2 ( 100 Points )
Programming Assignment 2 ( 100 Points ) Due: Thursday, October 16 by 11:59pm This assignment has two programs: one a Java application that reads user input from the command line (TwoLargest) and one a
More informationDatabase Lab Lab 6 DML part 3
Islamic University of Gaza Faculty of Engineering Department of Computer Engineering Fall 2011 ECOM 4113: Database System Lab Eng. Ahmed Abumarasa Database Lab Lab 6 DML part 3 Data Manipulation Language:
More informationCSE 142 Wi03 Midterm 2 Sample Solution All Versions Page 1 of 6
CSE 142 Wi03 Midterm 2 Sample Solution All Versions Page 1 of 6 Question 1. (5 points) One of your colleagues is having a terrible time with the following code, which doesn t work properly. /** A simple
More informationCMPT 225. Lecture 6 linked list
CMPT 225 Lecture 6 linked list 1 Last Lecture Class documentation Linked lists and its operations 2 Learning Outcomes At the end of this lecture, a student will be able to: define one of the concrete data
More informationEXAMINATIONS 2005 END-YEAR. COMP 103 Introduction to Data Structures and Algorithms
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I ÎÍÏ V I C T O R I A UNIVERSITY OF WELLINGTON EXAMINATIONS 2005 END-YEAR COMP 103 Introduction to Data Structures and Algorithms Time Allowed:
More informationData Structures and Algorithms
Data Structures and Algorithms Alice E. Fischer Lecture 3 217 Alice E. Fischer Data Structures L3... 1/31 1 Arrays Growing Arrays vectors 2 3 Empty Lists Inserting Data - Unsorted Inserting Data - Sorted
More informationPushing at the back 28/11/2018. Problem. Our linked list class
ECE 150 Fundamentals of Programming Outline 2 In this lesson, we will: Understand how to push a new entry onto the back of the linked list Determine how we can speed this up Understand that the cost is
More informationCSE 143 Final Part 1, August 18, 2011 Sample Solution
Question 1. (16 points) Binary Search Trees. (a) Draw a picture that shows the integer binary search tree that results when the following numbers are inserted into a new, empty binary search tree in the
More informationCOP 3337 Test 3. private int minimumposition(int from) { Part 1: Selection Sort
COP 3337 Test 3 NAME Part 1: Selection Sort The SelectionSorter class implements a selection sort on an array of strings. It is missing the minimumposition() method that returns the index position of the
More informationDIT960 Datastrukturer
DIT960 Datastrukturer suggested solutions for exam 2017-08-17 1. Assume that n is a non-negative integer, that s is an integer set implemented with a hash table and containing at most n elements, that
More informationComp Intermediate Programming EXAM #2 March 30, 2005 Rice University - Instructors: Cox & Nguyen
Instructions 1. This exam is conducted under the Rice Honor Code. It is a open-book exam. 2. Fill in your name on every page of the exam. 3. If you forget the name of a Java class or method, make up a
More informationSelection Statement ( if )
Islamic University Of Gaza Faculty of Engineering Computer Engineering Department Lab 4 Selection Statement ( if ) Eng. Ibraheem Lubbad October 10, 2016 In this lab we will constructs program that allow
More informationProblem 1: Get val soon! (15 marks)
Problem 1: Get val soon! (15 marks) In this problem, we will model a very simple machine. This machine operates on integers. The operation of this machine is described in the next paragraph. This machine
More informationPrelim 2 Solution. CS 2110, April 26, 2016, 7:30 PM
Prelim Solution CS 110, April 6, 016, 7:0 PM 1 5 Total Question True/False Complexity Heaps Trees Graphs Max 10 0 0 0 0 100 Score Grader The exam is closed book and closed notes. Do not begin until instructed.
More informationJAVA COLLECTION FRAMEWORK & SETS
JAVA COLLECTION FRAMEWORK & SETS Ch07.4-5 & Ch10.5 Presentation for use with the textbook 1. Data Structures and Algorithms in Java, 6 th edition, by M. T. Goodrich, R. Tamassia, and M. H. Goldwasser,
More informationCSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid
CSCE 20/220 Data Structures and Algorithms Prof. Amr Goneid Fall 208 / Spring 209 CSCE 20/220 DATA STRUCTURES AND ALGORITHMS Prof. Amr Goneid Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu Office:
More informationl Determine if a number is odd or even l Determine if a number/character is in a range - 1 to 10 (inclusive) - between a and z (inclusive)
Final Exam Exercises Chapters 1-7 + 11 Write C++ code to: l Determine if a number is odd or even CS 2308 Fall 2016 Jill Seaman l Determine if a number/character is in a range - 1 to 10 (inclusive) - between
More information