All categories

2 years ago

Which of these skills are used in game design?

Computers and Technology

1 answer:

olasank [31]2 years ago

8 0

Answer:

I think the answer is Writing but am not sure

You might be interested in

Consider two vectors that are NOT sorted, each containing n comparable items. How long would it take to display all items (in an

Darina [25.2K]

Answer:

The correct answer to the following question will be "Θ(n2)

". The further explanation is given below.

Explanation:

If we're to show all the objects that exist from either the first as well as the second vector, though not all of them, so we'll have to cycle around the first vector, so we'll have to match all the objects with the second one.

So,

This one takes:

= $O(n^2)$

And then the same manner compared again first with the second one, this takes.

= $O(n^2)$

Therefore the total complexity,

= Θ(n2)

7 0

3 years ago

Who would like to join a team devoted to decreasing spam and bullying?

Tema [17]

Yes i would love to help the cause <span />

6 0

3 years ago

Trading stock or selling stock, selling real estate for profit, and selling other assets that gain value over time.

Andrei [34K]

Answer:

D is reasonable

Explanation:

3 0

2 years ago

PLEASE HURRY!!<br> Look at the image below

vlada-n [284]

Answer:

Parameter

Explanation:

A parameter is a variable/argument of a function that are placed between the parentheses in the function's definition.

Hope this is clear :)

5 0

3 years ago

Consider the following method, remDups, which is intended to remove duplicate consecutive elements from nums, an ArrayList of in

MAXImum [283]

Answer:

B. {1, 2, 2, 3, 3, 4, 5}

Explanation:

Given

The above code segment

Required

Determine which list does not work

The list that didn't work is $B.\ \{1, 2, 2, 3, 3, 4, 5\}$

Considering options (A) to (E), we notice that only list B has consecutive duplicate numbers i.e. 2,2 and 3,3

All other list do not have consecutive duplicate numbers

Option B can be represented as:

$nums[0] = 1$

$nums[1] = 2$

$nums[2] = 2$

$nums[3] = 3$

$nums[4] = 3$

$nums[5] = 4$

$nums[6] = 5$

if (nums.get(j).equals(nums.get(j + 1)))

The above if condition checks for duplicate numbers.

In (B), when the elements at index 1 and 2 (i.e. 2 and 2) are compared, one of the 2's is removed and the Arraylist becomes:

$nums[0] = 1$

$nums[1] = 2$

$nums[2] = 3$

$nums[3] = 3$

$nums[4] = 4$

$nums[5] = 5$

The next comparison is: index 3 and 4. Meaning that comparison of index 2 and 3 has been skipped.

<em>This is so because of the way the if statement is constructed.</em>

3 0

3 years ago