Understanding Cis 2353 Week 14 Lecture
Let's dive into the details surrounding Cis 2353 Week 14 Lecture. Priority Queues, Heaps, and Compression Techniques.
Key Takeaways about Cis 2353 Week 14 Lecture
- Java Collections Framework introduction. ArrayLists and LinkedLists, the List and Collection interfaces. Abstract classes and ...
- Overview of the course and the syllabus. Fall 2015. Prof. John P. Baugh, Oakland Community College.
- Review of Java language, variables, constants, methods, object-oriented programming, overloading and overriding methods, ...
- Binary Trees, Binary Tree Theorem, paths, levels (depths), height, root, intermediate nodes, children, parents.
- A SinglyLinkedList toy class, usage of LinkedList from the JFC. Doubly linked list and usage.
Detailed Analysis of Cis 2353 Week 14 Lecture
Brief Introduction to Hashing. TreeMaps and TreeSets, Red-Black trees, honorable mention of AVL trees. An introduction to Stack and Queue concepts.
Algorithm Analysis, Run-time analysis, and random numbers.
That wraps up our extensive overview of Cis 2353 Week 14 Lecture.