CS201

CSCI 201-01 Computer Science Fundamentals

Fall 2010
Instructor - Higgins
Syllabus: Click here to get course information and requirements
Web tutorials
Finals Week Schedule

Phone: 3552
Recommended text: Wu, A Comprehensive Introduction to Object Oriented Programming with Java; McGraw-Hill
Recommended text: Computer Systems, by J. Stanley Warford, Jones and Bartlett publ.
Prerequisite: Grade of C or better in CSCI 116 (A first programming course like CSCI 116).
About the course: This is not a first course in computer science. You should already be able to program in Java or C++. NOTE: There will be several hand-in projects during the semester. You will have 2-3 weeks for each project and will need all this time to complete them, even if you are a good programmer. Programming is a required component of this course. Although we are primarily interested in other aspects of computer science, we will implement algorithms and explore topics through their implementation as applets or applications in Java. Class examples will all be done in Java. Student projects will be completed in Java. An introduction to Java programming will be provided as part of the course material. I am available to help on projects. My office help is contingent on your coming to class and keeping up with all class work, including running examples programs and exercises I give you. Additionally, I will not provide assistance on a project after the due date of the project. Late projects receive 1 point deduction for each school day late up to one week (5 days). After that they receive no credit.
Course Goals and Objectives: Students will study OOP-OOD principles of encapsulation and abstraction, object design, inheritance and will improve programming skills acquired in their first CSCI course by implementing a number of projects using object-oriented techniques. Students will be able to perform set, logical and Boolean algebraic operations. Students will learn radix positional notation as well as various number conversion algorithms and internal (computer) data representation. Students will learn about operating systems. Students will be introduced to automata theory and applications (FSM, pushdown stacks, and TM). If time permits there may be coverage of databases and computer communications. Students will show their competence in these topic areas through class participation, exams or programming projects.

·        Campus labs should have Textpad and Eclipse development environments available. You may also install these on your own computer. A few notes about using Textpad & Eclipse

·        Some remarks about posting applets: You will need only a few lines of html to post an applet to your web page. The example here shows both a minimal home page as well as the html file needed to point to an applet class file.

Link to raw html file and the page it generates

·        If you live off campus and wish to map to your (campus account) w drive you’ll need a ppp account and you’ll need to use a file transfer application like Filezilla to move files back and forth from your desktop to your w drive (see HelpDesk - HelpDesk pages - or ask HelpDesk staff for more details).

A link to a running applet and its source code: http://employees.oneonta.edu/higgindm/CSFundamentals/Calculator.html

Course projects

1.      First programming project   A java applet to add, multiply and subtract binary numbers. Due date Tuesday, September 21^st.

2.      Second project: DNF (POS) generator. Due date, Tuesday, October 12^th, 2010

3.      Third project Hamming encryption   Use a frame-based application to provide Hamming single-bit error correction. Due Tuesday, November 2^nd 2010.

4.      Fourth project Due November 30^th Exploring threads and runnable. Bouncing/colliding balls

5.      Fifth project Due before final exam, (which is 8:00am Thurs Dec 16^th 2010) Automata Study: UTM – Universal TM project- simulator.

Various other possible projects:

·        Combine JOptionPane with a base changer program from your notes to change numbers from base B (where B is in 2..10) to decimal (or visa versa). E.C.: Handle bases up to and including 16.

·        a Java Applet to perform Postfix processing

·        a Java Applet to perform set operations: add element to set, intersect sets, union sets, complement sets, display set elements.

·        DNF/CNF generator: Using Frames and File I/O in an application

·        Sockets projects: use sockets to set up a little network

·        OS simulator project Operating systems/ resource-sharing simulator

Sample exams may not be representative of the ordering of material or of what we cover in class this semester.

·        First in class exam: September 28^th,2010 Click here for>>>> Sample exam1

·        Second exam: November 18^th, 2010 Click here for>>>>Sample Exam2

·        Final Exam: see finals schedule usual room Click here for>>> Sample Final

Class notes: