Com Sci Test 2

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/19

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

20 Terms

1
New cards

Ada Lovelace is generally acknowledged as the world's first programmer, because of her work on Babbage's Analytical Engine.

True

2
New cards

Although they were large and expensive by today's standards, early computers such as the MARK I and ENIAC were comparable in performance (memory capacity and processing speed) to modern desktop computers.

False

3
New cards

Because transistors were smaller and produced less heat than vacuum tubes, they allowed for the design of smaller and faster computers.

True

4
New cards

The history of computers can be divided into generations based on advances in technology. Which of the following sequences correctly lists the technologies that defined generations 0 through 3 in chronological order?

electromagnetic relays --> vacuum tubes --> transistors --> integrated circuits

5
New cards

Bill Gates & Paul Allen

Microsoft

6
New cards

Steve Jobs & Steve Wozniak

Apple

7
New cards

Mark Dean

IBM

8
New cards

Gordon Moore

Intel Corporation

9
New cards

Greek natural philosophy is often referred to as "pre-scientific," since it relied on contemplation and/or observations, but not experimentation.

True

10
New cards

The steps of the scientific method are Decomposition, Pattern Recognition, Abstraction, and Algorithms.

False

11
New cards

A sequence of instructions for assembling a bookcase does not qualify as an "algorithm," as the instructions are not written in formal, mathematical notation.

False

12
New cards

Consider Algorithm 1 for finding the oldest person in a room (which lines up the people and asks each person their birthday in order). If it takes 20 seconds to ask and write down a person's name and age, how long would it take to find the oldest person in a room of 10 people?

200 seconds

13
New cards

Consider Algorithm 2 for finding the oldest person in a room (which repeatedly has the people pair up, compare ages, and have the younger sit down). If it takes 20 seconds for a round (simultaneous pair comparisons), how long would it take to find the oldest person in a room of 10 people?

80

14
New cards

For a precise, clearly stated problem, there can be only one algorithm that provides a solution.

False

15
New cards

When a Web page is loaded into a Web browser, JavaScript code in that page is executed by a JavaScript interpreter that is embedded in the browser

True

16
New cards

Suppose that you have been given an O(N) algorithm that processes student grades, where N is the number of grades. If it takes 1 minute to process 1,000 grades using the algorithm, how long would you expect it to take to process 4,000 grades?

4 minutes

17
New cards

Suppose you had a directory that listed each Creighton student (8,910 people), alphabetically by name. How many checks would be required to find a particular student, in the worst case, using binary search?

14

18
New cards

The three recurring themes that define the discipline of computer science are hardware, software, and theory.

True

19
New cards

Using public-key encryption, the sender and recipient of a message do NOT need to agree on a shared secret key before initiating secure communications.

True

20
New cards

The Turing Test was proposed by Alan Turing as a means of determining whether an artificially intelligent machine has been constructed.

True