i have question about scratch as you can see in this photo , it request to write a algorithm and Implement the algorithm using scratch what i need is a photo of algorithm and photo of scratch implementation Question 2: (8 marks)Consider a list of unsorted numbers, think about an algorithm to test all the items in thelist to check whether there are any two consecutive numbers (even if they are notadjacent) or not.For example 1: List A = [10,7,23,18,45, 24] -> output: trueo the output is True because 23 and 24 are consecutive numbers (even notadjacent).For example 2: List B = [24,15,18,18,42, 22] -> output: falseo the output of example 2 is False because there isn't any consecutivenumbers.Now, answer the following Questions:1- Write an algorithm to solve the above problem?2- Can you write a new algorithm that is more efficient than the one you wrote inquestion1 which does the same job? if the answer is yes you need to write downthe new algorithm, if not you need to mention that your solution is the best solution?End of the question

Answered: Image /qna-images/answer/9d98265c-7781-4c88-8666-ac42c944dbb2.jpg

Answered: have question about scratch as you can…

have question about scratch as you can see in this photo , it request to write a algorithm and Implement the algorithm using scratch what i need is a photo of algorithm and photo of scr

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Related questions

Q: Using JAVA, Find all numbers z such that both z and z2 are in the sequence, or report that no such…

A: The answer is

Q: Select a problem that lends itself to dynamic programming implementation. i. State the issue…

A: The dynamic programming can be denoted as a problem solving technique that involves dividing the…

Q: a program / Algorithm to print five numbers recursively in an ascending orde

A: C++ code: #include <iostream>using namespace std; //function to implement bubble sortvoid…

Q: Create a recursive algorithm to compute the product of two positive integers, m and n, using only…

A: As per our guidelines, we are supposed to answer only one question. Kindly repost the remaining…

Q: Find the complexity of the following blocks of code or algorithm’s description. [Note: your answer…

Q: Two main measures for the efficiency of an algorithm are Select one: a. Time and space O b.…

A: Algorithm: It means a finite set of instructions to be followed in calculations or other problem…

Q: These simple questions test the basic understanding of the student in basic algorithm construction…

A: A variable is a name that is created by using built-in data types such as int, float, double, char,…

Q: Please convert Mutual Recursion to Java

A: Introduction: Mutual recursion methods: The methods which are work together in a group or in a pair…

Q: no handwriting or one worded, one phrased, one sentenced answers please. if you can computerize it…

A: def find_sum(num): if num <= 1: return num else: return num + find_sum(num-1)…

Q: Drow the figure using algorithms and codes. use python or java anyone language. provide the codes…

A: We use java.awt for this purpose.

Q: ease explain (step-by-step) how to find the time complexity of a striaghtforward algorithm — any…

A: The method begins with a sorting phase that is used to organise the lectures in increasing order of…

Q: Computer Science Explain why you would pass a function as an argument to an algorithm and how you…

A: INTRODUCTION: A function is a collection of statements that receive inputs, do a certain…

Q: 1. Examine the following algorithm and show the output values displayed when find(4) is executed.…

A: The, answer has given below:

Q: What does the following function do if n=6? int fun (unsigned int n) if (n == 0 11n == 1) return n;…

A: Here in this question we have given a recursive code and we have asked to trace the output of this…

Q: Can you help me to make a java program that ask the user how many elements and ask those numbers and…

A: The question is java program selection sort in descending order with solution and count the swaps…

Q: Predict output of following program. #include int fun (int n) if (n == 4) return n; else return…

A: #include <stdio.h>int fun (int n){if (n == 4)return n;else return 2* fun (n+1);}int…

Q: How many algorithms are there in existence? a. Lots, since solutions to different programming…

A: Algorithm is a step-by-step process to solve a problem. There can be multiple ways to solve the same…

Q: Which of the following should influence your choice of a particular algorithm? I The run time of the…

A: Introduction: The algorithm is nothing but a step-by-step complete solution to any problem.

Q: You are given a list of students’ names and their test scores. Design an algorithm that does the…

A: START DECLARE array scores DECLARE variable i, sum, avg, n SET sum = 0, i = 0 REPEAT while i < n…

Q: > Output: Print the pattern and the repeated count if there is a repeated pattern, Print "none"…

A: Program: #include<bits/stdc++.h> using namespace std; void computeLPS(char str[], int M, int…

Q: Section A: Multiple Choice Questions Q3: Which one of the following is an approach for a systematic…

A: BACKTRACKING uses trial and error. it is used for solving problems recursively by trying to build a…

Q: (2) Provide a sample algorithm using pseudocode which employs recursion in two variation, a…

Q: Examine the following algorithm and show the output values displayed when find(4) is executed. Show…

A: Input :- Given the input n = 4 Output : -find(4) Solution :- The sequence of calls is depicted…

Q: 1. Approach: Non recursive: //include necessary header files #include using namespace std; //main…

A: Answer 1) Approach: Non-recursive: CODE: def main(): days = int(input("Enter number of…

Q: 21. Which of the following make use of symbol to represent an algorithm? None of the Choices…

A: Step form of algorithm consists of a sequence of numbered steps or points. So this form doesn't…

Q: hm in the usual way, ie with input data, output data and a step-by-step textual description. What…

A: It is defined as a process or set of rules to be followed in calculations or other problem-solving…

Q: a. Briefly explain why it is necessary to write an algorithm before writing a program. b. Write an…

A: (A) It is necessary to write algo of the program because in algo we used to write the steps of our…

Q: 1. Examine the following algorithm and show the output values displayed when find(4) is executed.…

A: The output values displayed when find(4) is executed are: 1 3 1 5

Q: 1. Code structure Pseudo code instructions, with comments for a recursive algorithm which will take…

A: A python program is created to convert the english text to Larrakia language as requested in the…

Q: Select the correct answer for the question below: Dynamic programming is an algorithm pattern ...…

A: Please find the answer below

Q: In Python Which of the following operations are best implemented by first sorting the list of…

A: i give this question answer in next step with theory and brief explanation

Q: 1. Design an algorithm to find the average test score for each student

A: Algorithm to find average test score for each student:- Consider 2 dimensional array, with row as…

Q: Critique the following statement: an iterative algorithm will usually run faster than an equivalent…

A: Given statement: an iterative algorithm will usually run faster than an equivalent recursive…

Q: Numeric Triangle Pattern Based on the example given on the previous module, create a program that…

A: Print the triangle patter for given integer value using c program

Q: Describe an iterative algorithm that takes as input a list of n distinct integers and finds the…

A: 1. Start 2. Declare variables 3. get an input list of n integers. 4. set max_even=0 5. for i=0 to n…

Q: Make an analysis of the algorithm you described in a) above and say what is its Time efficiency…

A: the algorithm used by your favorite ATM machine in dispensing cash.

Q: Analysis of algorithms is the determination of the amount of time and space resources required to…

A: The plan for analysis of general algorithm: Time complexity: 1.Loops a. N elements: if 1 is…

Q: Determine which characteristics of an algorithm the following procedures have and which they lack.…

A: This procedure has the characteristics of: Input, Finiteness, Generality This procedure lacks:…

Q: Which of the following statements about time complexity analysis is true? a. It is impossible for a…

A: Please find the answer below :

Q: Determine the algorithm performance based on the recursive relationship. () T(n)=27(n/2) + n…

Q: Determine which characteristics of an algorithm the following procedures have and which they lack.…

A: following are the definitions for different charaacteristics: Input - If a procedure has input…

Q: Explain, by way of an example, how Dynamic Programming with Memoisation improves the complexity of…

A: Dynamic programming: It is a type of algorithmic language which is used to solve a complex problem…

Q: 2.7 For each of the following six program fragments: a. Give an analysis of the running time (Big-Oh…

A: Given code is (1) sum = 0;for( i = 0; i < n; ++i )++sum;(2) sum = 0;for( i = 0; i < n; ++i…

Q: Create a recursive algorithm to compute the product of two positive integers, m and n, using only…

A: import java.util.*;class Main { static int productOfTwoIntegers(int n1, int n2){ if (n1 < n2)…

Q: Explain what is happening in the algorithm above, from line 13 to line 30.

A: GIVEN: A C++ code is given and we need to explain the line from 13 to 30

Q: Your programming team have been hired by the ministry of education to design programs to help…

A: I have added a commented code in the answer for taking input from the user for each test and each…

Q: 1. A certain computer algorithm executes four times as many operations when it is run with an input…

A: input size = 1 it executes 12 operations input size = 2 it executes 12*4 = 48 operations input…

Q: What does this algorithm compute? b. What is its basic operation? c. How many times is the basic…

Q: Explain and categorize from all of the algorithm Deterministic vs. Nondeterministic Computations…

A: The Deterministic vs. Non-deterministic Algorithms: The algorithm that is defined uniquely is known…

Q: Fill in the blank in the following pseudocode: if someCondition is true then do oneProcess do…

A: These statements of algorithm are the part of the basic structures, where in the structure in the…

Question

i have question about scratch as you can see in this photo , it request to write a algorithm and Implement the algorithm using scratch

what i need is a photo of algorithm and photo of scratch implementation

Question 2: (8 marks)
Consider a list of unsorted numbers, think about an algorithm to test all the items in the
list to check whether there are any two consecutive numbers (even if they are not
adjacent) or not.
For example 1: List A = [10,7,23,18,45, 24] -> output: true
o the output is True because 23 and 24 are consecutive numbers (even not
adjacent).
For example 2: List B = [24,15,18,18,42, 22] -> output: false
o the output of example 2 is False because there isn't any consecutive
numbers.
Now, answer the following Questions:
1- Write an algorithm to solve the above problem?
2- Can you write a new algorithm that is more efficient than the one you wrote in
question1 which does the same job? if the answer is yes you need to write down
the new algorithm, if not you need to mention that your solution is the best solution?
End of the question

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

How can I create a list by asking for input (x) and create a list from 1 to x using recursion? Example: Input: 12 Output: [1,2,3,4,5,6,7,8,9,10,11,12] def newlist(n): #Base Case/s #Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #Add conditions here for your recursive case/s #else: #return <operation and recursive call> function return []
“Rectangles” A rectangle can be specified in a 2-dimensional plane using the top left (north west) point and the bottom right (south east) point. Given n rectangles (using 2 points each), give an O(n log n) algorithm that tells if any two rectangles from the list overlap. Two rectangles are said to overlap, if there is a common point in both of them. [If a rectangle is entirely contained in another, they are still said to “overlap”, even though their lines don’t cross.]
discrete mathematics (a) Apply the bubble sort to the following list and write the modified list in every cycle [6, 12, 8, 11, 15, 14, 17, 2, 18, 7] (you may stop after it is fully sorted). (b) Merge the following two sets and write the merging list in every iteration [3, 5, 6, 8, 10, 11, 15] and [4, 7, 9, 13, 17]
Write and test a recursive function max to find the largest number in a list.The max is the larger of the first item and the max of all the other items.
Question 5 Implement binary search algorithm recursively on a list using F# Full explain this question and text typing work only thanks
Fill in the blanks in the function below. listsum() takes a list of integers and the list’s length. listsum() gets the sum by adding the sum of the halves. Each half is recursively divided into two until it reaches the base case (a list containing a single element or an empty list). Trace and illustrate what happens.
1- Simple check: First check if algorithm returns 0 for a sorted list and returnsfor a list sorted backwards. n(n-1)/2 2-Simple test: This picture contains a list of 10 integers. Your program should have 28 inversions.
5. Let F(n) denote the Fibonacci numbers. Prove the following property for all n ≥ 1 (Hint: Induction)F(1) + F(2) + · · · + F(n) = F(n + 2) − 1 7. The binary search algorithm is used with the following sorted list, with parameter x having the value“Chicago”. Name the elements against which x is compared.Boston, Charlotte, Indianapolis, New Orleans, Philadelphia, San Antonio, Yakima 8. The binary search algorithm is used with the following sorted list, with parameter x having the value“flour”. Name the elements against which x is compared.butter, chocolate, eggs, flour, shortening, sugar
How can I create a list by asking for input (x) and create a list from 1 to x using recursive functions? When the input is less than 1, it will print [] Example: Input: 9 Output: [1,2,3,4,5,6,7,8,9] Input: 1 Output: [1] Input: 0 Output: [] def newlist(x): #Add conditions here for your base case/s #if <condition> : #return <value> #Add conditions here for your recursive case/s #else: #return <operation and recursive call> function return []
One-friend recursion vs iteration.1. Your task is to accept a tuple a1, a2, ... , an and return the reversed tuple an, an−1, ... , a1. Being lazy, you will only strip off an element from one end or add an element back onto one end. But you have recursive friends to help you. Provide both a paragraph containing the friend’s explanation of the algorithm, and the recursive code.2. Now suppose that you have a stack, but no friends. (See Chapter 3). Quickly sketch an iterative program that solves this same problem. Be sure to include loop invariants and other the key steps required for describing an iterative algorithm.3. Trace each of these two programs. Step by step, compare and contrast their computations on a computer. i already uploaded this question 3 times and getting wrong answer so if you don't know right answer dont write rubbih ans otherwise you will get downvote
One-friend recursion vs iteration.1. Your task is to accept a tuple a1, a2, ... , an and return the reversed tuple an, an−1, ... , a1. Being lazy, you will only strip off an element from one end or add an element back onto one end. But you have recursive friends to help you. Provide both a paragraph containing the friend’s explanation of the algorithm, and the recursive code.2. Now suppose that you have a stack, but no friends. (See Chapter 3). Quickly sketch an iterative program that solves this same problem. Be sure to include loop invariants and other the key steps required for describing an iterative algorithm.3. Trace each of these two programs. Step by step, compare and contrast their computations on a computer. i already uploaded this question 3 times and getting wrong answer so if you don't know right answer dont write rubbih ans otherwise you will get downvote don't copy bartleby old or chegg its wrong
SOB 22 – (Block 2)Write up what the properties of sets, lists, vectors and strings are and whether they are mutable or immutable. Then consider the class of problems that they are best for and use some code to illustrate your points. E.g., if you have a function that solves a problem using lists, then you can say why you can/can’t use vectors for it or sets etc. Hint: Try and think of a problem (or maybe one you have already solved as part of the exercises) and try and solve it using the different data structures, e.g. first with lists, then vector, then sets. Which do you think works best? They might all be suitable? Is there a problem that you can think of where the one is suitable and the other is not (the key thing here is to understand how they differ)?[2:50 PM] E.g. a student was trying to add all the elements of 2 vectors together. He solved the problem with vectors. Can he use lists or sets? Show this by writing code in Racket to make your point.