http:^^www.cs.washington.edu^education^courses^373^96a^project.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 132 行
HTML
132 行
Date: Tue, 10 Dec 1996 16:49:00 GMTServer: NCSA/1.4.2Content-type: text/html<HTML><HEAD><TITLE>CSE 373 Projects</TITLE></HEAD><BODY><H1>CSE 373: Information about Projects</H1><h2>Purpose</h2>The project is your opportunity to practicedesign and implementation of a solution to a problem,using data structures and algorithms, ina more realistic context than the preceding assignments have afforded.Not only can you experience the problem-solving process througha more complete sequence, but you also can choose your topic froma variety of choice options. Unlike the assignments so far, youare asked to work in groups of two people (with thepossible exception that those working on the OPSIS topic below mightbe asked to work separately). By working togetherwith a partner, you will be able to communicate with another personas you solve your problem together. If every student worked aloneon a totally different project, there could be a tendency foryou to become isolated and easily get stuck with technical problemsthat nobody else could help you with. The project will involvenot only analysis and implementation, but reporting in both writtenand oral forms. This is much like what a software development teamhas to do in a corporate environment when they are part of an R&Deffort, a custom software project, or a new product plan.So, the data structures and algorithms will be a key part of yourproject, but not the only part.<h2>Topics</h2><el><li>Applying graph algorithms to WWW URL data. This could includetaking a bunch of WWW documents, computing some basic features ofthem like number of words, links, images, headings, etc., to obtaina "feature vector" for each document, and then considering thecomplete graph on n of these documents with a weight on an edgerepresenting the "distance" between its two documents. Then a minimumspanning tree could be constructed in order to identify clustersof similar documents.<li>Using tree and graph data structures to represent and manipulateimages or maps. Possibilities include implementing pyramids asmultiresolution representations of images or implementingsets of chain codes to represent roads, political boundaries, rivers,and other linear features in maps. Here is some additional informationon <!WA0><a href="http://www.cs.washington.edu/education/courses/373/96a/image-proj.html">pyramids and quadtrees.</a><li>Implementing and comparing various types of binary search trees(such as splay trees, AVL trees, etc.) using the OPSIS visualprogramming system for data structures. Students selecting thisoption will not need to write a large program in C, C++or any other traditionallanguage but will do most of their work with a powerful,new visual editor fordata structure algorithms.Here is <!WA1><a href="http://www.cs.washington.edu/homes/amir/Opsis.html">more information on OPSIS.</a><li><!WA2><a href="http://www.cs.washington.edu/education/courses/373/96a/lisp-proj.html">Processing of symbolic expressions</a>. Linked lists are particularlyuseful in representing symbolic expressions such as mathematicalformulas, parts of computer programs, and representations of knowledgefor artificial intelligence systems.At their core, interpreters for language such as Lisp and Mathematicaare list processing systems. Students selecting this option willeither design their own list-oriented language and implement itin C++ or choose a small subset of Lisp, Mathematica or similarlanguage and implement that in C++.</el><p><H3>Project Milestones</H3><el><li>Wednesday, November 20. Topic descriptions due.You should have chosen a partner (unless youare doing the OPSIS option) and a topic by this time.Your description should include both partners' names, a titlefor the project, a paragraph explaining your topic and whatyou hope to accomplish. It should also explain how you andyour partner plan to divide up the work. Who will do what?Explain which computing platform you plan to use. List one ortwo references you have found that will help you in your project.How will the user interact with your program?<li>Between Monday, November 25 and Wednesday, November 27.Small group meetings with me to discuss your projects and anydifficulties you may be having.Here is the<!WA3><a href="http://www.cs.washington.edu/education/courses/373/96a/proj-signups.txt">current schedule.</a><li> December 6, 9. Project presentations.<li> December 11. Written reports due.</el><H3>Late policy for project milestones</H2><p><dd><li> Topic descriptions received after the due date will have 10%taken off.<li> Teams that do not meet with me by December 2 will have 10% taken off thewhole project grade.<li> Project reports turned in after 12:35 on Dec. 11 but by12:00 on Dec 12 will be docked 10% of the project grade, and there willbe another 10% off for each business day the report is late.Turning it in on Monday, Dec 16 means 30% off the project grade.Tuesday, Dec 17 it's 40% off, and at the final exam it is 50% off.If turned in after the final exam, no credit will be given for projects. <ul></ul><pre>Last update: 13 November 1996.</pre>S. Tanimoto</BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?