Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
cs-312:syllabus [2015/04/14 09:14]
ringger
cs-312:syllabus [2015/04/14 16:57] (current)
ringger
Line 3: Line 3:
 == Description and Objectives == == Description and Objectives ==
  
-Welcome to CS 312!  This course will provide an introduction to the analysis and design of algorithms. ​ The course adopts both a theoretical (mathematical) and a practical perspective. ​ Algorithms solve problems, and we will explore a wide variety of problems, some relatively abstract and some down-to-earth. ​ Practical application domains include cryptography,​ geometry, 3-D graphics, image processing, bioinformatics,​ logistical planning, route planning, and artificial intelligence. ​ More abstract applications include combinatoric optimization and graph theory. ​ As such, CS 312 provides an excellent mathematical foundation and will serve as a gateway to problem solving in other domains.+Welcome to CS 312!  This course will provide an introduction to the analysis and design of algorithms. ​ The course adopts both a theoretical (mathematical) and a practical perspective. ​ Algorithms solve problems, and we will explore a wide variety of problems, some relatively abstract and some down-to-earth. ​ Practical application domains include cryptography,​ geometry, image processing, bioinformatics,​ logistical planning, route planning, and artificial intelligence. ​ More abstract applications include combinatoric optimization and graph theory. ​ As such, CS 312 provides an excellent mathematical foundation and will serve as a gateway to problem solving in other domains.  The domain of CS 312 is one of the key areas of focus for technical interviews, because of the centrality of the topic to computer science. ​ Doing well in this class will help you excel as a computer scientist and software engineer.
  
 We will explore several families of algorithms, with the ability to solve problems of increasing complexity:  ​ We will explore several families of algorithms, with the ability to solve problems of increasing complexity:  ​
Line 237: Line 237:
 | 15% | 15%
 |} |}
 +
 +Note that the Learning Suite gradebook includes a category called "​Project Raw Scores"​. ​ That category has 0 weight and is there only for internal TA and instructor purposes. ​ Please disregard that section.
  
 === Grade Scale === === Grade Scale ===
Line 350: Line 352:
  
 I reserve the right to update and clarify the syllabus throughout the semester. ​ Similarly, other elements of the course wiki will be updated in light of clearer thinking on my part and prompted by your questions and requests for clarification. I reserve the right to update and clarify the syllabus throughout the semester. ​ Similarly, other elements of the course wiki will be updated in light of clearer thinking on my part and prompted by your questions and requests for clarification.
- 
cs-312/syllabus.1429024441.txt.gz ยท Last modified: 2015/04/14 09:14 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0