Navigate to list of lectures -- Keyboard shortcut: 'u'  Previous lecture -- Keyboard shortcut: 'p'  Next lecture -- Keyboard shortcut: 'n'  Course home        Alphabetic index  Exit possible frame set        First slide  First annotated slide  Lecture notes - all slides and notes together  Textbook of this lecture      PDF print page        Help page about these notes
Lecture 12

LECTURE 12:
Collection Classes

Kurt NÝrmark ©
Department of Computer Science, Aalborg University, Denmark

Title page            Abstract            References from this lecture            Exercises in this lecture            Source programs in this lecture            

A complete PDF version of the text book is now available. The PDF version is an almost complete subset of the HTML version (where only a few, long program listings have been removed). See here.

Page 1Collections - History and OverviewPage 19Sample use of class LinkedList<T>
Page 2A historic View on Collection ProgrammingPage 20Time complexity overview: Collection classes
Page 3Generic Collections in C#Page 21Using Collections through Interfaces
Page 4Overview of Generic Collections in C#Page 22Generic Dictionaries in C#
Page 5The Interface IEnumerable<T>Page 23Dictionaries
Page 6The Interface ICollection<T>Page 24Overview of Generic Dictionaries in C#
Page 7The Interface IList<T>Page 25The interface IDictionary<K,V>
Page 8Overview of the class Collection<T>Page 26Overview of the class Dictionary<K,V>
Page 9Sample use of class Collection<T>Page 27Sample use of class Dictionary<K,V>
Page 10Specialization of CollectionsPage 28Notes about Dictionary Classes
Page 11Specialization of Collections - a realistic examplePage 29Time complexity overview: Dictionary classes
Page 12Overview of the class List<T>Page 30Non-generic Collections in C#
Page 13Sample use of class List<T>Page 31The non-generic collection library in C#
Page 14Sample use of the Find operations in List<T>Page 32Notes about non-generic Collections
Page 15Sample use of Sort in List<T>Page 33Patterns and Techniques
Page 16Sample use of BinarySearch in List<T>Page 34The Iterator Design Pattern
Page 17Overview of the class LinkedList<T>Page 35Making iterators with yield return
Page 18The class LinkedListNode<T>Page 36Iterator blocks and yield return

LENO - LEcture NOtes with LAML technologyGenerated: Monday February 7, 2011, 12:21:16
Program Oriented Web Engineering - using LAML