2011 ValueLabs Placement Paper:
1) What does 'virtual"keyword in C++?
2) EACKFHDBG what is preorder?
3) Depth of balanced binary tree?
a) log2n b) log2n+1 c) n d) None
4) Total no od comparisons in buubble sort when list is not sorted
5) Eficien data structure for store/search list of 1000 records
a) array b) double linked list c) circular queue d) hash table
6) static variale in C stored in
a) heap b) stack c) code segment d) none
7) Connectionless protocol is
Click Here ValueLabs placement paper 2011
1) What does 'virtual"keyword in C++?
2) EACKFHDBG what is preorder?
3) Depth of balanced binary tree?
a) log2n b) log2n+1 c) n d) None
4) Total no od comparisons in buubble sort when list is not sorted
5) Eficien data structure for store/search list of 1000 records
a) array b) double linked list c) circular queue d) hash table
6) static variale in C stored in
a) heap b) stack c) code segment d) none
7) Connectionless protocol is
Click Here ValueLabs placement paper 2011
No comments:
Post a Comment