Summary of computer comprehensive questions

  1. (Mathematical Calculation Question) How many different ways are there to distribute 6 identical balls to three different students, and some students are allowed to have no balls?
    C(8,2)=28. For a typical plug-in problem, directly set the formula, C(n+m-1,m-1). There are 6 balls, 5 empty ones, and there are students who can not divide them, and add 3 empty ones, a total of 8 empty spaces; insert 2 boards.
    insert image description here

  2. (Software Multiple Choice Question) What is Software Quality Assurance?
    A. Ensure that all work in the development process is carried out in accordance with regulations and standards.
    B. Ensure controllable and manageable software development cycle and resources.
    C. Ensure that the software meets expected requirements and specifications.
    D. Ensuring the safety and reliability of the software
    C.

  3. (Network Multiple Choice Question) Which of the following IP addresses is not a private address?
    A. 10.1.2.3
    B. 172.16.1.2
    C. 192.168.0.1
    D. 202.96.134.133
    D.

  4. (Mathematical proof question) Proof: If A, B, and C are all sets, then (A ∩ B) ∪ C = (A ∪ C) ∩ (B ∪ C).
    First, suppose x is an element in (A ∩ B) ∪ C, then x must satisfy x ∈ A and x ∈ B or x ∈ C. According to the distributive law, (A ∩ B) ∪ C can be expressed as (A ∪ C) ∩ (B ∪ C), so x must satisfy x ∈ A ∪ C and x ∈ B ∪ C, which means that x is (A ∪ C) ∩ (B ∪ C) an element.

Conversely, suppose x is an element in (A ∪ C) ∩ (B ∪ C), then x must satisfy x ∈ A ∪ C and x ∈ B ∪ C, that is, x ∈ A or x ∪ C, and x ∈ B or x ∈ C. Therefore, x is an element in (A ∩ B) ∪ C.

Therefore, (A ∩ B) ∪ C = (A ∪ C) ∩ (B ∪ C).

  1. (Software Multiple Choice Question) In software testing, what is the main difference between black box testing and white box testing?
    A. Black box testing only tests the functionality of the software, while white box testing only tests the performance of the software.
    B. Black-box testing only tests the correctness of the software, and white-box testing only tests the robustness of the software.
    C. Black-box testing only tests the interface of the software, while white-box testing only tests the internal logic of the software.
    D. Black box testing only tests the input and output of the software, while white box testing only tests the code of the software.
    C
  2. (AI Multiple Choice Question) Which of the following deep learning frameworks is not based on the Python programming language?
    A. TensorFlow
    B. PyTorch
    C. Keras
    D. Caffe

d. TensorFlow, PyTorch, and Keras are all deep learning frameworks based on the Python programming language, while Caffe is based on the C++ programming language.

4-14

  1. (Mathematical Calculation Problem) How many different ways are there to put 4 different balls in three different boxes so that no empty boxes appear?
    Choose 2 balls from 4 balls, and form 3 alternatives C 4 2 C_{4}^{2} with the other two ballsC42
    3 alternatives are arranged in all three boxes A 3 3 A_{3}^{3}A33
    So the counting item is C 4 2 ⋆ A 3 3 C_{4}^{2} \star A_{3}^{3}C42A33
  2. (Network fill in the blanks) FTP uses the transport layer protocol as __TCP protocol_____, and the server's provincial port number is ____21__ when establishing a connection.
    3. (Software multiple choice questions) When the software requirements are clear, the applicable software development model is (C)
    a fountain model b incremental model c waterfall model d spiral model.

4-17

  1. (Mathematical logic question) It doesn't matter whether a cat is black or white, as long as it can catch mice, it is a good cat.

W ( x ) x is a black cat \mathrm{W}(\mathrm{x}) \mathrm{x} is a black catW ( x ) x is a black cat
B ( x ) : x is a white cat B(x): x is a white catB(x):x is a white cat
C ( x ) : x can catch mice C(x): x can catch miceC(x):x can catch mice
G ( x ) : x is a good cat \mathrm{G}(\mathrm{x}): \mathrm{x} is a good catG(x):x是好猫
∀ x ( ( W ( x ) ∨ B ( x ) ) ∧ C ( x ) → G ( x ) ) \forall x((W(x) \vee B(x)) \wedge \mathrm{C}(\mathrm{x}) \rightarrow \mathrm{G}(\mathrm{x})) x((W(x)B(x))C(x)G ( x ))
2. (AI multiple-choice question) During the process of solving the problem with the neural network, ( B ) fell into a local extreme point.
A impossible B possible C inevitable
3.(Software True or False Question) Different objects can have equal identities throughout the life cycle of the object. Answer: wrong

Each object has its own unique identifier, and the corresponding object can be found through this identifier. Its identifier does not change during the entire life cycle of the object, and different objects cannot have the same identifier.

4-21

  1. (Mathematical solution question) There are 200 identical books, and they are placed in 4 different bookcases, so that the number of books placed in each bookcase can only be 20 40 60 80 200, how many ways are there to place them? ?

insert image description here
insert image description here
insert image description here
insert image description here

  1. (Network Multiple Choice Question) The IP address, 10.224.12.1 has a subnet mask of 255.240.0.0 and the address on the same subnet as ( C ).
    A.10.223.21.121
    B.10.24 0.46.23
    C.10.238.23.171
    D.10.242.23.120
    3.(Software question and answer question) Give the definition of module cohesion, and illustrate three types of model cohesion with examples.

Module cohesion is the interrelationship among components in a module. As one of the modularity metrics, it is an important concept to guide people in the design of module structure.
Module cohesion can be divided into: (It is enough to write three types.)
1) Functional cohesion (Functional Cohesion)
If all processing elements in a module complete one and only complete one function, it is called functional cohesion.
Functional cohesion is the highest degree of cohesion. But in the software structure, not every module can be designed as a functional cohesive module.
2) Sequential Cohesion
If the processing elements in a module are closely related to the same function, and these processing elements must be executed sequentially, it is called sequential cohesion.
3) Communication Cohesion
If all processing elements in a module use the same input data and/or produce the same output data, it is called communication cohesion.
4) Process cohesion (Procedural Cohesion)
If the processing elements in a module are related and must be executed in a specific order, it is called procedural cohesion.
The difference between procedural cohesion and sequential cohesion is: In sequential cohesion, data flow flows from one processing unit to another processing unit, while procedural cohesion is control flow flowing from one action to another.
5) Temporal Cohesion
If the tasks contained in a module must be executed within the same period of time, it is called Temporal Cohesion. Also known as instantaneous cohesion.
6) Logical Cohesion
If the tasks completed by the modules logically belong to the same or similar category, it is called logical cohesion.
7) Coincidental Cohesion

Guess you like

Origin blog.csdn.net/hhhhhhhhhhwwwwwwwwww/article/details/129293217