CompSci Final Exam Flashcards

1
Q

Machine language is a high-level programming language.

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

One of the benefits of machine language is that it uses natural language and mathematical notations.
T/F

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Clients cannot perform local computations without access to the network.

A

Fasle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Assemblers,____ and interpreters are all exampels of language services.

A

Compilers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

for a program to run on a naked machine, it must be represented in binary.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A Von Neumann computer without any helpful user-oriented features is called a(n)._____ machine.

A

naked

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

The_____ hides from the user the messy details of the underlying hardware.

A

Interface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

In__________, a single instruction provides multiple instructions in __________

A

high-level programming, machine language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

A(n)______ operation involves the comparison of values and the subsequent use of the outcome to decide what to do next.

A

conditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Which language does NOT require a semicolon to terminate an executable program statement

A

Python

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

The software translator used to convert our high-level language instructions into machine language instructions is called a(n)________

A

Complier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

High-level programming languages were created to overcome the deficiencies of________ language.

A

assembly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Assembly language programs are _____ Specific

A

Machine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Newer languages such as Java and C# were developed specifically to run on a variety of hardware platforms without the ned for separate ________ for each type of machine.

A

Complier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

The __________ computer architecture is characterized by sequential fetch- decode-execute cycles.

A

Von Neumann

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Each language we learned about uses its own notation (-, l, or #) ot denote aprogram comment.

A

true

17
Q

A LAN connects devices that are not ni close proximity but rather are across town, across the country, or across the ocean.

A

False

18
Q

_________is a low-power wireless standard used to communicate between devices located quite close to each other.

A

Bluetooth

19
Q

A ________ makes internetwork connections and provides routing between different WANs.

A

Gateway

20
Q

is the term for the separation of a service from the entity (or entities) providing that service.

A

Virtualization

21
Q

The most common public-key encryption algorithm is ____

A

RSA

22
Q

A_______ cipher, also called a shift cipher, involves shifting each character in the message to another character some fixed distance farther along in the alphabet.

A

Caesar

23
Q

The ________ takes the password the user originally chooses, chops it up, and stirs it around according to a given formula.

A

hash function

24
Q

An asymmetric encryption algorithm requires the use of a secret key known to both the sender and receiver.
T/F

A

False

25
Q

The success of RSA encryption depends on the fact that ti is extremely difficult to find the prime factors for n if n is large number.
T/F

A

True

26
Q

A block cipher encodes one character at a time.

A

False

27
Q

Computers are better than humans where there seems to be a high level of complexity, approximation, or ambiguity.
T/F

A

False

28
Q

In some areas of the brain, an individual neuron may collect signals from as many as 100,000 other neurons and send s
signals to equally large number of other neurons.
T/F

A

True

29
Q

In a neural network, both the knowledge representation and also the “programming” are stored in the network itself as the weights of the connections and the thresholds of the neurons.
T/F

A

True

30
Q

Building a machine that can beat a human at chess was viewed as the last of the “easy” hard problems.
T/F

A

True

31
Q

To be considered a robot, a machine must be in some way humanoid in design. True/false

A

False

32
Q

The Turing test is used to determine if a machine exhibits behavior indistinguishable from________________

A

Human

33
Q

is the study of how we as humans think and learn.

A

Cognitive science

34
Q

_______ is the branch of computer science that explores techniques for incorporating aspects of intelligence into computer systems.

A

Artificial intelligence

35
Q

A _____ is presented with training data, for which the correct outputs are known.

A

neural network

36
Q

The ________ causes the network to settle into a stable state where it can correctly respond, to any desired degree of accuracy, to al inputs in the training set.

A

back propagation algorithm

37
Q

A(n) i s a form of software technology that is designed ot interact collaboratively with a user somewhat in the mode of a personal assistant.

A

intelligent agent

38
Q

A(n) ________ ,also called an expert system, attempts to mimic the human ability ot engage pertinent facts and string them together in a logical fashion to reach some conclusion.

A

rule-based system