---
tags: computer-arch
---

# Quiz1 of Computer Architecture (2025 Fall)

:::info
:information_source: General Information
* You are allowed to read **[lecture materials](https://wiki.csie.ncku.edu.tw/arch/schedule)**.
* That is, an open book exam.
* You are permitted to use Google Search.
* We are using the honor system during this quiz, and would like you to accept the following:
1. You will not share the quiz with anyone.
2. You will not discuss the material on the quiz with anyone until after solutions are released.
3. **Taking screenshots or using any image processing tools is prohibited.**
4. If you need to proofread your work, you may use tools like [QuillBot](https://quillbot.com/) or [Grammarly](https://www.grammarly.com/).
* Each answer has 3 points.
* You must answer in valid numeric representation and/or English alphabet except your formal name.
* Always provide your answer in the shortest form. For example, use `ptr->member` instead of `(*ptr).member`.
* Assume that each C program already includes the headers `<assert.h>`, `<stdint.h>`, `<stddef.h>`, `<stdlib.h>`, `<stdio.h>`, `<stdbool.h>`, and `<string.h>`.
* The C standard referenced in this quiz is C99, officially known as [ISO/IEC 9899:2018](https://www.iso.org/standard/74528.html).
* ==Bonus Points==: After the class resumes at 10:35 AM, if you voluntarily participate in the class discussions, please email the instructor afterward, including your responses to the instructor's questions and any follow-up contributions. You will receive an additional ==20 points== for this quiz.
* :timer_clock: 09:15 ~ 10:25AM on Sep 16, 2025
:::

**[Problem set for Quiz1](https://drive.google.com/file/d/1Z2CeiyR-P1bwysCrm9UNIcPqWLfwXM45/view?usp=sharing)** $\to$ The PDF password consists of two parts, all in lowercase, and each can be found in the [course introduction slides](https://docs.google.com/presentation/d/15UftnjHE0OJqmmiW4YR2eBZ7VqpF3c4iImqA7csi26s/edit?usp=sharing). They are
* The surname of the most recent National Cheng Kung University alumnus who served as a Linux kernel maintainer and participated in this course series.
* the year (Arabic numerals) when the instructor's daughter's favorite video game character was first released

When prompted, enter a lowercase password in the form surnameYYYY (e.g., `huang1991`); this example is not the real password.

You are expected to answer A01 through A09, B01 through B08, and C01 through C21.

---

## Appendix `A`

/* Test suite */

void *test_for_each_callback(void *element, void *data)
{
    (*(int *) data)++;
    return NULL;
}

void test_delete_callback(void *element)
{
    /* Would free element in real use */
}

void test_vector_init()
{
    printf("Testing vector_init... ");
    vector_t v;
    vector_init(&v);
    assert(v.data == NULL);
    assert(v.size == 0);
    assert(v.count == 0);
    assert(v.free_slot == 0);
    printf("PASSED\n");
}

void test_vector_push_pop()
{
    printf("Testing vector_push and vector_pop... ");
    vector_t v;
    vector_init(&v);

    int data1 = 42, data2 = 84, data3 = 126;

    assert(vector_push(&v, &data1) == 0);
    assert(vector_used(&v) == 1);

    assert(vector_push(&v, &data2) == 1);
    assert(vector_used(&v) == 2);

    assert(vector_push(&v, &data3) == 2);
    assert(vector_used(&v) == 3);

    assert(vector_pop(&v) == &data3);
    assert(vector_used(&v) == 2);

    assert(vector_pop(&v) == &data2);
    assert(vector_used(&v) == 1);

    assert(vector_pop(&v) == &data1);
    assert(vector_used(&v) == 0);

    assert(vector_pop(&v) == NULL);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_get_at()
{
    printf("Testing vector_get_at... ");
    vector_t v;
    vector_init(&v);

    int data1 = 10, data2 = 20, data3 = 30;

    vector_push(&v, &data1);
    vector_push(&v, &data2);
    vector_push(&v, &data3);

    assert(vector_get_at(&v, 0) == &data1);
    assert(*(int *) vector_get_at(&v, 0) == 10);

    assert(vector_get_at(&v, 1) == &data2);
    assert(*(int *) vector_get_at(&v, 1) == 20);

    assert(vector_get_at(&v, 2) == &data3);
    assert(*(int *) vector_get_at(&v, 2) == 30);

    assert(vector_get_at(&v, 3) == NULL);
    assert(vector_get_at(&v, 100) == NULL);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_delete_at()
{
    printf("Testing vector_delete_at... ");
    vector_t v;
    vector_init(&v);

    int data1 = 100, data2 = 200, data3 = 300, data4 = 400;

    vector_push(&v, &data1);
    vector_push(&v, &data2);
    vector_push(&v, &data3);

    vector_delete_at(&v, 1);
    assert(v.free_slot == 1);
    assert(vector_get_at(&v, 1) == NULL);

    /* Push reuses free slot */
    assert(vector_push(&v, &data4) == 1);
    assert(v.free_slot == 0);
    assert(vector_get_at(&v, 1) == &data4);
    assert(*(int *) vector_get_at(&v, 1) == 400);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_for_each()
{
    printf("Testing vector_for_each... ");
    vector_t v;
    vector_init(&v);

    int data1 = 1, data2 = 2, data3 = 3;

    vector_push(&v, &data1);
    vector_push(&v, &data2);
    vector_push(&v, &data3);

    int counter = 0;
    vector_for_each(&v, test_for_each_callback, &counter);
    assert(counter == 3);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_delete_all()
{
    printf("Testing vector_delete_all... ");
    vector_t v;
    vector_init(&v);

    int data1 = 10, data2 = 20, data3 = 30;

    vector_push(&v, &data1);
    vector_push(&v, &data2);
    vector_push(&v, &data3);

    assert(vector_used(&v) == 3);

    vector_delete_all(&v, test_delete_callback);
    assert(vector_used(&v) == 0);
    assert(vector_pop(&v) == NULL);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_resize()
{
    printf("Testing vector automatic resize... ");
    vector_t v;
    vector_init(&v);

    /* Push more than initial size */
    for (int i = 0; i < 100; i++)
        vector_push(&v, (void *) (intptr_t) i);

    assert(vector_used(&v) == 100);
    assert(v.size >= 100);

    /* Verify all elements */
    for (int i = 0; i < 100; i++)
        assert((intptr_t) vector_get_at(&v, i) == i);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_get_end()
{
    printf("Testing vector_get_end... ");
    vector_t v;
    vector_init(&v);

    int data1 = 111, data2 = 222, data3 = 333;

    assert(vector_get_end(&v) == NULL);

    vector_push(&v, &data1);
    assert(vector_get_end(&v) == &data1);

    vector_push(&v, &data2);
    assert(vector_get_end(&v) == &data2);

    vector_push(&v, &data3);
    assert(vector_get_end(&v) == &data3);

    vector_free(&v);
    printf("PASSED\n");
}

void test_vector_set_at()
{
    printf("Testing vector_set_at... ");
    vector_t v;
    vector_init(&v);

    int data1 = 1, data2 = 2, data3 = 3, data4 = 999;

    vector_push(&v, &data1);
    vector_push(&v, &data2);
    vector_push(&v, &data3);

    size_t initial_size = vector_used(&v);
    assert(vector_set_at(&v, 1, &data4) == &data4);
    assert(vector_used(&v) == initial_size); /* Size unchanged */
    assert(vector_get_at(&v, 1) == &data4);

    assert(vector_set_at(&v, 10, &data4) == NULL); /* Out of bounds */

    vector_free(&v);
    printf("PASSED\n");
}

int main()
{
    printf("=== Running Vector Tests ===\n");

    test_vector_init();
    test_vector_push_pop();
    test_vector_get_at();
    test_vector_delete_at();
    test_vector_for_each();
    test_vector_delete_all();
    test_vector_resize();
    test_vector_get_end();
    test_vector_set_at();

    printf("\n=== All Tests Passed ===\n");

    return 0;
}