Decrypt this secret message if your able to a lot will come..

Write the code to call the function named send_signal. there are no parameters for this function.

nikklg [1K]

*Assuming JavaScript

Answer:

function send_signal() {}

send_signal() // calls the function

Explanation:

3 0

2 years ago

Which character formatting effect makes text appear in a small font size below the midpoint of a line of text

pav-90 [236]

Answer:

Superscript or Subscript

Explanation:

The superscript or the subscript is a type of character which is set a little lower or more than the normal line of type. And it is generally small as compared to the other texts. The subscript does appear at or less than the baseline, and the superscript is above. And for the superscript, you need to press the Ctrl + Shift + + ( press and at the same time also hold the Ctrl and the Shift, and finally press the +). And for the subscript, you need to press the Ctrl + Shift ++(Press and at the same time also hold the Ctrl. and finally press the =). And pressing the corresponding shortcut once again, you will be back to the normal text.

4 0

3 years ago

SYN scanning is a tactic that a malicious hacker (or cracker) can use to determine the state of a communications port without es

Mashutka [201]

Answer:

A closed port that can not receive request from authorized users.

Explanation:

Networks comprises of end devices, routing and switching devices, servers, technical control devices etc. The communication and interconnection of these devices makes up a secure and resourceful network.

Attackers can exploit loopholes in networks to steal information. The attackers uses the SYN scanning or cracking technique to implement the DOS or denial of service attack.

DOS is used to flood ports on a server in a network, preventing authorized user access, as they steal information to avoid detection.

8 0

3 years ago

a cryptarithm is a mathematical puzzle where the goal is to find the correspondence between letters and digits such that the giv

Leokris [45]

Using the knowledge in computational language in C++ it is possible to write a code that cryptarithm is a mathematical puzzle where the goal is to find the correspondence between letters and digits

<h3>Writting the code:</h3>

#include <bits/stdc++.h>

using namespace std;

// chracter to digit mapping, and the inverse

// (if you want better performance: use array instead of unordered_map)

unordered_map<char, int> c2i;

unordered_map<int, char> i2c;

int ans = 0;

// limit: length of result

int limit = 0;

// digit: index of digit in a word, widx: index of a word in word list, sum: summation of all word[digit]

bool helper(vector<string>& words, string& result, int digit, int widx, int sum) {

if (digit == limit) {

ans += (sum == 0);

return sum == 0;

}

// if summation at digit position complete, validate it with result[digit].

if (widx == words.size()) {

if (c2i.count(result[digit]) == 0 && i2c.count(sum%10) == 0) {

if (sum%10 == 0 && digit+1 == limit) // Avoid leading zero in result

return false;

c2i[result[digit]] = sum % 10;

i2c[sum%10] = result[digit];

bool tmp = helper(words, result, digit+1, 0, sum/10);

c2i.erase(result[digit]);

i2c.erase(sum%10);

ans += tmp;

return tmp;

} else if (c2i.count(result[digit]) && c2i[result[digit]] == sum % 10){

if (digit + 1 == limit && 0 == c2i[result[digit]]) {

return false;

}

return helper(words, result, digit+1, 0, sum/10);

} else {

return false;

}

// if word[widx] length less than digit, ignore and go to next word

if (digit >= words[widx].length()) {

return helper(words, result, digit, widx+1, sum);

}

// if word[widx][digit] already mapped to a value

if (c2i.count(words[widx][digit])) {

if (digit+1 == words[widx].length() && words[widx].length() > 1 && c2i[words[widx][digit]] == 0)

return false;

return helper(words, result, digit, widx+1, sum+c2i[words[widx][digit]]);

}

// if word[widx][digit] not mapped to a value yet

for (int i = 0; i < 10; i++) {

if (digit+1 == words[widx].length() && i == 0 && words[widx].length() > 1) continue;

if (i2c.count(i)) continue;

c2i[words[widx][digit]] = i;

i2c[i] = words[widx][digit];

bool tmp = helper(words, result, digit, widx+1, sum+i);

c2i.erase(words[widx][digit]);

i2c.erase(i);

}

return false;

}

void isSolvable(vector<string>& words, string result) {

limit = result.length();

for (auto &w: words)

if (w.length() > limit)

return;

for (auto&w:words)

reverse(w.begin(), w.end());

reverse(result.begin(), result.end());

int aa = helper(words, result, 0, 0, 0);

}

int main()

{

ans = 0;

vector<string> words={"GREEN" , "BLUE"} ;

string result = "BLACK";

isSolvable(words, result);

cout << ans << "\n";

return 0;

}

See more about C++ code at brainly.com/question/19705654

#SPJ1

3 0

2 years ago

Ray owns a gaming cafe where users can play video games on computers. These games involve rich graphics and need high processing

tankabanditka [31]

Answer:

thick

Explanation:

i took the test and got it right

6 0

2 years ago