ProGrads 卷別
資料結構與演算法
選擇國立中興大學 2025 · 考試 · 第 19 題
考科資料結構
(3 points) In an array-based circular queue, how do you check if the queue is full?
- (A)By comparing the front and rear indices directly
- (B)By checking if (rear + 1) % size == front
- (C)By ensuring rear == front at all times
- (D)By ensuring (front + 1) % size == rear