Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 2 out of 9 pages
Exam (elaborations)

COMP 200 FIND EXAM 2025 QUESTIONS AND ANSWERS

Document preview thumbnail
Preview 2 out of 9 pages

COMP 200 FIND EXAM 2025 QUESTIONS AND ANSWERS

Content preview

COMP 200 FIND EXAM 2025
QUESTIONS AND ANSWERS


TRUE - ✔✔The evolution of computer science began before the development of the first
computer system.

FALSE - ✔✔Computer science is the study of computers.

FALSE - ✔✔Computer science is the study of how to write computer programs.

FALSE - ✔✔Algorithms are exclusive to the field of computer science.

FALSE - ✔✔Algorithms usually contain a set of instructions to be executed in any order.

TRUE - ✔✔Mechanical devices for performing complex calculations existed prior to the
20th century.

FALSE - ✔✔The properties that make better algorithms are very similar to the
properties we look for when purchasing a car.

TRUE - ✔✔The first electronic programmable computer, ENIAC, was built during
World War I.

TRUE - ✔✔If we were to run the sequential search algorithm many times, with random
input values occurring at various places in the list, we would find the average number
of comparisons done to be approximately n/2.




COPYRIGHT © 2025 BY OLIVIA WEST, ALL RIGHTS RESERVED 1

, FALSE - ✔✔The sequential search and selection sort algorithms are different methods
to get the same thing done.

TRUE - ✔✔If an Q(n2) algorithm and an Q(n) algorithm exist for the same task, then for
large enough n, the Q(n2) algorithm does more work and takes longer to execute,
regardless of the constant factors for peripheral work.

FALSE - ✔✔Binary search uses significantly more space than sequential search.

FALSE - ✔✔First and foremost, we expect elegance from our algorithms

INTRACTABLE - ✔✔_______ problems are solvable, but the solution algorithms all
require so much work as to be virtually useless.

WORST - ✔✔The converging-pointers algorithm is O(n) in the ____ case .

FALSE - ✔✔An unstructured, "free-flowing" writing style should be used for writing
algorithms.

FALSE - ✔✔Java and C++ are examples of pseudocode languages

TRUE - ✔✔Having an infinite loop in an algorithm is an error.

FALSE - ✔✔Pattern matching can only be applied to graphics and pictures.

TRUE - ✔✔Input and output enable the computing agent to communicate with the
outside world.

TRUE - ✔✔One of the most powerful features of a computer is its ability to handle
loops.

FALSE - ✔✔The three basic sequential operations are called addition, multiplication,
and exponentiation.




COPYRIGHT © 2025 BY OLIVIA WEST, ALL RIGHTS RESERVED 2

Document information

Uploaded on
April 29, 2025
Number of pages
9
Written in
2024/2025
Type
Exam (elaborations)
Contains
Questions & answers
$12.99

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
OliviaWest
2.7
(23)
Sold
119
Followers
17
Items
8422
Last sold
1 month ago



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions