Channi Studies

Linear Probing A hash table with linear probing handles a collision by starting at the key's mapped bucket, and then linearly searches subsequent buckets until an empty bucket is found.  Item 124 should be inserted into bucket 4 since 124 % 10 = 4, but bucket 4 is already occupied, so it searched for next null (empty) bucket appearing linearly starting from the original bucket. Since bucket 5 wa..

Hash TableA hash table is data structure that stores unordered items by mapping (or hashing) each item to a location in an array (or vector).Ex. Given an array with indices 0 ... 9 to store integers from 0 ... 5000, the modulo (remainder) operator can b usd to map 25 to index 5 (25 % 10 = 5), and 149 to index 9 (149 % 10 = 9). A hash table's main advantage is that searching, inserting, and remov..

You can think of FOREIGN KEY as a primary key from one table that can be found within a different table.FOREIGN KEY constraint is used to prevent actions that would destory links between tables.Using a FOREIGN KEY, we can establish a link between two tables.  Let's stary by creating a new table for customer data. We will have customer_id, first_name, and last_name columns, and customer_id will b..

AUTO_INCREMENT attribute can be applied to a column that is set as a key. Whenever we insert a new row, the primary key will be populated automatically.  Let's re-create the transactions table that we created before. DROP TABLE transactions; CREATE TABLE transactions( transaction_id INT PRIMARY KEY AUTO_INCREMENT, amount DECIMAL(5, 2)); We can verify AUTO_INCREMENT attribute applied in the..