What's new?

• March 8
  The drop deadline is March 10.
• March 8
  The unofficial grades are available (see grades). After these grades have been approved by the department, you will receive your official grade from the registrar's office.
• March 8
  The grades for the third test are available (see grades). According to departmental policy, the final (lab)tests are not returned to the students. You can wait a few weeks and pay to get a photocopy at the departmental office. However, you can also drop by my office this week and have a look at your (lab)test.
• March 3
  The grades for the third labtest are available (see grades). According to departmental policy, the final (lab)tests are not returned to the students. You can wait a few weeks and pay to get a photocopy at the departmental office. However, you can also drop by my office next week and have a look at your (lab)test.
• February 26
  The labtest will not contain any questions about recursion. The written test will contain questions about recursion.
• February 26
  In the labtest, some of the classes the APIs of which can be found here may play a role. You will not be asked to implement any of these classes, but you will be asked to implement a class which is closely related to some of these classes and you will also be asked to write some client code that uses some of these classes. The corresponding jar file can be found here.
• February 24
  The grades for the second labtest are available (see grades). After the labtests have been photocopied, you can pick them up outside office 3046 of the Computer Science and Engineering Building.
• February 22
  Material for final test/labtest: all material covered in the course with emphasis on recursion.
• February 20
  You can pick up test 2 outside office 3046 of the Computer Science and Engineering Building.
• February 19
  In

  Jon Bentley. Programming pearls: Writing correct programs. Communications of the ACM, 26(12):1040-1045, December 1983.

  the author describes the challenge of binary search. Over one hundred programmers were asked to implement binary search. Ninety percent of them had bugs in their code. This shows that binary search is subtle to implement. Note: link is only accessible from machines within York.
• February 19
  Code: Math, Search, Sort.
• February 16
  The grades for the second test are available (see grades). After the tests have been photocopied, you can pick them up outside office 3046 of the Computer Science and Engineering Building. The test was on the easy side (since the material was covered more than three months ago). Expect more challenging questions about recursion on the third test.
• February 8
  A draft of part of Chapter 8 can be found here.
  
• February 6
  Material for test 2 and labtest 2: Everything covered up to and including Week 7. Note however that GUI (covered in Week 8) is mainly an example of aggregation and inheritance and, hence, it is useful to study that material as well. No questions about buttons, text fields etc. will be asked.
• February 3
  Course evaluation will take place on Thursday February 5.
• February 3
  Code: Print and MyList.
• February 3
  Try to implement the following method using iteration. Do not spend more than 15 minutes on this question.

  /**
   Returns the maximal value of the arithmetic expression represented
   by the given list.  For example, the list [2, -8, 5, -9, -6] represents
   the arithmetic expression 2 - -8 - 5 - -9 - -6 (simply separate the 
   elements of the list by a -) and parentheses can be placed
   in any way.  For this example, the maximal value is 20 which is obtained
   by placing the parentheses as follows: ((((2 - -8) - 5) - -9) - -6).
   
   @param list list of integers that represent the arithmetic expression.
   @pre. list != null  and list.size() > 0
   @return the maximal value of the arithmetic expression represented
   by the given list.
  */
  public static int max(List list)
  

• February 2
  The revised calendar, the revised weight distribution and the revised office hours can be found here.
• February 2
  Chapter 7 can be found here.
  
• January 30
  Information about the modified dates can be found here. Announcements from the Senate can be found here.
• January 30
  There is a "Town Hall Meeting" by the Department of Computer Science and Engineering planned for Thursday, February 5, 2008 at 12:00 near the Eshrat Arjomandi Undergrad Teaching Lab of the Computer Science and Engineering Building. Pizza and pop will be available.
• January 21
  Chapter 6 can be found here.
  
• January 3
  Best wishes for 2009. Hopefully, classes will resume soon. If you have any questions or concerns, please do not hesitate to contact me.
• December 30
  The Executive Committee of Senate has revised a communication (Bulletin #6) on "Academic Remediation: Accommodations, Adjustments and Modifications" which contains important new and updated information. It can be found here. Note that tests will not be scheduled in the first five calendar days following the resumption of classes.
• December 8
  Today's office hours: 12:30-14:00
• December 2
  Chapter 5 can be found here.
  The note about the big O notation has been updated. The latest version can be found here.
• December 2
  This week's office hours:
  Tuesday December 2, 12:00-14:00 and 15:00-16:00
  Thursday December 4, 12:00-16:00
• November 23
  A note about the big O notation can be found here.
• November 21
  A number of practice questions about recursion can be found here.
• November 19
  I encourage you to already start reading the material on recursion. I will post a number of practice questions on the course webpage. I am in my office almost every day. If you want to drop by, please email me in advance so that I can let you know if I am available at that particular day and time.
• November 6
  Unfortunately, there is no test today since all academic activities have been cancelled. If you have any questions or concerns, please do not hesitate to contact me.
• November 5
  22 students submitted PEx06.
• November 5
  Some material about GUI can be found here.
• October 31
  The marked tests and labtests can be picked up from a box outside office 3046 in the Computer Science and Engineering Building.
• October 30
  The material for Test 2 is all the material covered until October 31. That is, the material mentioned on the calendar for Week 1-7.
• October 28
  15 students submitted PEx05.
• October 28
  The grades for the first test are available (see grades). After the tests have been photocopied, you can pick them up. When and where will be announced here.
• October 23
  Given the labtests this week, the deadline for PEx05 has been extended until October 26.
• October 18
  The course evaluation will take place on November 18 and 20.
• October 17
  18 students submitted PEx04.
• October 17
  The sample labtest can be found here.
• October 7
  The second half of Chapter 4 has been posted (see calendar).
• October 5
  The first half of Chapter 4 has been posted (see calendar).
• October 4
  28 students submitted PEx03.
• October 3
  An invitation to a lunch can be found here.
• October 2
  Due to the fact that the file server was not working very well today, you can still hand in PEx03 tomorrow.
• September 30
  The material for Test 1 is all the material covered until October 8.
• September 26
  Chapter 3 has been posted (see calendar).
• September 26
  42 students submitted PEx02.
• September 25
  The pex03.JarTester was not producing any output (because I forgot to include print statements). A new pex03.jar has been created. Now the pex03.JarTester should produce the desired output.
• September 23
  Since there is no official textbook, I have modified the text for the labtest from "During the labtest you may consult your textbook" to "During the labtest you will have access to an electronic copy of the notes (but the links to the actual code within the notes are disabled)".
• September 23
  Chapter 2 has been updated: Section 2.3.1 has been expanded and Section 2.3.2 is new.
• September 20
  Feedback for PEx01 has been mailed to your cse account. You can access your cse account at this URL.
• September 19
  Chapter 2 has been updated (fixed typos and added material).
• September 19
  50 students submitted PEx01.
• September 18
  Clips that show how to use Eclipse can be found here.
• September 16
  The first part of Chapter 2 has been posted (see calendar).
• September 12
  23 students submitted PEx00.
• September 11
  Page 24 of Chapter 1 has been modified.
• September 8
  Check out the York programming contests. The first contest September 12 from 13:00 to 15:00. Check out also this facebook group.
• September 7
  Chapter 1 has been posted (see calendar).
• September 6
  PEx00 has been posted (see calendar).
• September 6
  The article The profession of IT: voices of computing by Peter J. Denning can be found here (the PDF file is accessible from computers on campus).
• September 4
  The labs start September 9.
• September 4
  Welcome to the course.