Deck 19: broad concept of computer security and its importance in modern society.
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/102
Play
Full screen (f)
Deck 19: broad concept of computer security and its importance in modern society.
1
Which language uses mnemonics to represent instructions?
A) High-level language
B) Assembly language
C) Machine language
D) Virtual language
E) Accumulator language
A) High-level language
B) Assembly language
C) Machine language
D) Virtual language
E) Accumulator language
B
2
Which of the following does not characterize the imperative (procedural) paradigm for high level programming languages?
A) Sequential execution of instructions
B) Use of variables to represent memory locations
C) Exemplified by the functional and the logic models of this paradigm
D) The use of assignment statements that change the values of variables used in this paradigm.
E) Utilized by the dominant programming languages (BASIC, FORTRAN, C, C++, PASCAL) in the historical evolution of computer software.
A) Sequential execution of instructions
B) Use of variables to represent memory locations
C) Exemplified by the functional and the logic models of this paradigm
D) The use of assignment statements that change the values of variables used in this paradigm.
E) Utilized by the dominant programming languages (BASIC, FORTRAN, C, C++, PASCAL) in the historical evolution of computer software.
C
3
Give some examples of abstractions as they relate to a computer system.
A user might run an application program to solve a problem and need only know how that program runs. The interface to the application program masks the underlying programming statements that make up the program. That program, written in a high-level language, is itself an abstraction, hiding the details of the machine-level instructions that actually get executed when the program runs.
4
Describe the relationship among bases that are powers of 2.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
5
Compare and contrast the signed-magnitude and two's complement representations of negative integers.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
6
Compare and contrast the ASCII character set and the Unicode character set.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
7
Identify the six basic logic gates and describe the behavior of each.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
8
What is a transistor?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
9
Describe the basic characteristics of a von Neumann computer architecture.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
10
Describe, in general, the limitations computers have regarding numbers and arithmetic.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
11
What does developing and implementing a successful test plan for programs require?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
12
Distinguish between an atomic data type and a composite data type.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
13
Describe the following composite data-structuring mechanisms: arrays, records, and classes.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
14
Are an array and a list the same? Explain.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
15
What is an intractable problem?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
16
What are the two primary services that an operating system provides?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
17
Compare and contrast multiprogramming and timesharing.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
18
Describe paged-memory management.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
19
What is a file system?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
20
What is a directory tree?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
21
What does a disk-scheduling algorithm do?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
22
What is the purpose of file protection schemes and what part of the system manages these file protection schemes?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
23
Why are spreadsheets particularly good at performing what-if analysis?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
24
Describe the three primary components of a database management system.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
25
What is the relationship among database tables, records, and fields?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
26
What is a semantic network?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
27
What is an artificial neural network?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
28
What are the three compositional elements of a robot?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
29
Explain the goal and execution of a Turing test.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
30
Discuss the inherent ambiguities that exist in natural languages that make it difficult for computers to comprehend them.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
31
What is a queuing system?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
32
What functionality does a game engine provide?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
33
What part does artificial intelligence play in game design?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
34
Describe the three aspects of a system that make it well-suited for simulation.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
35
Describe the client/server model and its relationship to computer networks. Give examples.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
36
Describe how a message is transmitted using packet switching.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
37
Describe the Domain Name System (DNS) and how it is used to resolve network addresses.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
38
Explain the advantages of cloud computing.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
39
What actually occurs when a user "visits" a web page?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
40
Name some specific uses of cookies.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
41
What is the main role of HTML?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
42
Describe the three components of the CIA triad of information security.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
43
Give the three categories of authentication credentials and an example of each.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
44
In which phases of the software life cycle should verification activities take place?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
45
What is the halting problem?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
46
Match the type of security attack to its description.
-Uses a fake web page to collect information such as usernames and passwords.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
-Uses a fake web page to collect information such as usernames and passwords.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
47
Match the type of security attack to its description.
-Uses a hidden feature of a program to gain special access to a system.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
-Uses a hidden feature of a program to gain special access to a system.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
48
Match the type of security attack to its description.
-Renders a system useless by preventing a valid user from accessing it.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
-Renders a system useless by preventing a valid user from accessing it.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
49
Match the type of security attack to its description.
-Uses network access to "listen" to ongoing message traffic.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
-Uses network access to "listen" to ongoing message traffic.
A)Man-in-the-middle
B) Denial of service
C) Back door
D) Phishing
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
50
Match the cryptography term to its description.
-Based on laying out the letters of a message in a grid.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
-Based on laying out the letters of a message in a grid.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
51
Match the cryptography term to its description.
-Based on a pair of corresponding cipher keys.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
-Based on a pair of corresponding cipher keys.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
52
Match the cryptography term to its description.
-Shifts a letter a certain number of characters down the alphabet.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
-Shifts a letter a certain number of characters down the alphabet.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
53
Match the cryptography term to its description.
-Uses sender's personal data and authenticated public key.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
-Uses sender's personal data and authenticated public key.
A) Route cipher
B) Caesar cipher
C) Digital certificate
D) Public-key cryptography
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
54
Which of the following describes the number 0 and any number that can be obtained by repeatedly adding one to it?
A) Number
B) Natural number
C) Integer
D) Negative number
E) Rational number
A) Number
B) Natural number
C) Integer
D) Negative number
E) Rational number
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
55
Which of the following is true about vector graphics?
A) They represent real-world images very well.
B) They do not represent each pixel individually.
C) JPEG is a vector graphics format.
D) GIF is a vector graphics format.
E) They rely on spatial compression.
A) They represent real-world images very well.
B) They do not represent each pixel individually.
C) JPEG is a vector graphics format.
D) GIF is a vector graphics format.
E) They rely on spatial compression.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
56
Which of the following is an instruction to the assembler program?
A) Assembler directive
B) Assembly language instruction
C) Comment
D) Loader
E) Machine language instruction
A) Assembler directive
B) Assembly language instruction
C) Comment
D) Loader
E) Machine language instruction
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
57
Which of the following translates a high-level language program into machine code?
A) Procedure
B) Interpreter
C) Bytecode
D) Paradigm
E) Compiler
A) Procedure
B) Interpreter
C) Bytecode
D) Paradigm
E) Compiler
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
58
Which of the following does not represent one of the four stages of the object-oriented design process?
A) Brainstorming
B) Filtering
C) Responsibility algorithms
D) Scenarios
E) Information hiding
A) Brainstorming
B) Filtering
C) Responsibility algorithms
D) Scenarios
E) Information hiding
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
59
A systems programmer writes programs that make it easier for others to program.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
60
Trees are a special case of graphs in which the edges represent a hierarchical relationship amongst the vertices.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
61
Object-oriented design focuses on the data objects that are to be transformed, resulting in a hierarchy of objects.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
62
A(n) _______________ is a mental model that removes complex details.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
63
Drawing boxes for variables and filling in the values is part of following an algorithm, whereas asking questions and deferring details is part of _______________ an algorithm.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
64
While at each iteration of a(n) _______________ sort, one more item is put into its permanent place, at each iteration of a(n) insertion sort one more item is put into its appropriate place with respect to those items above it.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
65
The lines connecting the nodes of a graph are called _______________.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
66
The requirement that only a value of the proper type can be stored into a variable is called _______________.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
67
_______________ is a language feature that enforces information hiding.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
68
What is Moore's law?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
69
Explain the onion analogy we use in this book to organize our exploration of computing systems.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
70
Describe the separation between the user and the computer hardware as software evolved.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
71
How does positional notation determine the value of a number?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
72
Convert the following base 13 number to decimal: 998
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
73
Explain the concepts of subprograms and parameters, and distinguish between value and reference parameters.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
74
What role did Dutch computer scientist Edsger Dijkstra have in the development in high-level programming language design?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
75
Compare and contrast a binary tree and a binary search tree.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
76
Convert the following decimal number to base 13: 297
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
77
Why are binary digits used to represent information on a computer?
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
78
Compare and contrast a stack and a queue from a logical view.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
79
Explain what is meant by a compression ratio of 3/4.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck
80
Describe the floating-point representation of a number.
Unlock Deck
Unlock for access to all 102 flashcards in this deck.
Unlock Deck
k this deck