Q. A graph is said to be complete if there is no edge between every pair of vertices.

Related MCQs

Q. The potential gradient across the material of low permittivity is than across the material of high permittivity.

Q. The Early Effect in a bipolar transistor is caused by ?

Q. What is the difference between a ring shift counter and a Johnson shift counter ?

Q. The doping concentration on the n-side of a p-a junction diode is enhanced. Which one of the following will get affected ?

Q. The result of logical AND operation with endpoint region codes is a nonzero value. Which of the following statement is true?

Q. What is the most important r parameter for amplifier analysis?

Q. Which polygon fill algorithm needs following information - 1.Boundary Color (BC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed point.

Q. In 8086 microprocessor , the address bus is bit wide

Q. Junction Field Effect Transistors (JFET) contain how many diodes ?

Q. Which nodes contains a null pointer in a linked list?