:: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Categories >> Software >> Programming Languages >> C++ >> C++ General


 STL interview questions  STL Interview Questions (91)
 OOPS interview questions  OOPS Interview Questions (558)
 C++ General interview questions  C++ General Interview Questions (458)
write a program that will produce the ff. output.
"what fruit will you buy?
ENTER CHOICE (1,2 or 3)>
 Question Submitted By :: C++-General
I also faced this Question!!     Answer Posted By  
# 1
Is This Answer Correct ?    0 Yes 0 No
Prasad Chavare

Other C++ General Interview Questions
  Question Asked @ Answers
what do you mean by memory management operators HCL 4
How the V-Table mechanism works? HP 6
how to swap two strings without using any third variable ?   11
What about Virtual Destructor? Virtusa 1
What are the total number of lines written by you in C/C++? What is the most complicated or valuable program written in C/C++? Intel 2
Why did you leave your last job?   2
write a programming using for loop in c++ to generate diamond trangel? NIIT 1
Can we generate a C++ source code from the binary file?   2
1. What does the following do: void afunction(int *x) { x=new int; *x=12; } int main() { int v=10; afunction(&v); cout<<v; } a) Outputs 12 b) Outputs 10 c) Outputs the address of v Quark 5
What are the different types of polymorphism?   3
Write a single instruction that will find the remainder of integral division when x is divided by y. Have the answer stored in z.   1
Brief explaination about #include<iostream.h>, cin and cout   3
For more C++ General Interview Questions Click Here 

Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
Copyright 2013  All Rights Reserved.   ::