队列是一个先入先出的数据结构。

Queues are the structures holding messages in a first-in, first-out fashion.

youdao

您会面临供和需哪一个先实现的困惑。

You are faced with the quandary of supply and demand — Which will come first?

youdao

基本上，一个队列就是一个先入先出(FIFO)的数据结构。

Basically, a queue is a first-in, first-out (FIFO) data structure.

youdao

And why don't we just start by you introducing yourselves a little bit about like what year you are, where you're from and what you're studying in Princeton.

请两位先做个自我介绍吧,诸如你们读几年级，从何而来，在普林斯顿学什么专业等。

普林斯顿公开课 - 人性课程节选

So, there will be a whole -- I'm looking ahead now, projecting into some topics that we'll explore more closely later.

所以对于这一部分,大家先有个印象,我们以后将会更细致的讨论

耶鲁公开课 - 古希腊历史简介课程节选

All right, so hopefully if you see any other combination of quantum numbers, for example, if it doesn't quickly come to you how many orbitals you have, you can actually try to write out all the possible orbitals and that should get you started.

所以希望你们如果遇到,任何其它的量子数组合的问题，如果你们不能马上想到有多少个轨道，可以试着先写出所有的轨道,这是个不错的切入点。

麻省理工公开课 - 化学原理课程节选