Comprehensive Technical Exam with Multiple‑Choice, Short Answer, and Programming Questions

This article presents a comprehensive technical exam consisting of multiple sections: an introductory banner, instructions for a 30‑minute test, a series of 20 multiple‑choice questions covering programming history, algorithms, networking, 5G, databases, and other fundamentals, followed by simple answer questions about design patterns and tree manipulation, and several programming challenges including a C program that counts cycles in a permutation and combinatorial problems about counting ways to eat bread or climb stairs.

The multiple‑choice section lists each question with four options (A‑D), ranging from the first female programmer to characteristics of 5G RLC layers.

The simple‑question part asks for explanations of the singleton pattern and a tree‑pruning algorithm.

The coding tasks ask participants to write programs (in any language) to enumerate ways to consume N pieces of bread with steps of 1 or 2, and to compute the number of ways to climb N stairs with steps of 1, 2, or 3.

One of the programming questions includes the following C code, which reads a permutation, marks visited elements, and outputs the number of cycles:

#include
int n, d[100];
bool v[100];
int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", d + i);
        v[i] = false;
    }

    int cnt = 0;

    for (int i = 0; i < n; ++i) {
        if (!v[i]) {
            for (int j = i; !v[j]; j = d[j]) {
                v[j] = true;
            }
            ++cnt;
        }
    }

    printf("%d\n", cnt);
    return 0;
}
输入：10 7 1 4 3 2 5 9 8 0 6

The article concludes with a wish for exam success and an invitation to share answers in the comments.