50 likes | 137 Views
Course End and Evaluation Fall 2011. COSC2320 COSC6306. Course topics covered. Algorithms: Correctness: output, P/Q Efficiency: time complexity; best, worst (avg harder) Basic operations: search (1 element), traverse, sort Iteration versus recursion; tail/linear recursion
E N D
Course End and EvaluationFall 2011 COSC2320 COSC6306
Course topics covered • Algorithms: • Correctness: output, P/Q • Efficiency: time complexity; best, worst (avg harder) • Basic operations: search (1 element), traverse, sort • Iteration versus recursion; tail/linear recursion • C++ programming vs Java (exceptions, I/O, pointers) • Data structures: • arrays, matrices, lists, queues, stacks, trees, hash tables, graphs • advanced: graphs, NP-completeness • Relationship to other CS courses: • Theory: advanced algorithms, Automata, Computability • Systems: Compilers, Search engines, DB systems,
Homeworks=60% • 6 HWs as planned; always challenging • Students with very low grades had 2nd opportunity; 1st time • No HW7: Due to most having issues. • 6306 final presentation: even ps id functional arithmetic (HW4), odd ps id sorting (HW6)
Final Exam • Two choices: • Take home, long answer. Weight: Final=10%, midterm=30%; posted tomorrow • Official date (Dec/13), short answer. Final=20%, midterm=20% • Most students should agree (vote) about take home exam. Otherwise, final remains as scheduled.
Course evaluations • Learning: C++ programming, understand CS theory via programming • Lecture. Book/slides: too easy?, Board: challenge for instructor • Grade: undergrad. challenging, true measure of what you know? • Bottom line: Ranking vs other instructors • Feedback, future students, permanent: http://www.ratemyprofessors.com