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
olasank [31]
3 years ago
11

A method that receives a two-dimensional array uses two ____ pairs following the data type in the parameter list of the method h

eader.
a.
parenthesis

b.
dot

c.
curly brace

d.
bracket

1 points

QUESTION 5

The bubble sort is the fastest and most efficient sorting technique.

True

False

1 points

QUESTION 6

With a two-dimensional array, the ____ field holds the number of rows in the array.

a.
row

b.
length

c.
size

d.
capacity

1 points

QUESTION 7

Which of the following describes a data type for which only appropriate behaviors are allowed?

a.
type-safe

b.
static

c.
value-neutral

d.
data-cast

1 points

QUESTION 8

When working with two-dimensional arrays, the length field holds the number of rows in an array and each row has a length field that holds the number of columns in the row.

True

False

1 points

QUESTION 9

In Java, you create an enumerated data type in a statement that uses the keyword ____.

a.
new

b.
sequence

c.
enum

d.
collection

1 points

QUESTION 10

The ArrayList class ____ method returns the current ArrayList size.

a.
length

b.
size

c.
capacity

d.
rows

1 points

QUESTION 11

Regarding enumerations, the ____ method returns an integer that represents the constant’s position in the list of constants; as with arrays, the first position is 0.

a.
ordinal

b.
indexOf

c.
positionOf

d.
valueAt
Computers and Technology
1 answer:
Veronika [31]3 years ago
5 0

Answer:

4. Curly brace

5. False

6. Lenght

7. Value-nuetral

8. True

9. Enum

10. Size

11. IndexOf

Explanation:

4. Curly brace or Brackets {…} are often used in prose to designate a list of equal choices.

5. bubble sort is faster But as we take larger dataset, quicksort becomes increasingly efficient due to lower run-time complexity. Merge sort is faster than bubble sort.

6. 2 Dimensional Arrays. ... 2-dimensional arrays provide most of this capability. Like a 1D array, a 2D array is a collection of data cells, all of the same type, which can be given a single name. However, a 2D array is organized as a matrix with a number of rows and columns.

You might be interested in
Importance/Role of the information systems in Education​
JulsSmile [24]

Answer:

Information technology can be used to promote opportunities for knowledge dissemination.

Explanation:

It can help the teachers and students have up-to-date information and knowledge. The accurate and right information is necessary for effective teaching and learning; and information technology

7 0
2 years ago
Define the computer with its workintg principple
GenaCL600 [577]

Explanation:

Computer is an electronic device that is designed to work with information.

WORKING PRINCIPLE OF COMPUTER

a.It accepts data and instructions by way of input,

b.It stores data,

c.It can process data as required by the user,

d.It gives result in the form of output,

e.It controls all operations inside a computer.

I hope it will help you

5 0
2 years ago
Use the drop-down menu to complete the sentences about the benefits of flowcharts.
mojhsa [17]

Answer:

c,a,c using the drop down menus edge 2021

GOODLUCK

Explanation:

4 0
3 years ago
What happens? In word 2016 when the home ribbon tab is clicked on ?
RideAnS [48]

When you clicked on the ribbon tab in word 2016, you'd be brought to the home tab, where all of the basic controls are displaced for you to see.

Hope I could help! :)

5 0
3 years ago
Read 2 more answers
Give a recursive version of the algorithm Insertion-Sort (refer to page 18 in the textbook) that works as follows: To sort A[1..
Inga [223]

Answer:

see explaination

Explanation:

void insertion( int e,int *x, int start, int end)

{

if (e >= x[end])

x[end+1] = e;

else if (start < end)

{

x[end+1] = x[end];

insertion(e, x, start, end-1);

}

else

{

x[end+1] = x[end];

x[end] = e;

}

}

void insertion_recurssion(int *b, int start, int end)

{

if(start < end)

{

insertion_sort_recur(b, start, end-1);

insertion(b[end], b, start, end-1);

}

}

void main()

{

insertion_recurssion(x,0,5);

}

3 0
3 years ago
Other questions:
  • Tim has an old server computer that his company uses as a backup. One of the hard drives has gone bad and needs to be replaced.
    13·1 answer
  • Which of the following is NOT an example of a font style?
    13·1 answer
  • Principles of defensive driving include:
    15·1 answer
  • Which technology can allow a single ground-based telescope to achieve images as sharp as those from the Hubble Space Telescope?
    7·1 answer
  • Jennifer frequently uses a few programs on her laptop. Where will she find all the frequently used program icons in her computer
    13·1 answer
  • Hi weegy, what is the latest android os?
    9·1 answer
  • Choose the true statement below. (html)
    5·1 answer
  • How do cyber criminals target user’s end devices?
    11·2 answers
  • Write any two disadvantage of First generations computers​
    14·1 answer
  • Why should you make sure the paper being used in a printer is dry and not damp?
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!