Answer:
File tab
Explanation:
source https://www.computerhope.com/jargon/b/backstage-view.htm
1.
#include <iostream>#include <string>
using namespace std;
int main(){ string chars; // This is where we will put our @ signs and print them for(int x=0;x < 5; x++){
chars = chars + '@'; // This will concatenate an @ sign at the end of the variable cout << chars << "\n"; }}
2.
#include <iostream>#include <string>
using namespace std;
int main(){ string name; // Our variable to store the name cout << "What is your name? \n"; // Asks the user for their name cin >> name; cout << "\nWell, hello " << name << "!";}
3.
#include <iostream>#include <string>
using namespace std;
int main(){ int number; // Our variable cout << "Enter a number\n"; // Asks for a number cin >> number; cout << "You entered " << number << "%!";}
4.
#include <iostream>#include <string>
using namespace std;
int main(){ int number; // Our variable cout << "Enter a number\n"; cin >> number;
int check = number % 2; // The modulo operator (the percent sign) gets the remainder of the quotient if (check == 0) { cout << number << " is even!"; // If the remainder is 0 then it prints out "x is even" } else { cout << number << " is odd!"; // If the remainder is not 0 then it prints out "x is odd" }}
5.
#include <iostream>#include <string>
using namespace std;
int main(){ float r; // Our variable cout << "Enter a radius\n"; cin >> r; if (r < 0){ cout << "Lol. No."; // If the radius is less than zero print out that message } float circumference=2*3.14*r; float area=r*r*3.14; cout << "\n\n Circumference of circle: " << circumference; cout << "\n Area of circle: " << area;}
Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.
The Jenkins tool is often used by DevOps to facilitate the development, testing, and deployment of new software.
<h3>What is software development?</h3>
The practice of conceptualizing, planning, designing, coding, documenting, testing, and bug-fixing that went into building and maintaining applications, platforms, or other software modules is known as software creation.
Jenkins is a Java-based continuous integration/continuous delivery and deployment system that is free and open-source.
Thus, the Jenkins tool is often used by DevOps to facilitate the development, testing, and deployment of new software.
Learn more about software development here:
brainly.com/question/3188992
#SPJ4
Answer:
RainbowTables
Explanation:
RainbowTables is the best option when the cracker has limited time.
