Lecture 18: Guest Lecturer
author: Jerry Cain,
Computer Science Department, Stanford University
published: Sept. 7, 2010, recorded: April 2008, views: 2475
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: Sept. 7, 2010, recorded: April 2008, views: 2475
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
So the least we could have it ten cones and the maximum is 40 cones. And every single customer because he doesn’t want to wait for every single cone to be done sequentially, then he’s gonna fight of a clerk or dispatch a clerk for every single ice cream cone that he wants. And so we will have clerks that are making the ice cream cones. We have 10 to 40 of those. But the thing is every single clerk because really giving the ice cream to the customer it has to ask for the manager’s inspection to get an approval for the cone that he made. ...
See the whole transcript at Programming Paradigms - Lecture 18
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: