Open course ware

[CREAKING] [RUSTLING] [CLICKING] SIGI ZHENG: There's a thinking approach that you need to grasp. So I know I'm not as funny and as smart as Juan and Azizi. So I need to make sure you like me. So I brought some food from Trader Joe's for today. And it's a way to make this very, very technical lecture a little bit funny. So that's about today. So today, we will talk about-- we already talked about green buildings and healthy buildings. Now we're going to talk about how to quantitatively measure the benefit of the green building or the or the green city and how to do a model. But don't be so worried. And this model is so simple, and I'm sure you can understand. So just to quickly recap-- the quickly recap is the following. So for the entire this course, we talk about the business case. We talk about business case. Our point is you cannot [INAUDIBLE] for people, for the planet with three bottom lines-- and very, very important bottom line, the ...

[CREAKING] BARBARA IMPERIALI: So what we are going to talk about today, and I'm going to do something a little annoying, as usual, I want to take you somewhere here. Yeah, sure, back to carbon, that's fine. But what I want to show you is the sizes of the molecular players in translation because we are going here now from the smallest carbon atom. And we spent the first four lectures on amino acids, nucleotides, sugars, phospholipids. But we're entering new territory here, and I'm just going to do this in such a way that it comes onto the screens. What you can see here is, in order to make proteins like hemoglobin and antibodies-- these are made up of amino acids, the really tiny things that are out of view right now-- we need large entities that are made up of either nucleic acids alone or nucleic acids plus proteins. And so the things that will feature today are the transfer RNAs and the ribosome. And I want you to look at the size of this molecular machi...

[CREAKING] [CLICKING] [SQUEAKING] [RUSTLING] [CLICKING] JUSTIN SOLOMON: We just started a new unit on graph theory, which is going to be sort of our focus for the next couple of lectures in 6006. And so I thought we'd give it a little bit of review at the beginning the lecture because, as usual, I've muddled together a lot of notions in our previous lecture, and then start with some new ideas. So basically, in our previous lecture, we talked about an algorithm called breadth-first search. And then almost always you see that paired with a second algorithm called depth-first search. And following tradition, and basically logic, we'll do the same thing in 006 today. But in any event, for today we'll stick to the technical material. So as a little bit of review, I guess actually, the one thing I didn't do on this slide was actually draw a graph. So we should probably start with that. So if you recall, graph is a collection of nodes or vertices depending-- ...