0% found this document useful (0 votes)
3 views4 pagesDiscrete Math and Operating System
The document contains a series of questions related to discrete mathematics and operating systems, covering topics such as set theory, binary relations, process management, and file systems. Each question presents multiple-choice answers that test the reader's understanding of these concepts. The questions are designed to assess knowledge in both theoretical and practical aspects of computer science.
Uploaded by
m91763195Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views4 pagesDiscrete Math and Operating System
The document contains a series of questions related to discrete mathematics and operating systems, covering topics such as set theory, binary relations, process management, and file systems. Each question presents multiple-choice answers that test the reader's understanding of these concepts. The questions are designed to assess knowledge in both theoretical and practical aspects of computer science.
Uploaded by
m91763195Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
/ 4
Discrete Math
1. Let E(x):x be an even number and P(x): x be a prime number,
then "there is a unique prime even number" is translated as ()
A:存在 x(P(x)∩E(x) B:任意 x(P(x)⺂E(x))
C: 存在 x(P(x)∩E(x)∩任意 y(P(y)∩E(y) ⺂(x=y)))
D: x(P(x)∩E(x)∩ non-y(P(y)∩E(y)∩(x!) =y）))
2. From which step does the following reasoning start to go
wrong () [Give 6 steps of logical reasoning to determine which
step starts to go wrong]
A:2 B:3 C:4 D:5
3. Two sets 6x6, how many subsets are there? A binary
relationship?
4. A company wants to assign a business trip project, only 1-2
people can go, and it is stipulated that A must go to C, and B
can not go to C, ask how many distribution plans ()
A:2 B:3 C:4 D:5
5. Let the power set of the set A={a,b,c,d,e},B=A-empty set-A,
in the partial order set {B, contained in the power set}, what
are the maximum and maximum number of elements of B ()
A:3,3 B:6,6 C:3,0 D:6,0
6. What is the number of edges and the number of shades of an
undirected complete graph of 9 vertices ()
A:36.10 B:72.9 C:36.8 D:36.9
7. N is the set of natural numbers, Q is the set of rational
numbers, the set of prime numbers, the set of infinite
polynomials, the set of real numbers between 0-1, the power
set, and the cardinality of Avrequiro has several ()
A: 5 B:4 C:3 D:2
8. Give 4 drawings to determine whether it is a floor plan or a
Hamiltonian diagram ()
A: Yes floor plan is Hamiltonian diagram B: Yes floor plan, not
Hamiltonian diagram
C: Not a floor plan is a Hamiltonian diagram D: Not a floor plan
is not a Hamiltonian diagram
9. Give a graph to find the minimum cost () [mainly use Dijstra to
find the shortest path, which is basically the same as the data
structure question type in the initial test]
ABCD Four options are one number
10. Let a binary relation be defined on a set less than or equal to
the relation <a,b>,a<=b, then its symmetric closure and
symmetric transitive closure relation are ()
A:<,!= B:<,> C:>,全域 D:>=,全域
11. If the number of vertices in a planar graph is n and the
number of edges is m, then ()
A:m=n-1; B:m=n+1; C:n<=3m-6 D:n>=3m-6
12. If the set A is {1,2,3,4} and the binary relation is defined as
divisible by 3, then the quotient set of the A/ relation is ()
A{1,3} B:{}1,4} C{1} D{3}
13. Given a discrete background, ask how many processes might
cause deadlocks, and use the knowledge of discrete
mathematics to solve ()
14. Ask how many addition operations are required for 10001
numbers, and only 4 numbers can be calculated each time ()
15. Given a set A, determine how many kinds of relations of this
set satisfy reflexive, anti-reflexive, symmetrical,
antisymmetric, and transitive relations ()
A: 5 B:4 C:3 D:2
operating system
1. Do I need to create a new process to execute shell commands
on a Linux system?
A: Internal commands are needed, external commands are not
needed B: Neither
C: All need D: Not needed internally, not needed externally
2. What happens to the child process when the parent process is
revoked early()
A: It is undone as well as the parent process
B: Think of init as the parent process
C: Becoming a zombie orphan process
D: Independence
3. When the file system is quickly formatted, the file data and
FAT tables ()
A: Delete, delete B: Keep both
C: Delete, Retain D: Retain, Delete
4. The following system calls are ()
(1) math function cos call (2) read call (3) stuck instruction
5. The main memory capacity is xxx, the address line is xxx, how
big is the hard disk, and how big is the last virtual memory ()
6. Regarding the deferred write buffer, what can make it output
buffer data ()
A: Device released B: Device preempted C: Write completed but
not within the specified time
7. Windows core process, a process contains three threads, one of
the threads is blocked, then ()
A: Everything else is blocking B: The process is blocked, the
thread is not blocking
C: The process is not blocking, the thread is blocking D: Not
blocking
8. The value returned by the fork() function call in the parent
process and the child process ()
A: Returns the ID of the child process in the parent process and 0
in the child process.
B: Returns the ID of the child process in the parent process and
the ID of the parent process in the child process.
C: returns 0 in the parent process and 0 in the child process;
9. Create a new child process in the parent process, the parent
process obtains the address space of the memory and calls the
methods open() and read(), then the child process()
A: Share everything in the parent process B: Share the address
space, not share calls
C: Do not share parent process resources D: Share read() and
address space
10. The characteristics of request-type pagination are ()
A: There is no need to load the program into the contiguous
space of the main memory
B: You don't need to load all programs into a contiguous space
in the main memory at the same time
C: No page replacement required
D: There is no requirement for page loss interruption
11. A single program can be loaded into continuously allocated
memory space management with ()
A: Override Technique B: Switching Technique C: Segment Page
Management D: Program Loading
12. Hard Links and Symbolic Links()
A: Hard links point to the file path, and symbolic links point to
the physical address of the file
B: All points to the physical address of the file
C: None of them can be used across systems
D: Hard links point to the physical address of the file, and
symbolic links point to the file path
13. If multiple processes share the same file F, then in the following
description, the correct one is ().
A. Each process can only open file F in "read" mode
B. There is only one entry in the system open file table that
contains the attribute of F
C. The user of each process opens the same entry about F in the
file table
D. When the process closes F, the system deletes the entry of F
in the system open file table