Skip to content

Syllabus

About

\begin{array}{|c|cccc|} \hline &Assignment &Quiz &Test\times 2 &Final \\ \hline Ratio & 30\% &20\% &30\% &20\%\\ \hline \end{array}

Syllabus

\begin{array}{|c|cll|} \hline & \text{Chapter} & \text{Topic} & \text{Assignment} \\ \hline 1 & 1, 2 & \text{Intro and loop invariant} & \text{2.1-3, 2.1-4, 2.2-2, 2.3-2,} \\ & & & \text{2.3-3, 2.3-4, 2.3-5, 2.3-6,} \\ & & & \text{2-2 and 2-4.} \\ \hline 2 & 3 & \text{Asymptotic notation} & \text{3.1-1, 3.1-2, 3.1-3, 3.1-4,} \\ & & & \text{3.1-6, 3.1-7, 3.1-8, 3-1,} \\ & & & \text{3-2 and 3-4.} \\ \hline 3 & 4 & \text{Divide and conquer} & \text{4.1-1, 4.1-2, 4.1-3, 4.2-1,} \\ & & & \text{4.2-2, 4.2-3, 4.3-1, 4.3-2,} \\ & & & \text{4.3-3 and 4.3-5.} \\ \hline 4 & 4 & \text{Solving recurrences} & \text{4.3-6, 4.3-7, 4.3-8, 4.3-9,} \\ & & & \text{4.4-1, 4.4-2, 4.4-3,4.4-4,} \\ & & & \text{4.4-5 and 4.5-1.} \\ \hline 5 & 1, 2, 3, 4 & \text{Test 1} & \text{-} \\ \hline 6 & 8 & \text{Comparison sort} & \text{8.1-1, 8.1-2, 8.1-3, 8.1-4,} \\ & & & \text{8.2-1, 8.2-2, 8.2-3, 8.2-4,} \\ & & & \text{8.3-1 and 8.3-4.} \\ \hline 7 & 15 & \text{Dynamic programming} & \text{15.1-2,15.1-3,15.2-1, 15.2-3,} \\ & & & \text{15.4-1,15.4-2,15.4-3,15.4-4,} \\ & & & \text{15.5-1 and 15.5-2.} \\ \hline 8 & 16 & \text{Greedy algorithms} & \text{16.1-1,16.1-2,16.1-3, 16.1-5,} \\ & & & \text{16.2-1, 16.2-2,16.3-1, 16.3-2,} \\ & & & \text{16.3-3 and 16.3-4.} \\ \hline 9 & 8, 5, 16 & \text{Test 2} & \text{- } \\ \hline 10 & 23 & \text{NP-completeness} & \text{16.1-4,16.2-4,16-1 and 16-2,} \\ & & & \text{23.1-1, 23.1-4, 23.1-6,} \\ & & & \text{23.1-10, 23.2-1, and 23.2-4.} \\ \hline 11 & \text{All above} & \text{Final} & \text{-} \\ \hline \end{array}