Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

SA1

CS0007

QuestionAnswer
A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length. effectiveness
Model development is an __________ process Group of answer choices Iterative Part by Part Step by Step Modular Iterative
Analysis of algorithms is the determination of the amount of time and space resources required to execute it. True
_________ thus a sequence of computational steps that transform the input into the output. algorithm
There are how many steps involved in solving computational problems Group of answer choices 10 11 9 12 9
GCD (224,602) 18 14 16 15 14
GCD (2344,1231) Group of answer choices 4 1 3 2 1
It refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification Group of answer choices Exactness Correctness Accuracy Precision Correctness
A sequence of computational steps that transform the input into the output. Group of answer choices Steps Process Procedure Algorithm Algorithm
Refers to rearrange the items of a given list in ascending or descending order. Group of answer choices organization union sorting group sorting
A sorting property that if it preserves the relative order of any two equal elements in its input Group of answer choices consistency stability firmness Performance Stability
string consist of letters, numbers, and special characters. Group of answer choices series of text pattern text string none of the above text string
collection of points called vertices, some of which are connected by line segments called edges. Group of answer choices Pattern Graph Trees Sequence graph
Stack uses LIFO / FILO approach. Group of answer choices True False True
Sorting ______ is a special piece of information used to guide sorting. Note: Write your answer in lowercase format. Example: compute key key
_________ is a sorting property that does not require extra memory, except, possibly for a few memory units Note: Write your answer in lowercase format. Hint: Two words Example: in place in place
Adjacent Linked list is collection of linked lists, one for each vertex, that contain all the vertices adjacent to the list’s vertex. Group of answer choices True False True
________ refers to Rearrange the items of a given list in ascending or descending order. Note: Write your answer in lowercase format. Example: computer sorting
A sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array’s index. Group of answer choices Array Collection Selection Linked list Array
Muhammad ibn Musa al-Khwarizmi – 9th century mathematician Group of answer choices True False True
__________ correctness refers to the input-output behavior of the algorithm. Note: Write your answer in lowercase format. Example: computer functional
GCD (24,60) Group of answer choices 14 16 18 12 12
There are how many elements of a problem statement 3 or three*
There are how many elements of a problem statement Group of answer choices 4 6 5 3 3
It refers to a sequence of unambiguous instructions for solving a problem Group of answer choices Procedure Algorithm Steps Process Algorithm
Finding a given value, called a search key, in a given set. Group of answer choices Looking Observing Guessing searching searching*
__________ A sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array’s index. Note: Write your answer in lowercase format. Example: compute Array
It is a sequence of characters from an alphabet Group of answer choices none of the above string pattern series of text string
Arrays is sequence of n items of the same data type that are stored contiguously in computer memory Group of answer choices True False True
Edges set E of vertex pairs. Group of answer choices True False False*
is a sorting property that does not require extra memory, except, possibly for a few memory units Group of answer choices in Value In set in Place In motion In Place
Validate means repeating until the hypothesis and observation agree Group of answer choices True False True
__________ terminates when the loop condition fails Note: Write your answer in lowercase format Example: computer iteration
A statement that repeatedly executes until the controlling condition becomes false Group of answer choices Iteration Recursion Loops Repetition Iteration
A programming technique that makes the code smaller Group of answer choices Repetition Iteration Recursion Loops Recursion
__________ consumes less memory Note: Write your answer in lowercase format Example: computer iteration
indicates how fast an algorithm runs. Time efficiency
Finding the median value in a sorted array of numbers Group of answer choices Linear Logarithmic Quadratic Constant magic oriented
When the input size measures the matrix dimension or total number of elements what is the basic operation False
Environmental Stack is the current variables are pushed onto the system stack, where they wait for further execution and then the call to the inside algorithm(function) is made. Group of answer choices True False True
What is the basic operation when checking primality of a given integer n Group of answer choices key comparison division multiplication of two numbers visiting a vertex Division
Adding integer takes how many nanoseconds to compute Group of answer choices 2.3 2.4 2.1 2.5 2 2.3
Computing sine values take about how many nanoseconds Group of answer choices 19.5 15.5 17.5 13.5
Created by: AdoKwatro
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards