software engineering
sort by: Relevancy | Title try advanced search for more options
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department discusses energy conservation in further depth, focusing on the design of heat exchangers.
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department discusses balancing equations and the conservation of mass in relation to process design.
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department continues his discussion on scaling by touching upon a pharmacokinetics problem.
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department discusses scaling, focusing on dimensionless analysis.
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department discusses the functioning of a kidney dialysis machine and clinic.
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department discusses the interactions between chemical engineering and the environment.
-
Professor Channing Robertson of the Stanford University Chemical Engineering Department discusses biomedical engineering and the functions and anatomy of the kidney.
-
Information Hiding, The Void Return Type, Parameter Passing Between Methods, Bad Times with Methods, Using Classes, Instance variables vs Local Variables, The RandomGenerator Program Example, The RollDice Program Example, The setSeed() Method
-
Memory, Different Sections of Memory for Different Types of Variables, Memory Allocation Mechanics, The Pointer Viewpoint, The Binky Pointer Fun Video
-
Enumeration, Characters, The ASCII Subset of Unicode, Reading Characters, Math on Characters, char as a Primitive Type; the Character Class, Strings and Their Manipulations
-
Heap Management - How Information about Allocations are Stored in the Heap
Stanford / Computer Science
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
-
readInt() and readDouble(), The Division Operator w.r.t ints and Doubles, Order of Precedence for Operators, Type Casting, Shorthands, Constants, The Boolean Data Type, Value Comparisons, Boolean Expressions, Short Circuit Evaluation, Statement Blocks, Scope of Variables, Cascading if, The Switch Statement, The For Loop, The While Loop
