Consider the following iterative root finding methods and convergence properties:
Iterative root Convergence properties
finding methods
Q.False Position I.Order of convergence =1.62
R.Newton-Raphson II.Order of convergence= 2 with guarantee of convergence
S.Secant III.Order of convergence= 1
T.Successive IV.Order of convergence Approximation= 1 with no guarantee of convergence
The correct matching of the methods and properties is
-
Solution
Q. False position – order of convergence= 1 with guarantee of convergence
R. Newton-Raphson – order of convergence= 2
S. Secant – order of convergence= 1.62
T. Successive approximation – order of convergence= 1 with no guarantee of convergence
What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3?
-
Solution
Number of edge = 24
6 vertices with degree 2
3 vertices with degree 4
Remaining with degree 3
Number of possible vertices be 10
Hence correct answer is (a).
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which the Ethernet address of the host is unique is
-
Solution
The answer should be (d) since a specific LAN technology -Ethernet is mentioned here, so MAC addresses will be specifically taken as physical address which is unique in the entire world.
If in general LAN Address was mentioned, then we would have had to take Physical Address concept, which only needs to be unique within the network, so answer would have been A in that case.
A system has four process and five allocatable resources,the current allocation and maximum needs are as follows
The smallest value of x for which system is in safe state,is __________.
-
Solution
x = 1 Process A cannot progress because the second resource is not available.Process B cannot progress because the second resource is not avail able.Process C cannot progress because the first resource is not available.Process D can progress, if x> = 1. Then, this is safe state.Hence, the smallest value of x is 1.
How many node splitting operations will be performed, if 30, 50, 12, 31 is inserted in the following B-tree of order 4. Also, find the number of nodes in the resultant tree.
Which one of the following statements is FALSE?
-
Solution
Packet-switched networks move data in separate, small packets - based on the destination address in each packet.When received, packets are reassembled in the proper sequence to make up the message.
A channel has a bit rate of K kilo bps and a propagation delay of t ms. For the efficiency of E of stop and wait protocol. Find the expression for the size of frame L.
-
Solution
The equivalent post fix expression for \(\frac{d}{(e+f)}\)+ b * c is
-
Solution
Consider the following simultaneous boole an equations
A + \(\bar{A}\)B= 0
AB + BC +CD = 0
C + DE = A ⊕ B
Which of the following cannot be values of D and E to satisfy the given boolean equations?
-
Solution
What is the minimum size of ROM required to store the complete truth table of an 8-bit × 8-bit multiplier?
-
Solution
Minimum size of ROM required to store the complete truth table of 8 bit × 8 bit ultiplexer is 64 K × 16 bit because input to ROM – 2 lines, 8 bit each then possible = 64 K B, and maximum otuput size = 1 bit combinations in ROM = (28) *(28),size of truth table= 28* 28 = 216