13. Given an array of integers, you must find the k smallest number after deleting the given elements. n case of repeating elements, delete one instance for every instance of the element present in the array containing the elements to be deleted. Assume that at least k elements will be left after deleting n elements. Examples: nput: array[] = { 5, 12, 33, 4, 56, 12, 20}, dell] = { 12, 56, 5 }, k = 3 Dutput :4 12 20 Explanation : After deletions { 33, 4, 12, 20} will be left. Print top 3 lowest elements from it. Explain how you would solve this problem. You WILL NOT write the C++ code. Based on your data structure knowledge so far, what data structures would you use? Explain your

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

this is a data structure question

read the question carefully and answer it but dont plagarize from internet

13. Given an array of integers, you must find the k smallest number after deleting the given elements.
In case of repeating elements, delete one instance for every instance of the element present in the array
containing the elements to be deleted.
Assume that at least k elements will be left after deleting n elements.
Examples:
Input: arrayl] = {5, 12, 33, 4, 56, 12, 20 }, del[] = { 12, 56, 5 }, k = 3
Output : 4 12 20
Explanation : After deletions { 33, 4, 12, 20 } will be left. Print top 3 lowest elements from it.
Explain how you would solve this problem. You WILL NOT write the C++ code.
Based on your data structure knowledge so far, what data structures would you use? Explain your
choices based on runtime and compare with other data structure choices.
Transcribed Image Text:13. Given an array of integers, you must find the k smallest number after deleting the given elements. In case of repeating elements, delete one instance for every instance of the element present in the array containing the elements to be deleted. Assume that at least k elements will be left after deleting n elements. Examples: Input: arrayl] = {5, 12, 33, 4, 56, 12, 20 }, del[] = { 12, 56, 5 }, k = 3 Output : 4 12 20 Explanation : After deletions { 33, 4, 12, 20 } will be left. Print top 3 lowest elements from it. Explain how you would solve this problem. You WILL NOT write the C++ code. Based on your data structure knowledge so far, what data structures would you use? Explain your choices based on runtime and compare with other data structure choices.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
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