[[courses:cs241-201301:lecture_notes]]
Trace: » lecture_notes

CMPU-241

Course Info
Final Exam Questions
Weekly Calendar
Lecture Notes
Homework Assignments
Project Topics
Homework Solutions
Project Assignments

Vassar College, Box 732
124 Raymond Ave.
Poughkeepsie, NY 12604
(845)437-5985 voice
(845)437-7498 fax
csdept@cs.vassar.edu

Cook's Theorem -- CNF-SAT in NP-Complete

The Turing Machine Introduction to NP-Complete

Network Flow (part 1) Network Flow (part 2)

RNA Folding Algorithm Edit Distance 





Dynamic Programming  Longest Common Subsequence





Prim's and Dijkstra's Algorithm





Greedy Algorithms  Binary Heap





Graphs  ——   Graphs part 2





Examples of Divide and Conquer





Radix Sort





Searching and Sorting ppt





Analysis of Quicksort





Solving recurrence relations-the master method





Big-Oh Notation





Stable Marriage



        

      
    
      

        

          

                    

          

          courses/cs241-201301/lecture_notes.txt · Last modified: 2013/04/23 13:14 by teneyck          

        

      


    


    
        
  


VCCS Top

Events
  
Extended Site Search

Login
  
Vassar Science Web

Vassar Home




  Driven by DokuWiki


  Valid XHTML 1.0