Write your date of birth and your AIUB ID, and then consider each single digit as the input value for an index of an array. For example, Birthday: 08/07/1978 and AIUB ID: 97-23412-2. Based on these data the Array is following: index 0 1 2 value 0 | 3 4 5 6 7 8 9 10 11 12 13 14 | 7 | 1 15 | 2 8. 7 8 9 2 3 4 1 2 If any value is reaped into the array then delete all the repeated values. For example:

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Birthday: 06/12/2001. AIUB ID: 21-44485-1. Send the code in c++ format.
Write your date of birth and your AIUB ID, and then consider each single digit as the input value for an
index of an array. For example, Birthday: 08/07/1978 and AIUB ID: 97-23412-2. Based on these data the
Array is following:
|index 0 1
value o
If any value is reaped into the array then delete all the repeated values. For example:
|2 3 4 5 6 7 8 9 10 11
12 13
1
14
15
8
1
7
8.
9
7
2
3
4
2
index 01
2
3 4
5 6
8
9 10
12
13
11
14
15
value 0
After deleting all reaped value from the array, the final array is following:
8
7
1
2
3
4
index 0 1
2
3
4
5
6
7
value 0
8
7
9
2
4
Now, build a max heap using the final array.
Transcribed Image Text:Write your date of birth and your AIUB ID, and then consider each single digit as the input value for an index of an array. For example, Birthday: 08/07/1978 and AIUB ID: 97-23412-2. Based on these data the Array is following: |index 0 1 value o If any value is reaped into the array then delete all the repeated values. For example: |2 3 4 5 6 7 8 9 10 11 12 13 1 14 15 8 1 7 8. 9 7 2 3 4 2 index 01 2 3 4 5 6 8 9 10 12 13 11 14 15 value 0 After deleting all reaped value from the array, the final array is following: 8 7 1 2 3 4 index 0 1 2 3 4 5 6 7 value 0 8 7 9 2 4 Now, build a max heap using the final array.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY