All categories

3 years ago

The purchase and subsequent sale of a securities position in a customer account solely to generate commissions is____________.

Computers and Technology

1 answer:

Citrus2011 [14]3 years ago

5 0

Answer:

Churning

Explanation:

Churning is termed as an act of a broker conducting immoderate trading in the account of client solely to generate commissions. It is an illegal and deceptive practice. It violates security laws. The purchase and subsequent sale of a securities that are little or insignificant to meet the investment goals of client can be the evidence of churning. Consequently it causes considerable losses in client's account or can produce a tax liability.

Churning occurs due to over trading by a broker to generate commissions by buying and selling stocks excessively on the behalf of investor. This often happens when broker has permissive authority over client's account.

You might be interested in

Which type of backup ensures you capture a complete snapshot of everything that makes your computer run?.

Elanso [62]

Answer:

Answer is D / If not : A full image backup, or mirror backup

Explanation:

is an exact replica of everything on your computer's hard drive, from the operating system, boot information, apps, and hidden files to your preferences and settings. Imaging software not only captures individual files, but everything you need to get your system running again.

Thanks for asking this question. If my response helped, please mark as brainliest. Thank you!

5 0

3 years ago

How do a tubercolosis test work?

Soloha48 [4]

The answer is If a skin or blood TB test is posittive, your doctore mau give you a chest X-ray. They will look for abnormal spots on your lungs or any changes caused by TB.

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

On line two, you take a string, word, as input. Then, using that string...

Solnce55 [7]

Answer:

Explanation:

This one obtains results that the others in particular do not have, whether it is even one more word or another initial sentence

8 0

3 years ago

sammy [17]

Answer:

b. The names in the list should be in alphabetical order.

Explanation:

A binary search is an algorithm used for searching for an item in a list or array. The algorithm first sorts the data structure into order and then divides it into halves. If the searched item is less than the middle item in the list, then the algorithm searches for the target in the first half, else, in the second half. This reduces the time complexity of the search.

5 0

3 years ago