Register

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

• closed by
290 views
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

883
views
2 answers
1 votes
admin asked Apr 1, 2020
883 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$
User Avatar
1.1k
views
1 answers
2 votes
admin asked Apr 1, 2020
1,092 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}$
User Avatar
1.7k
views
1 answers
0 votes
admin asked Apr 1, 2020
1,704 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 calledHypertextHypermediaBoth $(A)$ and $(B)$Anchoring
User Avatar
1.5k
views
1 answers
0 votes
admin asked Apr 1, 2020
1,487 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 4
If the objects focus on the problem domain, then we are concerned withObject Oriented AnalysisObject Oriented DesignObject Oriented Analysis and DesignNone of the above
User Avatar
Link Copied!