Register

UGC NET CSE | December 2006 | Part 2 | Question: 13

• edited by
527 views
1 votes
1 votes 
int arr[ ]={1, 2, 3, 4} 
int count;
incr( ) {return ++count;} 
main( )
{
arr[count++]=incr( );
printf(“arr[count]=%d\n”, arr[count]);
}

The value printed by the above program is :

  1. $1$
  2. $2$
  3. $3$
  4. $4$
• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 27, 2020
1,502 views
UGC NET CSE | December 2006 | Part 2 | Question: 15
The declaration “unsigned u” indicates : u is an unsigned character u is an unsigned integer u is a character u is a string
The declaration “unsigned u” indicates :u is an unsigned characteru is an unsigned integeru is a characteru is a string
User Avatar
0 votes
0 votes
1 answer
2
go_editor asked Mar 27, 2020
1,528 views
UGC NET CSE | December 2006 | Part 2 | Question: 1
Which of the regular expressions corresponds to this grammar ? $S → AB/AS, A → a/aA, B → b$ $aa^*b^+$ $aa^*b$ $(ab)^*$ $a(ab)^*$
Which of the regular expressions corresponds to this grammar ?$S → AB/AS, A → a/aA, B → b$$aa^*b^+$$aa^*b$$(ab)^*$$a(ab)^*$
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Mar 27, 2020
594 views
UGC NET CSE | December 2006 | Part 2 | Question: 2
The proposition ~ q ∨ p is equivalent to :
The proposition ~ q ∨ p is equivalent to :
User Avatar
1 votes
1 votes
2 answers
4
go_editor asked Mar 27, 2020
12,202 views
UGC NET CSE | December 2006 | Part 2 | Question: 3
The number of edges in a complete graph with $N$ vertices is equal to : $N (N−1)$ $2N−1$ $N−1$ $N(N−1)/2$
The number of edges in a complete graph with $N$ vertices is equal to :$N (N−1)$$2N−1$$N−1$$N(N−1)/2$
User Avatar
Link Copied!