A(n) is an ordered collection of unambiguous, executable steps that defines a terminating process. algorithm instruction O program process Which of the following is NOT a way of representing an algorithm? flowchart O programming language pseudocode step-wise refinement

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
icon
Related questions
Question
**Question 1:**  
A(n) __________ is an ordered collection of unambiguous, executable steps that defines a terminating process.

- [x] algorithm
- [ ] instruction
- [ ] program
- [ ] process

**Question 2:**  
Which of the following is NOT a way of representing an algorithm?

- [ ] flowchart
- [ ] programming language
- [ ] pseudocode
- [x] step-wise refinement
Transcribed Image Text:**Question 1:** A(n) __________ is an ordered collection of unambiguous, executable steps that defines a terminating process. - [x] algorithm - [ ] instruction - [ ] program - [ ] process **Question 2:** Which of the following is NOT a way of representing an algorithm? - [ ] flowchart - [ ] programming language - [ ] pseudocode - [x] step-wise refinement
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Hiring Problem
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.
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