{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lec1_IntroNPC

# Lec1_IntroNPC - COT 6936 Topics in Algorithms Giri...

This preview shows pages 1–14. Sign up to view the full content.

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 [email protected] http://www.cs.fiu.edu/~giri/teach/COT6936_S12.html https://online.cis.fiu.edu/portal/course/view.php?id= XXX Purpose of this class • First course in algorithms is inadequate preparation for most PhD students – Learn standard techniques – Solve standard problems – Learn basic analysis techniques – Need to go beyond that! • This course – Model/formalize a problem – Leverage existing solutions – Create your own solutions 1/9/12 COT 6936 2 Expectations • Attend class • Do required reading before class • Participate in class discussions • Team work; discussion groups • Solve practical research problems • Make a presentation; write a report – need a research component; may implement • Write research paper • No cell phones, SMS, or email during class 1/9/12 COT 6936 3 1/9/12 COT 6936 4 Evaluation • Exam (1) 20% • Quizzes 5% • Homework Assignments 15% • Semester Project 40% • Class Participation 20% Semester Project & Exam Schedule • Milestones: – By Jan 23: Meet with me and discuss project – By Jan 30: Send me email with project team information and topic – Feb 20 : Short presentation giving intro to project, problem definition, notation, and background – March 5 : Take-home Exam – April 16, 23 : Final presentation of project – April 24 : Written report on project 1/9/12 COT 6936 5 1/9/12 COT 6936 6 Why should I care about Algorithms ? Cartoon from Intractability by Garey and Johnson 1/9/12 COT 6936 7 Why are theoretical results useful? Cartoon from Intractability by Garey and Johnson 1/9/12 COT 6936 8 Why are theoretical results useful? Cartoon from Intractability by Garey and Johnson What if efFcient algorithms don ’ t exist • Find good approximation algorithms – Quality of the solution is guaranteed • Find good heuristic algorithms • Understand nature of inputs in practice • Perform many experiments after implementing 1/9/12 COT 6936 9 1/9/12 COT 6936 10 If you like Algorithms, nothing to worry about! Classical (Theoretical) Algorithmic Model • Input-output description provided • Input provided & stored in memory • Output computed & stored or output immediately • Entire program stored in memory • Algebraic Computation-Tree Model ( Variants : indirection, floor function, square root) • Space (?) and time (?) efficiency • Deterministic and Sequential algorithms • Worst-case analysis • No other factors to consider 1/9/12 COT 6936 11 Find a “ good ” student • Director of SCIS says to you: “ Find me a good CS student. ” • You ask: “ What do you mean by good ? ” • Director says: “ S/he must be at least as good as at least half of our current students. ” 1/9/12 COT 6936 12 Naïve Solution • Solution 1 – Email (or contact or inspect) N / 2 + 1 students and pick best among them – Too inefficient • Solution 2 – Pick a random student – May be wrong...
View Full Document

{[ snackBarMessage ]}

### Page1 / 59

Lec1_IntroNPC - COT 6936 Topics in Algorithms Giri...

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

View Full Document
Ask a homework question - tutors are online