{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CourseReview - 4 Selection sort 4 Merge sort 4 Quicksort 4...

Info icon This preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC 2100B Data Structures 2 nd Term, 2006/2007 Course Review Lecturer: Leung Ho Fung Time: M7, 8 & T2 Page 1 of 8
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Assessment Scheme: Assignments: 40% (10% each) Quizzes: 20% (10% each) Examination: 40% z Each assignment includes written and programming parts. z There is no mid-term examination. z There will be two quizzes on 13 February and 20 March (45 min each). z The final examination lasts for 2 hours. Page 2 of 8
Image of page 2
What Will You Learn in this Course z Data Structures and Their Applications z Abstract Data Types and Their Implementations in Java z Introduction to Complexity Analysis z Advanced Java Programming (compared to CSC1130) Page 3 of 8
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Stacks 4 Push 4 Pop 4 Implementation Queues 4 Enqueue 4 Dequeue 4 Implementation Symbol Tables 4 Enter 4 Lookup 4 Implementation: Hashing; iterators Page 4 of 8
Image of page 4
Lists (not linked list !) 4 Head 4 Tail 4 Implementation: Cons, Empty Lists 4 Recursive programming
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 6
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4 Selection sort 4 Merge sort 4 Quicksort 4 Recursive programming Complexity 4 Big-O notation Page 5 of 8 Trees 4 Binary search trees ± Implementation ± Node insertion; node deletion ± Searching 4 AVL trees ± Node insertion: single / double rotations ± Searching 4 Expression trees 4 Tree traversals ± pre-order ± in-order ± post-order Page 6 of 8 Priority Queues 4 Priority-Enqueue 4 Priority-Dequeue 4 Implementation: partially ordered tree, heap Splay Trees 4 Splaying at a node B-Trees 4 Order of a B-tree 4 Key insertion Red Black Trees 4 Node insertion Page 7 of 8 Tries 4 Cost of a trie; Huffman’s algorithm Disjoint Sets 4 Union: Union-by-height 4 Find Graphs 4 Traversal ± Breath-first ± Depth-first 4 Shortest paths: Dijkstra’s algorithm 4 Minimum spanning trees: Kruskal’s algorithm 4 Minimum spanning trees: Prim’s algorithm Page 8 of 8...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern