Which component is in discreat type? A.power IC B.regular IC C.Resistor D.digital IC

Computers and Technology

2 answers:

Finger [1]3 years ago

5 0

Answer:

C. Resistor

Explanation:

A discrete component can be defined as any electronic component that are built as an individual or single unit.

Basically, a discrete component comprises of a single circuitry element, either an active element such as a vacuum tube, transistor etc or a passive element such as a resistor, diode, capacitor, inductor etc.

Hence, a discrete component is different from an integrated circuit (IC) or hybrid circuits because it is typically constructed or built with a single circuit element while integrated or hybrid circuits are constructed as a multiple unit.

Additionally, most discrete component are mainly semiconductors and as such consume large amounts of current.

Lostsunrise [7]3 years ago

5 0

Answer:

Resistor

Explanation:

You might be interested in

What are the advantage of transistors over vacuum tubes?

marusya05 [52]

Answer:

Transistors are comparatively cheaper and consume less power as compared to vacuum tubes.

Explanation:

Transistor when compared to vacuum tubes perform much faster processing, are small and lightweight which enables it to integrate them into circuits.

They also show a high amplification factor than vacuum tubes.

7 0

3 years ago

Which group allows you to add notes to your presentation?

aleksandrvk [35]

Answer:

Presentation views

Explanation:

6 0

3 years ago

Read 2 more answers

Many of the web server controls have a _____ menu that gives developers options to perform common tasks and settings

blondinia [14]

<span>Many of the web server controls have a _____ menu that gives developers options to perform common tasks and settings

Answer = Edit Menu</span>

5 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