0% found this document useful (0 votes)
21 views

Quiz - Week 1 - Attempt 1

CSIS 101 Quiz

Uploaded by

mikeschallra
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views

Quiz - Week 1 - Attempt 1

CSIS 101 Quiz

Uploaded by

mikeschallra
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Quiz: Intro to Computers and

Algorithms
 Due Mar 25 at 11:59pm

 Points 20

 Questions 20

 Time Limit 30 Minutes

 Allowed Attempts 3

Instructions
The quiz:

 Covers the Textbook material from Module 1: Week 1.


 Contains 20 multiple-choice and true/false questions.
 Is limited to 30 minutes.
 Allows 3 attempts and the highest attempt will count towards the grade.
 Is worth 20 points.

Quizzes are open book and open notes. Use of Internet search tools is not
advised as our quizzes are keyed to the textbook information. Textbooks and
searches do not always agree and for this course; therefore, your textbook is
the authoritative agent.
Submit this assignment by 11:59 p.m. (ET) on Monday of Module 1: Week 1.

TAKE THE QUIZ AGAIN


Attempt History

Attempt Time Score

LATEST Attempt 1 17 minutes 17 out of 20


Correct answers are hidden.
Score for this attempt: 17 out of 20
Submitted Mar 22 at 2:42pm
This attempt took 17 minutes.

Question 1
1 / 1 pts
When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the
computing agent carrying out the algorithm.

True

False

Question 2
1 / 1 pts
FORTRAN and COBOL, the first high-level (English-like) programming languages, appeared during
the first generation of computing. _________________________

True

False

Question 3
1 / 1 pts
According to Norman Gibbs’s and Allen Tucker’s definition of computer science, the central concept in
computer science is the compiler. _________________________
True

False

Question 4
1 / 1 pts
Algorithms are exclusive to the field of computer science.

True

False

Question 5
1 / 1 pts
At its most basic level, computer science is the study of algorithms.

True

False

Question 6
1 / 1 pts
The evolution of computer science began before the development of the first computer system.

True

False

Question 7
1 / 1 pts
In Babbage’s Analytical Engine, a mill was most like the ____ of modern-day computers.

RAM

processor

logic unit

input/output

Question 8
1 / 1 pts
In computer science, it is not simply the construction of a high-quality __________ that is important but
also the methods it embodies.

processor

program

memory module

storage device

Question 9
1 / 1 pts
The Analytical Engine was the first computing device to use the base-2 binary numbering system.
_________________________

True

False

Question 10
1 / 1 pts
What is wrong with the following algorithm?
1. Set X to be 1
2. Increment X
3. Print X
4. If X > 0, repeat from 2

It does not produce a result.

It is ambiguous.

It does not halt in a finite amount of time.

It is not well ordered.

Question 11
1 / 1 pts
In computer science terminology, the machine, robot, person, or thing carrying out the steps of the
algorithm is called a(n) ____.

computing agent

algorithmic agent

computing representative

algorithmic representative

Question 12
1 / 1 pts
An algorithm is a ____ collection of unambiguous and effectively computable operations that, when
executed, produces a result and halts in a finite amount of time.

sequential

computing agent

mechanical calculator

well-ordered

Question 13
1 / 1 pts
John Von Neumann’s stored program computer lay the groundwork for modern-day computing by
allowing the computer to store instructions in ____ alongside the data.

binary values

external displays

vacuum tubes

data cylinders

Question 14
1 / 1 pts
The statement “If the mixture is too dry, then add one-half cup of water to the bowl” is an example of
a(n) iterative operation. _________________________

True

False

Question 15
1 / 1 pts
All conceivable problems can be solved algorithmically.

True

False

IncorrectQuestion 16
0 / 1 pts
An algorithm may be too ____ to be of any use.

difficult to read

inefficient
difficult to create

offensive

Question 17
1 / 1 pts
The first electronic programmable computer, ENIAC, was completed just after World War II.

True

False

Question 18
1 / 1 pts
The discovery by Gödel places a limit on the capabilities of computers and computer scientists.
_________________________

True

False

IncorrectQuestion 19
0 / 1 pts
The ____ revolution enabled us to implement algorithms that automated the drudgery of repetitive mental
tasks.

industrial

technological

computer

designer
IncorrectQuestion 20
0 / 1 pts
The ____ was the first fully electronic, general-purpose, programmable computer.

EDVAC

EDSAC

ENIAC

Mark I

Quiz Score: 17 out of 20

You might also like