Register

UGC NET CSE | December 2011 | Part 2 | Question: 33

• recategorized by
1,577 views

2 Answers

Best answer
1 votes
1 votes

A. 216-1.

2 bytes=16 bits therefore 2^16 possible values 
But since values start from 0,there's one less value for positive numbers. So -1

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
6 answers
1
go_editor asked Mar 27, 2020
2,205 views
UGC NET CSE | December 2005 | Part 2 | Question: 11
What is the output of the following $C$-program main() { printf("%d %d %d",size of (3.14f), size of (3.14), size of (3.141)); } 4 4 4 4 8 10 8 4 8 8 8 8
What is the output of the following $C$-programmain() { printf("%d %d %d",size of (3.14f), size of (3.14), size of (3.141)); }4 4 44 8 108 4 88 8 8
User Avatar
0 votes
0 votes
1 answer
2
makhdoom ghaya asked Aug 20, 2016
699 views
UGC NET CSE | December 2011 | Part 2 | Question: 36
$X - = Y + 1$ means $X = X – Y + 1$ $X = -X - Y - 1$ $X = -X + Y + 1$ $X= X - Y - 1$
$X - = Y + 1$ means$X = X – Y + 1$$X = -X - Y - 1$$X = -X + Y + 1$$X= X - Y - 1$
User Avatar
1 votes
1 votes
2 answers
4
makhdoom ghaya asked Aug 21, 2016
2,885 views
UGC NET CSE | December 2011 | Part 2 | Question: 50
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to $2^{0} + 2^{1} + ….. 2^{h}$ $2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{1} + ….. 2^{h+1}$ $2^{1} + ….. 2^{h+1}$
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to$2^{0} + 2^{1} + ….. 2^{h}$$2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{...
User Avatar
Link Copied!