Chapter 1

• I would like to follow the outline on page xxiii, but I will never be able to keep this pace.
  • 14 weeks x 3 classes per week = 42 classes.
  • But we will not sacrifice understanding for material.
• However, to even attempt this, you will need to read, and ASK QUESTIONS.
• So please give chapter 1 a read.
  • Some of this you know, I mean really know.
  • Some of this you know, but should think about again.
  • Some of this you don't know, but should.
• We are about to begin the study of Algorithms
  • In this case, we are most likely referring to "Known Named Algorithms"
  • Think Bubblesort
  • Not the things you write before you start coding
  • Think CSCI 125, 130, 230, 330, ....
• But by studying what has been done
  • We hope to make the second type of algorithm easier to create
  • Because we don't need to reinvent the wheel
  • Because we understand the mistakes and discoveries of others.
  • Because we have studied techniques by which algorithms are created.
• We will study some algorithms you already know
  • Some sorting and searching algorithms.
• Some you might (sort of ) know
  • Quicksort
  • Prim's, Kruskal's
• And some you don't
  • Some sorting algorithms,
  • The Gift Wrapping Algorithm
• We will study data structures associated with these algorithms.
  • Again some you know: arrays, lists
  • Some you might know: graphs, trees
  • And some you don't: heaps
• This class could be considered "Applied Discrete Math"
  • Some topics will overlap, depending on who you had for Discrete I
  • Or who you have now!
  • And some topics will overlap with Discrete II (A grand Class)
  • And some with Graph Theory (we will overlap a bit)
• It will involve proof, both formal and informal
• It will heavily involve algorithm analysis.
• And it will involve programming projects
  • Some will be continuing.
  • Some will be large
  • All will require reports and documentation.
• Read the quotes on page 1 and 2.
• What is computer science?