Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | LinkedBag contains | Free Coding Problem, code writing | Coding Question | CodeWorkout | Lists, nodes, chains, links, bag, ADT, contains, code writing |
| 2 | Link Nodes | Algorithm Visualization, Code Tracing Presentation | Slideshow introducing the concept of Link Nodes. | OpenDSA | Link Node |
| 3 | Link Nodes: Iteration | Algorithm Visualization, Code Tracing Presentation | Slideshow introducing the concept of iterating through a linked list. | OpenDSA | Link Node, Iteration |
| 4 | Link Nodes: Delete | Algorithm Visualization, Code Tracing Presentation | Slideshow introducing the concept of deleting from a linked list. | OpenDSA | Link Node, Iteration |
| 5 | Link Nodes: Insertion | Algorithm Visualization, Code Tracing Presentation | Slideshow introducing the concept of inserting a new node into a linked list. | OpenDSA | Link Node, Iteration |
| 6 | Update Nodes - 1 | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked lists, code writing |
| 7 | Update Nodes - 2 | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked lists, code writing |
| 8 | Update Nodes - 3 | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked lists, code writing |
| 9 | Update Nodes - 4 | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked lists, code writing |
| 10 | Update Nodes - 5 | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked lists, code writing |
| 11 | Build Nodes | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked structures, Pointers, code writing |
| 12 | Internal nodes in a binary tree | Question, forced choice | Multiple Choice Question | CodeWorkout | cci, Java, binary tree, 2214, forced choice |
| 13 | Leaf nodes in a binary tree | Question, forced choice | Multiple Choice Question | CodeWorkout | cci, Java, binary tree, forced choice |
| 14 | Internal nodes in a binary tree | Question, forced choice | Multiple Choice Question | CodeWorkout | cci, binary tree, forced choice |
| 15 | Child nodes in a binary tree | Question, forced choice | Multiple Choice Question | CodeWorkout | cci, binary tree, forced choice |
| 16 | Implement addLast using raw nodes | Code Completion | Implement the addLast method in this simplified LinkedList class. | CodeCheck | Linear Data Structures |
| 17 | Binary Tree Sum Nodes Exercise | Free Coding Problem, code writing | Coding Question | CodeWorkout | Trees, code writing |
| 18 | Binary Tree Leaf Nodes Count Exercise | Free Coding Problem, code writing | Coding Question | CodeWorkout | Trees, code writing |
| 19 | Binary Tree Leaf Nodes Count Exercise | Free Coding Problem, code writing | Coding Question | CodeWorkout | Trees, code writing |
| 20 | Build Two Nodes | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked structures, Pointers, code writing |
| 21 | Build Three Nodes | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked structures, Pointers, code writing |
| 22 | Number of nodes at a level in binary tree | Question, forced choice | Multiple Choice Question | CodeWorkout | cci, binary tree, forced choice |
| 23 | Determining Number of Parse Tree Nodes Exercise: Alternate | Calculation Exercise, Battery | User determines the number of nodes in a parse tree generated by a given string on a given grammar. Alternative... | OpenDSA | Context-Free Grammar, Parse Tree |
| 24 | Determining Number of Parse Tree Nodes Exercise | Calculation Exercise | User determines the number of nodes in a parse tree generated by a given string on a given grammar. | OpenDSA | Context-Free Grammar, Parse Tree |
| 25 | Rotate linked list by manipulating nodes | Code Completion | Your task is to add a rotate method to the LinkedList class of Section 15.2 that rotates the elements of... | CodeCheck | Linear Data Structures |
| 26 | Creating a Chain of Links | Algorithm Visualization, Code Tracing Presentation | Slideshow introducing the concept of chaining link nodes to form a linked list. | OpenDSA | Link Node, Linked List |
| 27 | List Element Data Slideshow | Algorithm Visualization | Slideshow discussing the tradeoffs for storing element values in link nodes vs. references to element values. | OpenDSA | List Element Implementation |
| 28 | Inserting binary tree | In a BinaryTree, adding new nodes to the tree is an important capability to have. Construct a simple implementation of... | PCEX | binary search, recursion, trees | |
| 29 | Inserting binary tree Challenge | In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... | PCEX | recursion, trees | |
| 30 | Inorder Traversal Exercise | Tracing Exercise | Practice exercise for Inorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Inorder Traversal |
| 31 | Postorder Traversal Exercise | Tracing Exercise | Practice exercise for postorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Postorder Traversal |
| 32 | Preorder Traversal Exercise | Tracing Exercise | Practice exercise for preorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Preorder Traversal |
| 33 | Heap Build Proficiency Exercise | Tracing Exercise | Practice exercise for heap building. User clicks on nodes to indicate the proper order of the build process. | OpenDSA | Heap |
| 34 | Heap Insert Proficiency Exercise | Tracing Exercise | Practice exercise for heap insertion. User clicks on nodes to indicate the proper order of the insert process. | OpenDSA | Heap |
| 35 | Heap Remove Proficiency Exercise | Tracing Exercise | Practice exercise for heap remove. User clicks on nodes to indicate the proper order of the remove process. | OpenDSA | Heap |
| 36 | List Element Type Slideshow | Algorithm Visualization | Slideshow illustrating the choice between storing non-homogeneous data types in list nodes and limiting to a homogenous data type. | OpenDSA | List Element Implementation |
| 37 | Replacement Selection Proficiency Exercise | Tracing Exercise | Interactive algorithm proficiency exercise for the replacement selection algorithm. User clicks on heap nodes to reproduce the behavior of replacement... | OpenDSA | File Processing, External Sorting, Replacement Selection |
| 38 | Kruskal's Minimal-Cost Spanning Tree Proficiency Exercise | Tracing Exercise | Proficiency exercise for Kruskal's minimal-cost spanning tree. User must indicate the order in which nodes are visited by clicking on... | OpenDSA | Minimal-Cost Spanning Tree |
| 39 | Prim's Minimal-Cost Spanning Tree Proficiency Exercise | Tracing Exercise | Proficiency exercise for Prim's minimal-cost spanning tree. User must indicate the order in which nodes are visited by clicking on... | OpenDSA | Minimal-Cost Spanning Tree |
| 40 | B+ Tree Insertion Proficiency Exercise | Tracing Exercise | Interactive proficiency exercise for insertion into a B+ Tree. User clicks on tree nodes to indicate how the insert process... | OpenDSA | B-Tree, Tree-Based Indexing |
| 41 | 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 |
| 42 | Practicing Pointers: Links | Tracing Exercise | Third pointer assignment proficiency exercise. Users click on objects to show how pointers link nodes together into a linked list. | OpenDSA | Pointer, Object |
| 43 | 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 |
| 44 | Tree traversal. | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | binary search, trees | |
| 45 | Tree traversal. Challenge | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | trees | |
| 46 | Union/Find Proficiency Exercise | Tracing Exercise | Proficiency exercise for the Union/Find algorithm to maintain a collection of disjoint sets. User must show the complete sequence of... | OpenDSA | Union/Find Algorithm |
| 47 | Breadth-First Search Graph Traversal Proficiency Exercise | Tracing Exercise | Proficiency exercise for breadth-first search to traverse a graph. User must indicate the order in which nodes are visited by... | OpenDSA | Breadth-First Search |
| 48 | Depth-First Search Graph Traversal Proficiency Exercise | Tracing Exercise | Proficiency exercise for depth-first search to traverse a graph. User just indicate the order in which nodes are visited by... | OpenDSA | Depth-First Search |
| 49 | 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 |
| 50 | Search in the linked list. | When using a LinkedList, it is possible that you may want to search through the list to see if a... | PCEX | linked list, search algorithms | |
| 51 | Search in the linked list. Challenge | When using a LinkedList, it is possible that you may want to search through the list to see if a... | PCEX | search algorithms | |
| 52 | Tree Node Access | Python CodeVisualization for demonstrating Tree Node Access | JSVEE | binary search, trees | |
| 53 | Remove Node | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 54 | Linked Chain Find Middle Node | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 55 | Linked Chain Find First Node By Value | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 56 | Linked Chain Find Last Node By Value | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 57 | Linked Chain Find Node Before Value | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 58 | Add After Node | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 59 | Remove Next Node | Free Coding Problem, code writing | Coding Question | CodeWorkout | 2114, Pointers, Visualizable, code writing |
| 60 | Create New Node | Free Coding Problem, code writing | Coding Question | CodeWorkout | linked structures, Pointers, code writing |
| 61 | Split on Insertion into a 2-3 tree. | Algorithm Visualization | Slideshow showing how node split on insertion is handled by a 2-3 tree. | OpenDSA | Tree-Based Indexing, 2-3 Tree |
| 62 | 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 |
| 63 | PR Quadtree Visualization | Algorithm Visualization | Algorithm Visualization for the PR Quadtree with one point per node. | OpenDSA | PR Quadtree |
| 64 | Bad Linked List Representation Slideshow | Presentation | Slideshow demonstrating a bad representation for the current node in a linked list. | OpenDSA | Linked List |
| 65 | Linked List Deletion Problem Slideshow | Presentation | Slideshow demonstrating why a naive representation for the current node in a linked list leads to problems on deletion. | OpenDSA | Linked List |
| 66 | Construct an inorder traversal function | Construct an inorder traversal function that recursively traverse a tree from left node, root node and right node. We store... | jsParsons | trees | |
| 67 | Construct a preorder traversal function | Construct a preorder traversal function that recursively traverse a tree from root node, left node and right node. We store... | jsParsons | trees | |
| 68 | PR Quadtree Two Points Visualization | Algorithm Visualization | Algorithm Visualization for the PR Quadtree with up to two points per node. | OpenDSA | PR Quadtree |
| 69 | 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 |
| 70 | 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 |
| 71 | 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 |
| 72 | 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 |
| 73 | 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 |
| 74 | 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 |
| 75 | Calculating Body Mass Index (BMI) | BMI is a measure of body fat based on height and weight that applies to adult men and women. BMI... | PCEX | arithmetic operations, operators, variables | |
| 76 | Calculating and Rounding Up Body Mass Index (BMI) To the Nearest Integer | BMI is a measure of body fat based on height and weight that applies to adult men and women. BMI... | PCEX | arithmetic operations | |
| 77 | Calculo del Indice de Masa Corporal (IMC) | El IMC es una medida de la grasa corporal basada en la altura y el peso que se aplica a... | PCEX | operators, variables | |
| 78 | Calculo y Redondeo del Indice de Masa Corporal (IMC) al Entero Mas Cercano. | El IMC es una medida de grasa corporal basada en la altura y el peso que se aplica a hombres... | PCEX | operators, variables | |
| 79 | Bintree Interactive Visualization | Algorithm Visualization, User Supplied Data | Interactive Algorithm Visualization for the Bintree data structure. User can click to indicate where a point should be inserted or... | OpenDSA | Bintree |
| 80 | BMI Calculator | BMI is a measure of body fat based on height and weight that applies to adult men and women. BMI... | PCEX | arithmetic operations, arithmetic operators, operators, variables | |
| 81 | BMI Calculator | BMI is a measure of body fat based on height and weight that applies to adult men and women. BMI... | PCEX | operators, variables | |
| 82 | Calculating and Rounding Up Body Mass Index (BMI) To the Nearest Integer | BMI is a measure of body fat based on height and weight that applies to adult men and women. BMI... | PCEX | arithmetic operations, arithmetic operators, data types, operators, variables | |
| 83 | BMI Calculator | BMI is a measure of body fat based on height and weight that applies to adult men and women. BMI... | PCEX | operators, variables |