week-1 - CSE 830: Design and Theory of Algorithms Dr....

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

View Full Document Right Arrow Icon
1 CSE 830: Design and Theory of Algorithms Dr. Charles Ofria Overview • Administrative stuff… • Rules of the game • What is an algorithm? • Systems for studying algorithms • Some examples • Lecture schedule overview Course Info • Textbook: Introduction to Algorithms, Second Edition by Cormen, Leiserson, Rivest, and Stein • Web page: http://www.cse.msu.edu/~ofria/cse830/ • My Info: 2140 Engineering, 355-8389, ofria@msu.edu • Office Hours: Mondays, 10am-11am and by appointment.
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Tentative Grading 25% Homework (5 assignments worth 5% each) 10% Programming Project 20% Exam I 20% Exam II 25% Final Exam What would you prefer? - Quizzes? (more frequent, but easier than exams) - More Programming? - More take-home assignments? Homework • 5 Homework Assignments • You must work in small groups ; 2-3 students per group. Only hand in one written set of answers. • A single homework is allowed to be a week late; otherwise 20 points off per class session. • Re-grades can go in either direction! Project • You will be given a hard problem and you need to write a program to solve it correctly and efficiently. • This is not a group project - everyone must write their own. • Prizes will be given out for the best solutions.
Background image of page 2
3 Exams • There will be three exams over the course of the semester. • All exam questions will be made available ahead of time - with many others. • I typically give 140 points of questions on an exam, but you only need to answer 100 points worth. • Exams are cumulative. What is an Algorithm? According to the Academic American Encyclopedia: An algorithm is a procedure for solving a usually complicated problem by carrying out a precisely determined sequence of simpler, unambiguous steps. Such procedures were originally used in mathematical calculations (the name is a variant of algorism, which originally meant the Arabic numerals and then "arithmetic") but are now widely used in computer programs and in programmed learning. What is an Algorithm? Algorithms are the ideas behind computer programs. An algorithm is the thing that stays the same whether the program is in C++ running on a Cray in New York or is in BASIC running on a Macintosh in Katmandu! To be interesting, an algorithm has to solve the general form of a well-defined problem. An algorithmic problem is specified by describing the set of instances it must work on and what desired properties the output must have.
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Example: Sorting Input : A sequence of N numbers a 1 …a n Output : the permutation (reordering) of the input sequence such that a 1 a 2 a n . We seek algorithms that are
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 21

week-1 - CSE 830: Design and Theory of Algorithms Dr....

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

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