Searching for integers : 17 results found | RSS Feed for this search

18.702 Algebra II (MIT) 18.702 Algebra II (MIT)

Description

This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory. This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory.Subjects

Sylow theorems | Sylow theorems | Group Representations | Group Representations | definitions | definitions | unitary representations | unitary representations | characters | characters | Schur's Lemma | Schur's Lemma | Rings: Basic Definitions | Rings: Basic Definitions | homomorphisms | homomorphisms | fractions | fractions | Factorization | Factorization | unique factorization | unique factorization | Gauss' Lemma | Gauss' Lemma | explicit factorization | explicit factorization | maximal ideals | maximal ideals | Quadratic Imaginary Integers | Quadratic Imaginary Integers | Gauss Primes | Gauss Primes | quadratic integers | quadratic integers | ideal factorization | ideal factorization | ideal classes | ideal classes | Linear Algebra over a Ring | Linear Algebra over a Ring | free modules | free modules | integer matrices | integer matrices | generators and relations | generators and relations | structure of abelian groups | structure of abelian groups | Rings: Abstract Constructions | Rings: Abstract Constructions | relations in a ring | relations in a ring | adjoining elements | adjoining elements | Fields: Field Extensions | Fields: Field Extensions | algebraic elements | algebraic elements | degree of field extension | degree of field extension | ruler and compass | ruler and compass | symbolic adjunction | symbolic adjunction | finite fields | finite fields | Fields: Galois Theory | Fields: Galois Theory | the main theorem | the main theorem | cubic equations | cubic equations | symmetric functions | symmetric functions | primitive elements | primitive elements | quartic equations | quartic equations | quintic equations | quintic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.702 Algebra II (MIT) 18.702 Algebra II (MIT)

Description

The course covers group theory and its representations, and focuses on the Sylow theorem, Schur's lemma, and proof of the orthogonality relations. It also analyzes the rings, the factorization processes, and the fields. Topics such as the formal construction of integers and polynomials, homomorphisms and ideals, the Gauss' lemma, quadratic imaginary integers, Gauss primes, and finite and function fields are discussed in detail. The course covers group theory and its representations, and focuses on the Sylow theorem, Schur's lemma, and proof of the orthogonality relations. It also analyzes the rings, the factorization processes, and the fields. Topics such as the formal construction of integers and polynomials, homomorphisms and ideals, the Gauss' lemma, quadratic imaginary integers, Gauss primes, and finite and function fields are discussed in detail.Subjects

Sylow theorems | Sylow theorems | Group Representations | Group Representations | definitions | definitions | unitary representations | unitary representations | characters | characters | Schur's Lemma | Schur's Lemma | Rings: Basic Definitions | Rings: Basic Definitions | homomorphisms | homomorphisms | fractions | fractions | Factorization | Factorization | unique factorization | unique factorization | Gauss' Lemma | Gauss' Lemma | explicit factorization | explicit factorization | maximal ideals | maximal ideals | Quadratic Imaginary Integers | Quadratic Imaginary Integers | Gauss Primes | Gauss Primes | quadratic integers | quadratic integers | ideal factorization | ideal factorization | ideal classes | ideal classes | Linear Algebra over a Ring | Linear Algebra over a Ring | free modules | free modules | integer matrices | integer matrices | generators and relations | generators and relations | structure of abelian groups | structure of abelian groups | Rings: Abstract Constructions | Rings: Abstract Constructions | relations in a ring | relations in a ring | adjoining elements | adjoining elements | Fields: Field Extensions | Fields: Field Extensions | algebraic elements | algebraic elements | degree of field extension | degree of field extension | ruler and compass | ruler and compass | symbolic adjunction | symbolic adjunction | finite fields | finite fields | Fields: Galois Theory | Fields: Galois Theory | the main theorem | the main theorem | cubic equations | cubic equations | symmetric functions | symmetric functions | primitive elements | primitive elements | quartic equations | quartic equations | quintic equations | quintic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.702 Algebra II (MIT) 18.702 Algebra II (MIT)

Description

This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory. This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory.Subjects

Sylow theorems | Sylow theorems | Group Representations | Group Representations | definitions | definitions | unitary representations | unitary representations | characters | characters | Schur's Lemma | Schur's Lemma | Rings: Basic Definitions | Rings: Basic Definitions | homomorphisms | homomorphisms | fractions | fractions | Factorization | Factorization | unique factorization | unique factorization | Gauss' Lemma | Gauss' Lemma | explicit factorization | explicit factorization | maximal ideals | maximal ideals | Quadratic Imaginary Integers | Quadratic Imaginary Integers | Gauss Primes | Gauss Primes | quadratic integers | quadratic integers | ideal factorization | ideal factorization | ideal classes | ideal classes | Linear Algebra over a Ring | Linear Algebra over a Ring | free modules | free modules | integer matrices | integer matrices | generators and relations | generators and relations | structure of abelian groups | structure of abelian groups | Rings: Abstract Constructions | Rings: Abstract Constructions | relations in a ring | relations in a ring | adjoining elements | adjoining elements | Fields: Field Extensions | Fields: Field Extensions | algebraic elements | algebraic elements | degree of field extension | degree of field extension | ruler and compass | ruler and compass | symbolic adjunction | symbolic adjunction | finite fields | finite fields | Fields: Galois Theory | Fields: Galois Theory | the main theorem | the main theorem | cubic equations | cubic equations | symmetric functions | symmetric functions | primitive elements | primitive elements | quartic equations | quartic equations | quintic equations | quintic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

18.104 is an undergraduate level seminar for mathematics majors. Students present and discuss subject matter taken from current journals or books. Instruction and practice in written and oral communication is provided. The topics vary from year to year. The topic for this term is Applications to Number Theory. 18.104 is an undergraduate level seminar for mathematics majors. Students present and discuss subject matter taken from current journals or books. Instruction and practice in written and oral communication is provided. The topics vary from year to year. The topic for this term is Applications to Number Theory.Subjects

Infinitude of the primes | Infinitude of the primes | Summing powers of integers | Summing powers of integers | Bernoulli polynomials | Bernoulli polynomials | sine product formula | sine product formula | $\zeta(2n)$ | $\zeta(2n)$ | Fermat's Little Theorem | Fermat's Little Theorem | Fermat's Great Theorem | Fermat's Great Theorem | Averages of arithmetic functions | Averages of arithmetic functions | arithmetic-geometric mean | arithmetic-geometric mean | Gauss' theorem | Gauss' theorem | Wallis's formula | Wallis's formula | Stirling's formula | Stirling's formula | prime number theorem | prime number theorem | Riemann's hypothesis | Riemann's hypothesis | Euler's proof of infinitude of primes | Euler's proof of infinitude of primes | Density of prime numbers | Density of prime numbers | Euclidean algorithm | Euclidean algorithm | Golden Ratio | Golden RatioLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.S66 The Art of Counting (MIT) 18.S66 The Art of Counting (MIT)

Description

The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment. The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.Subjects

enumerative combinatorics | enumerative combinatorics | finite set | finite set | sum of positive integers | sum of positive integers | bijective proofs | bijective proofs | bijection (one-to-one correspondence) | bijection (one-to-one correspondence) | permutations | permutations | partitions | partitions | Catalan numbers | Catalan numbers | Young tableaux | Young tableaux | lattice paths and tilings | lattice paths and tilingsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.851 Advanced Data Structures (MIT) 6.851 Advanced Data Structures (MIT)

Description

Includes audio/video content: AV lectures. Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure. Acknowledgments Thanks to videographers Martin Demaine and Justin Zhang. Includes audio/video content: AV lectures. Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure. Acknowledgments Thanks to videographers Martin Demaine and Justin Zhang.Subjects

data | data | structures | structures | data structures | data structures | computers | computers | computer science | computer science | strings | strings | dynamic graphs | dynamic graphs | integers | integers | hash | hash | hashing | hashing | hashish | hashish | hashtag | hashtag | hash tag | hash tag | hash tagger | hash tagger | memory | memory | memory heirarchy | memory heirarchy | binary tree | binary tree | binary search | binary search | binary search tree | binary search tree | time travel | time travel | back to the future | back to the future | forward to the past | forward to the past | database | database | table | table | database table | database table | cache | cache | caching | caching | mad cache money | mad cache money | logarithmic time | logarithmic time | eurythmic time | eurythmic time | operations | operations | search | search | heaps | heapsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allavcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.851 Advanced Data Structures (MIT) 6.851 Advanced Data Structures (MIT)

Description

Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course will cover major results and current directions of research in data structures. Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course will cover major results and current directions of research in data structures.Subjects

dynamic optimality | dynamic optimality | geometric data structures | geometric data structures | strings | strings | integers | integers | dictionaries | dictionaries | dynamic graphs | dynamic graphs | temporal data structures | temporal data structures | external memory | external memory | cache-oblivious | cache-oblivious | succinct data structures | succinct data structuresLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This unit is about major topics in mathematics.Subjects

NQ | coordinates of points | multiplying integers | dividing integers | Pythagoras | D322 10 | MATHEMATICS | SCQF Level 4License

Copyright in these materials is owned by a Member College of the Colleges Open Learning Exchange Group (COLEG). None of these materials may be Used without the express, prior, written consent of COLEG and the Member College, except if and to the extent that such Use is permitted under COLEG's conditions of Contribution and Use of Learning Materials through COLEG’s Repository, for the purposes of which these materials are Member Materials. Copyright in these materials is owned by a Member College of the Colleges Open Learning Exchange Group (COLEG). None of these materials may be Used without the express, prior, written consent of COLEG and the Member College, except if and to the extent that such Use is permitted under COLEG's conditions of Contribution and Use of Learning Materials through COLEG’s Repository, for the purposes of which these materials are Member Materials. Licensed to colleges in Scotland only Licensed to colleges in Scotland only http://content.resourceshare.ac.uk/xmlui/bitstream/handle/10949/17759/LicenceCOLEG.pdf?sequence=1 http://content.resourceshare.ac.uk/xmlui/bitstream/handle/10949/17759/LicenceCOLEG.pdf?sequence=1 COLEG COLEGSite sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.851 Advanced Data Structures (MIT)

Description

Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course will cover major results and current directions of research in data structures.Subjects

dynamic optimality | geometric data structures | strings | integers | dictionaries | dynamic graphs | temporal data structures | external memory | cache-oblivious | succinct data structuresLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

The study of “abstract algebra” grew out of an interest in knowing how attributes of sets of mathematical objects behave when one or more properties we associate with real numbers are restricted. The student will begin this course by reviewing basic set theory, integers, and functions in order to understand how algebraic operations arise and are used. The student then will proceed to the heart of the course, which is an exploration of the fundamentals of groups, rings, and fields. This free course may be completed online at any time. See course site for detailed overview and learning outcomes. (Mathematics 231)Subjects

set theory | abstract algebra | integers | relations | functions | permutations | groups | cyclic | symmetric | linear | cosets | rings | commutative | homomorphisms | isomorphisms | fields | Computer science | I100License

Attribution 2.0 UK: England & Wales Attribution 2.0 UK: England & Wales http://creativecommons.org/licenses/by/2.0/uk/ http://creativecommons.org/licenses/by/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.851 Advanced Data Structures (MIT)

Description

Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course will cover major results and current directions of research in data structures.Subjects

dynamic optimality | geometric data structures | strings | integers | dictionaries | dynamic graphs | temporal data structures | external memory | cache-oblivious | succinct data structuresLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory.Subjects

Sylow theorems | Group Representations | definitions | unitary representations | characters | Schur's Lemma | Rings: Basic Definitions | homomorphisms | fractions | Factorization | unique factorization | Gauss' Lemma | explicit factorization | maximal ideals | Quadratic Imaginary Integers | Gauss Primes | quadratic integers | ideal factorization | ideal classes | Linear Algebra over a Ring | free modules | integer matrices | generators and relations | structure of abelian groups | Rings: Abstract Constructions | relations in a ring | adjoining elements | Fields: Field Extensions | algebraic elements | degree of field extension | ruler and compass | symbolic adjunction | finite fields | Fields: Galois Theory | the main theorem | cubic equations | symmetric functions | primitive elements | quartic equations | quintic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

The course covers group theory and its representations, and focuses on the Sylow theorem, Schur's lemma, and proof of the orthogonality relations. It also analyzes the rings, the factorization processes, and the fields. Topics such as the formal construction of integers and polynomials, homomorphisms and ideals, the Gauss' lemma, quadratic imaginary integers, Gauss primes, and finite and function fields are discussed in detail.Subjects

Sylow theorems | Group Representations | definitions | unitary representations | characters | Schur's Lemma | Rings: Basic Definitions | homomorphisms | fractions | Factorization | unique factorization | Gauss' Lemma | explicit factorization | maximal ideals | Quadratic Imaginary Integers | Gauss Primes | quadratic integers | ideal factorization | ideal classes | Linear Algebra over a Ring | free modules | integer matrices | generators and relations | structure of abelian groups | Rings: Abstract Constructions | relations in a ring | adjoining elements | Fields: Field Extensions | algebraic elements | degree of field extension | ruler and compass | symbolic adjunction | finite fields | Fields: Galois Theory | the main theorem | cubic equations | symmetric functions | primitive elements | quartic equations | quintic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This undergraduate level course follows Algebra I. Topics include group representations, rings, ideals, fields, polynomial rings, modules, factorization, integers in quadratic number fields, field extensions, and Galois theory.Subjects

Sylow theorems | Group Representations | definitions | unitary representations | characters | Schur's Lemma | Rings: Basic Definitions | homomorphisms | fractions | Factorization | unique factorization | Gauss' Lemma | explicit factorization | maximal ideals | Quadratic Imaginary Integers | Gauss Primes | quadratic integers | ideal factorization | ideal classes | Linear Algebra over a Ring | free modules | integer matrices | generators and relations | structure of abelian groups | Rings: Abstract Constructions | relations in a ring | adjoining elements | Fields: Field Extensions | algebraic elements | degree of field extension | ruler and compass | symbolic adjunction | finite fields | Fields: Galois Theory | the main theorem | cubic equations | symmetric functions | primitive elements | quartic equations | quintic equationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.104 Seminar in Analysis: Applications to Number Theory (MIT)

Description

18.104 is an undergraduate level seminar for mathematics majors. Students present and discuss subject matter taken from current journals or books. Instruction and practice in written and oral communication is provided. The topics vary from year to year. The topic for this term is Applications to Number Theory.Subjects

Infinitude of the primes | Summing powers of integers | Bernoulli polynomials | sine product formula | $\zeta(2n)$ | Fermat's Little Theorem | Fermat's Great Theorem | Averages of arithmetic functions | arithmetic-geometric mean | Gauss' theorem | Wallis's formula | Stirling's formula | prime number theorem | Riemann's hypothesis | Euler's proof of infinitude of primes | Density of prime numbers | Euclidean algorithm | Golden RatioLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.S66 The Art of Counting (MIT)

Description

The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.Subjects

enumerative combinatorics | finite set | sum of positive integers | bijective proofs | bijection (one-to-one correspondence) | permutations | partitions | Catalan numbers | Young tableaux | lattice paths and tilingsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.851 Advanced Data Structures (MIT)

Description

Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure. Acknowledgments Thanks to videographers Martin Demaine and Justin Zhang.Subjects

data | structures | data structures | computers | computer science | strings | dynamic graphs | integers | hash | hashing | hashish | hashtag | hash tag | hash tagger | memory | memory heirarchy | binary tree | binary search | binary search tree | time travel | back to the future | forward to the past | database | table | database table | cache | caching | mad cache money | logarithmic time | eurythmic time | operations | search | heapsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata