CS 2604 Minor Project 3 DRAFT Summer 2000

Size: px
Start display at page:

Download "CS 2604 Minor Project 3 DRAFT Summer 2000"

Transcription

1 Simple Hash Table For this project you will implement a simple hash table using closed addressing and a probe function. The hash table will be used here to store structured records, and it should be implemented as a template for reusability (by you on a future project). The hash table must support all the usual functionality, as discussed in class. For this project we will focus primarily on building the initial hash table from a list of records in a file, searching by key value for records in the table, inserting new records to the table, and deleting old records. In order to determine if the hash table organization is correct, you will instrument the insert and search functions to display the probe sequence (indices visited in performing a search). The specific hash function and probe strategy will be specified shortly. You may use the first string hash function from the notes and quadratic probing for now (the sample output given below is based on those choices). You should design your implementation so that changes to the hash function and probe strategy are painless. Be careful about infinite loops when probing. For this project, if the probe sequence returns to the original hash slot you should terminate the probe and let the search operation fail. Note that this means that insertions to the hash table may fail. Your program will first read a file of data records and hash each into the table. After building the initial table your program will read a command file and process the commands as specified below. Data Structures: The primary data structures element of this project is a hash table. Your implementation is under the following specific requirements: You must encapsulate the hash table as a C++ template. The underlying table structure must be a dynamically allocated array. For testing, your hash table should have the ability to display itself to a specified output stream. The records that are stored in the hash table must be implemented using a C++ class. Without exception, data members of classes should be private. If an error occurs during the parsing of the initial data file, there s an error in your code. However, your program should still attempt to recover, by flushing the current input attempting to recover to the beginning of the next record in the file. The same applies for the command file. Initial Data File Description: Your program must read the initial hash table data from a file named HashData.txt use of another input file name will almost certainly result in a score of 0. The first line of the initial data file should be ignored. The second line will contain a text label, ending with a colon, followed by the number of slots the hash table should have. The third line should also be ignored. The remainder of the file will consist of an arbitrary number of records each of the following format: line 1: a string specifying a name line 2: a string specifying a street address line 3: a string specifying a city, state, etc. line 4: a line of delimiters marking the end of the record The strings will be of arbitrary length and a newline character will immediately follow each string. This file will not contain any comment lines. No two records will contain the same name (so name is a primary key). Due: 23:59:59 Wednesday, August 2 Page 1 of 5

2 A sample initial data file follows: Sample initial data file. Hash table size: 17 Asimov, Isaac Robot Way Brooklyn, NY Bradbury, Ray 1 Martian Blvd Burbank, CA Card, Orson Scott 40 Wending Way Delta, UT Clarke, Arthur C Rama Road Colombo, Sri Lanka Clement, Hal 7000 Granite St Gravity, NM Dick, Philip K 8to1 Stochastic Ave Los Angeles, CA Leiber, Fritz Gold Street Lankhmar, Nehwon Niven, Larry 314 Perimeter Place Pasadena, CA Russell, Eric Frank 5 Allamagoosa Place San Francisco, CA Vance, Jack 99 High Castle Road Boulder, CO Command File Description: Your program must read commands from a file named HashCommands.txt use of another input file name will almost certainly result in a score of 0. Lines beginning with a semicolon ( ) character are comments your program will ignore comments. An arbitrary number of comment lines may occur in the command file. Each line of the command file will specify one of the commands described below. Each line consists of a sequence of tokens which will be separated by single tab characters. A newline character will immediately follow the final token on each line. insert <name> <street address> <city> Due: 23:59:59 Wednesday, August 2 Page 2 of 5

3 This will cause a record containing the given data to be inserted to the hash table. For each insert command you must print the probe sequence followed during the insertion. If the insertion fails, print no room. delete <name> This will cause the record containing the given name to be deleted from the hash table, if a matching record occurs there. For each delete command you must print the probe sequence followed during the deletion. If no record matches the given name, print not found. find <name> This causes the hash table to be searched for a record containing the given name. After the search, print the probe sequence that was followed. If no record matches the given name, print not found. dump This causes the hash table to print itself to standard output. This is only for testing purposes the command files actually used by the Curator will NOT specify this command. exit This causes the hash table application to terminate. The input file is guaranteed to end with an exit command. Legend: in the commands above: <name> <street address> <city> You may assume that the command file will conform to the given syntax, so syntactic error checking is not required. A sample command file is shown on the following page. Log File Description: Your program must write its output to a file named HashOut.txt use of another output file name will undoubtedly result in a score of 0. Since your output for this assignment will be graded automatically, you must adhere to the specified format exactly. The first two lines should contain your name, course and project title, followed by separator line, as shown on the following page. The next two lines should list the size of the hash table, and the number of slots filled after it is build from the initial data file, followed again by a separator line as shown below. Remember that your labels must match the sample output exactly. The remainder of the log file should show the specified output for find, insert and delete commands. A separator line should follow the last of these lines. A sample log file is shown on the following page. Due: 23:59:59 Wednesday, August 2 Page 3 of 5

4 Sample command file. Find at hash index: find Bradbury, Ray Find after probing: find Russell, Eric Frank Insert at hash index: insert Willis, Connie 1940 TimeNet Way Boulder, CO Delete a record: delete Clarke, Arthur C Confirm deletion: find Clarke, Arthur C Find record that collided with deleted one: find Russell, Eric Frank Search for nonexistent record: find Hubbard, L Ron insert Clarke, Arthur C Rama Road Colombo, Sri Lanka find Clarke, Arthur C find Niven, Larry dump exit Bill McQuain CS 2604 Hash Table Size: 17 Usage: Finding Bradbury, Ray: 13 Finding Russell, Eric Frank: Inserting Willis, Connie: 16 Deleting Clarke, Arthur C: 5 Finding Clarke, Arthur C: not found Finding Russell, Eric Frank: Finding Hubbard, L Ron: not found Inserting Clarke, Arthur C: 5 Finding Clarke, Arthur C: 5 Finding Niven, Larry: Submitting Your Program: You will submit this assignment to the Curator System (read the Student Guide), and it will be graded automatically. Instructions for submitting, and a description of how the grading is done, are contained in the Student Guide. Note that the automated grading system requires that your program be submitted as a single source file. For this project you should develop your implementation using separate compilation, and then manually concatenate the code into a single.cpp file, being careful to get the order right and remove obsolete #include directives. You will be allowed up to five submissions for this assignment. Use them wisely. Test your program thoroughly before submitting it. If you do not get a perfect score, analyze the problem carefully and test your fix before submitting again. The highest score you achieve will be counted. The submission client can be found at: Due: 23:59:59 Wednesday, August 2 Page 4 of 5

5 Evaluation: Your submitted program will be assigned a score based upon the runtime testing performed by the Curator System. After that, your program may be given a brief evaluation by one of the GTAs, who will consider: whether your implementation makes appropriate use of data, and whether the internal documentation of your code is acceptable. This evaluation will produce a deduction (possibly zero, of course) that will be applied to your runtime testing score to produce your final score for the project. The evaluation, if it is done, will use your submission that achieved the best score. In the event more than one submission meets that criterion, the earliest of those will be evaluated. Programming Standards: While we won t be carefully evaluating your source code on this assignment for programming style, you should still observe good practice. See the Programming Standards page on the course website for specific requirements that should be observed in this course. Pledge: Each of your program submissions must be pledged to conform to the Honor Code requirements for this course. Specifically, you must include the following pledge statement in the header comment for your program: On my honor: - I have not discussed the C++ language code in my program with anyone other than my instructor or the teaching assistants assigned to this course. - I have not used C++ language code obtained from another student, or any other unauthorized source, either modified or unmodified. - If any C++ language code or documentation used in my program was obtained from another source, such as a text book or course notes, that has been clearly noted with a proper citation in the comments of my program. - I have not designed this program in such a way as to defeat or interfere with the normal operation of the Curator System. <Student Name> Failure to include this pledge in a submission is a violation of the Honor Code. Due: 23:59:59 Wednesday, August 2 Page 5 of 5

CS 2604 Minor Project 1 DRAFT Fall 2000

CS 2604 Minor Project 1 DRAFT Fall 2000 RPN Calculator For this project, you will design and implement a simple integer calculator, which interprets reverse Polish notation (RPN) expressions. There is no graphical interface. Calculator input

More information

CS 2604 Minor Project 1 Summer 2000

CS 2604 Minor Project 1 Summer 2000 RPN Calculator For this project, you will design and implement a simple integer calculator, which interprets reverse Polish notation (RPN) expressions. There is no graphical interface. Calculator input

More information

Multiple-Key Indexing

Multiple-Key Indexing Multiple-Key Indexing For this project you provide indexing capabilities for a simple database file. The database will consist of a sequence of logical records, of varying sizes (similar to the initial

More information

CS 2604 Minor Project 3 Movie Recommender System Fall Braveheart Braveheart. The Patriot

CS 2604 Minor Project 3 Movie Recommender System Fall Braveheart Braveheart. The Patriot Description If you have ever visited an e-commerce website such as Amazon.com, you have probably seen a message of the form people who bought this book, also bought these books along with a list of books

More information

CS 1044 Program 6 Summer I dimension ??????

CS 1044 Program 6 Summer I dimension ?????? Managing a simple array: Validating Array Indices Most interesting programs deal with considerable amounts of data, and must store much, or all, of that data on one time. The simplest effective means for

More information

CS 2704 Project 1 Spring 2001

CS 2704 Project 1 Spring 2001 Robot Tank Simulation We've all seen various remote-controlled toys, from miniature racecars to artificial pets. For this project you will implement a simulated robotic tank. The tank will respond to simple

More information

Fundamental Concepts: array of structures, string objects, searching and sorting. Static Inventory Maintenance Program

Fundamental Concepts: array of structures, string objects, searching and sorting. Static Inventory Maintenance Program Fundamental Concepts: array of structures, string objects, searching and sorting The point of this assignment is to validate your understanding of the basic concepts presented in CS 1044. If you have much

More information

Decision Logic: if, if else, switch, Boolean conditions and variables

Decision Logic: if, if else, switch, Boolean conditions and variables CS 1044 roject 4 Summer I 2007 Decision Logic: if, if else, switch, Boolean conditions and variables This programming assignment uses many of the ideas presented in sections 3 through 5 of the course notes,

More information

The Program Specification:

The Program Specification: Reading to Input Failure, Decisions, Functions This programming assignment uses many of the ideas presented in sections 3 through 8 of the course notes, so you are advised to read those notes carefully

More information

CS 1044 Program 2 Spring 2002

CS 1044 Program 2 Spring 2002 Simple Algebraic Calculations One of the first things you will learn about C++ is how to perform numerical computations. In this project, you are given an incomplete program (see the end of this specification),

More information

CS 2704 Project 3 Spring 2000

CS 2704 Project 3 Spring 2000 Maze Crawler For this project, you will be designing and then implementing a prototype for a simple game. The moves in the game will be specified by a list of commands given in a text input file. There

More information

CS 1044 Project 2 Spring 2003

CS 1044 Project 2 Spring 2003 C++ Mathematical Calculations: Falling Bodies Suppose an object is dropped from a point at a known distance above the ground and allowed to fall without any further interference; for example, a skydiver

More information

gcc o driver std=c99 -Wall driver.c everynth.c

gcc o driver std=c99 -Wall driver.c everynth.c C Programming The Basics This assignment consists of two parts. The first part focuses on implementing logical decisions and integer computations in C, using a C function, and also introduces some examples

More information

CS 1044 Project 1 Fall 2011

CS 1044 Project 1 Fall 2011 Simple Arithmetic Calculations, Using Standard Functions One of the first things you will learn about C++ is how to perform numerical computations. In this project, you are given an incomplete program

More information

Each line will contain a string ("even" or "odd"), followed by one or more spaces, followed by a nonnegative integer.

Each line will contain a string (even or odd), followed by one or more spaces, followed by a nonnegative integer. Decision-making in C Squeezing Digits out of an Integer Assignment For part of this assignment, you will use very basic C techniques to implement a C function to remove from a given nonnegative integer

More information

A rectangle in the xy-plane, whose sides are parallel to the coordinate axes can be fully specified by giving the coordinates of two opposite corners:

A rectangle in the xy-plane, whose sides are parallel to the coordinate axes can be fully specified by giving the coordinates of two opposite corners: Decision-making in C (Possibly) Intersecting Rectangles Background A rectangle in the xy-plane, whose sides are parallel to the coordinate axes can be fully specified by giving the coordinates of two opposite

More information

Given that much information about two such rectangles, it is possible to determine whether they intersect.

Given that much information about two such rectangles, it is possible to determine whether they intersect. Decision-making in C (Possibly) Intersecting Rectangles Background A rectangle in the xy-plane, whose sides are parallel to the coordinate axes can be fully specified by giving the coordinates of one corner

More information

// Initially NULL, points to the dynamically allocated array of bytes. uint8_t *data;

// Initially NULL, points to the dynamically allocated array of bytes. uint8_t *data; Creating a Data Type in C Bytes For this assignment, you will use the struct mechanism in C to implement a data type that represents an array of bytes. This data structure could be used kind of like a

More information

You will provide an implementation for a test driver and for a C function that satisfies the conditions stated in the header comment:

You will provide an implementation for a test driver and for a C function that satisfies the conditions stated in the header comment: Decision-making in C (Possibly) Intersecting Rectangles Background A rectangle in the xy-plane, whose sides are parallel to the coordinate axes can be fully specified by giving the coordinates of one corner

More information

CS ) PROGRAMMING ASSIGNMENT 11:00 PM 11:00 PM

CS ) PROGRAMMING ASSIGNMENT 11:00 PM 11:00 PM CS3114 (Fall 2017) PROGRAMMING ASSIGNMENT #4 Due Thursday, December 7 th @ 11:00 PM for 100 points Due Tuesday, December 5 th @ 11:00 PM for 10 point bonus Last updated: 11/13/2017 Assignment: Update:

More information

CS2304 Spring 2014 Project 3

CS2304 Spring 2014 Project 3 Goal The Bureau of Labor Statistics maintains data sets on many different things, from work place injuries to consumer spending habits, but what you most frequently hear about is employment. Conveniently,

More information

gcc o driver std=c99 -Wall driver.c bigmesa.c

gcc o driver std=c99 -Wall driver.c bigmesa.c C Programming Simple Array Processing This assignment consists of two parts. The first part focuses on array read accesses and computational logic. The second part focuses on array read/write access and

More information

Creating a String Data Type in C

Creating a String Data Type in C C Programming Creating a String Data Type in C For this assignment, you will use the struct mechanism in C to implement a data type that models a character string: struct _String { char data; dynamically-allocated

More information

For storage efficiency, longitude and latitude values are often represented in DMS format. For McBryde Hall:

For storage efficiency, longitude and latitude values are often represented in DMS format. For McBryde Hall: Parsing Input and Formatted Output in C Dealing with Geographic Coordinates You will provide an implementation for a complete C program that reads geographic coordinates from an input file, does some simple

More information

Programming Standards: You must conform to good programming/documentation standards. Some specifics:

Programming Standards: You must conform to good programming/documentation standards. Some specifics: CS3114 (Spring 2011) PROGRAMMING ASSIGNMENT #3 Due Thursday, April 7 @ 11:00 PM for 100 points Early bonus date: Wednesday, April 6 @ 11:00 PM for a 10 point bonus Initial Schedule due Thursday, March

More information

struct _Rational { int64_t Top; // numerator int64_t Bottom; // denominator }; typedef struct _Rational Rational;

struct _Rational { int64_t Top; // numerator int64_t Bottom; // denominator }; typedef struct _Rational Rational; Creating a Data Type in C Rational Numbers For this assignment, you will use the struct mechanism in C to implement a data type that represents rational numbers. A set can be modeled using the C struct:

More information

CS 1044 Project 5 Fall 2009

CS 1044 Project 5 Fall 2009 User-defined Functions and Arrays This programming assignment uses many of the ideas presented in topics 3 through 18 of the course notes, so you are advised to read those carefully. Read and follow the

More information

3. When you process a largest recent earthquake query, you should print out:

3. When you process a largest recent earthquake query, you should print out: CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #1 Due Wednesday, September 18 @ 11:00 PM for 100 points Due Tuesday, September 17 @ 11:00 PM for 10 point bonus Updated: 9/11/2013 Assignment: This is the first

More information

a f b e c d Figure 1 Figure 2 Figure 3

a f b e c d Figure 1 Figure 2 Figure 3 CS2604 Fall 2001 PROGRAMMING ASSIGNMENT #4: Maze Generator Due Wednesday, December 5 @ 11:00 PM for 125 points Early bonus date: Tuesday, December 4 @ 11:00 PM for 13 point bonus Late date: Thursday, December

More information

CS 3114 Data Structures and Algorithms DRAFT Project 2: BST Generic

CS 3114 Data Structures and Algorithms DRAFT Project 2: BST Generic Binary Search Tree This assignment involves implementing a standard binary search tree as a Java generic. The primary purpose of the assignment is to ensure that you have experience with some of the issues

More information

CS 2704 Project 2: Elevator Simulation Fall 1999

CS 2704 Project 2: Elevator Simulation Fall 1999 Elevator Simulation Consider an elevator system, similar to the one on McBryde Hall. At any given time, there may be zero or more elevators in operation. Each operating elevator will be on a particular

More information

File Navigation and Text Parsing in Java

File Navigation and Text Parsing in Java File Navigation and Text Parsing in Java This assignment involves implementing a smallish Java program that performs some basic file parsing and navigation tasks, and parsing of character strings. The

More information

Pointer Accesses to Memory and Bitwise Manipulation

Pointer Accesses to Memory and Bitwise Manipulation C Programming Pointer Accesses to Memory and Bitwise Manipulation This assignment consists of two parts, the second extending the solution to the first. Q1 [80%] Accessing Data in Memory Here is a hexdump

More information

Pointer Casts and Data Accesses

Pointer Casts and Data Accesses C Programming Pointer Casts and Data Accesses For this assignment, you will implement a C function similar to printf(). While implementing the function you will encounter pointers, strings, and bit-wise

More information

Accessing Data in Memory

Accessing Data in Memory Accessing Data in Memory You will implement a simple C function that parses a tangled list of binary records in memory, processing them nonsequentially, and produces a simple text report. The function

More information

PR quadtree. public class prquadtree< T extends Compare2D<? super T> > {

PR quadtree. public class prquadtree< T extends Compare2D<? super T> > { PR quadtree This assignment involves implementing a point-region quadtree (specifically the PR quadtree as described in section 3.2 of Samet s paper) as a Java generic. Because this assignment will be

More information

Pointer Accesses to Memory and Bitwise Manipulation

Pointer Accesses to Memory and Bitwise Manipulation C Programming Pointer Accesses to Memory and Bitwise Manipulation This assignment consists of implementing a function that can be executed in two modes, controlled by a switch specified by a parameter

More information

Here is a C function that will print a selected block of bytes from such a memory block, using an array-based view of the necessary logic:

Here is a C function that will print a selected block of bytes from such a memory block, using an array-based view of the necessary logic: Pointer Manipulations Pointer Casts and Data Accesses Viewing Memory The contents of a block of memory may be viewed as a collection of hex nybbles indicating the contents of the byte in the memory region;

More information

Simple C Dynamic Data Structure

Simple C Dynamic Data Structure C Programming Simple C Dynamic Data Structure For this assignment, you will implement a program that manipulates a simple queue of integer values. Your program will include the following features: IntegerDT

More information

CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #2 Due Tuesday, October 11:00 PM for 100 points Due Monday, October 11:00 PM for 10 point bonus

CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #2 Due Tuesday, October 11:00 PM for 100 points Due Monday, October 11:00 PM for 10 point bonus CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #2 Due Tuesday, October 15 @ 11:00 PM for 100 points Due Monday, October 14 @ 11:00 PM for 10 point bonus Updated: 10/10/2013 Assignment: This project continues

More information

Invoice Program with Arrays and Structures

Invoice Program with Arrays and Structures A Realistic System: Invoice Program with Arrays and Structures For this assignment, you will implement a simple invoice program. Each stocked item in the inventory has a unique identification code (called

More information

Pointer Accesses to Memory and Bitwise Manipulation

Pointer Accesses to Memory and Bitwise Manipulation C Programming Pointer Accesses to Memory and Bitwise Manipulation This assignment consists of two parts, the second extending the solution to the first. Q1 [80%] Accessing Data in Memory Here is a hexdump

More information

Both parts center on the concept of a "mesa", and make use of the following data type:

Both parts center on the concept of a mesa, and make use of the following data type: C Programming Simple Array Processing This assignment consists of two parts. The first part focuses on array read accesses and computational logic. The second part requires solving the same problem using

More information

The assignment requires solving a matrix access problem using only pointers to access the array elements, and introduces the use of struct data types.

The assignment requires solving a matrix access problem using only pointers to access the array elements, and introduces the use of struct data types. C Programming Simple Array Processing The assignment requires solving a matrix access problem using only pointers to access the array elements, and introduces the use of struct data types. Both parts center

More information

For this assignment, you will implement a collection of C functions to support a classic data encoding scheme.

For this assignment, you will implement a collection of C functions to support a classic data encoding scheme. C Programming SEC-DED Data Encoding For this assignment, you will implement a collection of C functions to support a classic data encoding scheme. Data transmission and data storage both raise the risk

More information

File Navigation and Text Parsing in Java

File Navigation and Text Parsing in Java File Navigation and Text Parsing in Java This assignment involves implementing a smallish Java program that performs some basic file parsing and navigation tasks, and parsing of character strings. The

More information

Geographic Information System

Geographic Information System Geographic Information System Geographic information systems organize information pertaining to geographic features and provide various kinds of access to the information. A geographic feature may possess

More information

Protein Sequence Database

Protein Sequence Database Protein Sequence Database A protein is a large molecule manufactured in the cell of a living organism to carry out essential functions within the cell. The primary structure of a protein is a sequence

More information

Geographic Information System version 1.0

Geographic Information System version 1.0 Geographic Information System version 1.0 Geographic information systems organize information pertaining to geographic features and provide various kinds of access to the information. A geographic feature

More information

CS4120/4121/5120/5121 Spring /6 Programming Assignment 4

CS4120/4121/5120/5121 Spring /6 Programming Assignment 4 CS4120/4121/5120/5121 Spring 2016 Programming Assignment 4 Intermediate Code Generation Due: Friday March 18, 11:59pm This programming assignment requires you to implement an IR generator for the Xi programming

More information

Here is a C function that will print a selected block of bytes from such a memory block, using an array-based view of the necessary logic:

Here is a C function that will print a selected block of bytes from such a memory block, using an array-based view of the necessary logic: Pointer Manipulations Pointer Casts and Data Accesses Viewing Memory The contents of a block of memory may be viewed as a collection of hex nybbles indicating the contents of the byte in the memory region;

More information

Geographic Information System

Geographic Information System Geographic Information System Geographic information systems organize information pertaining to geographic features and provide various kinds of access to the information. A geographic feature may possess

More information

CS : Programming for Non-majors, Fall 2018 Programming Project #2: Census Due by 10:20am Wednesday September

CS : Programming for Non-majors, Fall 2018 Programming Project #2: Census Due by 10:20am Wednesday September CS 1313 010: Programming for Non-majors, Fall 2018 Programming Project #2: Census Due by 10:20am Wednesday September 19 2018 This second assignment will introduce you to designing, developing, testing

More information

READ THIS NOW! Do not start the test until instructed to do so!

READ THIS NOW! Do not start the test until instructed to do so! READ THIS NOW! Failure to read and follow the instructions below may result in severe penalties. Failure to adhere to these directions will not constitute an excuse or defense. Print your name in the space

More information

Data Structures and Algorithms

Data Structures and Algorithms CS 3114 Data Structures and Algorithms 1 Trinity College Library Univ. of Dublin Instructors and Course Information 2 William D McQuain Email: Office: Office Hours: wmcquain@cs.vt.edu 634 McBryde Hall

More information

Data Structures and OO Development II

Data Structures and OO Development II CS 2606 1 Long House Ancestral Puebloan, Mesa Verde Instructor and Course Information 2 William D McQuain Email: Office: Office Hours: wmcquain@cs.vt.edu 631 McBryde Hall see course website CS 2606 Design

More information

CS/SE 153 Concepts of Compiler Design

CS/SE 153 Concepts of Compiler Design San José State University Department of Computer Science CS/SE 153 Concepts of Compiler Design Section 1 Fall 2018 Course and Contact Information Instructor: Ron Mak Office Location: ENG 250 Email: ron.mak@sjsu.edu

More information

Using VeriCite. NMU Center for Teaching and Learning. 1. To Create and Assignment using VeriCite:

Using VeriCite. NMU Center for Teaching and Learning. 1. To Create and Assignment using VeriCite: 1. To Create and Assignment using VeriCite: Log into EduCat, Click into your course, and Turn editing on. 2. Scroll to the section you want the assignment to be displayed. Click on Add an activity or resource.

More information

Practical 2: Ray Tracing

Practical 2: Ray Tracing 2017/2018, 4th quarter INFOGR: Graphics Practical 2: Ray Tracing Author: Jacco Bikker The assignment: The purpose of this assignment is to create a small Whitted-style ray tracer. The renderer should be

More information

CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm

CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm 1 CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm Objectives To enhance your experience with designing and implementing your own

More information

CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 2 Assigned: September 7, 2016 Due: Wednesday, September 14, 2016 by 2:30 pm

CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 2 Assigned: September 7, 2016 Due: Wednesday, September 14, 2016 by 2:30 pm 1 Objectives CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 2 Assigned: September 7, 2016 Due: Wednesday, September 14, 2016 by 2:30 pm To develop a template for a Java program to use during

More information

Today s Topics. Last Time Top-down parsers - predictive parsing, backtracking, recursive descent, LL parsers, relation to S/SL

Today s Topics. Last Time Top-down parsers - predictive parsing, backtracking, recursive descent, LL parsers, relation to S/SL Today s Topics Last Time Top-down parsers - predictive parsing, backtracking, recursive descent, LL parsers, relation to S/SL This Time Constructing parsers in SL Syntax error recovery and repair Parsing

More information

Homework 2 - KW26 - using 40 hexadecimal digits

Homework 2 - KW26 - using 40 hexadecimal digits Homework 2 - KW26 - using 40 hexadecimal digits Michael McAlpin Instructor - COP3502 - CS-1 Fall 2017 CECS-UCF michael.mcalpin@ucf.edu October 13, 2017 Assignment due date: November 5, 2017 Abstract In

More information

How to Access If Rubrics does not appear on your course navbar, click Edit Course, Tools, Rubrics to activate..

How to Access If Rubrics does not appear on your course navbar, click Edit Course, Tools, Rubrics to activate.. KODIAK QUICK GUIDE Rubrics Overview Rubrics allow you to establish set criteria for grading assignments; you can attach Rubrics to Dropbox folders or Discussion topics so that the criteria are available

More information

CMPE 152 Compiler Design

CMPE 152 Compiler Design San José State University Department of Computer Engineering CMPE 152 Compiler Design Section 1 (Class) Sections 2 and 3 (s) Fall 2018 Course and Contact Information Instructor: Ron Mak Office Location:

More information

CS131 Compilers: Programming Assignment 2 Due Tuesday, April 4, 2017 at 11:59pm

CS131 Compilers: Programming Assignment 2 Due Tuesday, April 4, 2017 at 11:59pm CS131 Compilers: Programming Assignment 2 Due Tuesday, April 4, 2017 at 11:59pm Fu Song 1 Policy on plagiarism These are individual homework. While you may discuss the ideas and algorithms or share the

More information

CS 3114 Data Structures and Algorithms Test 1 READ THIS NOW!

CS 3114 Data Structures and Algorithms Test 1 READ THIS NOW! READ THIS NOW! Print your name in the space provided below. There are 7 short-answer questions, priced as marked. The maximum score is 100. This examination is closed book and closed notes, aside from

More information

Assignment 5: MyString COP3330 Fall 2017

Assignment 5: MyString COP3330 Fall 2017 Assignment 5: MyString COP3330 Fall 2017 Due: Wednesday, November 15, 2017 at 11:59 PM Objective This assignment will provide experience in managing dynamic memory allocation inside a class as well as

More information

CS 1044: Introduction to Programming in C++

CS 1044: Introduction to Programming in C++ CS 1044: Introduction to Programming in C++ Spring 2009 Table of Contents Instructor Info Description & Texts Course Agreement Evaluation Curve Class Organization Trademark Notice CS1044 URL: http://courses.cs.vt.edu/~cs1044/

More information

Curator System Student Guide January 2004

Curator System Student Guide January 2004 Curator System January 2004 Table of Contents 1 Introduction 2 2 Submitting an Assignment 3 3 Submitting Responses to a Quiz 12 4 Announcements 14 5 How the Curator Scores Auto-Graded Submissions 15 6

More information

CS 111X - Fall Test 1

CS 111X - Fall Test 1 CS 111X - Fall 2016 - Test 1 1/9 Computing ID: CS 111X - Fall 2016 - Test 1 Name: Computing ID: On my honor as a student, I have neither given nor received unauthorized assistance on this exam. Signature:

More information

Blackboard 9 - Creating Categories in the Grade Center

Blackboard 9 - Creating Categories in the Grade Center University of Southern California Marshall Information Services Blackboard 9 - Creating Categories in the Grade Center Categories allow you to place Blackboard data columns (i.e. non-calculated columns)

More information

CS 374 Fall 2014 Homework 2 Due Tuesday, September 16, 2014 at noon

CS 374 Fall 2014 Homework 2 Due Tuesday, September 16, 2014 at noon CS 374 Fall 2014 Homework 2 Due Tuesday, September 16, 2014 at noon Groups of up to three students may submit common solutions for each problem in this homework and in all future homeworks You are responsible

More information

Gradebook - Grades Tab Create Assignment

Gradebook - Grades Tab Create Assignment Gradebook - Grades Tab Create Assignment If no assignments have been created for the selected class in the selected term, the student names will not display. No Grades Found will be displayed where the

More information

CS 1044 Programming in C++ Test 1 READ THIS NOW! Failure to read and follow the instructions below may result in severe penalties.

CS 1044 Programming in C++ Test 1 READ THIS NOW! Failure to read and follow the instructions below may result in severe penalties. READ THIS NOW! Failure to read and follow the instructions below may result in severe penalties. Print your name in the space provided below. Print your name and ID number on the Opscan form and code your

More information

Outline. hash tables hash functions open addressing chained hashing

Outline. hash tables hash functions open addressing chained hashing Outline hash tables hash functions open addressing chained hashing 1 hashing hash browns: mixed-up bits of potatoes, cooked together hashing: slicing up and mixing together a hash function takes a larger,

More information

CS 241 Data Organization. August 21, 2018

CS 241 Data Organization. August 21, 2018 CS 241 Data Organization August 21, 2018 Contact Info Instructor: Dr. Marie Vasek Contact: Private message me on the course Piazza page. Office: Room 2120 of Farris Web site: www.cs.unm.edu/~vasek/cs241/

More information

CMPE 152 Compiler Design

CMPE 152 Compiler Design San José State University Department of Computer Engineering CMPE 152 Compiler Design Course and contact information Instructor: Ron Mak Office Location: ENG 250 Email: Website: Office Hours: Section 4

More information

Solution READ THIS NOW! CS 3114 Data Structures and Algorithms

Solution READ THIS NOW! CS 3114 Data Structures and Algorithms READ THIS NOW! Print your name in the space provided below. There are 5 short-answer questions, priced as marked. The maximum score is 100. This examination is closed book and closed notes, aside from

More information

CS 111X - Fall Test 1 - KEY KEY KEY KEY KEY KEY KEY

CS 111X - Fall Test 1 - KEY KEY KEY KEY KEY KEY KEY CS 111X - Fall 2016 - Test 1 1/9 Computing ID: CS 111X - Fall 2016 - Test 1 - KEY KEY KEY KEY KEY KEY KEY Name: Computing ID: On my honor as a student, I have neither given nor received unauthorized assistance

More information

Assignment 4 Publication date: 27/12/2015 Submission date: 17/01/ :59 People in-charge: R. Mairon and Y. Twitto

Assignment 4 Publication date: 27/12/2015 Submission date: 17/01/ :59 People in-charge: R. Mairon and Y. Twitto Assignment 4 Publication date: 27/12/2015 Submission date: 17/01/2016 23:59 People in-charge: R. Mairon and Y. Twitto Introduction The objectives of this assignment are to exercise a few advanced object

More information

CMPE 152 Compiler Design

CMPE 152 Compiler Design San José State University Department of Computer Engineering CMPE 152 Compiler Design Section 1 (Class) Sections 2 and 3 (Labs) Spring 2019 Course and Contact Information Instructor: Ron Mak Office Location:

More information

for (i=1; i<=100000; i++) { x = sqrt (y); // square root function cout << x+i << endl; }

for (i=1; i<=100000; i++) { x = sqrt (y); // square root function cout << x+i << endl; } Ex: The difference between Compiler and Interpreter The interpreter actually carries out the computations specified in the source program. In other words, the output of a compiler is a program, whereas

More information

Project 2 Reliable Transport

Project 2 Reliable Transport Project 2 Reliable Transport UC Berkeley CS 168, Fall 2014 Version 1.0 Due: 11:59am (noon), November 2nd, 2014 In this project, you will build a simple reliable transport protocol, BEARS TP (BTP). Your

More information

Out: April 19, 2017 Due: April 26, 2017 (Wednesday, Reading/Study Day, no late work accepted after Friday)

Out: April 19, 2017 Due: April 26, 2017 (Wednesday, Reading/Study Day, no late work accepted after Friday) CS 215 Fundamentals of Programming II Spring 2017 Programming Project 7 30 points Out: April 19, 2017 Due: April 26, 2017 (Wednesday, Reading/Study Day, no late work accepted after Friday) This project

More information

On my honor I affirm that I have neither given nor received inappropriate aid in the completion of this exercise.

On my honor I affirm that I have neither given nor received inappropriate aid in the completion of this exercise. CS 2413 Data Structures EXAM 2 Fall 2017, Page 1 of 10 Student Name: Student ID # OU Academic Integrity Pledge On my honor I affirm that I have neither given nor received inappropriate aid in the completion

More information

COP4530 Data Structures, Algorithms and Generic Programming Recitation 3 Date: January 20 & 22, 2009

COP4530 Data Structures, Algorithms and Generic Programming Recitation 3 Date: January 20 & 22, 2009 COP4530 Data Structures, Algorithms and Generic Programming Recitation 3 Date: January 20 & 22, 2009 Lab objectives: 1) Quiz 2) Set up SSH to run external programs. 3) Learn how to use the DDD debuger.

More information

COURSE ELEMENTS / DROPBOX

COURSE ELEMENTS / DROPBOX Creating a Dropbox (version 10.2) COURSE ELEMENTS / DROPBOX The following documentation will show you, the instructor, how to create a dropbox folder to enable electronic submissions from within a D2L

More information

Absolute C++ Walter Savitch

Absolute C++ Walter Savitch Absolute C++ sixth edition Walter Savitch Global edition This page intentionally left blank Absolute C++, Global Edition Cover Title Page Copyright Page Preface Acknowledgments Brief Contents Contents

More information

COMP 401 COURSE OVERVIEW

COMP 401 COURSE OVERVIEW COMP 401 COURSE OVERVIEW Instructor: Prasun Dewan (FB 150, help401@cs.unc.edu) Course page: http://www.cs.unc.edu/~dewan/comp401/current/ COURSE PAGE Linked from my home page (google my name to find it)

More information

It is academic misconduct to share your work with others in any form including posting it on publicly accessible web sites, such as GitHub.

It is academic misconduct to share your work with others in any form including posting it on publicly accessible web sites, such as GitHub. p4: Cache Simulator 1. Logistics 1. This project must be done individually. It is academic misconduct to share your work with others in any form including posting it on publicly accessible web sites, such

More information

COMP Assignment 1

COMP Assignment 1 COMP281 2019 Assignment 1 In the following, you will find the problems that constitute Assignment 1. They will be also available on the online judging (OJ) system available at https://student.csc.liv.ac.uk/judgeonline

More information

CS 3114 Data Structures and Algorithms READ THIS NOW!

CS 3114 Data Structures and Algorithms READ THIS NOW! READ THIS NOW! Print your name in the space provided below. There are 9 short-answer questions, priced as marked. The maximum score is 100. When you have finished, sign the pledge at the bottom of this

More information

PowerSchool Student and Parent Portal User Guide. https://powerschool.gpcsd.ca/public

PowerSchool Student and Parent Portal User Guide. https://powerschool.gpcsd.ca/public PowerSchool Student and Parent Portal User Guide https://powerschool.gpcsd.ca/public Released June 2017 Document Owner: Documentation Services This edition applies to Release 11.x of the PowerSchool software

More information

for (i=1; i<=100000; i++) { x = sqrt (y); // square root function cout << x+i << endl; }

for (i=1; i<=100000; i++) { x = sqrt (y); // square root function cout << x+i << endl; } Ex: The difference between Compiler and Interpreter The interpreter actually carries out the computations specified in the source program. In other words, the output of a compiler is a program, whereas

More information

CS52 - Assignment 8. Due Friday 4/15 at 5:00pm.

CS52 - Assignment 8. Due Friday 4/15 at 5:00pm. CS52 - Assignment 8 Due Friday 4/15 at 5:00pm https://xkcd.com/859/ This assignment is about scanning, parsing, and evaluating. It is a sneak peak into how programming languages are designed, compiled,

More information

CMSC 423 Fall 2009: Project Specification

CMSC 423 Fall 2009: Project Specification CMSC 423 Fall 2009: Project Specification Introduction The project will consist of four components due throughout the semester (see below for timeline). Basic rules: You are allowed to work in teams of

More information

CMPE 180A Data Structures and Algorithms in C++ Spring 2018

CMPE 180A Data Structures and Algorithms in C++ Spring 2018 San José State University Department of Computer Engineering CMPE 180A Data Structures and Algorithms in C++ Spring 2018 Instructor: Ron Mak Assignment #6 Assigned: Thursday, March 1 Due: Thursday, March

More information

CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG

CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG 1 Notice Reading Assignment Chapter 1: Introduction to Java Programming Homework 1 It is due this coming Sunday

More information

CS 215 Fundamentals of Programming II Fall 2017 Project 7. Morse Code. 30 points. Out: November 20, 2017 Due: December 4, 2017 (Monday) a n m

CS 215 Fundamentals of Programming II Fall 2017 Project 7. Morse Code. 30 points. Out: November 20, 2017 Due: December 4, 2017 (Monday) a n m CS 215 Fundamentals of Programming II Fall 2017 Project 7 30 points Out: November 20, 2017 Due: December 4, 2017 (Monday) This project is to build a Morse code tree and use it to encode and decode messages.

More information