多选题
Given below statements: 1.F...
发布于 2022-03-03 17:31:14
Given below statements:
1.First-in-first out types of computations are efficiently supported by STACKS.
2.Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
3.Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
4.Last-in-first-out type of computations are efficiently supported by QUEUES.
Which of the following is correct?（单选）
1.First-in-first out types of computations are efficiently supported by STACKS.
2.Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
3.Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
4.Last-in-first-out type of computations are efficiently supported by QUEUES.
Which of the following is correct?（单选）
登录后免费查看答案
关注者
0
被浏览
7
