Join For Free Learn how error monitoring with Sentry closes the gap between the product team and your customers. With Sentry, you can focus on what you do best:
August 09, I have divided them into 10 different topic areas that I think the project may use the most.
Keep in mind that a few of these projects could have been classified in more than one topic. So I hope you enjoy and here they are! Keep a limit to how far the program will go. Also figure out how long it will take the user to pay back the loan.
The program will figure out the change and the number of quarters, dimes, nickels, pennies needed for the change. Make it a scientific calculator for added complexity.
The user enters the type of unit being entered, the type of unit they want to convert to and then the value. The program will then make the conversion. This program may require finding coordinates of the cities like latitude and longitude. It then returns the tax plus the total cost with tax.
To form the Pig Latin form of an English word the initial consonant sound is transposed to the end of the word and an ay is affixed Ex.: Read Wikipedia for more information on rules.
For added complexity have it report a sum of each vowel found. For added complexity read these strings in from a text file and generate a summary. Add syntax highlighting and other features. You can have the program also add popup reminders.
The user can set how often the stocks are checked and the program can show green up and red down arrows to show which direction the stock value has moved.
It can allow comments or not and timestamps all entries. Could also be made into a shout box. Then send them to a friend. Great for making online documentation of standard text documentation. Great for software developers looking to make shareware that can be activated.
It will then run the regular expression against the source text and return any matches or flag errors in the regular expression. There are various clocks across the world. Do a search for a list of them. For added complexity, create your own protocol to facilitate this chatting.
On any successful connections mark the port as open.Binary Search Tree, is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with . This is a Java Program to implement Binary Search Tree. A binary search tree (BST), sometimes also called an ordered or sorted binary tree, is a node-based binary tree data structure which has the following properties: i) The left subtree of a node contains only nodes with keys less than the node’s key.
Binary Tree: A data structure in which we have nodes containing data and two references to other nodes, one on the left and one on the right.
Binary Tree consist of Nodes. Nodes are nothing but objects of a class and each node has . A binary search tree is a binary tree in which every node contains a key that satisfies following criteria: The key in left child is less than the .
Description: Deadlock describes a situation where two or more threads are blocked forever, waiting for each other. Deadlocks can occur in Java when the synchronized keyword causes the executing thread to block while waiting to get the lock, associated with the specified object.
A binary search tree (BST) is a node based binary tree data structure which has the following properties. • The left subtree of a node contains only nodes with keys less than the node’s key.