Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
CS 61B - Data Structures - Fall 2006
543 students

CS 61B - Data Structures - Fall 2006

CS 61B: Data Structures - Fall 2006. Fundamental dynamic data structures, including linear lists, queues, trees, and oth
Created byUC Berkeley
Last updated 3/2010
English

Explore related topics

Course content

1 section • 17 lectures • 12h 56m total length

  • Algorithm Analysis44:15
    Prof. Jonathan Shewchuk teaches the 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.
  • Asymptotic Analysis48:50
    Prof. Jonathan Shewchuk teaches the 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.
  • Encapsulated Lists43:24
    Prof. Jonathan Shewchuk teaches the 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.
  • Game Trees50:40
    Prof. Jonathan Shewchuk teaches the 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.
  • More Java43:48
    Prof. Jonathan Shewchuk teaches the 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.
  • Java Packages46:35
    Prof. Jonathan Shewchuk teaches the 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.
  • Abstract Classes51:09
    Prof. Jonathan Shewchuk teaches the 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.
  • Inheritances50:07
    Prof. Jonathan Shewchuk teaches the 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.
  • Testing48:18
    Prof. Jonathan Shewchuk teaches the 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.
  • Stack Frames53:09
    Prof. Jonathan Shewchuk teaches the 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.
  • Linked Lists II43:51
    Prof. Jonathan Shewchuk teaches the 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.
  • Linked Lists I52:02
    Prof. Jonathan Shewchuk teaches the 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.
  • Iteration and Arrays II48:08
    Prof. Jonathan Shewchuk teaches the 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.
  • Iteration and Arrays I49:20
    Prof. Jonathan Shewchuk teaches the 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.
  • Types and Conditionals51:25
    Prof. Jonathan Shewchuk teaches the 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.
  • Defining Classes51:22
    Prof. Jonathan Shewchuk teaches the 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.
  • Using Objects
    Prof. Jonathan Shewchuk teaches the 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.

Description

CS 61B: Data Structures - Fall 2006. 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.

Report abuse