context stringlengths 545 71.9k | questionsrc stringlengths 16 10.2k | question stringlengths 11 563 |
|---|---|---|
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | let the variable $ min $ be the current minimum reasonable guess for this round , and let the variable $ max $ be the current maximum reasonable guess . the input to the problem is the number $ n $ , the highest possible number that your opponent is thinking of . we assume that the lowest possible number is one , but i... | i.e number [ 0 ] = 5 , number [ 1 ] = 9 , number [ 2 ] = 17 , etc ... would you arrange the array indexes in order ( if that is at all possible ) ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | if the guess was too high , set $ max $ to be one smaller than the guess . go back to step two . we could make this pseudocode even more precise by clearly describing the inputs and the outputs for the algorithm and by clarifying what we mean by instructions like `` guess a number '' and `` stop . '' | what does the next challenge want me to do for step 3 ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | you found it ! if the guess was too low , set $ min $ to be one larger than the guess . if the guess was too high , set $ max $ to be one smaller than the guess . go back to step two . | so simply put , you guess the middle option out of the possible range each time ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | why do we start from 1 , do n't array indexes start from 0 ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | you found it ! if the guess was too low , set $ min $ to be one larger than the guess . if the guess was too high , set $ max $ to be one smaller than the guess . | why you need to put one larger than the guess ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | if the program examined every star in the star catalog in order starting with the first , an algorithm called linear search , the computer might have to examine all 2,539,913 stars to find the star you were looking for , in the worst case . if the catalog were sorted alphabetically by star names , binary search would n... | can someone help explain why `` binary search would not have to examine more than 22 stars , even in the worst case '' in the stars example ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | what do the $ dollar signs surrounding min mean ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | if your guess is not correct , then i tell you whether it 's too high or too low , and you can eliminate about half of the reasonable guesses . for example , if the current range of reasonable guesses is 26 to 80 , you would guess the halfway point , $ ( 26 + 80 ) / 2 $ , or 53 . if i then tell you that 53 is too high ... | not sure why in step 2 of the pseudocode you would have the computer guess the `` average '' of the numbers in the range when you can have it divide the overall range by 2 and have that number as the starting point ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | what variables should be created , and what initial values should they have ? what intermediate steps should be taken to compute other values and to ultimately compute the output ? do these steps repeat instructions that can be written in simplified form using a loop ? | would n't the latter equation be faster than having the computer compute the average of the range ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . | does the binary search rely upon the assumption that the underlying data it is searching is ordered in some way ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . | or when looking at the , data can we safely ignore that assumption if the data is `` reasonably '' ordered for the binary search ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | is a mathematical reason binary search works because 2 is the only even prime number ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | one of the most common ways to use binary search is to find an item in an array . for example , the tycho-2 star catalog contains information about the brightest 2,539,913 stars in our galaxy . suppose that you want to search the catalog for a particular star , based on the star 's name . if the program examined every ... | how is that if you make the star catalog alphabetical , you only need 22 guesses max ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | [ edited to only show relevant code ] var dosearch = function ( array , targetvalue ) { while ( ... ) { ... if ( min===max ) { ... } else if ( min < max ) { ... } else { ... } } ... } ; what am i doing wrong ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | how is binary search applied in programming ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | what intermediate steps should be taken to compute other values and to ultimately compute the output ? do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . | is snake and chess a algorith form ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | would the answer to sal 's `` heavier ball '' brain teaser be an example of a binary search ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | why does the sun look larger when it is on the horizon ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | should n't min be 26 and max 52 ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | why exactly is max = n ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | back to max+min/2 you could make more efficient algorithms just by making functions that request less calculations right ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | let 's say that i 'm thinking of a number between one and 100 , just like the guessing game . if you 've already guessed 25 and i told you my number was higher , and you 've already guessed 81 and i told you my number was lower , then the numbers in the range from 26 to 80 are the only reasonable guesses . here , the r... | what happens when there is no hint of `` higher '' or `` lower '' ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . | is binary search the best type of algorithm or is there a better way ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | that 's why we need to describe computer algorithms completely . in order to implement an algorithm in a programming language , you will need to understand an algorithm down to the details . what are the inputs to the problem ? | would there be any significant diff between learning algorithm+ java and algorithm+python since my class is using python ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | guess the average of $ max $ and $ min $ , rounded down so that it is an integer . if you guessed the number , stop . you found it ! | how does the computer search to see if the guessed number is below or above its chosen number ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | does the max always have to be n ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | let the variable $ min $ be the current minimum reasonable guess for this round , and let the variable $ max $ be the current maximum reasonable guess . the input to the problem is the number $ n $ , the highest possible number that your opponent is thinking of . we assume that the lowest possible number is one , but i... | what is the input of a problem ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | some details may be left out of a recipe for a cake ; the recipe assumes that you know how to open the refrigerator to get the eggs out and that you know how to crack the eggs . people might intuitively know how to fill in the missing details , but computer programs do not . that 's why we need to describe computer alg... | if a human brain can fill in the missing details ( logical thought processes ) , why ca n't we model a computer program to behave in a similar fashion ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . | do neural networks in deep learning address this issue at all ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | how does the min-max combo work in detail because the way that they explain how it detects and can switch seems vague ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | people might intuitively know how to fill in the missing details , but computer programs do not . that 's why we need to describe computer algorithms completely . in order to implement an algorithm in a programming language , you will need to understand an algorithm down to the details . | what are some examples of the algorithms that would be used to tell a computer to turn off ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | what does the dollar signs of `` $ min $ '' mean in the last paragraph ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | some details may be left out of a recipe for a cake ; the recipe assumes that you know how to open the refrigerator to get the eggs out and that you know how to crack the eggs . people might intuitively know how to fill in the missing details , but computer programs do not . that 's why we need to describe computer alg... | why do you need to be so specific when writing programs ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | if the program examined every star in the star catalog in order starting with the first , an algorithm called linear search , the computer might have to examine all 2,539,913 stars to find the star you were looking for , in the worst case . if the catalog were sorted alphabetically by star names , binary search would n... | would someone explain how binary search is there in the stars in the galaxy example ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | why is binary search algorithm called `` binary '' ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | what variables should be created , and what initial values should they have ? what intermediate steps should be taken to compute other values and to ultimately compute the output ? do these steps repeat instructions that can be written in simplified form using a loop ? | what is the definition of input and output ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | go back to step two . we could make this pseudocode even more precise by clearly describing the inputs and the outputs for the algorithm and by clarifying what we mean by instructions like `` guess a number '' and `` stop . '' but this will do for now . | what does the `` $ '' mean ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | why binary is needed in a program ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | for example , the tycho-2 star catalog contains information about the brightest 2,539,913 stars in our galaxy . suppose that you want to search the catalog for a particular star , based on the star 's name . if the program examined every star in the star catalog in order starting with the first , an algorithm called li... | what is the star 953,747 ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | for example , the tycho-2 star catalog contains information about the brightest 2,539,913 stars in our galaxy . suppose that you want to search the catalog for a particular star , based on the star 's name . if the program examined every star in the star catalog in order starting with the first , an algorithm called li... | how could it be possible to find the star with the name you are looking for in 22 guesses tops ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . | why have a header for psuedocode , and not give us a definition of what psuedocode is ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | if the program examined every star in the star catalog in order starting with the first , an algorithm called linear search , the computer might have to examine all 2,539,913 stars to find the star you were looking for , in the worst case . if the catalog were sorted alphabetically by star names , binary search would n... | why the program wound only examine 22 stars to find the right star with binary search in the first example ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | that 's why we need to describe computer algorithms completely . in order to implement an algorithm in a programming language , you will need to understand an algorithm down to the details . what are the inputs to the problem ? | is there an algorithm for when it chooses ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . ... | how does the `` max '' and `` min '' work , do you just have to guess the number according to step 2 or you have to follow steps to finding this out ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutorial . one of the most common ways to use binary search is to find an item in an array . | how is the $ symbol used here ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | why is binary so important to us humans ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | alright so we need to choose the average number in a binary search , but in real life who would tell us whether it 's higher or lower ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | just curious why would one guess 25 first if it 's binary search of numbers between 1 and 100 ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutorial . one of the most common ways to use binary search is to find an item in an array . | can binary search be used for efficient price discovery of a security and if yes how ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | in what number base was the addition 1+nn=100 , where n > 0 done ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | in what number base was the addition 1+nn=100 , where n > 0 , done ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | ok , so from the binary search pseudo code in the first lesson , why is `` max = n '' , should n't `` input '' be set to `` n '' ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | for the guessing game , we can keep track of the set of reasonable guesses using a few variables . let the variable $ min $ be the current minimum reasonable guess for this round , and let the variable $ max $ be the current maximum reasonable guess . the input to the problem is the number $ n $ , the highest possible ... | should n't `` max '' just be the maximum number of a reasonable guess , a static integer ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | what are the inputs to the problem ? the outputs ? what variables should be created , and what initial values should they have ? | what do u exactly mean by inputs and outputs ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | in the pseudocode , what does the `` $ '' means ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | do these steps repeat instructions that can be written in simplified form using a loop ? let 's look at how to describe binary search carefully . the main idea of binary search is to keep track of the current range of reasonable guesses . | am i correct in assuming that it is actually faster to do a binary search on each digit in a number than the whole number in large numbers since that way scales linearly and normal binary search scales exponentially ? |
binary search is an efficient algorithm for finding an item from an ordered list of items . it works by repeatedly dividing in half the portion of the list that could contain the item , until you 've narrowed down the possible locations to just one . we used binary search in the guessing game in the introductory tutori... | we assume that the lowest possible number is one , but it would be easy to modify the algorithm to take the lowest possible number as a second input . here 's a pseudocode description of binary search : let $ min = 1 $ and $ max = n $ . guess the average of $ max $ and $ min $ , rounded down so that it is an integer . | i 'm very rusty on javascript , so that probably explains my ignorance here , but on step 2 , why are dollar signs used around the `` min '' but not the `` max '' ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | the term scalar multiplication refers to the product of a real number and a matrix . in scalar multiplication , each entry in the matrix is multiplied by the given scalar . in contrast , matrix multiplication refers to the product of two matrices . | why does a 2x3 multiplied by a 3x2 become a 2x2 ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | it is an ordered list of $ n $ numbers . we can find the dot product of two $ n $ -tuples of equal length by summing the products of corresponding entries . for example , to find the dot product of two ordered pairs , we multiply the first coordinates and the second coordinates and add the results . | can we take the dot product of two n-tuples of unequal length ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | to help our understanding , let 's label the rows in matrix $ a $ and the columns in matrix $ b $ . we can define the product matrix , matrix $ c $ , as shown below . notice that each entry in matrix $ c $ is the dot product of a row in matrix $ a $ and a column in matrix $ b $ . specifically , the entry $ c_ { \blued ... | is a square matrix containing a row or column of zeros invertible ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | similarly , column $ 1 $ is denoted $ \goldd { \vec { c_1 } } = ( 6,4 ) $ and column $ 2 $ is denoted $ \goldd { \vec { c_2 } } = ( 2,3 ) $ . check your understanding matrix multiplication we are now ready to look at an example of matrix multiplication . given $ a=\left [ \begin { array } { rr } { 1 } & amp ; 7 \ 2 & a... | can someone 'unmess ' my understanding , please ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | given $ a=\left [ \begin { array } { rr } { 1 } & amp ; 7 \ 2 & amp ; 4 \end { array } \right ] $ and $ b=\left [ \begin { array } { rr } { 3 } & amp ; 3 \ 5 & amp ; 2 \end { array } \right ] $ , let 's find matrix $ c=ab $ . to help our understanding , let 's label the rows in matrix $ a $ and the columns in matrix $ ... | what is the purpose learning to multiply matrix ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | the expression $ \vec { a } \cdot \vec { b } $ indicates the dot product of these two ordered triples and can be found as follows : $ \begin { align } \vec { a } \cdot \vec { b } & amp ; = ( \purplec 3 , \greend1 , \maroonc8 ) \cdot ( \purplec4 , \greend2 , \maroonc3 ) \\ & amp ; =\purplec3\cdot \purplec4+\greend1\cdot... | why is the word 'vector ' missing from the section about 'n-tuples ' ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | understanding how to find the dot product of two ordered lists of numbers can help us tremendously in this quest , so let 's learn about that first ! $ n $ -tuples and the dot product we are familiar with ordered pairs , for example $ ( 2,5 ) $ , and perhaps even ordered triples , for example $ ( 3,1,8 ) $ . an $ n $ -... | just curious , can you multiply 2 n-tuples of different length ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | check your understanding matrices and $ n $ -tuples when multiplying matrices , it 's useful to think of each matrix row and column as an $ n $ -tuple . in this matrix , row $ 1 $ is denoted $ \blued { \vec { r_1 } } = ( 6,2 ) $ and row $ 2 $ is denoted $ \blued { \vec { r_2 } } = ( 4,3 ) $ . similarly , column $ 1 $ i... | can anyone solve this question with each legal step -- -have a look q. let m * [ 1 1 ] = [ 1 2 ] where m is a matrix , find the matrix m ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | $ \begin { align } ( \purplec2 , \greend5 ) \cdot ( \purplec3 , \greenc1 ) & amp ; =\purplec2\cdot \purplec3+\greend5\cdot \greend1\ \ & amp ; =6+5\ \ & amp ; =11 \end { align } $ ordered $ n $ -tuples are often indicated by a variable with an arrow on top . for example , we can let $ \vec { a } = ( 3,1,8 ) $ and $ \ve... | if a and b are matrices does a * b = b * a ? |
what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . for example , matrix $ a $ has $ 2 $ rows and $ 3 $ columns . the element $ a_ { \blued2 , \goldd1 } $ is the entry in... | what you should be familiar with before taking this lesson a matrix is a rectangular arrangement of numbers into rows and columns . each number in a matrix is referred to as a matrix element or entry . | peter piper picked a peck of pickled peppers ; a peck of pickled peppers peter piper picked ; if peter piper picked a peck of pickled peppers , where 's the peck of pickled peppers peter piper picked ? |
overview the women ’ s rights movement of the mid-1800s gained traction through abolitionist sentiment and religious fervor surrounding the second great awakening . the declaration of rights and sentiments , published at the seneca falls convention in 1848 , used constitutional language to underline the inconsistencies... | it declared , “ we hold these truths to be self-evident : that all men and women are created equal ; that they are endowed by their creator with certain inalienable rights ; that among these are life , liberty , and the pursuit of happiness. ” “ the history of mankind , ” the document continued , “ is a history of repe... | what gave men the right to be so judgmentall ? |
overview the women ’ s rights movement of the mid-1800s gained traction through abolitionist sentiment and religious fervor surrounding the second great awakening . the declaration of rights and sentiments , published at the seneca falls convention in 1848 , used constitutional language to underline the inconsistencies... | what do you think ? compare and contrast the mid-19th century women ’ s rights movement and the abolition movement . how did the beginning of the women ’ s rights movement challenge gender norms ? how did it reinforce them ? | were there some men that were for the women 's rights movement ? |
overview the women ’ s rights movement of the mid-1800s gained traction through abolitionist sentiment and religious fervor surrounding the second great awakening . the declaration of rights and sentiments , published at the seneca falls convention in 1848 , used constitutional language to underline the inconsistencies... | it declared , “ we hold these truths to be self-evident : that all men and women are created equal ; that they are endowed by their creator with certain inalienable rights ; that among these are life , liberty , and the pursuit of happiness. ” “ the history of mankind , ” the document continued , “ is a history of repe... | are women considered inferior , superior , or towards the equals of men ? |
overview the women ’ s rights movement of the mid-1800s gained traction through abolitionist sentiment and religious fervor surrounding the second great awakening . the declaration of rights and sentiments , published at the seneca falls convention in 1848 , used constitutional language to underline the inconsistencies... | the declaration of rights and sentiments , published at the seneca falls convention in 1848 , used constitutional language to underline the inconsistencies between national commitments to human equality and the treatment of women . women leveraged their specialty in all things involving the private sphere—the home—to o... | did women truly believe in the abolition of slavery , or did they advocate this for only women ? |
venice - another world petrarch , the fourteenth-century tuscan poet , called venice a `` mundus alter '' or `` another world , '' and the city of canals really is different from other renaissance centers like florence or rome . venice is a cluster of islands , connected by bridges and canals , and until the mid-19th c... | ( see this effect in the rosy flush of the venus of urbino ’ s cheeks by titian or in the blue-orange clouds in giorgione ’ s adoration of the shepherds— above ) . plus , when oil paint dries it stays somewhat translucent . as a result , all of those thin layers reflect light and the surface shines . | was oil paint adopted due to its natural resistance to moisture ? |
venice - another world petrarch , the fourteenth-century tuscan poet , called venice a `` mundus alter '' or `` another world , '' and the city of canals really is different from other renaissance centers like florence or rome . venice is a cluster of islands , connected by bridges and canals , and until the mid-19th c... | the trio transformed saintly stories into relatable human drama ( veronese ’ s the dream of st. helena ) , captured the wit and wealth of portrait subjects ( titian ’ s portrait of a man ) , and interpreted nature through mythological tales ( tintoretto ’ s the origin of the milky way ) . essay by dr. heather a. horton... | why is there so much info about art from the tiny state of venice , but very , very little about eastern european art from these eras ? |
venice - another world petrarch , the fourteenth-century tuscan poet , called venice a `` mundus alter '' or `` another world , '' and the city of canals really is different from other renaissance centers like florence or rome . venice is a cluster of islands , connected by bridges and canals , and until the mid-19th c... | the trio transformed saintly stories into relatable human drama ( veronese ’ s the dream of st. helena ) , captured the wit and wealth of portrait subjects ( titian ’ s portrait of a man ) , and interpreted nature through mythological tales ( tintoretto ’ s the origin of the milky way ) . essay by dr. heather a. horton... | how did the venetian school of art influence the renaissance artists and architecture ? |
venice - another world petrarch , the fourteenth-century tuscan poet , called venice a `` mundus alter '' or `` another world , '' and the city of canals really is different from other renaissance centers like florence or rome . venice is a cluster of islands , connected by bridges and canals , and until the mid-19th c... | painters also experimented more with the textural differences produced by thick versus thin application of paint . in the late renaissance titian ’ s mastery was rivaled by tintoretto and veronese . each attempted to out-paint the other with increasingly dynamic and sensual subjects for local churches and international... | so most of the events in the late renaissance was in venice ? |
venice - another world petrarch , the fourteenth-century tuscan poet , called venice a `` mundus alter '' or `` another world , '' and the city of canals really is different from other renaissance centers like florence or rome . venice is a cluster of islands , connected by bridges and canals , and until the mid-19th c... | as a result , all of those thin layers reflect light and the surface shines . painting conservators have even found that bellini , giorgione , and titian added ground-up glass to their pigments to better reflect light . venetian painting in the 16th century over the next century venetian painters pursued innovative com... | what do you mean with `` bellini , giorgione , and titian added ground-up glass to their pigments '' ? |
overview in the 1950s and 1960s , young americans had more disposable income and enjoyed greater material comfort than their forebears , which allowed them to devote more time and money to leisure activities and the consumption of popular culture . rock and roll , a new style of music which drew inspiration from africa... | where there had been only 178,000 televisions in homes in 1948 , by 1955 , over three-quarters of a million us households—about half of all homes—had television . various types of programs were broadcast on the handful of major networks : situation comedies , variety programs , game shows , soap operas , talk shows , m... | what are police procedural shows ? |
in this series of articles , we ’ re going to take an in-depth look at the sat reading test . on the test , you will encounter a variety of passages broken into three content areas : u.s. and world literature . includes prose fiction texts , both contemporary and classic , by american and international authors . these ... | questions will ask you to determine relationships between the graphic or to analyze how two paired passages relate to one another . on official sat practice with khan academy , students will see the categories of literature , history , social science , and science . the founding documents and great global conversation ... | what words are we expecting to see in the new sat ? |
in this series of articles , we ’ re going to take an in-depth look at the sat reading test . on the test , you will encounter a variety of passages broken into three content areas : u.s. and world literature . includes prose fiction texts , both contemporary and classic , by american and international authors . these ... | the founding documents and great global conversation texts can be found under the history category . you will not need to know the names of these categories for the test , but this gives you an idea of the passage content . start practicing your reading test skills now ! | how can you become a faster reader and still understand the passage at the same time ? |
overview the boston tea party , which involved the willful destruction of 342 crates of british tea , proved a significant development on the path to the american revolution . the boston tea party , which occurred on december 16 , 1773 and was known to contemporaries as the destruction of the tea , was a direct respons... | in exchange for the power to appoint its governors , north loaned the company £1.5 million—the equivalent of about \ $ 270 million today. $ ^2 $ north also granted the company a monopoly on the right to sell tea in the north american colonies . the boston tea party as the british authorized the shipment of thousands of... | was the boston tea party an effective form of protest against british taxes ? |
overview the boston tea party , which involved the willful destruction of 342 crates of british tea , proved a significant development on the path to the american revolution . the boston tea party , which occurred on december 16 , 1773 and was known to contemporaries as the destruction of the tea , was a direct respons... | in exchange for the power to appoint its governors , north loaned the company £1.5 million—the equivalent of about \ $ 270 million today. $ ^2 $ north also granted the company a monopoly on the right to sell tea in the north american colonies . the boston tea party as the british authorized the shipment of thousands of... | so is it correct to say that the reason the colonists were against the tea act was because there was too much tea thus too many taxes ? |
overview the boston tea party , which involved the willful destruction of 342 crates of british tea , proved a significant development on the path to the american revolution . the boston tea party , which occurred on december 16 , 1773 and was known to contemporaries as the destruction of the tea , was a direct respons... | boston was the center of colonial revolutionary fervor , and its radicals did not take kindly to hutchinson ’ s demands . the sons of liberty , a secret society formed by radical colonists to protest british taxation policies after the passage of the stamp act in 1765 , spearheaded the opposition to the tea act. $ ^3 $... | why id the sons of liberty just wear a mask instead of full on clothes ? |
overview the boston tea party , which involved the willful destruction of 342 crates of british tea , proved a significant development on the path to the american revolution . the boston tea party , which occurred on december 16 , 1773 and was known to contemporaries as the destruction of the tea , was a direct respons... | boston was the center of colonial revolutionary fervor , and its radicals did not take kindly to hutchinson ’ s demands . the sons of liberty , a secret society formed by radical colonists to protest british taxation policies after the passage of the stamp act in 1765 , spearheaded the opposition to the tea act. $ ^3 $... | why did sons of liberty choose to disguise native americans except for hiding their identity ? |
overview the boston tea party , which involved the willful destruction of 342 crates of british tea , proved a significant development on the path to the american revolution . the boston tea party , which occurred on december 16 , 1773 and was known to contemporaries as the destruction of the tea , was a direct respons... | the coercive acts levied fines for the destroyed tea , sent british troops to boston , and rewrote the colonial charter of massachusetts , giving broadly expanded powers to the royally appointed governor . british taxation policies after the conclusion of the seven years ’ war in 1763 , the british empire was in financ... | by the end of the american revolution , was the british empire in extreme debt ? |
overview the boston tea party , which involved the willful destruction of 342 crates of british tea , proved a significant development on the path to the american revolution . the boston tea party , which occurred on december 16 , 1773 and was known to contemporaries as the destruction of the tea , was a direct respons... | in exchange for the power to appoint its governors , north loaned the company £1.5 million—the equivalent of about \ $ 270 million today. $ ^2 $ north also granted the company a monopoly on the right to sell tea in the north american colonies . the boston tea party as the british authorized the shipment of thousands of... | is there any specific scene 's during the tea party ? |
overview the second continental congress convened in philadelphia in the summer of 1775 , shortly after the war with the british had begun . it was preceded by the first continental congress in the fall of 1774 . the congress appointed george washington as commander of the continental army , and authorized the raising ... | the congress appointed george washington as commander of the continental army , and authorized the raising of the army through conscription . on july 4 , 1776 , the congress issued the declaration of independence , which for the first time asserted the colonies ’ intention to be fully independent of the mother country ... | were federalists and/or democratic republicans created by this time period ? |
overview the second continental congress convened in philadelphia in the summer of 1775 , shortly after the war with the british had begun . it was preceded by the first continental congress in the fall of 1774 . the congress appointed george washington as commander of the continental army , and authorized the raising ... | it did not have the authority to raise taxes , nor did it have the ability to regulate commerce . on july 4 , 1776 , the congress took a momentous step and issued the declaration of independence . although the delegates were partly motivated by the necessity of securing foreign allies—particularly the french—to assist ... | when congress issued the declaration of independance , did n't england fight again or try to stop them ? |
overview the second continental congress convened in philadelphia in the summer of 1775 , shortly after the war with the british had begun . it was preceded by the first continental congress in the fall of 1774 . the congress appointed george washington as commander of the continental army , and authorized the raising ... | the congress established itself as the central governing authority under the articles of confederation , which remained in force until 1788 . fighting the revolutionary war in april 1775 , at lexington and concord in massachusetts , war between britain and its north american colonies broke out . in order to direct the ... | just to confirm , was the declaration explaining lexington and concord or basically informing the british that the colonies were declaring a full-blown war ( starting the revolutionary war ) ? |
“ the beautiful woman ” genre of chinese painting throughout the history of chinese art , painters never tired of adopting beautiful female figures as the subject of their depictions . with a stable political structure , flourishing economy and prosperous culture , the genre of “ beautiful women painting ” ( meirenhua ... | literary records provide clues for another symbolic meaning associated with this conventional practice . the ninth-century scholar wang renyu documented that every springtime , the tang dynasty emperor xuanzong ( who ruled from 685–762 ) organized a banquet and required palace women to wear blossoms in their hair . sho... | is there good evidence that the emperor xuanzong actually ruled for 77 years ? |
the caliphates the umbrella term `` islamic art '' casts a pretty big shadow , covering several continents and more than a dozen centuries . so to make sense of it , we first have to first break it down into parts . one way is by medium—say , ceramics or architecture—but this method of categorization would entail looki... | geography is another means of organization , but modern political boundaries rarely match the borders of past islamic states . a common solution is to consider instead , the historical caliphates ( the states ruled by those who claimed legitimate islamic rule ) or dynasties . though these distinctions are helpful , it ... | what made the caliphates `` legitimate '' ... i would think that the only thing that legitimizes a ruling government is the consent of the governed ( in most cases a democracy ) ... were the caliphates anything like a democracy ? |
the caliphates the umbrella term `` islamic art '' casts a pretty big shadow , covering several continents and more than a dozen centuries . so to make sense of it , we first have to first break it down into parts . one way is by medium—say , ceramics or architecture—but this method of categorization would entail looki... | the caliphates the umbrella term `` islamic art '' casts a pretty big shadow , covering several continents and more than a dozen centuries . so to make sense of it , we first have to first break it down into parts . | what is a umbrella term ? |
the caliphates the umbrella term `` islamic art '' casts a pretty big shadow , covering several continents and more than a dozen centuries . so to make sense of it , we first have to first break it down into parts . one way is by medium—say , ceramics or architecture—but this method of categorization would entail looki... | the first years following the death of muhammad were , of course , formative for the religion and its artwork . the immediate needs of the religion included places to worship ( mosques ) and holy books ( korans ) to convey the word of god . so , naturally , many of the first artistic projects included ornamented mosque... | can someone explain which is `` correct '' , or why some mosques are ornamental and heavily decorated while others are bare and modest ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | why does n't mars have a magnetic field like earth ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | if we look at the history of martian rock more broadly we notice we see 2 phases in the geologic record : “ iron/magnesium clays ” and then “ aluminum clays ” . iron/magnesium clays form when the ratio of water interacting with rock is low . while aluminum clays are signs of a high water/rock ratio as soluble elements ... | would you be able to explain to me how the magnetic field would disappear without gold or iron ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | this means that the crater was once filled with water . below is an artist 's rendition of a hypothetical sea that may have once filled mars ’ largest crater , hellas , located in the planet ’ s southern hemisphere . if we look at the history of martian rock more broadly we notice we see 2 phases in the geologic record... | is the magnetic sphere what gives the planet an atmosphere ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | it is believed that these streaks are formed by short term discharge of salty waters when mars heats up briefly in the summer . if we look at ancient mars using this topographic map , we see enormous outflow channels and valleys into blue depression . so water wasn ’ t “ short term ” in the past as it is today . | in the topographic map , what do the red parts mean ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . | why mars why not mercury to explore first ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | why does n't mars have a magnetic field like earth ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid water during periods of warming . here is nasa ’ s hypothesised history of water on mars : today we still find evidence of ice below the surface when ast... | why dont you have the rover dig down and extract the ice ? |
a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . this ice cycles back to liquid w... | a mild history curiosity will land in a region where this key item on the checklist of life ’ s requirements has already been determined : it was wet . how could have mars been wet ? mars axis isn ’ t stable like earth , and when it tilts extremely the poles grow resulting in ice ages . | how did mars ' atmosphere get thin and/or why is it that way ? |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.