Write a Menu Driven C++ program that creates one-dimensional array arr[] and initialize it with user. The program should do following Tasks using Menu, the menu operations are implemented using functions: a) Write a function Count(), that counts the occurrences of x (a number) in arr[]. b) Write a function Partition(), that take the first element of the array x and put x in a position such that all smaller elements (smaller than x) are before x, and put all greater elements (greater than x) after x. c) Write a function next_XOR(),the count of elements which are equal to the XOR of the next two elements. d) Write a function Duplicates(),which calculated the frequencies of all the elements and display them. e) Write a function Circular(),which replace every element of the array by the sum of next two consecutive elements in a circular manner i.e. arr[0] = arr[1] + arr[2], arr[1] = arr[2] + arr[3], ... arr[n – 1] = arr[0] + arr[1]. f) Write a function Search(), takes an array and element to search in the array and returns the index of element if the element is found. And return the negative number if not found. g) Write a function shift_Circular (), which shifts an array circularly left by two positions. Thus, if p[0] = 15, p[1]= 30, p[2] = 28, p[3]= 19 and p[4] = 61 then after the shift p[0] = 28, p[1] = 19, p[2] = 61, p[3] = 15 and p[4] = 30.

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

Write a Menu Driven C++ program that creates one-dimensional array arr[] and initialize it with user. The
program should do following Tasks using Menu, the menu operations are implemented using functions:
a) Write a function Count(), that counts the occurrences of x (a number) in arr[].
b) Write a function Partition(), that take the first element of the array x and put x in a position such
that all smaller elements (smaller than x) are before x, and put all greater elements (greater
than x) after x.
c) Write a function next_XOR(),the count of elements which are equal to the XOR of the next two
elements.
d) Write a function Duplicates(),which calculated the frequencies of all the elements and display
them.
e) Write a function Circular(),which replace every element of the array by the sum of next two
consecutive elements in a circular manner i.e. arr[0] = arr[1] + arr[2], arr[1] = arr[2] + arr[3],
... arr[n – 1] = arr[0] + arr[1].
f) Write a function Search(), takes an array and element to search in the array and returns the
index of element if the element is found. And return the negative number if not found.
g) Write a function shift_Circular (), which shifts an array circularly left by two positions. Thus, if
p[0] = 15, p[1]= 30, p[2] = 28, p[3]= 19 and p[4] = 61 then after the shift p[0] = 28, p[1] = 19, p[2]
= 61, p[3] = 15 and p[4] = 30.

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Functions
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.
Similar questions
  • SEE MORE QUESTIONS
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