This PROJECT attempts to implement a Database using B+Tree. The PROJECT has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
PIC18F1320 bootloader. This a port of the PIC16F87x bootloader to the PIC18F1320. PROJECT includes Microsoft Visual C++ source for the Windows downloader, and assembly source for the PIC core. For more background documentaiton about bootloaders in general, see the PIC16F87x
This PROJECT does not contain a full, runnable application program. Instead, the only package ope.account contains two classes which represent basic bank customer and account information.
The PROJECT Adventure is a simple text-based adventure game. The game, as given, involves the hero trying to find his way from a deep dark forest to home and his true love. There s very little else the player can do apart from moving from place to place. It s not really very interesting.
This PROJECT can be of use beyond the given, rather boring forest adventure though. You can use it as a basis for developing your own adventure game with different, more interesting commands, areas, items, people and so on.
The package ope.adventure contains classes to describe the game world.
This PROJECT does not contain a full, runnable application program. Instead, the only package ope.football contains two classes to represent match data for football (and possibly other team sports).
Implemented BFS, DFS and A*
To compile this PROJECT, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
The source code samples for chapter 2, 4, 6, and 8 are contained in the
EvenChapters PROJECT. Those chapters all reference various aspects of this single PROJECT.
The source code for the BullsEye control (chapter 10 example) is in the BullEyeCtl PROJECT.
The source samples for the other chapters are provided in the Chapter XX sub-directories.
