Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 21

• recategorized by
627 views
0 votes
0 votes

A program $P$ calls two subprograms $P1$ and $P2.\;P1$ can fail $50\%$ time and $P2$ can fail $40\%$ times. The program $P$ can fail

  1. $50\%$
  2. $10\%$
  3. $60\%$
  4. $70\%$
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
2
admin asked Apr 1, 2020
849 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 1
What will be the output of following? main() { Static int a = 3; Printf(“%d”,a--); If(a) main(); } $3$ $3\;2\;1$ $3\;3\;3$ Program will fall in continuous loop and print $3$
What will be the output of following?main() { Static int a = 3; Printf(“%d”,a ); If(a) main(); }$3$$3\;2\;1$$3\;3\;3$Program will f...
User Avatar
2 votes
2 votes
1 answer
3
admin asked Apr 1, 2020
1,069 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$ $2^{h-1} – 1$ $2^{h+1} – 1$ $2^{h+1}$
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...
User Avatar
0 votes
0 votes
1 answer
4
admin asked Apr 1, 2020
1,629 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 3
Web links are stored within the page itself and when you wish to ‘jump’ to the page that is linked, we select the hotspot or anchor. This technique is called Hypertext Hypermedia Both $(A)$ and $(B)$ Anchoring
Web links are stored within the page itself and when you wish to ‘jump’ to the page that is linked, we select the hotspot or anchor. This technique is calledHypertext...
User Avatar
Link Copied!