Computer Science 61B

UC Berkeley Course , Fall 2006 , Prof. Jonathan Shewchuk

282 students enrolled

Overview

Course Overview -Using Objects - Defining Classes - Types and Conditionals - Iteration and Arrays - Linked Lists - Stack Frames -Testing - Inheritances - Abstract Classes - Java Packages - Exceptions -More Java - Game Trees - Encapsulation - Encapsulated Lists - Asymptotic Analysis - Algorithm Analysis - Hash Tables - Stacks and Queues - Trees and Traversals - Priority Queues - Binary Search Trees - Balanced Search Trees - Graphs - Weighted Graphs - Sorting - Disjoint Sets - Sortings - Splay Trees - Amortized Analysis - Randomized Analysis - Expression Parsing - Garbage Collection - Augmenting Data Structures

Lecture 1: Course Overview

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        3.5 (24 Ratings)

        Lecture Details

        CS 61B Data Structures - Fall 2006 Instructor 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. httpwww.cs.berkeley.edu

        LECTURES



        Review


        3.5

        24 Rates
        5
        42%
        10
        4
        13%
        3
        3
        25%
        6
        1
        21%
        5

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment