Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Binary Search Tree Insert Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST insert. | OpenDSA | Binary Search Tree |
| 2 | Binary Search Tree Remove Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST remove. | OpenDSA | Binary Search Tree |
| 3 | Binary Search Tree Search Proficiency Exercise | Tracing Exercise | Interactive exercise to demonstrate proficiency with BST search. | OpenDSA | Binary Search Tree |
| 4 | Binary Search Tree Summary Questions | Question, Battery | Self-practice questions about Binary Search Trees. | OpenDSA | Binary Search Tree |
| 5 | Binary Tree Chapter Summary Questions | Question, Battery | Self-practice questions for the full Binary Tree chapter. | OpenDSA | Binary Tree, Binary Search Tree, Heap, Huffman Coding Tree |
| 6 | BST Search Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive search in a BST. | OpenDSA | Binary Search Tree |
| 7 | Tree inorder traversal | Python PredictingFinalResult for demonstrating Tree inorder traversal | QuizPET | binary search, trees | |
| 8 | Tree preorder traversal | Python PredictingFinalResult for demonstrating Tree preorder traversal | QuizPET | binary search, trees | |
| 9 | Tree | Python CodeVisualization for demonstrating Tree | JSVEE | binary search, trees | |
| 10 | Tree Node Access | Python CodeVisualization for demonstrating Tree Node Access | JSVEE | binary search, trees | |
| 11 | BST Delete Max Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive delete of the maximum value in a BST. | OpenDSA | Binary Search Tree |
| 12 | BST Insert Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive insert in a BST. | OpenDSA | Binary Search Tree |
| 13 | BST Remove Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive remove value in a BST. | OpenDSA | Binary Search Tree |
| 14 | Inefficient Range Query in a BST Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing a range query implementation in a BST, contrasting an inefficient and an efficient implementation. | OpenDSA | Binary Search Tree |
| 15 | Functional Programming Recursion: BST | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing list-of-list (tree) processing in a functional programming language: Binary Search Tree Search. | OpenDSA | Functional Programming |
| 16 | Paged BST Slideshow | Algorithm Visualization | Slideshow showing the use of paging with a BST-based index. Updating the BST to require it to remain a complete... | OpenDSA | Tree-Based Indexing |
| 17 | Paged BST with Page Rebalancing For Use on Disk Slideshow | Algorithm Visualization | Slideshow showing the use of paging with a BST-based index. Reorganizing the nodes to be on optimal disk pages reduces... | OpenDSA | Tree-Based Indexing |
| 18 | Tree Timeline Slideshow | Algorithm Visualization | Slideshow showing the concept of marking a timeline for the values stored in a BST. This will be contrasted with... | OpenDSA | Trie |
| 19 | Trie Timeline Slideshow | Algorithm Visualization | Slideshow showing the concept of marking a timeline for the values stored in a Trie decomposition version of a BST. | OpenDSA | Trie |
| 20 | Binary Search | PCEX Set of activities for Binary Search | PCEX | ||
| 21 | Binary search | Binary Search operates by dividing an array in half, and then determining whether or not the target value would be... | PCEX | ||
| 22 | Binary search | Binary Search operates by dividing an array in half, and then determining whether or not the target value would be... | PCEX | ||
| 23 | Binary Search Proficency Exercise | Tracing Exercise | Interactive exercise where users indicate which elements of the array should be searched to reproduce the binary search algorithm's behavior. | OpenDSA | Binary Search |
| 24 | Binary Search - 1 | Construct a function that receives an array and a target element to be searched in the given array. If the... | PCEX | ||
| 25 | Binary Search - 1 | Construct a function that receives an array and a target element to be searched in the given array. If the... | PCEX | ||
| 26 | Binary Search - Recursive | PCEX Set of activities for Binary Search - Recursive | PCEX | ||
| 27 | Binary Search - 2 | This function implements a recursive version of Binary Search | PCEX | ||
| 28 | Binary Search - 2 | This function implements a recursive version of Binary Search | PCEX | ||
| 29 | Binary Search Algorithm Worst Case Analysis Recurrence Visualization | Algorithm Analysis Presentation | Slideshow illustrating Binary Search worst case analysis through analysis of its recurrence relation. | OpenDSA | Binary Search, Algorithm Analysis, Recurrence Relation |
| 30 | Binary Search Algorithm | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating Binary Search and presenting its analysis. | OpenDSA | Binary Search, Algorithm Analysis |
| 31 | Recursive Binary Search | Construct a function that uses recursive binary search to find if a specific value is in a list (known as... | PCEX | ||
| 32 | Recursive Binary Search | Construct a function that uses recursive binary search to find if a specific value is in a list (known as... | PCEX | ||
| 33 | py_search_binary_search | PCEX Set of activities for py_search_binary_search | PCEX | ||
| 34 | (Searching) Binary search - CSEdPad | This program uses binary search algorithm to search the index, where "index will be the rank of prizes you get... | AnnEx | search algorithms | |
| 35 | Binary Insertion Sort Slideshow | Algorithm Visualization | Slideshow introducing the concept of using binary search to find the insert location of the next record during Insertion Sort.... | OpenDSA | Binary Insertion Sort |
| 36 | csedpad.22.Searching.searching(binarysearch) | This program implements Binary Search using a recursive algorithm (recursion is used in this algorithm | PCEX | ||
| 37 | csedpad.22.Searching.searching(binarysearch)_1 | This program uses the binary search algorithm to search the index, where "index will be the rank of prizes you... | PCEX | ||
| 38 | py_search_binary_recursive | PCEX Set of activities for py_search_binary_recursive | PCEX | ||
| 39 | csedpad.22.Searching.searching(binarysearch) | PCEX Set of activities for csedpad.22.Searching.searching(binarysearch) | PCEX | ||
| 40 | csedpad.22.Searching.searching(binarysearch)_1 | PCEX Set of activities for csedpad.22.Searching.searching(binarysearch)_1 | PCEX | ||
| 41 | Binary_Expressions | C++ BehaviorExample for demonstrating Binary_Expressions | AnnEx | ||
| 42 | Binary Tree Definition Calculation Questions | Question, Battery, Calculation Exercise | Self-practice questions about binary tree terminology that require calculation of quantities such as node counts and tree heights. | OpenDSA | Binary Tree |
| 43 | Binary Tree Traversal Summary Questions | Question, Battery | Self-practice questions about binary tree traversals. | OpenDSA | Binary Tree Traversal |
| 44 | Binary Tree Terminology Practice Questions | Question, Battery | Self-practice questions about binary tree terminology that require calculation of quantities such as descendants and tree heights. | OpenDSA | Binary Tree |
| 45 | Binary Tree Sequential Representation Proficiency Exercise | Tracing Exercise | User must show the sequential representation for a given binary tree. | OpenDSA | Sequential Representation, Binary Tree |
| 46 | Binary Tree Serialization Slideshow: Internal Node Mark Bits | Algorithm Visualization | Slideshow how to reconstruct a binary tree from a serialized representation of its node values. Alternative representation using mark bits... | OpenDSA | Serialization, Binary Tree |
| 47 | Binary Tree Serialization Slideshow | Algorithm Visualization | Slideshow how to reconstruct a binary tree from a serialized representation of its node values. | OpenDSA | Serialization, Binary Tree |
| 48 | Inserting binary tree | In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... | PCEX | ||
| 49 | Inserting binary tree | In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... | PCEX | ||
| 50 | Complete Binary Tree Calculation Questions | Calculation Exercise, Battery | Self-practice questions requiring user to calcuate node positions and values in an array representation for a complete binary tree. | OpenDSA | Linked List |
| 51 | Alternative Binary Tree Sequential Representation Proficiency Exercise | Tracing Exercise | User must show the sequential representation for a given binary tree. This representation marks internal nodes. | OpenDSA | Sequential Representation, Binary Tree |
| 52 | Full Binary Tree Sequential Representation Proficiency Exercise | Tracing Exercise | User must show the sequential representation for a given full binary tree. The representation uses a bit vector to deduce... | OpenDSA | Sequential Representation, Full Binary Tree |
| 53 | Full Binary Tree Serialization Slideshow: Mark Bits | Algorithm Visualization | Slideshow how to reconstruct a full binary tree from a serialized representation of its node values. All that is needed... | OpenDSA | Serialization, Binary Tree |
| 54 | DFA Exercise: Even Binary Numbers | Automata Construction Exercise | User creates a DFA that accepts the langugage of even binary numbers. | OpenDSA | Deterministic Finite Automata |
| 55 | Recursive Operations in a Binary Tree | Presentation | Slideshow discussing recursive operations on a binary tree. | OpenDSA | Array-Based Stack |
| 56 | DFA Example Trace: Even Binary Numbers | Algorithm Visualization, Code Tracing Presentation | Visualization of how a DFA would process input strings for the language of even binary numbers. | OpenDSA | Deterministic Finite Automata |
| 57 | Regular Expression Exercise: Strings of Even Binary Numbers | RegEx Writing Exercise | User writes an regular expression for the language of strings that are even binary numbers. | OpenDSA | Regular Expression |
| 58 | Tree Implementation Overhead Exercise | Calculation Exercise, Battery | Self-practice questions that require the user to calculate overhead fractions for various binary tree node implementations. | OpenDSA | Binary Tree, Overhead |
| 59 | General Tree Serialization Slideshow | Algorithm Visualization | Slideshow how to reconstruct a general tree from a serialized representation of its node values. | OpenDSA | Serialization, Binary Tree |
| 60 | Traverse an expression tree | Algorithm Visualization, Code Tracing Presentation | Slideshow demonstrating traversal of an expression tree. The primary point is to highlight the node implementation for a full binary... | OpenDSA | Expression Tree, Binary Tree Traversal, Full Binary Tree |
| 61 | DFA Exercise: Divisible by 4 | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of binary numbers divisible by 4. | OpenDSA | Deterministic Finite Automata |
| 62 | Typical Mistakes During Tree Traversal | Code Tracing Presentation | Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. | OpenDSA | Preorder Traversal |
| 63 | Inorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of inorder traversal of a binary tree and how the recursion works. | OpenDSA | Inorder Traversal |
| 64 | Postorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of postorder traversal of a binary tree and how the recursion works. | OpenDSA | Postorder Traversal |
| 65 | Preorder Traversal Shown in Detail | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting a detailed visualization of preorder traversal of a binary tree and how the recursion works. | OpenDSA | Preorder Traversal |