Skip to content
free
K
1
2
practice
Home
Math
English
Science
Social Studies
Contact
Language
English
Español
Sign In
/
High School Electives
/
Computer Science
/
Abstract Data Types
Grade Level
Computer Science
HSCS.150 Abstract Data Types
0%
Skill Level
🔴 Hard
00:00
Progress to Next Level
25% to Medium
Easy
Medium
Hard
Mastery
100%
A team writes, "Our Queue ADT is a ring buffer with front and rear indexes." Which revision better distinguishes behavior from implementation?
A
A Queue ADT should expose index arithmetic so clients can skip enqueue.
B
A Queue ADT provides FIFO enqueue and dequeue behavior; a ring buffer is one possible implementation.
C
A Queue ADT provides random removal from any internal index; a ring buffer is required.
D
A Queue ADT is defined by the names front and rear, not by removal order.
Submit Answer
