The extra credit problems are to be done on separate sheets of paper and handed in near the end of the trimester. The programming problems will require you to turn in your program on blackboard, details to follow later.
computer science
Description
• Please read the policy on plagiarism and on homework guidelines(in the course outline handed out on the first day) and remember that I enforce that policy. Email submissions will not be accepted.
• The extra credit problems are to be done on separate sheets of paper and handed in near the end of the trimester. The programming problems will require you to turn in your program on blackboard, details to follow later.
• Whenever you presenting an algorithm, remember that you should first give a short (2-3 lines) description of the main idea behind the algorithm before you get into the details of the pseudocode.
• If you are going to be using an algorithm discussed in class or the textbook (eg: Insertion Sort) you don’t have to write the pseudocode for that algorithm; you can just refer to it by name.
• Quiz 1 (open book, open notes) will be on 2/25/20 Tuesday and will cover those topics from the following list which we cover in Weeks 1, 2, 3.
Preliminaries: Review of elementary math concepts: logarithmic and exponential functions, Σ, Π, Algorithms:
how to specify, correctness, efficiency, worst case, average case and best case analysis, order of growth, big-oh
O() notation – Chapters 1 and 3. Sorting: Insertion Sort – Chapter 2. Ω() and Θ() notation – 3.1. Merge Sort
– 2.3. Counting Sort – 8.2. Review of elementary math concepts: permutations and combinations, proof by
induction, proof by contradiction.
