1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
romanna [79]
3 years ago
13

Consider this argument: "if pepsi tasted better than coke, then it would outsell coke. But pepsi does not taste better than coke

. So it will not outsell coke. " that argument is an example of __________.
SAT
1 answer:
Elodia [21]3 years ago
6 0

Answer:

this argument is I believe an example of a biased opinion, (which if I can remember) means based on someone's own opinion/experiences.

You might be interested in
Graph the image of the given triangle after a rotation of 180º about the origin. Select the Polygon tool. Click the points of th
Leona [35]

Answer:

mom

Explanation:

mom

8 0
3 years ago
Once you have your heap structure created, next you must use it as a backing structure to a priority queue. Develop a PriorityQu
saveliy_v [14]

Using the knowledge in computational language in python it is possible to write a code that Develop a PriorityQueue data structure in a file.

<h3>Writting the code in python:</h3>

<em>import sys</em>

<em>class Node:</em>

<em>def __init__(self,key):</em>

<em>self.left = None</em>

<em>self.right = None</em>

<em>self.val = key</em>

<em>self.parent = None</em>

<em>class MinHeap:</em>

<em>def __init__(self, maxsize):</em>

<em>self.maxsize = maxsize</em>

<em>self.size = 0</em>

<em>self.Heap = Node(-1 * sys.maxsize )</em>

<em>self.FRONT = self.Heap</em>

<em># A utility function to do inorder tree traversal</em>

<em>def isLeaf(self, node):</em>

<em>if node.left == None and node.right == Node:</em>

<em>return True</em>

<em>return False</em>

<em># Function to swap two nodes of the heap</em>

<em>def swap(self, node1, node2):</em>

<em>node1.data, node2.data = node2.data, node1.data</em>

<em># Function to heapify the node at pos</em>

<em>def minHeapify(self, node):</em>

<em># If the node is a non-leaf node and greater</em>

<em># than any of its child</em>

<em>if not self.isLeaf(node):</em>

<em>if (node.data > node.left.data or</em>

<em>node.data > node.right.data):</em>

<em># Swap with the left child and heapify</em>

<em># the left child</em>

<em>if node.left.data < node.right.data:</em>

<em>self.swap(node, node.left)</em>

<em>self.minHeapify(node.left)</em>

<em># Swap with the right child and heapify</em>

<em># the right child</em>

<em>else:</em>

<em>self.swap(node, node.right)</em>

<em>self.minHeapify(node.right)</em>

<em># Function to insert a node into the heap</em>

<em>def insert(self, element):</em>

<em>if self.size >= self.maxsize :</em>

<em>return</em>

<em>self.size+= 1</em>

<em>self.bst_insert(FRONT, element)</em>

<em>current = FRONT</em>

<em>while current.parent != None and current.data < current.parent.data:</em>

<em>self.swap(current, current.parent)</em>

<em>current = current.parent</em>

<em># Function to print the contents of the heap</em>

<em>def Print(self):</em>

<em>self.inorder()</em>

<em># Function to build the min heap using</em>

<em># the minHeapify function</em>

<em>def inorder(self, root):</em>

<em>if root:</em>

<em>inorder(root.left)</em>

<em>print(root.val)</em>

<em>inorder(root.right)</em>

<em>def bst_insert(self, root, node):</em>

<em>if root is None:</em>

<em>root = node</em>

<em>else:</em>

<em>root.next = node</em>

<em>self.FRONT = node</em>

<em># Driver Code</em>

<em>if __name__ == "__main__":</em>

<em>r = Node(50)</em>

<em>bst_insert(r,Node(30))</em>

<em>bst_insert(r,Node(20))</em>

<em>bst_insert(r,Node(40))</em>

<em>bst_insert(r,Node(70))</em>

<em>bst_insert(r,Node(60))</em>

<em>bst_insert(r,Node(80))</em>

<em># Print inoder traversal of the BST</em>

<em>inorder(r)</em>

<em>print('The minHeap is ')</em>

<em>minHeap = MinHeap(15)</em>

<em>minHeap.insert(5)</em>

<em>minHeap.insert(3)</em>

<em>minHeap.insert(17)</em>

<em>minHeap.insert(10)</em>

<em>minHeap.insert(84)</em>

<em>minHeap.insert(19)</em>

<em>minHeap.insert(6)</em>

<em>minHeap.insert(22)</em>

<em>minHeap.insert(9)</em>

<em>minHeap.minHeap()</em>

<em>minHeap.Print()</em>

<em>print("The Min val is " + str(minHeap.remove()))</em>

See more about python at brainly.com/question/13437928

#SPJ1

6 0
2 years ago
What are the coefficients for the binomial expansion of (a b)3? 1, 4, 6, 4, 1 1, 1 1, 2, 1 1, 3, 3, 1
Advocard [28]

The coefficients for the binomial expansion of (a + b)³ are 1, 3, 3, 1.

We have,

The binomial expansion (a + b)³,

So,

Now,

We know that,

Formula for binomial expansion,

i.e.

(u + v)ⁿ = ⁿC₀ · uⁿ · v⁰ + ⁿC₁ · uⁿ⁻¹ · v¹ + ⁿC₂ · uⁿ⁻² · v² + ⁿC₃ · uⁿ⁻³ · v³

Now,

According to the question,

Here,

u = a,

v = b,

And, n =3

Now,

Putting values,

i.e.

(a + b)³ = ³C₀ · a³ · b⁰ + ³C₁ · a³⁻¹ · b¹ + ³C₂ · a³⁻² · b² + ³C₃ · a³⁻³ · b³

We get,

(a + b)³ = ³C₀ · a³ · b⁰ + ³C₁ · a² · b¹ + ³C₂ · a¹ · b² + ³C₃ · a⁰ · b³

Now,

Using combination formula,

^{n} C_{r} = \frac{n!}{r!(n-r)!}

On solving we get,

(a + b)³ = a³ + 3 a² b + 3 a b² + b³

So,

Now,

The coefficients of :

a³ = 1,

3a²b = 3,

3ab² = 3,

b³ = 1,

So,

The coefficients of the given binomial expansion are 1, 3, 3, 1.

Hence we can say that the coefficients for the binomial expansion of (a + b)³ are 1, 3, 3, 1.

Learn more about binomial expansion here

brainly.com/question/3632340

#SPJ4

4 0
2 years ago
_____ are counted in both the Gross Domestic Product (GDP) and the Gross National Product (GNP).
IgorC [24]

Answer

Clocks from an American-owned shop in France

Explanation

GDP is an estimated value of the total worth of a country’s production and services by its citizens and foreign workers from within the country’s boundary calculated in one year.It is applied to measure the strength of a county’s local economy.GNP estimations are carried in the country’s land or foreign land over a year. It aims at seeing how the individuals of a country are doing economically.


8 0
3 years ago
Read 2 more answers
Dan runs a busy desktop-publishing company. His company want to increase its exposure, so it runs a new a new promotion each wee
Sergeu [11.5K]

The correct answer is A) blog.

The options of the question were B) fax. C) firewall. D) wiki.

Dan runs a busy desktop-publishing company. His company wants to increase its exposure, so it runs a new promotion each week. The tool Dan most likely chooses to publicize this promotion is a blog.

Using a blog is a great tool to communicate with your audiences and target groups. In a blog, you can also include all the promotions you want because you know that people that visit your blog are people who are interested in your company's products. So when they're there, they could notice the promotions, and read an article or getting more familiar with the company and their products.

8 0
3 years ago
Other questions:
  • Why was Hiter infuential<br> among young people?
    12·2 answers
  • If the square root of a number, s, is approximately 6.7082, then s is between which two of the following pairs of integers? 2 an
    12·2 answers
  • Help me please with this
    6·2 answers
  • This is the average cost for attending a Private College:
    15·2 answers
  • Tennille has a cell phone plan that charges $26 per month there is an additional charge of 0.30 per text message write an expres
    10·1 answer
  • How was the quran compiled
    5·1 answer
  • Find the mean 2,3,4,2,1,6,7
    12·2 answers
  • The discovery, collection, and analysis of evidence found on computers and networks.
    7·1 answer
  • Which pattern(s) may be observed from the arrangement of elements in the periodic table? select all that apply.
    10·1 answer
  • If countries A and B produce only either rubber bands or paper clips, their maximum outputs are shown in the accompanying produc
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!