2019q1 Homework1 (lab0)
contributed by < dianarolien
>
開發環境
作業要求
作業要求寫得很多,不是只有下方這件事,請重新閱讀指定材料並摘要
Image Not Showing
Possible Reasons
- The image file may be corrupted
- The server hosting the image is unavailable
- The image path is incorrect
- The image format is not supported
Learn More →
jserv
作業說明 / cprogramminglab
-
實驗目標為實作 queue
- first in, first out (FIFO)
- last in, first out (LIFO)
-
實作以下function:
- q_new : Create a new, empty queue.
- q_free : Free all storage used by a queue.
- q_insert_head : Attempt to insert a new element at the head of the queue.
- q_insert_tail : Attempt to insert a new element at the tail of the queue.
- q_remove_head : Attempt to remove the element at the head of the queue.
- q_size : Compute the number of elements in the queue.
- q_reverse : Reorder the list so that the queue elements are reversed in order.
Image Not Showing
Possible Reasons
- The image file may be corrupted
- The server hosting the image is unavailable
- The image path is incorrect
- The image format is not supported
Learn More →
- 解釋自動評分系統運作的原理
- 提及 qtest 的行為和裡頭的技巧
實作
Queue structure
q_new
Create a new, empty queue.
q_free
Free all storage used by a queue.
q_insert head
Attempt to insert a new element at the head of the queue (LIFO discipline).
q_insert_tail
Attempt to insert a new element at the tail of the queue (FIFO discipline).
q_remove_head
Attempt to remove the element at the head of the queue.
q_size
Compute the number of elements in the queue.
q_reverse
Reorder the list so that the queue elements are reversed in order.
This function should not allocate or free any list elements ( either directly or via calls to other functions that allocate or free list elements.).
Instead, it should rearrange the existing elements.
自動評分系統運作的原理
qtest 的行為和裡頭的技巧