<span>The fourth generation of computers was marked by the introduction of microprocessors. </span>
Answer:
The program in QBasic is as follows;
PRINT "Number: "
INPUT N
LET FACT = 1
FOR I = 1 TO N
FACT = FACT * I
NEXT I
PRINT FACT
END
Explanation:
This prompts user for number
PRINT "Number: "
This accepts input from the user
INPUT N
This initializes the factorial to 1
LET FACT = 1
This iterates through the number the user inputs and calculates its factorial
<em>FOR I = 1 TO N
</em>
<em> FACT = FACT * I
</em>
<em>NEXT I
</em>
This prints the factorial
PRINT FACT
The program ends here
END
Consider the given data:
Assume packet length=n
Maximum queuing delay= (n–1)D
All packets are of the same length, n packets arrive at the same time to the n input ports, and all n packets want to be forwarded to different output ports.
a) The maximum delay for a packet for the memory = (n-1)D
b) The maximum delay for a packet for the bus = (n-1)D
c) The maximum delay for a packet for the crossbar switching fabrics= 0
Answer:
Option (A)
Explanation:
In the post order traversal, we always print left subtree, then right subtree and then the root of the tree. In preorder traversal, First the root is printed, then, left subtree and at last, right subtree, so, the first element in preorder is the root of the tree and we can find elements of left sub tree from in order as all the elements written left to the root will of left subtree and similarly the right one. This is how repeating it will give the post order traversal.
