Wednesday, 11 March 2009

NEXT POST
Anos 80 Amstrad CPC 464 computer. In 1980, Amstrad shares issued on the London Stock Exchange, doubling the size each year during the early years. Amstrad began marketing their own personal computers in an attempt to capture the market with the Sinclair and Commodore CPC 464 in 1984. The computer, based on a Zilog Z80 8-bit, 3.7 MHz and 64 Kbytes of RAM also includes the tape drive and a monitor (or phosphorous green color) with integrated power supply. The CPC range was launched in the UK, France, Australia, Germany and Spain, where he was a bestseller. He failed to oust competitors, but now every game for home computer that has aspirations of success of these sales are versions for three systems. Followed CPC 664 models, with disk drive, 3 ", and CPC 6128 with 128 Kbytes of RAM and a keyboard supposedly more professional and discreet, but identical to the manufacturing of other models. Variants subsequent CPC " Plus " (1990) attempted to extend the life of the product significantly increasing their functionality while maintaining compatibility with the GX4000, Amstrad's brief foray into the realm of the game. Unfortunately, the CPC Plus could not compete with the emerging 16-bit computers went on tiptoe by the market, finally dying shortly after their departure. In 1985 he entered the Amstrad PCW, which is marketed as a word processor at a price of 399 pounds sterling (competitors went for 10,000 pounds), who literally sweeps the target market, even overwhelmed, because in the end, in a computer compatible with the operating system CP / M and that includes the number of word processor LocoScript. Amsoft, the software division of Amstrad clothing created for the launch of 464, is effective in its work of converting the format extrano Compact Floppy disk 3 inches of the vast...
PREVIOUS POST
Removal In a normal binary tree search, when you delete an internal node with two nodes as children, we take the maximum element of the left subtree or the minimum of the right subtree, and move its value at that node is removed (as shown here). Then remove the node from which copiabamos the value must be less than two leaves no child nodes. Copy a value does not violate any of the red-black properties and reduces the problem of general andalusia delete to delete a node with at most one leaf child. No matter if this node is the node that originally we wanted to delete the node or the value of that copy. Summarizing, we can assume that we remove a node with a child as much leaf (if leaf nodes only have children, take them as a child). If you remove a red node, we can simply replace it with your child, to be black. All roads to simply delete the node pass through a node less red, and both nodes, the father of the deletion and the child have to be black, so that the properties 3 (all pages, including zero, are black ) and 4 (the two sons of every red node are black) are maintained. Another simple case is when the deleted node is black and his son is red. Simply remove a black node could break the 4 properties (the two children of every red node are black) and 5 (all paths from a given node to its leaves contain the same number of black nodes), but if your child repainted in black Both properties are preserved. The complex case is when the node that will be erased and his son are black. We started by replacing the node that will be wiped off...