Cross-Site Request Forgery
CSRF is a type of a malicious exploit or an attack vector that forces a user to transmit unauthorized commands that the web application trust. Malicious websites can transmit such commands through hidden forms or specially crafted image tags. Unlike Cross-Site Scripting (XSS) where the victim’s trust for a website is exploited, the website’s trust in CSRF for a victim’s browser is exploited.
Answer:
// here is code in C++.
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variables Declaration and initialization
int no_gallon=16;
int dis=312;
// find the miles per gallon
double mile_gallon=dis/double(no_gallon);
// print the results
cout<<"number of gallons: "<<no_gallon<<endl;
cout<<"distance travel before refueling: "<<dis<<endl;
cout<<"miles per gallon is: "<<mile_gallon<<endl;
return 0;
}
Explanation:
Declare and initialize the number of gallon and distance travel without refueling. Calculate the miles per gallon by dividing distance with number of gallons.Then print the results.
Output:
number of gallons: 16
distance travel before refueling: 312
miles per gallon is: 19.5
Answer:
See explaination
Explanation:
In our grammar for arithmetic expression, the start symbol is <expression>, so our initial string is:
<expression >
Using rule 5 we can choose to replace the nonterminal, producing the string:
<expression >*<expression >
We now have two nonterminals, to replace, we can apply rule three to the first nonterminal, producing the string:
<expression >+<expression>*<expression>
We can apply rule two to the remaining nonterminal, we get:
(number)+number*number
This is a valid arithmetic expression as generated by grammar.
Given a grammar G with start symbol S, if there is some sequence of production that when applied to the initial string S, result in the string s, then s is in L (G). the language of the grammar.