All categories

3 years ago

An sObject named Application _c has a lookup relationship to another sObject named Position_c.

Computers and Technology

1 answer:

Vedmedyk [2.9K]3 years ago

4 0

Answer:

The correct options to the following question is C.).

Explanation:

Because there is given that it is the lookup relationship.

The Flow or the Process builder can do this (as given in the question) as well.
The lookup relationships with the other objects are just like the Child's to the Parent's relationships. Here, the Position_c is Parent and the Application _c is the child.
The updated fields in the child records is when the parent's records are updated.

You might be interested in

Which of the following contains information about which keywords are bringing visitors to your website?

Natasha_Volkova [10]

I would go with C. but it would depend on what you have recently been studying to know for sure since lingo can change from person to person. Good luck! :)

8 0

3 years ago

Your app needs to store the following information. For each type of information, decide whether you would use an array or a vari

Virty [35]

Answer:

Array: (a) All the messages a user has sent.

Variable: (b) The highest score a use has reached on the app. (c) A username and password to unlock the app.

Explanation:

An array generally has more than one value whereas a variable can only contain a single value at any particular point in time. In addition, a variable has a limit whereas an array does not have any maximum limit. Therefore, it can be concluded that option (a) will be stored as an array while options (b) and (c) will be stored as variables.

3 0

3 years ago

25 POINTS!!!!!!!!!!!!!

Paladinen [302]

A leaking data exhaust

7 0

2 years ago

Read 2 more answers

Is the following a true statement in our world? Why or why not?

posledela

Answer:

The statement would be true

Explanation:

let, L = is a NFL player

M = teaches in CSU

N = has tattoos

Given that:

nfl player who teaches in csu = L^ M (this is false every time)

Above statement is L ^ M -> N

this would be true because

false -> true (true

)

false -> false (true

)

Second exp:

There are no players who teach in Csu therefore if we say they all have tattoos statement would be true.

4 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