Please e-mail us with questions or feedback. You may also use this anonymous form which goes directly to Hunter.

Important Dates:

  • Tuesday, February 19: Midterm exam from 5:00-6:00pm
  • Tuesday, February 24: Last day to change to or from S/NS grade option; last day to drop courses using Annual Drop.
  • Tuesday, March 19: Final exam from 12:30-2:20pm

Announcements

    [01-06] Welcome to CSE 143! Some have asked what material they should know before enrolling in this class. Here are some resources to look at if you are unsure of what is covered in our prerequisite course CSE 142:
    • The following slide deck contains a review of the information that you should be mostly familiar with from 142 (or equivalent course) [ PDF, PPT]. The first couple lectures will have a little bit of review of the material at the end of the slide deck relating to classes and objects.
    • Try out our site used for practicing Java problems called PracticeIt! Here are some problems that may be good to review: flipLines, sameDashes, collapse, TimeSpan
    • Take a look at the exams page from last quarter's 142 to see if you feel confident with concepts covered on the practice material for the exam.

Calendar

Please keep in mind that Hunter is constantly updating this page. It should accurately describe the past, but it won't always accurately predict the future.

Lecture recordings can be found through Panopto on Canvas. We recommend that you treat the recordings as a supplement to going to lecture (or if you have to miss one day) rather than using the recordings as a replacement to going to lecture.

Readings marked as required (Req) are meant to be read after lecture that day and before the next lecture. Readings marked as supplementary (Sup) are listed if you need them, but are not necessary to read if you feel like you understood the material from lecture that day. The PracticeIt problems linked on the calendar are problems Hunter thinks you should be able to work on after lecture and the readings for that day; if you find that you aren't able to solve the problems, that is a good sign you should be going to section to get more practice but in a more structured learning environment.

Mon Tue Wed Thu Fri
  • folder 01-08

    Section 1: How to succeed in 143; ArrayList


  • folder 01-10

    Section 2: ArrayIntList


  • folder 01-15

    Section 3: Bad ArrayIntList


  • folder 01-17

    Section 4: Stacks & Queues

    HW1 Due


  • folder 01-21

    No school! :)


  • folder 01-22

    Section 5: List Nodes


  • folder 01-23

    LinkedIntLists & loops

    Reading:

    • Req: coming soon
    • Sup: 16.2 from BJP

    Videos:


  • folder 01-24

    Section 6: LinkedLists with loops

    HW2 Due


  • folder 01-25

    Advanced LinkedIntList

    Reading:

    • Req: coming soon
    • Sup: 16.3 from BJP

    Videos:

    HW3 Released


  • folder 01-29

    Section 7: Harder LinkedList problems


  • folder 01-31

    Section 8: Sets & Maps

    HW3 Due


  • folder 02-01

    More maps

    HW4 Released


  • folder 02-05

    Section 9: Recursive tracing


  • folder 02-07

    Section 10: Recursive Programming

    HW4 Due


  • folder 02-08

    Regular expressions; grammars

    Reading:

    • Req: coming soon
    • Sup: pages 698-690 from BJP

    HW5 Released


  • folder 02-12

    Section 11: Inheritance


  • folder 02-13

    Wrap Up Inheritance; Some Midterm Review


  • folder 02-14

    Section 12: Midterm Review

    HW5 Due


  • folder 02-15

    Exhaustive search

    Reading:

    • Req: coming soon
    • Sup: 12.5 from BJP


  • folder 02-18

    No school! :)


  • folder 02-19

    Section 13: Exhaustive search

    Midterm at 5:00pm


  • folder 02-20

    More recursive backtracking


  • folder 02-21

    Section 14: Recursive backtracking


  • folder 02-22

    TBD

    HW6 Released


  • folder 02-26

    Section 15: Binary Trees 1


  • folder 02-27

    Binary search trees

    Reading:

    • Req: coming soon
    • Sup: 17.3-17.4 from BJP

    Videos:


  • folder 02-28

    Section 16: Binary Trees 2

    HW6 due


  • folder 03-01

    Comparable; Generic binary search tree

    Reading:

    • Req: coming soon
    • Sup: 10.2 from BJP

    Videos:

    HW7 released


  • folder 03-04

    Collections case study; Abstract classes

    Reading:

    • Req: coming soon
    • Sup: 9.3, 17.5 from BJP


  • folder 03-05

    Section 17: Comparable


  • folder 03-06

    Huffman coding

    HW8 Released


  • folder 03-07

    Section 18: LinkedList review

    HW7 Due


  • folder 03-08

    ArrayIntList; Iterators

    Reading:

    • Req: coming soon
    • Sup: 15.3 from BJP


  • folder 03-11

    Hashing

    Reading:

    • Req: coming soon
    • Sup: 18.1 from BJP


  • folder 03-12

    Section 19: Exam Review


  • folder 03-13

    Exam review


  • folder 03-14

    Section 20: Exam review

    HW8 Due


  • folder 03-15

    Course Wrap Up and What's Next