Home > Search Results

historical study of genetic engineering


sort by: Relevancy | Title try advanced search for more options

  1. Temp Thumb

    Engineering (Except Electrical)

    13 COURSES, 48 LECTURES
  2. Temp Thumb

    Electrical Engineering

    12 COURSES, 49 LECTURES
  1. Garbage Collection

    Garbage Collection

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  2. Disjoint Sets

    Disjoint Sets

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  3. Expression Parsing

    Expression Parsing

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  4. Randomized Analysis

    Randomized Analysis

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  5. Amortized Analysis

    Amortized Analysis

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  6. Weighted Graphs

    Weighted Graphs

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  7. Asymptotic Analysis

    Asymptotic Analysis

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  8. Sorting II

    Sorting II

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  9. Sorting I

    Sorting I

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  10. Sorting V

    Sorting V

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  11. Sorting III

    Sorting III

    Berkeley / Computer Science
    Jonathan Shewchuk

    Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

  12. Heap Management - How Information about Allocations are Stored in the Heap

    Heap Management - How Information about Allocations are Stored in the Heap

    Stanford / Computer Science
    Jerry Cain

    Heap Management - How Information about Allocations are Stored in the Heap, Result of Freeing Memory Improperly, Actual Sizes of Heap Allocations - Nearest Power of 2, Management of Free Blocks on the Heap by Storing Addresses in the Blocks of Free Memory, Algorithms for Choosing Which Free Block to Allocate, How the Heap's Free List Can Be Updated When Memory is Freed, How Adjacent Free Blocks Are Combined To Avoid Fragmentation, Compacti...more