|
Dates
|
Material
|
Homework & Tests
|
Announcements and notifications
|
| Mon, Jan 8 |
Topic: Rules of the game, Introduction.
Required reading: Preface, Section 1.1 |
|
Check new Syllabus for grading and homework return policy. |
| Wed, Jan 10 |
Topic: Introduction
Required reading: Preface, Sections 1.2, 1.3 |
Pretest on Friday in class.
No take home portion.
Closed book. |
Students w/o 235 should contact instructor ASAP. |
| Fri, Jan 12 |
Pretest
|
| Mon, Jan 15 |
Martin Luther King Day
|
| Wed, Jan 17 |
Topic: Correction of the pretest. Divide and conquer.
Required reading: Preface Section 1.3 |
|
Your copies of the pretest will be distributed and the pretest will be
corrected in class. Then all copies must be returned to the instructor
for grade collection (If you don't return your copy, your grade will be
null). If you have any question about your grade
you must discuss it with the TA during her office hours by
Jan 24, 2001. No claim after that date will be taken in consideration.
After all copies are collected, grades will be adjusted.
You are required to check in the list distributed in class whether you
are an honor student (H) or not (N).
Announcement will be made in class.
|
| Fri, Jan 19 |
Topic: Asymptotic notations
Required reading: Chapter 2, Section 2.1 |
|
|
| Mon, Jan 22 |
Topic: Asymptotic notations (again!) and Elementary Data Structures
Required reading: Same as previous lecture + Chapter 11, Section
11.1 |
|
|
| Wed, Jan 24 |
Topic: Elementary Data Structures
Required reading: Chapter 11, Section 11.1 |
Homework 1 (MSWord) assigned. |
|
| Fri, Jan 26 |
Topic: Elementary Data Structures
Required reading: Chapter 11, Section 11.2, 11.4 |
|
Section 11.3 not discussed but may be of interest to you |
| Mon, Jan 29 |
Topic: Review of recursion
Required reading: handout (PS), (PDF) |
|
|
| Wed, Jan 31 |
Topic: Solving recurrence
Required reading: Chapter 4, section 4.1 |
|
Slides for Recurrence (PS), (PDF)
are fixed |
| Fri, Feb. 2 |
Topic: Solving recurrence
Required reading: Chapter 4, section 4.1 |
|
Two new undergraduate TAs, Ms Gennette Gill and Mr. Joel Gompert,
will be working with the Grad TA and the instructor to make this class
most profitable to you all. |
| Mon, Feb. 5 |
Topic: Exercises in class
Required reading: Recurrence, data structure, etc. |
|
The instructor is out of town. The TAs will replace her
and do lots of tricky exercises, typical exam questions. Do
not miss.. or you can only blame yourself :--( |
| Wed, Feb. 7 |
Topic: Solving recurrence
Required reading: Chapter 4, sections 4.2 and 4.3 |
Homework 1 due.
Must be returned before the lecture. |
|
| Fri, Feb. 9 |
University closed for inclement weather
|
| Mon, Feb. 12 |
Topic: Graphs
Required reading: Chapter 5, Section 5.4 |
Homework2.doc assigned. |
|
| Wed, Feb. 14 |
Topic: Trees
Required reading: Chapter 5 (Section 5.5), Chapter 13, Section
13.1
Recommended reading: Proofs of Theorem 5.2, Notes from
Dr. Cusack (PS,
PDF). |
|
|
| Fri, Feb. 16 |
Topic: Trees and Heaps
Required reading: Chapter 5 (Section 5.5), Chapter 13, Section
13.1
Recommended reading: Proofs of Theorem 5.2. |
|
|
| Mon, Feb. 19 |
Topic: Heaps and Heapsort
Required reading: Chapter 7, Sections 7.1, 7.2, 7.3, 7.4,
and 7.5 |
Correction of Homework1 in class. |
For point claims, contact TAs: Gill and Gompert for questions
1 to 7; Li for questions 8, 9, and 10
You have until Friday Feb 23rd 6:00 pm for claiming points. After
that time, no claim will be received. |
| Wed, Feb. 21 |
Topic: Heaps, Heapsort, Priority queues
Required reading: |
|
|
| Fri, Feb. 23 |
Topic: Quicksort
Required reading: Chapter 8, Sections 8.1, 8.2, and notes from
Dr. Cusack |
|
|
| Mon, Feb. 26 |
Topic: Quicksort
Required reading: same as above |
Homework2 is due. |
|
| Wed, Feb. 28 |
Review
|
| Fri, Mar 2 |
Mid-term
|
Homework3.doc
assigned.
Check header file and comments on
cse.unl.edu:~cse310/HWK3/HEAP/
Or through the web. |
|
| Mon, Mar 5 |
Topic: Sorting in linear time
Required reading: Chapter 9, Section 9.2 and 9.3 |
|
|
| Wed, Mar 7 |
Topic: Radix sort
Required reading: |
|
Instructor out of town. Replaced by Ms. Gennette Gill. |
| Fri, Mar 9 |
Topic: Hash tables
Required reading: Chapter 12, Sections 12.1, 12.2, and 12.3 |
Part 1 Homework3 is due. |
|
| Mon, Mar 12 |
Spring vacation
|
| Wed, Mar 14 |
| Fri, Mar 16 |
| Mon, Mar 19 |
Topic: Hash tables
Required reading: Chapter 12, Sections 12.1, 12.2, and 12.3 |
|
HWK2 has been retuned. For questions and claims, contact the
TAs. For questions [1,5] Xin Li, and question 6, Gennette Gill.
You have until Friday Mar 23rd 6:00 pm for claiming points. After
that time, no claim will be receive |
| Wed, Mar21 |
Topic: Hash tables
Required reading: Chapter 12, Sections 12.1, 12.2, and 12.3 |
|
|
| Fri, Mar 23 |
Topic: Hash tables
Required reading: Chapter 12, Sections 12.1, 12.2, and 12.3 |
Part II Homework 3 is due. |
|
| Mon, Mar 26 |
Topic: Hash tables
Required reading: Chapter 12, Sections 12.3 and 12.4 |
|
|
| Wed, Mar 28 |
Topic: Hash tables
Required reading: Chapter 12, Section 12.4 |
Homework 4 assigned |
|
| Fri, Mar 30 |
Topic: Hash tables
Required reading: Chapter 12, Section 12.4 |
|
|
| Mon, Apr 2 |
Topic: Dynamic Programming
Required reading: Chapter 16, Sections 16.1, 16.2
Recommended reading: Section 16.3 and 16.4 |
|
|
| Wed, Apr 4 |
Topic: Dynamic Programming
Required reading: Chapter 16, Sections 16.1, 16.2
Recommended reading: Section 16.3 and 16.4 |
|
|
| Fri, Apr 6 |
Topic: Dynamic Programming
Required reading: Chapter 16, Sections 16.1, 16.2
Recommended reading: Section 16.3 and 16.4 |
|
CLASS WILL BE HELD IN FERGUSON 111
|
| Mon, Apr 9 |
Topic: Dynamic Programming
Required reading: Chapter 16, Sections 16.1, 16.2
Recommended reading: Section 16.3 and 16.4 |
Homework4 due
Homework5
assigned |
|
| Wed, Apr 11 |
Topic: Dynamic programming, Greedy algorithms
Required reading: Chapter 17, Sections 17.1, 17.2, and 17.3
Recommended reading: Sections 16.3 and 16.4 |
|
|
| Fri, Apr 13 |
Topic: Greedy algorithms
Required reading: Chapter 17, Sections 17.1, 17.2, and 17.3 |
|
|
| Mon, Apr 16 |
Topic: Greedy algorithms
Required reading: Chapter 17, Sections 17.1, 17.2, and 17.3 |
|
|
| Wed, Apr 18 |
Topic: Greedy algorithms
Required reading: Chapter 17, Sections 17.1, 17.2, and 17.3 |
|
|
| Fri, Apr 20 |
Help session replaces lecture.
Please check time change. Location is same. |
Homework 5 due. |
Class canceled for Engineering Day and Kauffman
Center dedication ceremony.
Help session will be held from 10:30 am to 11:20 am
in Ferguson Room 217
|
| Mon, Apr 23 |
Topic: Greedy algorithms and Elementary graph algorithms
Required reading: Chapter 17, Chapter 23
Recommended reading: proofs in chapter 23 |
|
 Cool animations: Dynamic
Programming, Huffman
code |
| Wed, Apr 25 |
Topic: Elementary graph algorithms
Required reading: Chapter 23
Recommended reading: proofs in chapter 23 |
|
|
|
Fri, Apr 27
|
Review
|
| Thu, May 3 |
Final exam from 1:00 p.m. to 3:00 p.m.
This is a CLOSED-BOOK exam.
However, you may bring *ONE* (1) 8 1/2" x 11" sheet as crib sheet.
You may use both sides of the sheet and write as small as you like. You
sheet needs to be *HANDWRITTEN*. No photocopies, typewritten paper,
electronic/mechanical reproductions are allowed. You *MUST* hand
in your crib sheet when you hand in your exam.
Best of luck.
|