CS341 Lecture Notes - Lecture 1: Sorting Algorithm, Algorithm Design, Code Reuse
21 Feb 2016
School
Department
Course
Professor
Document Summary
Bin ma, dc3345, email: binma@ office hours: thursday 10am-12pm. Lap chi lau, dc3120, email: lapchi@ office hours: monday 10am-12pm. Section 1: bin ma, wf 8:30am-9:50am, mc 2054. Section 2: lap chi lau, wf 11:30am-12:50pm, mc1056. Section 3: bin ma, wf 1:00pm-2:20pm, mc 2038. Section 4: lap chi lau, wf 4:00pm-5:20pm, mc 2038. But two lecturers will most likely lecture them differently and add different extra examples. Grading: 5 assignments (25%) + midterm (25%) + final exam (50%) Assignments: a mixture of programming and written solutions to problems. Announcements and online q&a will be done via piazza (https://piazza. com/class/iixb0lnf7s36ql#) The goal is to learn to design and analyze an algorithm. Learn skills to analyze the complexities of an algorithm; Learn skills to adapt an existing algorithm to solve new problems; In the pre-(cid:396)e(cid:395)uisite (cid:272)ou(cid:396)ses you"(cid:448)e al(cid:396)eady learned some algorithms, such as sorting, string matching. A defined procedure that takes some data as input, and computes a desired output.
