Graphic characters used to identify items on an unordered list first line indent is called _______

Computers and Technology

1 answer:

Elodia [21]3 years ago

4 0

Answer: they are calles BULLETS

Explanation:

You might be interested in

Where does the oracle11g server store information about objects in the database, including information about constraints?

tiny-mole [99]

The oracle11g server stores information about objects in the database, including information about constraints in the tables. An Oracle database is a set of files that store Oracle data in persistent disk storage.A database instance is a set of memory structures that manage database files.

4 0

2 years ago

Sites like Zillow get input about house prices from a database and provide nice summaries for readers. Write a program with two

qaws [65]

Answer:

Se explaination

Explanation:

/Declaring variables

integer currentPrice

integer lastMonthPrice

integer changeLastMonth

float mortagage

//Reading input

currentPrice = Get next input

lastMonthPrice = Get next input

//Calculating price change

changeLastMonth = currentPrice - lastMonthPrice

//Calculating mortagage

mortagage = (currentPrice * 0.051) / 12

//Printing output

Put "This house is $" to output

Put currentPrice to output

Put "\nThe change is $" to output

Put changeLastMonth to output

Put " since last month." to output

Put "\nThe estimated monthly mortgage is $" to output

Put mortagage to output

3 0

2 years ago

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursive (Algorithm 2.1).

damaskus [11]

Answer:

There is also an attachment below

Explanation:

Since we are talking about binary search, let's assume that the items are sorted according to some criteria.

Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.

N = 700000000.

So, number of comparisions can be log(N) = 29.3 = 29.

So, in the worst case it does comparisions 29 times