archive-edu.com » EDU » H » HWS.EDU Total: 727 Choose link from "Titles, links and description words view": Or switch to
"Titles and links view". |

- Math/CS at HWS

Guide to Recommendation Letters Major Minor Audit Forms 3 2 Engineering First Year Advising Math Placement Info Some Of Our Work Programming Textbook Eck CS Theory Textbook Critchlow Eck Analysis Textbook Mitchell Belding Biostatistics Textbook Mitchell Other Publications Jacquelyn Rische Visiting Assistant Professor Department of Mathematics and Computer Science Hobart and William Smith Colleges Mailing address Hobart and William Smith Colleges 300 Pulteney Street Geneva New York 14456 Office Office

Original URL path: http://math.hws.edu/web/faculty/rische.html (2016-02-07)

Open archived version from archive - David J. Eck

several years the textbook in this course has been a set of notes written by Professors Carol Critchlow and me This set of notes is now available for reading on line or for downloading at no charge For more information and links to the PDF version of the book see http math hws edu FoundationsOfComputation A printed textbook can be ordered for the cost of reproduction from lulu com The Most Complex Machine My introductory computer science textbook The Most Complex Machine was published in July 1995 The book surveys most of the major areas of computer science and is suitable as a textbook for a first course in computer science It is also suitable for self study A review of in the April 96 issue of CHOICE magazine says that it is Strongly recommended as a foundation for guided self study for gifted high school students as well as non computing majors You can read more about it here A set of applets and labs for use with the text is freely available on line This book is now quite old alghough not so out of date as most computer books published in the 1990s The applets written in an old version of Java are not as attractive as they could be but some of them are still quite useful In particular xSortLab A visual demonstration of several sorting algorithms xTuringMachine A Turing Machine simulator xLogicCircuits Create and run simulated circuits made from AND OR and NOT gates xComputer Simulates a complete simple computer that is programmable in assembly language The source code for the applets can be downloaded from this page You can also get jar files for running for running the applets as stand alone programs Java Components for Mathematics Project JCM Java Components for Mathematics is a project that is attempting to make it easier to write educational mathematical applets for use on Web pages To learn more about it and to try some of the applets that I ve written check out http math hws edu javamath xFunctions for Java My xFunctions applet can be use for playing with and learning about functions Besides being fun to play with it is suitable for use in calculus and pre calculus courses It was designed to be very easy to use so that it can be used with very little instructional overhead It is available for on line use and for downloading at http math hws edu xFunctions More Java Applets Besides the software for The Most Complex Machine and my On line Java Text I ve written a few other Java applets They might offer a few minutes of diversion and after all that s part of what Java is all about Here are some links Mandelbrot Set Viewer An applet and standalone application for exploring the famous Manelbrot Set This program requires Java version 5 0 or higher New in June 2009 A palette editor arbitrary precision computation and the possibility of distributing the computation

Original URL path: http://math.hws.edu/eck/ (2016-02-07)

Open archived version from archive - Jonathan Forde - Mathematics

Tuesday Wednesday Thursday Friday Location Math 100 10 10 11 05 None 10 10 11 05 None 10 10 11 05 Emerson 3 Math 100 Lab None None None 10 20 11 45 None Coxe 7 Math 237 3 00 3 55 None 3 00 3 55 None 3 00 3 55 Napier 202 Office Hours 1 00 2 00 Appointment 11 30 12 30 Appointment 2 00 3 00

Original URL path: http://math.hws.edu/forde/ (2016-02-07)

Open archived version from archive - John Vaughn's Personal Home Page

frames but your current browser does not support them Please upgrade your browser to use this program Supported browsers include Internet Explorer 3 0 Netscape Navigator 4 5 Foxfire 1

Original URL path: http://math.hws.edu/vaughn/ (2016-02-07)

Open archived version from archive - HWS Math/CS Department News

El Geneva Scholarship Associates at HWS the Parkinson Research Foundation or a charity of one s choice Sincerely Mark D Gearan President Posted 24 December 2013 Joe Bochynski Math and Studio Art 2007 I m excited to say this June I graduated from the Rhode Island School of Design with my MFA The thesis exhibit has come down however there was a review that included my work out of the 200 grads shown Really Big Show This piece is entitled William and Patty Hearst Also if you are in New York this July my class of painting grads have a group show at Projekt 722 in Brooklyn The opening is July 13th while the show runs from July 6 28 You should know I m still using what I learned in math CS my thesis drew on some vector field ideas and I typeset it in LaTeX Posted 1 July 2013 Department Prizes for 2013 Each Spring the Department of Mathematics and Computer Science is pleased to recognize student excellence with a variety of departmental prizes Here is the list for 2013 The John S Klein Prize awarded to a graduating Senior to recognize excellence in Computer Science to Alexander Kittelberger H 13 The Abigail Mosey Book Prize awarded to a Hobart or William Smith Senior for generosity in helping others to learn and appreciate mathematical ideas to Samuel Heinle H 13 The William Ross Proctor Prize awarded to the William Smith Sophomore who has achieved the highest rank in mathematics in her first two years at the Colleges to Alana Kilcullen WS 15 The Irving Bentsen Prize awarded to the second year student at Hobart College who has the most outstanding record in mathematics and computer science to Ruiqian Richard Dai H 15 and Luke DeLuccia H 15 For more about student prizes in the Department of Mathematics and Computer Science visit our department prizes page Posted 29 April 2013 Alex Kittelberger Honors Project Alexander Kittelberger H 13 has completed an Honors project with the title Online Virtual Math Museum Building a Virtual Math Museum with Modern Web Technologies and an XML Infrastructure An Honors project is a year long endeavour culminating in a long Honors thesis and an oral examination by a committee of three examiners Alex s Honors Project was to create a website for mathematical visualizations From equations to geometry there are many different types of mathematical objects that can all be described in different forms The â Online Virtual Math Museumâ is designed to store and present information about mathematical objects in the form of a website An XML language is used to define these mathematical objects and a Java program is used to create webpages to present the objects visually For this project a framework was developed for a website that can display different mathematical objects The framework can easily be extended and allows programmers to expand on the presentations Alex s advisor for the project was Professor David Eck Posted 29 April 2013

Original URL path: http://math.hws.edu/web/news/index.php?type=All&page=2 (2016-02-07)

Open archived version from archive - Mathematics and Computer Science at HWS

with phone numbers and e mail addresses Personal home pages Professor David Eck Professor Kevin Mitchell Professor John Vaughn Information from the 1995 96 catalog about majoring in Mathematics or Computer Science Information about Kevin Mitchell s Term Abroad in Australia program Notes for a talk by Kevin Mitchell on hyperbolic tilings Information about The Most Complex Machine David Eck s introductory computer science textbook Math and Computer Science on the Web Starting Points for Exploration The Association for Computing Machinery s server including Crossroads an on line journal by and for students Graduate Assistantship Directory The American Mathematical Society s server including On line versions of AMS publications such as Bulletin of the AMS and Notices of the AMS A searchable membership list World Wide Web Virtual Library pages for Mathematics Computing The Mathematical Association of America List of Mathematics Information Servers from the Penn State Some Interesting Pages The Geometry Center The Jargon File aka The Hacker s Deictionary Electronic Journal of Undergraduate Mathematics This site is located on a Macintosh IIci running Chuck Shotton s HTTP server for Macintosh MacHTTP If you are interested in learning more about MacHTTP here is the MacHTTP documentation that came with

Original URL path: http://math.hws.edu/original-website/Default.html (2016-02-07)

Open archived version from archive - John Vaughn's Home Page

A Life by Susan Quinn Reflections of Eden by Birute M F Galdikas The Most Complex Machine by David Eck includes software The Devil s Dictionary by Ambrose Bierce Journey Through Genius by William Dunham Teach Yourself Web Publishing with HTML by Laura Lemay Mobile Robots Inspiration to Implementation by Jones and Flynn Bebop to the Boolean Boogie by Clive call me Max Maxwell Pinhole Photography by Eric Renner Making

Original URL path: http://math.hws.edu/original-website/vaughn/index.html (2016-02-07)

Open archived version from archive - CPSC 328: Program Translators

of a given type are represented by the same token The actual value of the constant is considered to be an attribute of the token Identifiers are similar except that the attribute for an identifier should probably be some sort of reference to a symbol table entry for that identifier The symbol table would contain information about the identifier such as whether it is a global variable parameter constant etc Alternatively you might want to have different tokens to represent different types of identifiers Also you have to consider how to handle identifiers that have not yet been defined Your lexical analyzer should be pretty much complete after this assignment Your symbol table should be able to store at least global variable names You will need to store the type of the variable along with its name You can expect to do more work on your symbol table as you do the remaining assignments I will give you more information and more suggestions in class Assignment 2 Variables and assignment statements due February 6 For assignment number 2 you will write a compiler for a simple subset of Pascal in which the only possible statement is an assignment statement This compiler will use the lexical anlyzer and symbol table that you wrote for assignment 1 You might find that you need to add some features to the symbol table Your compiler should output a stack machine program equivalent to the Pascal input file Following is a description of the syntax of the language you should compile for this assignment The description is written in extended BNF The symbols IDENT INT FLOAT and CHAR are special tokens representing respectively an identifier an integer constant a floating point constant and a character constant Note that a character constant is a single character it is not the same as a string constant You should write a procedure corresponding to each of the BNF productions in the following syntax description In the remaining assignments you will build on what you write for this assignment Most of the procedures you write will be in final form The productions marked with correspond to procedures that will need further work in later assignments For example the definition of program will be modified in a later assignment to include a type section and procedure and function definitions You should write a procedure now for each production even if the production is very simple like the one for type since the definition might become much more complicated later program program IDENT const section var section begin statement list end const section const IDENT constant IDENT constant var section var variable declaration variable declaration variable declaration IDENT IDENT type type IDENT constant INT FLOAT CHAR IDENT statement list statement statement statement assignment statement EMPTY assignment statement L value R value L value variable ref R value basic expression basic Expression basic expression not term or term term factor div mod and factor factor constant variable ref R value variable ref IDENT Of course you will also have to deal with the semantics of the language This is much harder than the syntax which you can handle more or less mechanically just by following the BNF productions What is meant by semantics here Well for example you have to know that when a variable is declared it should be entered into the symbol table along with any relevant information such as its type and its location in memory When a variable is used in an expression you have to check whether it was defined and what its type is You have to check that the types of the left hand side and the right hand side of an assignment statement match There are many other things to worry about Here are a few hints about how to handle the semantics The purpose of your L value procedure should be to put an address on the stack This might be used later for example by a sm Store instruction The purpose of your R value procedure should be to put a value on the stack The same is true for basic expression term and factor You will need to know the type of each L value basic expression term and factor that is processed Therefore the corresponding procedures should return in a var parameter an indication of the type A var section processes variable declarations You will need to know the number of memory locations required by the variables so the corresponding procedure should return this number When an IDENT token is encountered the semantics will determine the exact type of identifier that is acceptable and what is done with it For example in the defintion of a type the IDENT must be the name of a type such as real boolean or later in the course some name that was defined as a type in the program that is being compiled This is by no means everything you need to know about semantics If you have any questions as you think about or work on your program please ask them I found it extrememly useful by the way to write two procedures to help me in processing an R value procedure CheckOpType var op TokenKind opType TypeIndicator if the given operator op plusTOK geTOK etc is not legal with an operand of type opType then generate an error otherwise do nothing procedure Emit var binop TokenKind var op1Type op2Type TypeIndicator Assuming that two operands of types op1type and op2type have already been processed generated the stack machine instruction or instructions needed to apply the binary operation binop to those operands More than one instruction is needed if one of the operands has to be converted from integer to real and in that case op1Type or op2Type will be changed accordingly You will probably find that you have to do some more work on your symbol table for this assignment You should initialize the symbol table with the predefined constant identifiers true

Original URL path: http://math.hws.edu/eck/courses/cpsc328_w95.html (2016-02-07)

Open archived version from archive