Template:CSFlag: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
[[CS|Computer Science Notes]] | [[CS|Computer Science Notes]] | ||
Part of the 2017 [https://charlesreid1.com:3000/cs/study-plan CS Study Plan]. | |||
| Line 22: | Line 22: | ||
Builtin features of Java: [[Java/Exceptions]] {{,}} [[Java/Memory]] {{,}} [[Java/Interfaces]] {{,}} [[Java/Comparators]] {{,}} [[Java/Iterable]] | Builtin features of Java: [[Java/Exceptions]] {{,}} [[Java/Memory]] {{,}} [[Java/Interfaces]] {{,}} [[Java/Comparators]] {{,}} [[Java/Iterable]] | ||
[[Java/Decorators]] {{,}} [[Java/Lambas]] {{,}} [[Java/Diamond Notation]] | [[Java/Generics]] {{,}} [[Java/Decorators]] {{,}} [[Java/Lambas]] {{,}} [[Java/Diamond Notation]] | ||
[[Java/Numeric]] {{,}} [[Java/TypeChecking]] {{,}} [[Java/Testing]] {{,}} [[Java/Timing]] {{,}} [[Java/Profiling]] | [[Java/Numeric]] {{,}} [[Java/TypeChecking]] {{,}} [[Java/Testing]] {{,}} [[Java/Timing]] {{,}} [[Java/Profiling]] | ||
| Line 30: | Line 30: | ||
External libraries: [[Apache Commons]] {{,}} [[Guava]] {{,}} [[Twitter4j]] | External libraries: [[Apache Commons]] {{,}} [[Guava]] {{,}} [[Twitter4j]] | ||
[[Java/OOP]] {{,}} [[Java/OOP/Patterns]] | [[Java/OOP]] {{,}} [[Java/OOP/Patterns]] {{,}} [[Java/Abstract Class]] {{,}} [[Java/Encapsulation]] {{,}} [[Java/Generics]] | ||
Revision as of 18:04, 18 June 2017
 |
Computer Science notes on computer science topics on the wiki, for educational and learning purposes
Part of the 2017 CS Study Plan.
Python/Builtin Functions · Python/OOP Builtin features of Java: Java/Exceptions · Java/Memory · Java/Interfaces · Java/Comparators · Java/Iterable Java/Generics · Java/Decorators · Java/Lambas · Java/Diamond Notation Java/Numeric · Java/TypeChecking · Java/Testing · Java/Timing · Java/Profiling Tools and functionality: Java/URLs · Java/CSV · Java/Twitterbots External libraries: Apache Commons · Guava · Twitter4j Java/OOP · Java/OOP/Patterns · Java/Abstract Class · Java/Encapsulation · Java/Generics
|
|
|
Data Structures Part of Computer Science Notes
This is the staging ground for computer science notes as part of the 2017 CS Study Plan.
Classes of data structures: Abstract Data Types Array-based and Link-based memory management: ArrayLists and Linked Lists Algorithmic Analysis of Data Structures: Algorithmic Analysis of Data Structures Advanced data structures: Advanced Data Structures
|
|
|
Arrays Part of Computer Science Notes
Series on Data Structures Python: Arrays/Python · Arrays/Python/Sizeof · Arrays/Python/AppendCost · Arrays/Python/CaesarCipher · Arrays/Python/CompactArrays · Arrays/Python/DynamicArray Java: Arrays/Java · Arrays/Java/CaesarCipher · Arrays/Java/FisherYates · Arrays/Java/PythonList · Arrays/Java/Repeatedly_Remove Categories: Category:Python Arrays
|
|
|
Stacks and Queues Part of Computer Science Notes
Series on Data Structures
Stacks and Queues: Python StacksQueues/Python · StacksQueues/Python/ArrayStack · StacksQueues/Python/ArrayQueue · StacksQueues/Python/ArrayDeque StacksQueues/Python/LinkedStack
Stacks and Queues: Java StacksQueues/Java · StacksQueues/Java/ArrayStack · StacksQueues/Java/ArrayQueue · StacksQueues/Java/ArrayQueueFS · StacksQueues/Java/ArrayDeque StacksQueues/Java/LinkedStack · StacksQueues/Java/LinkedQueue · StacksQueues/Java/LinkedDeque
Applications Postfix_Expressions#Stacks · StacksQueues/Subsets · StacksQueues/Subsets/Java
|
|
|
Priority Queues and Heaps Part of Computer Science Notes
Series on Data Structures
Java: Priority Queues/Java · Priority Queues/ADT · Priority Queues/Sorted · Priority Queues/Unsorted Performance: Priority Queues/Timing and Performance Applications: Maximum Oriented Priority Queue · Priority Queues/Stack
Priority Queues/Heap · Priority Queues/Java · Priority Queues/Comparators
|
|
|
Linked List Part of Computer Science Notes
Series on Data Structures Java: Linked Lists/Java · Linked Lists/Java/Single · Linked Lists/Java/Double · Linked Lists/Java/Circular Performance: Linked Lists/Java/Timing · Linked Lists/Java/Reverse Python: Linked Lists/Python · Linked Lists/Python/Single
|
|
|
Trees Part of Computer Science Notes
Series on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder In-Order traversal: Binary Trees/Inorder Breadth-First Search: BFS Breadth-First Traversal: BFT Depth-First Search: DFS Depth-First Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
|
|
|
Search Trees Part of Computer Science Notes
Series on Data Structures
Binary Search Trees · Balanced Search Trees Trees/OOP · Search Trees/OOP · Tree Traversal/OOP · Binary Trees/Inorder
(Note that heaps are also value-sorting trees with minimums at the top. See Template:PriorityQueuesFlag and Priority Queues.)
|
|
|
Maps and Dictionaries Part of Computer Science Notes
Series on Data Structures
Maps/Dictionaries Maps · Maps/ADT · Maps in Java · Maps/OOP · Maps/Operations and Performance Map implementations: Maps/AbstractMap · Maps/UnsortedArrayMap · Maps/SortedArrayMap Dictionary implementations: Dictionaries/LinkedDict · Dictionaries/ArrayDict
Hashes Hash Maps/OOP · Hash Maps/Operations and Performance Hash Maps/Dynamic Resizing · Hash Maps/Collision Handling with Chaining Hash functions: Hash Functions · Hash Functions/Cyclic Permutation Hash map implementations: Hash Maps/AbstractHashMap · Hash Maps/ChainedHashMap
Skip Lists · Java/ConcurrentSkipList · Java implementations: SkipList
Sets Sets · Sets/ADT · Sets in Java · Sets/OOP · Multisets
|
|
|
Algorithms Part of Computer Science Notes
Series on Algorithms
Algorithms/Sort · Algorithmic Analysis of Sort Functions · Divide and Conquer · Divide and Conquer/Master Theorem Three solid O(n log n) search algorithms: Merge Sort · Heap Sort · Quick Sort Algorithm Analysis/Merge Sort · Algorithm Analysis/Randomized Quick Sort
Algorithms/Search · Binary Search · Binary Search Modifications
Algorithms/Combinatorics · Algorithms/Combinatorics and Heuristics · Algorithms/Optimization · Divide and Conquer
Algorithms/Strings · Algorithm Analysis/Substring Pattern Matching
Algorithm complexity · Theta vs Big O Amortization · Amortization/Aggregate Method · Amortization/Accounting Method Algorithm Analysis/Matrix Multiplication
Estimation Estimation · Estimation/BitsAndBytes
Algorithm Practice and Writeups Project Euler · Five Letter Words · Letter Coverage
|