08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.

202301 COMP-125-SD1

14427.202301 COMP-125-SD1 Assignments and Tests Review Test Submission: Quiz 1

Review Test Submission: Quiz 1

User Harmanjot Singh

Course COMP-125-SD1
Test Quiz 1
Started 2/7/23 10:02 PM
Submitted 2/7/23 10:32 PM
Due Date 2/16/23 2:54 PM
Status Completed
Attempt Score 22 out of 50 points
Time Elapsed 30 minutes out of 45 minutes
Results All Answers, Submitted Answers, Correct Answers, Feedback, Incorrectly
Displayed Answered Questions

Question 1 0 out of 2 points

____ is an example of a natural language.

Selected Answer: a. Java

Answers: a. Java

b. English

c. C

d. Perl

Question 2 2 out of 2 points

To construct an OR gate, two transistors are connected in

____________________.
Selected Answer: Parallel
Correct Answer:
Evaluation Method Correct Answer Case Sensitivity

Exact Match parallel

Question 3 2 out of 2 points

The three types of operations used to construct algorithms are sequential,

___________________, and iterative.
Selected Answer: conditional
Correct Answer:
https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 1/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1
Correct Answer:
Evaluation Method Correct Answer Case Sensitivity

Exact Match conditional

Question 4 2 out of 2 points

Explain the term “unambiguous operation.”

Selected An"unambiguous operation" refers to a clear-cut instruction which
Answer: needs to be followed to carry out the given task. Unambiguity iss
very important while doing operations and tasks since it should be
to the point and direct to be understood.
Correct
Answer: An unambiguous operation is one that can be understood and
carried out directly by the computing agent without further
simplification or explanation.
Response [None Given]
Feedback:

Question 5 2 out of 2 points

With a natural language, different readers can interpret the same sentence in
totally different ways.
Selected Answer: True
Answers: True
False

Question 6 0 out of 2 points

What is the rule for evaluating the NOT operation?

Selected The rule for evaluating "NOT" operation is that it is "and plus not"
Answer: are together and one condition is true.

Correct
Answer: If a is a Boolean expression, then the value of the expression
(NOT a) is true if a has the value false, and it is false if a has
the value true.
Response If a is a Boolean expression, then the value of the expression
Feedback: (NOT a) is true if a has the value false, and it is false if a has the
value true.

Question 7 2 out of 2 points

In Babbage’s Analytical Engine, a mill was most like the ____ of modern-day
computers.
Selected Answer: b. logic unit

Answers: a. input/output

b. logic unit
https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 2/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1

c. processor

d. RAM

Question 8 0 out of 2 points

The total number of ____ per second is called hertz.

Selected Answer: b. bytes

Answers: a. cycles

b. bytes

c. periods

d. bits

Question 9 2 out of 2 points

The worst case in binary search occurs ____.

Selected d. when the object to be searched is not in the list
Answer:

Answers: a.
when the object to be searched is in the middle of the list

b.
when the object to be searched is at the beginning of the list

c. when the object to be searched is at the end of the list

d. when the object to be searched is not in the list

Question 10 0 out of 2 points

In the _______ search algorithm, the worst case occurs when the value being
searched for is the last value in the list.
Selected Answer: b. shuffle

Answers: a. binary

b. shuffle

c. sequential

d. bubble

Question 11 0 out of 2 points

https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 3/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1

In 1672, a French philosopher and mathematician designed and built one of the
first mechanical calculators named the ____ that could do addition and
subtraction.
Selected Answer: a. Leibniz Wheel

Answers: a. Leibniz Wheel

b. Abacus

c. TI-85

d. Pascaline

Question 12 2 out of 2 points

A sequential search is the technique of looking at all the items in a list one at a
time, starting at _______ of the list, until we either find what we are looking for
or come to the end of the list.
Selected Answer: d. the beginning

Answers: a. a defined location

b. the middle

c. The end

d. the beginning

Question 13 0 out of 2 points

To create a loop that executes exactly b times, we create a ____.

Selected Answer: a. counting method

Answers: a. counting method

b. counter

c. control object

d. variable

Question 14 0 out of 2 points

Jacquard’s Loom was considered the first “computing device” because it was
____ and had memory where information was stored in a machine-readable form.
Selected Answer: c. compact

Answers: a. programmable

b. electric

c. compact

https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 4/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1

d. mathematically efficient

Question 15 0 out of 2 points

A(n) ____ is an algorithmic operation that carries out a single numeric

computation and stores the result.
Selected Answer: d. expression

Answers: a. computation

b. constant

c. variable

d. expression

Question 16 0 out of 2 points

____ statements are the “question-asking” operations of an algorithm.

Selected Answer: a. Iterative

Answers: a. Iterative

b. Primitive

c. Conditional

d. Sequential

Question 17 2 out of 2 points

Every Boolean expression can be represented pictorially as a circuit diagram, and

every output value in a circuit diagram can be written as a Boolean expression.
Selected Answer: True
Answers: True
False

Question 18 0 out of 2 points

Designing programming languages and translating algorithms into these

languages is known as ____ realization.
Selected Answer: c. programming language

Answers: a. interpreter

b. linguistic

c. programming language

https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 5/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1

d. compiler

Question 19 0 out of 2 points

What is the problem with using natural language to represent algorithms?

Selected The problem with using natural language to represent algorithms is
Answer: that algorithms are supposed to be very simple and task oriented
which anyone can read and understand for future purposes and
references. An Algorithm further helps in creating the psuedocode
and that further forms our syntax. An Algorithm should not consist of
any syntax.
Correct
Answer: Natural language can be extremely verbose, causing the resulting
algorithms to be rambling, unstructured, and hard to follow. An
unstructured, “free-flowing” writing style might be wonderful for
novels and essays, but it is horrible for algorithms. The lack of
structure makes it difficult for the reader to locate specific sections
of the algorithm because they are buried inside the text. For
example, without any clues to guide us, such as indentation, line
numbering, or highlighting, locating the beginning of a loop can be
a daunting and time-consuming task. A second problem is that
natural language is too “rich” in interpretation and meaning. Natural
language frequently relies on either context or a reader’s
experiences to give precise meaning to a word or phrase. This
permits different readers to interpret the same sentence in totally
different ways. This may be acceptable, even desirable, when
writing poetry or fiction, but it is disastrous when creating
algorithms that must always execute in the same way and produce
identical results.
Response [None Given]
Feedback:

Question 20 2 out of 2 points

The selection of an algorithm to solve a problem is greatly influenced by the way

the input ____ for that problem are organized.
Selected Answer: c. data

Answers: a. solutions

b. words

c. data

d. pseudocode

Question 21 0 out of 2 points

____________________ is the term used to describe an algorithm’s careful use

of resources.
Selected Answer: Unambiguous
Correct Answer:
https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 6/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1

Evaluation Method Correct Answer Case Sensitivity

Exact Match Efficiency

Question 22 2 out of 2 points

What is pseudocode and why is it well-suited for representing algorithms?

Selected A Pseudocode is one step next to an algorithm. A pseudocode is
Answer: more formal than an algorithm and is close to our program without
the syntax and hence pseudocode is very well-suited to represent
an algorithm.
Correct
Answer: Most computer scientists use a notation called pseudocode to design
and represent algorithms. This is a set of English language
constructs designed to resemble statements in a programming
language but that do not actually run on a computer. Pseudocode
represents a compromise between the two extremes of natural and
formal languages. It is simple, highly readable, and has virtually no
grammatical rules. (In fact, pseudocode is sometimes called a
programming language without the details.) However, because it
contains only statements that have a well-defined structure, it is
easier to visualize the organization of a pseudocode algorithm than
one represented as long, rambling natural-language paragraphs. In
addition, because pseudocode closely resembles many popular
programming languages, the subsequent translation of the algorithm
into a computer program is relatively simple. Pseudocode is not a
formal language with rigidly standardized syntactic and semantic
rules and regulations. On the contrary, it is an informal design
notation used solely to express algorithms. One of the nice features
of pseudocode is that you can adapt it to your own personal way of
thinking and problem solving.
Response [None Given]
Feedback:

Question 23 0 out of 2 points

The ____ operation complements the value of a Boolean expression.

Selected Answer: b. OR

Answers: a. NOT

b. OR

c. NOR

d. AND

Question 24 0 out of 2 points

The process of finding a solution to a given problem is called

____________________ discovery.
Selected Answer: Problem Solving

https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 7/8
08/04/2023, 16:54 Review Test Submission: Quiz 1 – 14427.202301 COMP-125-SD1

Correct Answer:
Evaluation Method Correct Answer Case Sensitivity

Exact Match algorithm

Question 25 2 out of 2 points

A ____ is the repetition of a block of instructions.

Selected Answer: b. loop

Answers: a. cycle

b. loop

c. nucleus

d. matrix

Saturday, April 8, 2023 4:24:19 AM PDT

← OK

https://myclass.ufv.ca/webapps/assessment/review/review.jsp?attempt_id=_4410272_1&course_id=_62025_1&content_id=_2448829_1&outcome_id=_432834… 8/8