[Skip Navigation] [CSUSB] / [CNS] / [Comp Sci & Eng] / [R J Botting] / [CSci202] / p2
[Text Version] [Syllabus] [Schedule] [Glossary] [Resources] [Grading] [Contact] [Question] [Search ]
Notes: [01] [02] [03] [04] [05] [06] [07] [08] [09] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20]
Labs: [01] [02] [03] [04] [05] [06] [07] [08] [09] [10]
Tue May 25 11:22:01 PDT 2010

Contents

    CS202 Project 2 Requirements

      Goals

       Your project should show your skill and knowledge in an area covered in recent sessions (listed by chapter below).

      Choices

       Choose one single even numbered programming project from either chapter 10(recursion), 11(sorting and searching), or 12(list, stacks and queues).

      Deadline

      [ schedule.html ]

      Style

      Your code must have comments that identify you, the project in the book, and what you are doing!

      Hand in UML diagrams for all classes you declare. You can draw these by hand on you code listings.

      Make the code as simple and as clear as you can: Do the simplest thing that can possibly work first, and then use Don't repeat yourself to improve the code.

      I want to be able to read your code and know what it does, and what it should do! Comments should explain anything complicated or buggy.

      Our grading method is described in the CSci202 syllabus.

      Hand in

      Hand in the code. No cover sheets, folders, etc. No test runs. Print it out, staple it, and hand it in!

      Incomplete work

      We will forgive some incomplete or buggy work as long as you explain what is wrong.

      Resubmission

       This project may not be resubmitted.

      Quizzes and Finals

      Don't be surprised if a test requires you to recall what you did when you wrote this project.

      Also See

      The CS202 syllabus has the rules, deadlines, and hints: [ syllabus.html ]

    . . . . . . . . . ( end of section CS202 Project 2 Requirements) <<Contents | End>>

    Abbreviations

  1. Algorithm::=A precise description of a series of steps to attain a goal, [ Algorithm ] (Wikipedia).
  2. class::="A description of a set of similar objects that have similar data plus the functions needed to manipulate the data".
  3. Data_Structure::=A small data base.
  4. Function::programming=A selfcontained and named piece of program that knows how to do something.
  5. Gnu::="Gnu's Not Unix", a long running open source project that supplies a very popular and free C++ compiler.
  6. KDE::="Kommon Desktop Environment".
  7. object::="A little bit of knowledge -- some data and some know how", and instance of a class".
  8. OOP::="Object-Oriented Programming", Current paradigm for programming.
  9. Semantics::=Rules determining the meaning of correct statements in a language.
  10. SP::="Structured Programming", a previous paradigm for programming.
  11. STL::="The standard C++ library of classes and functions" -- also called the "Standard Template Library" because many of the classes and functions will work with any kind of data.
  12. Syntax::=The rules determining the correctness and structure of statements in a language, grammar.
  13. Q::software="A program I wrote to make software easier to develop",
  14. TBA::="To Be Announced", something I should do.
  15. TBD::="To Be Done", something you have to do.
  16. UML::="Unified Modeling Language".
  17. void::C++Keyword="Indicates a function that has no return".

End