COMP 200 Intro to Computer Science Quizzes | 100% Correct | Verified | 2024 Version

COMP 200 Intro to Computer Science Quizzes | 100% Correct | Verified | 2024 Version In theoretical computer science, researchers study the logical and _____ of problems and their solutions - Mathematical Properties Designing Programming languages and translating algorithms into these languages is known as _____ language - Linguistic An algorithm is essentially useless when _____. - it takes too long to execute 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 - Infinite loop The history of mathematics begins _____ years ago. - 3000+ In Babbage's Analytical engine, a mill was used to _____. - Perform arithmetic operations _____ is an example of a natural language. - English _____ operations provide the computing agent with data values from the outside world that it may then use in later instructions. - Input A purely ____ algorithm is sometimes termed a straight-line algorithm. - Sequential The _____ loop is an example of a posttest loop - do-while The technique of looking at all the items in a list, starting at the beginning of the list, one at a time, until we either find what we are looking for or come to the end of the list is called ____ search. - Sequential The selection of an algorithm to solve a problem is greatly influenced by the way the input ____ for that problem are organized. - Data _____ is the algorithmic equivalence of style - Elegance The study of the efficiency of algorithms is called the _____ of algorithms - Analysis In the sequential search algorithm, the minimum amount of work is done if the value being searched for is the _____ value in the list. - First Placing a list of items in alphabetical or numerical order is called _____. - Sorting The _____ sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the back to the front. - Selection The worst case in binary search occurs _____. - when the object to be searched is not in the list. An ____ algorithm is called and exponential algorithm. - O(2^n) Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms. - Approximation The way information is represented by humans and the way it is entered at the keyboard is known as the ____ of information. - External Representation Using the leftmost bit of a number to represent the sign, with 0 meaning positive and 1 meaning negative is termed ____ notation. - Sign/Magnitude The _____ of a sound wave is a measure of its loudness. - Amplitude The _____ is the number of bits used to encode each sample - Bit Depth _____ is a circuit construction algorithm - Sum-of-products A _____ is a circuit that performs binary addition on two unsigned N-bit intergers. - Full Adder The acronym _____ is frequently used