All categories

3 years ago

Concerning Structured Cabling, select the statement that is true, or select, "All statements are false."

Computers and Technology

1 answer:

ikadub [295]3 years ago

7 0

Answer:

1) TRUE

2) FALSE

3) FALSE

4) TRUE

5) TRUE

Explanation:

1) vertical cross connects connect work stations to the closest data closet TRUE

2) a patch cable is relatively short, from 20 feet to 90 feet

FALSE

3) the dmarc is located at the local telecommunications carrier's office

FALSE

4) the MDF(main distribution frame) is the centralized point of interconnection for an organization's LAN.

TRUE

5 )the IDF (intermediate distribution frame) is a junction point between the MDF and the entrance facility.

TRUE

You might be interested in

What are the two types of computer keyboards and how are they different?

VARVARA [1.3K]

A piano keyboard
A qwerty keyboard
A Dvorak Simplified Keyboard

These are 3 types of keyboard

4 0

3 years ago

Read 2 more answers

Does anyone have 2.19.4 Guess a number 2.0 code for codehs?

lubasha [3.4K]

Answer:

I'm trying to create a program that will ask the user for an exam score in the range 0 to 100. ... I want to take the python course but I have not class code, anyone can help?

Explanation:

3 0

3 years ago

How to make text icome one word at a timen filmora

bezimeni [28]

You would want to add multiple text slides.

I hope this helps as the wording of the question was unclear.

8 0

1 year ago

Kelly is a college sophomore majoring in computer science. She is interested in gaining exposure to the most useful and current

Nuetrik [128]

Answer:

Java

Explanation:

Java is a general-purpose programming language that is object-oriented, and has strong support for web development.

Therefore, one of the languages that a college sophomore majoring computer science learn is <u>Java,</u> an object-oriented programming language that is commonly used to write Web applications.

6 0

3 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

7 0

3 years ago