Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Match the Definition to the Term

Match the Definition to the Term

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

In C++

Match the Definition to the Term A. Copies all of the member field values of an object. B. Members functions in a class that delete an object C. Used to define a function outside a class A C++ enhancement feature to increase the execution time of a D. program Member functions that allow for modification of the data Е. members v Inline Function v Friend Function Recursively divides a list into several sub lists, until they only F. contain one element. The lists will then be sorted and merged, resulting in a sorted list. v Shallow Copy Finds the biggest element in each iteration by comparing G. adjacent elements, and bubbles the larger values over to the right, by swapping index values. v Deep Copy v Scope Resolution Operator Can access the private and protected members of a class if it is Н. declared v Private Member v Public Member I. Can be accessed or viewed from outside a class v Mutator Function Requests for the memory allocation in heap. It initializes the J. memory to the pointer variable and returns its address v Accessor Function K. Cannot be accessed or viewed from outside a class. v Selection sort Copies all fields, and makes copies of dynamically allocated L. v Bubble sort memory pointed to by the fields in an object. A special method that is automatically called when an object of М. a class is created v Insertion sort v Merge sort Picks a pivot value and divides the remainder of the elements into two sub lists: those that are bigger than the pivot value and N. those that are less than the pivot value. It then places the pivot value in the correct location and repeats this process with the v Quick sort v Constructor two sub lists until all elements are sorted v Destructor Used to deallocate the memory. User has privilege to deallocate О. the created pointer variable by this operator v new Operator Creates a sorted sub list to the left, comparing with the adjacent element to the right, and inserts the elements into the correct P. order. There is no swap of index values like the last two sorting methods, but an insertion into an index value and shifting all v delete Operator other elements over. Q. Member functions that allow access to data members Finds the minimum element in each iteration and places it in R. the beginning of the unsorted list, or to the left, by swapping index values.
Transcribed Image Text:Match the Definition to the Term A. Copies all of the member field values of an object. B. Members functions in a class that delete an object C. Used to define a function outside a class A C++ enhancement feature to increase the execution time of a D. program Member functions that allow for modification of the data Е. members v Inline Function v Friend Function Recursively divides a list into several sub lists, until they only F. contain one element. The lists will then be sorted and merged, resulting in a sorted list. v Shallow Copy Finds the biggest element in each iteration by comparing G. adjacent elements, and bubbles the larger values over to the right, by swapping index values. v Deep Copy v Scope Resolution Operator Can access the private and protected members of a class if it is Н. declared v Private Member v Public Member I. Can be accessed or viewed from outside a class v Mutator Function Requests for the memory allocation in heap. It initializes the J. memory to the pointer variable and returns its address v Accessor Function K. Cannot be accessed or viewed from outside a class. v Selection sort Copies all fields, and makes copies of dynamically allocated L. v Bubble sort memory pointed to by the fields in an object. A special method that is automatically called when an object of М. a class is created v Insertion sort v Merge sort Picks a pivot value and divides the remainder of the elements into two sub lists: those that are bigger than the pivot value and N. those that are less than the pivot value. It then places the pivot value in the correct location and repeats this process with the v Quick sort v Constructor two sub lists until all elements are sorted v Destructor Used to deallocate the memory. User has privilege to deallocate О. the created pointer variable by this operator v new Operator Creates a sorted sub list to the left, comparing with the adjacent element to the right, and inserts the elements into the correct P. order. There is no swap of index values like the last two sorting methods, but an insertion into an index value and shifting all v delete Operator other elements over. Q. Member functions that allow access to data members Finds the minimum element in each iteration and places it in R. the beginning of the unsorted list, or to the left, by swapping index values.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
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
SEE MORE TEXTBOOKS