Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
cent) 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 nu adjacent). For example 2: List B = [24,15,18,18,42, 22] -> output: false the output of c xample 2 is Ealse because there isn+

cent) 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 nu adjacent). For example 2: List B = [24,15,18,18,42, 22] -> output: false the output of c xample 2 is Ealse because there isn+

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

For all questions you need to write the full algorithm and implement the algorithm by using OUBILD script. The student should provide provide one screenshot for the OUBUILD script and two screenshots for differnt outputs.

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? ||
Transcribed Image Text: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? ||
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Computational Systems
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS