Lecture Notes on 02 May 2022

* Test 3 is on Friday (06 May 2022) at 6 pm. You get 4 hours to
  finish the test. 

* Here is the study guide for Test 3:
https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/StudyGuide3.txt

* Make sure that you have done the course evaluation and uploaded a
  screenshot on Canvas.

* There is NO class on Friday (06 May 2022) and no office hours next
  week.
                
* Climbing Stairs:
  Imagine that you have a long flight of stairs to climb. You can 
  take either 1 step, or 2 steps, or 3 steps or any combinations of 
  the three ways to get to the top. Complete the worksheet to get
  the answer.

https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/Climb_Stairs.pdf

https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/Climb_Stairs.docx

* Longest Common Subsequence: 
  Given two strings p and q return the length of the longest common 
  subsequence. A common subsequence is a sequence of characters that 
  appears in the same relative order in both strings but are not 
  necessarily contiguous.

https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/Longest_Common_Subsequence.pdf

https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/Longest_Common_Subsequence.docx

* Weighted Job Scheduling: 
  A job is characterized by {Start Time, Finish Time, Profit}. Given 
  a set of jobs chose a subset of jobs that are non-overlapping with 
  maximum profit.  

https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/Weighted_Job_Scheduling.pdf

https://www.cs.utexas.edu/users/mitra/csSpring2022/cs313/notes/Weighted_Job_Scheduling.docx