A binary tree T has 20 leaves. The number of nodes in T having two chi

1.	A binary tree T has 20 leaves. The number of nodes in T having two children is .
A.	17
B.	18
C.	19
D.	16
Answer» D. 16

Discussion

No Comment Found

Related MCQs

Consider the following four schedules due to three transactions (indicted by the subscript) using read and write on a data item x, denoted r (x) and w (x) respectively. Which one of them is conflict serializable?
Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of 60%, the minimum number of bits required to represent the sequence number field is
Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2kB. The time taken (in msec) by the TCP connection to get back to 32KB congestion window is
Consider a token ring network with a length of 2km having 10 stations including a monitoring station. The propagation speed of the signal is 2 x 108 m/s and the token transmission time is ignored. If each station is allowed to hold the token for 2 µsec, the minimum time for which the monitoring station should wait (in µsec) before assuming that the token is lost is .
Identify the correct order in which the following actions take place in an interaction between a web browser and a web server. 1. The web browser requests a webpage using HTTP 2. The web browser establishes a TCP connection with the web server. 3.The web server sends the requested webpage using HTTP. 4. The web browser resolves the domain name using DNS.
Which one of the following are used to generate a message digest by the network security protocols? (P) RSA (Q) SHA-1 (R) DES (S) MD5
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links [S1] The computational overhead in link state protocols is higher than in distance vector protocols. [S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol. [S3] After a topology change, a link state protocol will converge faster than a distance vector protocol. Which one of the following is correct about S1, S2, and S3?
Which one of the following is FALSE?
A machine has a 32-bit architecture, with 1-word long instructions. It has 64 registers, each of which is 32 bits long. It needs to support 45 instructions, which have an immediate operand in addition to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is .
The base (or radix) of the number system such that the following equation holds is . 312/20= 13.1

A binary tree T has 20 leaves. The number of nodes in T having two children is .

Discussion

No Comment Found

Related MCQs

Reply to Comment