| Other STL Interview Questions |
| |
| Question | Asked @ | Answers |
| |
| In what cases using of a 'template' is a better approach
then using of a 'base class'? | Lucent | 6 |
| How Find, Replace and Go To commands ca be used to
substitute one
character string for another? Explain with the heIp of an
example.
| | 1 |
| What is the STL? | HP | 2 |
| what is use of for loop? | Wipro | 7 |
| Assume I have a linked list contains all of the alphabets
from "A" to "Z?" I want to find the letter "Q" in the list,
how does you perform the search to find the "Q?" | | 2 |
| Explain how to insert a hyperlink in to an Excel worksheet
and save a Word document as a Web page. | | 1 |
| Find the error in the following program struct point
{struct point *next; int data; } x; main() {int...data;
}
x;
main()
{int i;
for(x=p;x!=0;)
x=x->next,x++;
freelist(x);
}
freelist(x)
{free(x);
return
} | Sun-Microsystems | 1 |
| c# support late binding or early binding. | | 3 |
| I am doing my BS.c MATHS CAN I ABLE TO JOIN IN NIIT? | | 1 |
| what is an algorithm in terms of STL? | Wipro | 1 |
| Give the output of the following program
main()
{char *p='a';
int *i=100/*p;
}
what will be the value of *i= 1
| Sun-Microsystems | 3 |
| if 4-5 year old brother is standing on d roof with me and
watching d moon, suddenly moon coverd by cloud then how
will i explain d hiding of moon to my brother. | MBT | 6 |
| what is strcture
i++ i ++i answer to this i=5 what is the out put | | 5 |
| how to swap two numbers in a linked list without exchanging
the data but only the links? | Wipro | 2 |
| What is 2*2? | | 3 |
| What is the underlying datastructure of map? | Siemens | 4 |
| Which data structure gives efficient search?
A. B-tree B. binary tree C. array D. linked list | Sun-Microsystems | 14 |
| What is Template Specialization? | Lucent | 1 |
| What is Object Oriental Progam | | 1 |
| what's the difference between abstract class and concreate
class? what's the meaning of standard template library(STL)? | | 3 |
| |
| For more STL Interview Questions Click Here |