(a) Which of the following are true about Object-Oriented Programming (O0P). Choose ALL that apply. A. OOP allows us to define new classes B. Use of inheritance allows us to reuse code without having to rewrite it C. A parent class can have at most one child class in Python D. ALL methods in the parent class must be overridden by the child class (b) Which of the following are TRUE about a correct recursive algorithm? Choose ALL that apply. A. It must have at least one base case B. It must have no more than 2 base cases C. The execution of the algorithm must eventually reach a base case D. The algorithm's runtime must be 0(1)

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

It's all one question 

(a) Which of the following are true about Object-Oriented Programming (00P).
Choose ALL that apply.
A. OOP allows us to define new classes
B. Use of inheritance allows us to reuse code without having to rewrite it
C. A parent class can have at most one child class in Python
D. ALL methods in the parent class must be overridden by the child class
(b) Which of the following are TRUE about a correct recursive algorithm?
Choose ALL that apply.
A. It must have at least one base case
B. It must have no more than 2 base cases
C. The execution of the algorithm must eventually reach a base case
D. The algorithm's runtime must be 0(1)
Transcribed Image Text:(a) Which of the following are true about Object-Oriented Programming (00P). Choose ALL that apply. A. OOP allows us to define new classes B. Use of inheritance allows us to reuse code without having to rewrite it C. A parent class can have at most one child class in Python D. ALL methods in the parent class must be overridden by the child class (b) Which of the following are TRUE about a correct recursive algorithm? Choose ALL that apply. A. It must have at least one base case B. It must have no more than 2 base cases C. The execution of the algorithm must eventually reach a base case D. The algorithm's runtime must be 0(1)
(c) You're reading the docstring of the do_something () method of the Mystery
class. The docstring says the following:
Precondition: Len(self.items) > 148
Postcondition: Len(self.items) < 148
Assume that the class is designed and documented properly.
Which of the following are TRUE? Choose all that apply.
A. Len(items) == 147 is a possible representation invariant of Mystery
B. Len(items) == 148 is a possible representation invariant of Hystery
C. Len(items) == 149 is a possible representation invariant of Hystery
D. None of the above is a possible representation invariant of Hystery
(d) Given a non-empty binary tree T, let list L1 be the preorder traversal of
T and list L2 be the postorder traversal of T. Which of the following are TRUE?
Choose ALL that apply.
A. Len(L1) and len(L2) are the sae
B. L1 is L2 reversed
C. Li[0] is the
D. Either L1 or L2 must be a sorted list.
same as L2[-1]
Transcribed Image Text:(c) You're reading the docstring of the do_something () method of the Mystery class. The docstring says the following: Precondition: Len(self.items) > 148 Postcondition: Len(self.items) < 148 Assume that the class is designed and documented properly. Which of the following are TRUE? Choose all that apply. A. Len(items) == 147 is a possible representation invariant of Mystery B. Len(items) == 148 is a possible representation invariant of Hystery C. Len(items) == 149 is a possible representation invariant of Hystery D. None of the above is a possible representation invariant of Hystery (d) Given a non-empty binary tree T, let list L1 be the preorder traversal of T and list L2 be the postorder traversal of T. Which of the following are TRUE? Choose ALL that apply. A. Len(L1) and len(L2) are the sae B. L1 is L2 reversed C. Li[0] is the D. Either L1 or L2 must be a sorted list. same as L2[-1]
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of Security Technology
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