This is a Java source code for a simple graphical application that demonstrates how to use various types of borders in Swing, a Java GUI toolkit. The program defines a class BorderDemo that extends JApplet, a Swing component used for embedding a Java application in a web page or other container.
Read More
This Java Code supports two-way chatting between users. It implements a client for the ConnectionBroker server, which can set up a relayed connection between a pair of such clients. There are really two functions: The user can register with the server as a client who is willing to accept a connection, or the user can make a connection with one of the clients who is waiting on the server. The code retrieves and displays a list of waiting clients when it starts. There is a Refresh button that the user can click to refresh this list (since the list of waiting clients can change from time to time).
Read More
This is a simple C++ program to make a car race game. It uses object oriented approach to generate different objects in the game such as using Car, Obstacle and Timer classes.
Read MoreThis is a very basic C++ program that demonstrates data protection in a very simple way. Data protection in Object Oriented Programming is controlling access to all attributes is one of the most important concepts of object-oriented design
Read More“describe a problem which occurs over and over again in our environment, and then describe the core of the solution to that problem, in such a way that you can use this solution a million times over, without ever doing it...
Read MoreThis is a special console based utility which will calculate the Message Digest, Base 64 Encoding and Decoding, Checks the Message Digest and give output through file or through screen you can use this class to make the dll....
Read More
This C++ program is tour of knight on 64 square of chess board. The goal is to place a knight on an empty chess board and then move the knight to each of the remaining 63 squares while only visiting each square once. If on visiting the last square the knight is able to hop to the square on which it first started it is known as a closed tour (and so the knight could resume the exact same sequence of moves to complete another tour) while if the knight is unable to hop to the original square, it is known as an open tour.
Read More
This is a C++ implementation of various sorting algorithms. The list of algorithms include Bubble Sort, Heap Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Shell Sort. A brief description of each sorting algorithm is listed below along with their complexity.
Read More