Exam 18: Limitations of Computing

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

A(n) _______________ is a conceptual computing device that reads and writes symbols on an infinite tape.

Free
(Short Answer)
5.0/5
(34)
Correct Answer:
Verified

Turing machine

What is the number of errors per line of code in the software for the space shuttle?

Free
(Multiple Choice)
5.0/5
(37)
Correct Answer:
Verified

D

The _____________________ is the concept that software is developed, not just coded, and evolves over time.

Free
(Short Answer)
4.9/5
(50)
Correct Answer:
Verified

software life cycle

Which of the following is the Big-O notation for constant or bounded time?

(Multiple Choice)
4.9/5
(42)

A(n) _______________ is used to make the number of 1s in a byte odd (or even) to validate the storage or transmission of the byte.

(Short Answer)
4.8/5
(38)

All of the following project or system breakdowns occurred as a result of software errors, except:

(Multiple Choice)
4.7/5
(35)

The term significant digits refers to the number of places that a computer can accurately represent to the right of the decimal point.

(True/False)
4.9/5
(40)

Most errors in a software project occur in the implementation phase.

(True/False)
4.8/5
(32)

Which of the following occurs when the results of a calculation are too large to represent in the computer?

(Multiple Choice)
4.8/5
(37)

Software verification activities should be carried out in all phases of the software life cycle.

(True/False)
4.9/5
(41)

_______________ problems can be solved using one processor in polynomial time.

(Short Answer)
4.7/5
(35)

The best-known open source project is _______________.

(Short Answer)
4.8/5
(29)

The maximum number of significant digits that a computer can represent is known as precision.

(True/False)
4.8/5
(46)

The halting problem is an unsolvable problem.

(True/False)
4.8/5
(29)

Which of the following is the most efficient?

(Multiple Choice)
4.8/5
(41)

An algorithm that runs in logarithmic time is more efficient than one that runs in quadratic time.

(True/False)
4.9/5
(42)

Class NP problems are those that can be solved with one processor in polynomial time.

(True/False)
4.9/5
(33)

Which of the following statements is most closely associated with Big-O analysis?

(Multiple Choice)
5.0/5
(36)

An algorithm that runs in exponential time is more efficient than one that runs in linear time.

(True/False)
4.8/5
(44)

Which of the following attempts to prove that an algorithm behaves as intended?

(Multiple Choice)
4.9/5
(45)
Showing 1 - 20 of 50
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)