Partial preview of the text
Download LETRS Unit 6 Assessment Questions and Verified Answers A+ GRADED. and more Exams Teaching method in PDF only on Docsity!
Which of the following statements best describes an effective way to prepare students to listen to or read a text? Which of the following describes a product of comprehension, rather than a process? Establish the purpose for reading the text and impart background knowledge. verbalizing a summary or retelling of the text after reading Which of these statements is not true of students with specific comprehension difficulties? Students with greater background knowledge of a text's topic are more likely to: Which teaching strategy is most likely to help English Learners construct a mental model of a texts meanings? They rely less on context to guess on the identity of the words. remember more of what the text actually says Provide visual context for meaning- pictures, graphic organizers, objects, and/or actions. comprehend the structure of a fictional narrative? Which sentence is most likely to challenge younger students’ language comprehension abilities? What activity would best create awareness of substitution as a cohesive device? Unless everyone can agree, we will not play there again. having students underline words and phrases that mean almost the same thing Which of the following is true of algorithms?A. Algorithms may have an infinite set ofinstructionsB. Algorithms must be expressed C. Every algorithm can be usinga programming languageC. constructedusing combinations of Every algorithm can be sequencing, selection, and iteration constructedusing combinations of sequencing, selection, and iterationD. Every problem can be solved with analgorithm algorithm below?7REPEAT 2 TIMES {REPEAT 3 TIMES {MOVE_FORWARD() }ROTATE_LEFT() MOVE_FORWARD() ROTATE_RIGHT()} 310f98c026f-imad7960be324- A.https://images.code.org/e0540a96 im876cbd35c-im77b2e13504-imD. 943dcd50493f7age- 1581440447265.59.37%20AM.png B.https://images.code.org/0d54e315 8f1c63770a0b6age- 1581440458676.59.48%20AM.png C.https://images.code.org/1a7ffd8a2 53d0ff94c3651cage- 1581440461642.59.55%20AM.png D.https://images.code.org/598c9b72 b1f4ebe0d75f71age- 1581440465868.00.01%20AM.png https://image- 1581440465868 .00.01%20AM.png undecidable problemD. An efficiency problem ages.code.org/598c9b72b1f4ebe0d75f7177 The algorithm below is used to find the largest element in a list of numbers. By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how?01 target <- list[1]02 FOR EACH num IN list 03 {04 IF(num > target)05 {06 target <- num07 }08 }09 DISPLAY (target)A. Line 01 becomes target <- list[2]B. Line 04 becomes IF (num < target)C. Line 04 becomes IF (num = target)D. Line 01 becomes list[0] <- target B. Line 04 becomes IF (num < target) 1581441889986.23.24%20AM.png C.https://images.code.org/6fe51751c 407d54d1b65aage- 1603899791984. png D.https://images.code.org/30224203 112d3c6bd8d5aage- 1581441895813.23.42%20AM.png ages.code.org/45ba8c65d34cd05e4867603 https://images.code.org/967d626aa8 a809dc18a99age- Sca45aaf88d-im 1650572605550.pngThis graph shows the efficiencies of two different algorithms that solve the same problem. Which of the following is most efficient?A. These algorithms are equally efficientB. Algorithm A is more efficient thanalgorithm BC. Algorithm B is more efficient D. The algorithms have different efficiencies depending on the input size Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time.Which principle does this decision best demonstrate?A. Unreasonable algorithms may sometimes also be undecidableB. Heuristics can be used to solve someproblems for which no reasonable algorithm existsC. Two algorithms that solve the sameproblem must also have the same efficiencyD. Approximate solutions are often identical to optimal solutions Which of the following algorithmic efficiencies would be considered LEAST efficient?A. LinearB. Constant D. Exponential output for at leasttwo possible inputsC. Undecidable problems are problemsfor which an algorithm can be written thatproduces a correct output for all inputsbut in an unreasonable timeD. An undecidable problem is a problemfor which no algorithm can be constructed that always produces a correct output A group of students writes their D. Only the linear search will work names and unique student ID sincethe data has not been sorted numbers on sheets of paper. The sheets are then randomly placed in a stack. Their teacher is looking to see if a specific ID number is included in the stack. Which of the following best describes whether their teacher should use a linear or a binary search?A. The teacher could use either type ofsearch though the linear search is likelyto be fasterB. The teacher could use either type 
