01-course-intro.ppt

01-course-intro.ppt - CS4102, Algorithms, Spring 2010 Dr....

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
CS4102, Algorithms, Spring 2010 • Course Mechanics • Homework issues to resolve • Course content • Topics from earlier classes • CS4102 course learning objectives • What’s the course all about? A quick tour Dr. Tom Horton horton.uva@gmail.com
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS 432, Algorithms: General Info • See beginning of course memo for general information • It’s a draft! We may alter HW information, exam dates, grade breakdown,… • Pre-requisites: • CS 2150 is absolutely required (with C- or better)
Background image of page 2
CS 432, Algorithms: General Info • Required Textbook: Algorithms , by Richard Johnsonbaugh and Marcus Schaefer • On reserve in library • Other references (also on reserve): • Your CS2150 textbook • The “old” textbook by Cormen et al • Other readings may be assigned • Definitely some handouts • Possibly web articles, PDFs
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Expectations • For a given week/unit, I will post in advance: • What I expect you to remember/review from earlier • What I expect you to read before class sessions • A set of problems you ought to be able to solve at the end of that week/unit • This will allow us to: • Have more interesting class sessions than just lecturing • A more successful educational experience (better grades) • Let’s all live up to our expectations (the high ones)!
Background image of page 4
Expectations: • Of you: • When asked, prepare for things in advance • Participate in class activities, some out-of-class activities • Act mature, professional. • Plan ahead. • Don’t take advantage. Follow the Honor Code. (See the BOCM.) • Of me: • Be fair, open, and considerate. • Seek and listen to your feedback. • Not to waste your time. • Be effective in letting you know how you’re doing
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Exam Info: • Three exams: • Exam 1, 22%. Thursday, Feb. 25 • Exam 2, 22%. Tuesday, Apr. 13 • Final exam, 22%. May 6, 2-4pm. • Final is half on topics after April 13, and half on earlier topics. • Issues? • Exam days: prefer Tuesdays to Thursdays? • Move exam(s) up to be a week earlier?
Background image of page 6
Other Class-work • Homework (worth 34% of your grade): • Could be a combination of: Problem sets. Traditional homework problems. Proofs, math, algorithms, etc. Programming-based assignments. Possibly experiment oriented. Involving programming. Groups or pairs. Probably done in parallel to other problems sets, with longer deadlines. One or two or ?. • Now, let’s talk about this…
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
• The Big Question: How does homework help you learn better? • “Learn better” might mean doing better on exams. • Possible student points of view: • Working through problems is better than just reading solutions. • Being required to turn it in makes me do it.
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 35

01-course-intro.ppt - CS4102, Algorithms, Spring 2010 Dr....

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online