<?xml version="1.0" encoding="utf-8"?>
<lom:lom xsi:schemaLocation="http://ocw.mit.edu/xmlns/LOM http://ocw.mit.edu/xsd/LOM/lomv1.0/lomv1.0.xsd http://ocw.mit.edu/xmlns/ocwLOM http://ocw.mit.edu/xsd/ocwLOM/ocwlomv1.0/ocwlomv1.0.xsd" xmlns="http://ocw.mit.edu/xmlns/LOM" xmlns:lom="http://ocw.mit.edu/xmlns/LOM" xmlns:ocwlom="http://ocw.mit.edu/xmlns/ocwLOM" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
  <!--************************************************************ This LOM
			record was produced by an automatic transformation to IEEE LOM, from
			OpenCourseWare's (OCW) initial version of Learning Object Metadata (LOM). (The
			initial version was based on IMS Global Consortium's LOM.)
			********************************************************--><!--***************************--><!--**** GENERAL ****--><!--***************************--><lom:general uniqueElementName="general"><lom:title uniqueElementName="title"><lom:string language="en">Hashing</lom:string></lom:title><lom:description><lom:string language="en">This resource contains information on the topic of hashing and hash functions.</lom:string></lom:description><lom:language>en</lom:language><lom:aggregationLevel uniqueElementName="aggregationLevel"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">2</lom:value></lom:aggregationLevel></lom:general><!--***************************--><!--**** LIFECYCLE ****--><!--***************************--><lom:lifeCycle uniqueElementName="lifeCycle"><lom:version uniqueElementName="version"><lom:string language="en">Fall 2005</lom:string></lom:version><lom:contribute><lom:role><lom:source uniqueElementName="source">OCW_LOMv1.0</lom:source><lom:value uniqueElementName="value">Author</lom:value></lom:role><lom:entity>Leiserson, Charles</lom:entity><lom:date uniqueElementName="date"><lom:dateTime uniqueElementName="dateTime">2007-07-20</lom:dateTime></lom:date></lom:contribute><lom:contribute><lom:role><lom:source uniqueElementName="source">OCW_LOMv1.0</lom:source><lom:value uniqueElementName="value">Contributor</lom:value></lom:role><lom:entity>Demaine, Erik</lom:entity><lom:date uniqueElementName="date"><lom:dateTime uniqueElementName="dateTime">2007-07-20</lom:dateTime></lom:date></lom:contribute></lom:lifeCycle><!--***************************--><!--**** TECHNICAL ****--><!--***************************--><lom:technical uniqueElementName="technical"><lom:location>/NR/rdonlyres/11608C3D-CF70-4D0A-8153-E836FDB9515A/0/lec7.pdf</lom:location><lom:format>application/pdf</lom:format><lom:otherPlatformRequirements><lom:string language="en">Adobe® Reader® software is required to view this .pdf file.</lom:string></lom:otherPlatformRequirements><lom:size>228468</lom:size><lom:requirement><lom:orComposite><lom:type uniqueElementName="type"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">browser</lom:value></lom:type><lom:name uniqueElementName="name"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">ms-internet explorer</lom:value></lom:name><lom:minimumVersion uniqueElementName="minimumVersion">5.1</lom:minimumVersion></lom:orComposite><lom:orComposite><lom:type uniqueElementName="type"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">browser</lom:value></lom:type><lom:name uniqueElementName="name"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">netscape communicator</lom:value></lom:name><lom:minimumVersion uniqueElementName="minimumVersion">4.7</lom:minimumVersion></lom:orComposite></lom:requirement></lom:technical><!--***************************--><!--**** EDUCATIONAL ****--><!--***************************--><lom:educational><lom:learningResourceType><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">lecture</lom:value></lom:learningResourceType><lom:context><lom:source uniqueElementName="source">OCW_LOMv1.0</lom:source><lom:value uniqueElementName="value">Undergraduate</lom:value></lom:context><lom:description><lom:string language="en">Class notes.</lom:string></lom:description></lom:educational><!--***************************--><!--**** RIGHTS ****--><!--***************************--><lom:rights uniqueElementName="rights"><lom:copyrightAndOtherRestrictions uniqueElementName="copyrightAndOtherRestrictions"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">yes</lom:value></lom:copyrightAndOtherRestrictions><lom:cost><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">no</lom:value></lom:cost><lom:description><lom:string language="en">This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.</lom:string></lom:description></lom:rights><!--***************************--><!--**** RELATION ****--><!--***************************--><lom:relation><lom:kind uniqueElementName="kind"><lom:source uniqueElementName="source">LOMv1.0</lom:source><lom:value uniqueElementName="value">ispartof</lom:value></lom:kind><lom:resource uniqueElementName="resource"><lom:identifier><lom:catalog uniqueElementName="catalog">OCW Master Course Number</lom:catalog><lom:entry uniqueElementName="entry">6.046J Introduction to Algorithms (SMA 5503) Fall 2005</lom:entry></lom:identifier><lom:description><lom:string language="en">Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. Enrollment may be limited.</lom:string></lom:description></lom:resource></lom:relation><!--***************************--><!--**** CLASSIFICATION ****--><!--***************************--><lom:classification><lom:taxonPath><lom:source uniqueElementName="source"><lom:string language="en">CIP</lom:string></lom:source><lom:taxon><lom:id uniqueElementName="id">110201</lom:id><lom:entry uniqueElementName="entry"><lom:string language="en">Computer Programming/Programmer, General</lom:string></lom:entry></lom:taxon></lom:taxonPath><lom:taxonPath><lom:source uniqueElementName="source"><lom:string language="en">CIP</lom:string></lom:source><lom:taxon><lom:id uniqueElementName="id">150399</lom:id><lom:entry uniqueElementName="entry"><lom:string language="en">Electrical and Electronic Engineering Technologies/Technicians, Other</lom:string></lom:entry></lom:taxon></lom:taxonPath><lom:keyword><lom:string language="en">algorithms</lom:string></lom:keyword><lom:keyword><lom:string language="en">efficient algorithms</lom:string></lom:keyword><lom:keyword><lom:string language="en">sorting</lom:string></lom:keyword><lom:keyword><lom:string language="en">search trees</lom:string></lom:keyword><lom:keyword><lom:string language="en">heaps</lom:string></lom:keyword><lom:keyword><lom:string language="en">hashing</lom:string></lom:keyword><lom:keyword><lom:string language="en">divide-and-conquer</lom:string></lom:keyword><lom:keyword><lom:string language="en">dynamic programming</lom:string></lom:keyword><lom:keyword><lom:string language="en">amortized analysis</lom:string></lom:keyword><lom:keyword><lom:string language="en">graph algorithms</lom:string></lom:keyword><lom:keyword><lom:string language="en">shortest paths</lom:string></lom:keyword><lom:keyword><lom:string language="en">network flow</lom:string></lom:keyword><lom:keyword><lom:string language="en">computational geometry</lom:string></lom:keyword><lom:keyword><lom:string language="en">number-theoretic algorithms</lom:string></lom:keyword><lom:keyword><lom:string language="en">polynomial and matrix calculations</lom:string></lom:keyword><lom:keyword><lom:string language="en">caching</lom:string></lom:keyword><lom:keyword><lom:string language="en">parallel computing</lom:string></lom:keyword></lom:classification></lom:lom>