CSCE 310: Data Structures and Algorithms

Fall 2010, MWF 1:30-2:20pm

Room 109, Avery Hall

 

 

Instructor

TAs

Recitation TA

Grading TA

Name

Office

Office Hours

Email

Prof. Ying Lu

106 Schorr Center

MF 12:30-1:30pm

and by appointment

ylu at cse.unl.edu        

 

 
Maimaitituerxun Pazilijiang

122C Avery Hall

W 4:00-5:00pm at SRC (13 Avery)

 

paziljan at cse.unl.edu

Weiyue Xu

207 Schorr Center

Th 5:00-6:00pm at SRC (13 Avery)

 

weiyue at cse.unl.edu

 

 

Announcements:

·         Information about PAT, click here.

·         Information about Final Exam (1:00 to 3:00pm Wednesday, Dec 15 in Avery 109) Focused Sections, click here.

·        Dec 7: no lecture this Friday, instead, instructor will hold office hours 1:30-3:30pm this Friday in her office. Please come to discuss any problems you have when reviewing for the final exam.  

Syllabus

Class Roster

 

Lecture Notes

Reading List  

1. Administrivia

 

2. Introduction

Chap 1

3. Algorithm Analysis

Chap 2.1

4. Asymptotic Notations

Chap 2.2

5. Analysis of Nonrecursive Algorithms

Chap 2.3, Appendix A

6. Analysis of Recursive Algorithms

Chap 2.4, 2.5, Appendix B

7. Brute Force Algorithms

Chap 3

8. Divide and Conquer1: MergeSort and QuickSort

Chap 4.1, 4.2

9. Divide and Conquer2: Binary Search and Multiplication

Chap 4.3, 4.5

10. Divide and Conquer3: Closest Pair and Convex Hull

Chap 4.6

11. Decrease and Conquer1

Chap 5.2, 5.3, 5.4

12. Decrease and Conquer2

Chap 5.5, 5.6

13. AVL and 2-3 Trees

Chap 6.3

14. Heap and HeapSort

Chap 6.4

15. Space and Time Tradeoff

Chap 7.1, 7.2

16. Hashing

Chap 7.3

17. Computing a Binomial Coefficient and Longest Common Subsequence

Chap 8.1

18. Warshall’s and Floyd’s Algorithms

Chap 8.2

19. 0-1 Knapsack Problem

Chap 8.4

20. Greedy Algorithms MST

Chap 9.1, 9.2

21. Dijkstra’s Algorithm

Chap 9.3

22. Huffman Code

Chap 9.4

23. P, NP & NP-Complete

Chap 11.3

                                                       

Homework                                            Due Date

Homework1: Pretest (word) (lex) (pdf)                   1:30pm Sep 15

Homework2: (word) (lex) (pdf)                              1:30pm Oct 11

Homework3: (word) (lex) (pdf)                              1:30pm Nov 3

Homework4: (word) (tex) (pdf)                              1:30pm Nov 17        

Homework5: (word) (tex) (pdf)                              1:30pm Dec 6