Speaker’s Bureau Program Plan: Include the required header files. Declare the constant variable “n” as type of integer. Declare a structure named “Speaker”. Declare the members “s_name”, “number”, “spe_top”, and “req_fee”. Declare a function named “inp_data()” to get input data. Declare a function named “disp_data()” to display all data. Declare a function named “key_search()” to search for a speaker on a particular topic. Define the “main()” function. Declare the variables “ms”, “option”, and “spe_num” as integer type. Declare the structure array variable “arr[]” with size “n”. Use “do-while” loop to display the menu. Get the “option” from user and validate the option using “while” loop. Use “switch-case” to perform the action chosen by the user from the menu. Define the “inp_data()” function to get speaker name, telephone number, speaking topic and fee required from the user. Validate each input which are empty or less than “0”. Define a function “disp_data” to display the content of the structure array. Define a “key_search()” function. Declare the temporary variable “temp” in Boolean data type. Perform the necessary operation to search the speaker name to the array of structures.

Question

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…

Answer 1

Question

Chapter 11, Problem 10PC

Program Plan Intro

Speaker’s Bureau

Program Plan:

Include the required header files.

Declare the constant variable “n” as type of integer.

Declare a structure named “Speaker”.

Declare the members “s_name”, “number”, “spe_top”, and “req_fee”.

Declare a function named “inp_data()” to get input data.

Declare a function named “disp_data()” to display all data.

Declare a function named “key_search()” to search for a speaker on a particular topic.

Define the “main()” function.

Declare the variables “ms”, “option”, and “spe_num” as integer type.

Declare the structure array variable “arr[]” with size “n”.

Use “do-while” loop to display the menu.

Get the “option” from user and validate the option using “while” loop.

Use “switch-case” to perform the action chosen by the user from the menu.

Define the “inp_data()” function to get speaker name, telephone number, speaking topic and fee required from the user.

Validate each input which are empty or less than “0”.

Define a function “disp_data” to display the content of the structure array.

Define a “key_search()” function.

Declare the temporary variable “temp” in Boolean data type.

Perform the necessary operation to search the speaker name to the array of structures.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…

using r language

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…