1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
DIA [1.3K]
3 years ago
7

I. A teacher can prepare a slide and demonstrate it in the class with the help

Computers and Technology
1 answer:
marin [14]3 years ago
3 0

Answer:

ay di ko alam yan hahahaha

You might be interested in
How can i see what websites are visited on my wifi
grigory [225]

Answer:

If you want to view sites visited on a wireless network, you can check the logs stored by the wireless router to see what information is available. You may need to set your logging settings to capture the data you want.

Explanation:

5 0
2 years ago
1. What are copyright laws?
andre [41]
1. Copyright laws protects original works of authorita1. A
7 0
3 years ago
Read 2 more answers
Organ transplants are rarely successful.
Maurinko [17]

False......................

6 0
3 years ago
Filtering removes data from the spreadsheet. A. True B. False
____ [38]
6 is false
7 is false
8 is true
5 0
3 years ago
Read 2 more answers
Write the routines with the following declarations: void permute( const string & str ); void permute( const string & str
fomenos

Answer:

Here is the first routine:

void permute( const string &str ) {  // function with one parameter

 int low = 0;

 int high = str.length();

 permute(str, low, high);

}    

Or you can directly call it as:

 permute(str, 0, str.length());

Explanation:

The second routine:

void permute( const string &str, int low, int high)  

//function with three parameters

{ string str1 = str;

 if ( low == high ) {  //base case when last index is reached

   for (int i = 0; i <= high; ++i)

     cout << str1[i]; }  //print the strings  

 else {

   for (int i=low; i<high; ++i) {  // if base case is not reached

     string temp = str1;   //fix a character

     swap( str1[i], str1[low] ); //swap the values

     permute( str1, low + 1, high );  //calling recursive function (recursion case)

     swap( str1[i], str1[low] );     }  } } //swap again to go to previous position

In this function the following steps are implemented:

A character is fixed in the first position.

Rest of the characters are swapped with first character.

Now call the function which recursively repeats this for the rest of the characters.

Swap again to go to previous position, call the recursive function again and continue this process to get all permutations and stop when base condition is reached i.e. last index is reached such that high==low which means both the high and low indices are equal.

You can write a main() function to execute these functions.

int main() {

 string str;

 cout << "Enter a string: ";

 cin >> str;

 permute(str);  }

5 0
3 years ago
Other questions:
  • Which best describes a difference between transcription and DNA replication
    8·2 answers
  • You want to boot a linux system into singer user mode/ what options might you add to a linux kernel options list in a boot loade
    9·1 answer
  • Which are the best examples of cost that should be considered when creating a project budget
    14·1 answer
  • Implement a function inValues() that asks the user to input a set of nonzero floating-point values. When the user enters a value
    7·1 answer
  • Really helpful, I want to get together tomorrow ,Later I will follow and make it the best answer
    7·1 answer
  • What is the scope of each variable?
    11·2 answers
  • How many hours do you spend on the Internet per day?
    11·2 answers
  • Difference between switch and switch lite
    10·1 answer
  • Write a loop that continually asks the user what pets the user has until the user enters rock in which case the loop ends. It sh
    6·1 answer
  • . Why is it important to use Social Media responsibly? ANSWER NOW!!!
    15·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!