Computer Science 61B

UC Berkeley , Prof.Jonathan Shewchuk

LECTURE10 :

Testing

1445 views

Lecture Description

CS 61B: Data Structures - Fall 2006Instructor Jonathan ShewchukFundamental 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.http://www.cs.berkeley.edu

Course Description

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

SEE ALLAdd a note
YOU
Add your Comment
 

About

FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

[email protected]

Learn More About us

FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel