Courses‎ > ‎AP Computer Science 2‎ > ‎Platek‎ > ‎

Homework

20. Due Thurs. 3/30
       Exam #3 : 3/31  - Stack.java, ArrayStack.java, DoublingArrayStack.java, DNode.java, DLinkedList.java
     Review DLinkedList.java
     Complete the methods:  remove(DNode<E>), removeFirst(), removeLast(), remove(int).
19. Due Wed 3/28
     Exam #3 : 3/31  - Stack.java, ArrayStack.java, DoublingArrayStack.java, DNode.java, DLinkedList.java
     Review DLinkedList.java
     Complete the methods:  addAtrer(DNode<E>, DNode<E>), addFirst(DNode<E>), addFirst(E).
18. Due Mon. 3/27
       *** St. Joseph's Programming competition is on Wed. May 24. 
            Registration is next week.  See Mr. Brooks if you'd like to join
      *****
       Exam Fri. 3/31
       Correct previous exam.
17. Due Fri. 3/24
         Complete the DoublingArrayStack.
         Read Labs/Stack/Infix/InfixCalculator.txt

16. Due: Thurs. 3/23
          Complete questions 1 - 3 in the DoublingArrayStack class.

15.    On Monday, 3/20 at 4pm in room 307, Phillip Compeau, a professor at Carnegie Mellon University will 
       be giving a video talk about 
Computational Biology. The talk should be a primer on Computational Biology, while also
         talking a bit about CMU’s brand new major in that field that they are launching in the fall of 2017. This is going to
         be a good talk and a chance for you to see another potential field in CS.

14. Due. Tues 3/14 - Exam 3/17
                                - Complete the reverse() method from Lab_II.txt.
13. Due Mon. 3/13 - Exam 3/17
                               - Complete the swap(Node, Node) method from Lab_II.txt
12. Due Fri. 3/10 - Review the code  in Labs/LinkedList.
      Write the SLinkedList method append(SLinkedList L) that concatenates two lists in O(n) time.
      Let n be the number of elements in the resulting list.
     Here's an example, 
     S = [ a,b]
     M = [ c,d,e]
     S.append(M) -> [a,b,c,d,e]
     M.append(S) -> [c,d,e,a,b]
     Neither S nor M should be modified (no side effects). 

    public SLinkedList append(SLinkedList L){}



11. Due. Tues. 3/7 - Correct Exams,
                              - Review Labs/Node/LN.java
                              - You will be given time in class tomorrow to work on questions 5 and 6.
10. Due. Mon. 3/6  - Sudy Labs/Node/LN.java
                               - Complete questions 1 - 4 in LN.java
9. Due Thurs 3/2 - Study Labs/Node/Node.java
                            - implement the print() and printReverse() methods of LN.java
8. Due Wed. 3/1 - study Labs/QuickSort/Quick.java 
                           - Answer this question:
                               Under what circumstances would you not use a quick sort? Explain your
                               answer in a written statement.

7. Due Thurs., 2/16 - Exam 2/17 
                                       Topics:  Merge (arrays and lists), MergeSort, SelectionSort, InsertionSort, Partition
                                 - Complete Labs/Partition
6. Due Wed. 2/15 - Exam 2/17
                                  Topics:  Merge (arrays and lists), MergeSort, SelectionSort, InsertionSort, QuickSort.
                               - Review : Labs/Merge/MergeList
                                                Labs/MergeSort/MergeSortArrayR.java
5. Due Tues. 2/14 - Exam 2/17
                             - Review Labs/Merge/Merge.java
                             - Complete Labs/Merge/MergeListLab
4. Due Wed. 2/8 - Exam 2/17
                           - Review the NumToEng,java solution.
                           -  Start the toRoman(int) method of the Roman class.
                               convert the integers from  1 to 20 only.
3. Due Tues 2/7 - Extend NumToEng to include all positive integers. Upto and including Integer.MAX_VALUE.
2. Due Mon. 2/6 - See hw02.txt posted below.
1, Due Thurs. 2/2 - Classwork/HailStone/HailStone.txt (and HailStone.java)
ċ
hw02.txt
(1k)
Rick Platek,
Feb 3, 2017, 11:38 AM
Comments