ALLInterview.com :: 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                      
Google
   
 
Categories >> Software >> Programming Languages >> C++ >> OOPS
 
 


 

 
 STL interview questions  STL Interview Questions (91)
 OOPS interview questions  OOPS Interview Questions (558)
 C++ General interview questions  C++ General Interview Questions (458)
just right the logic of it 
1--> If few people are electing then every time ur candidate
should win
2--> arrange books in box, if box carry weight == books
weight then take another box..... find the no of box 
required.


No Answer is Posted For this Question

Be the First to Post Answer

 
 
 
Other OOPS Interview Questions
 
  Question Asked @ Answers
 
what is a virtual class? Cap-Gemini 5
Write a program to multiply 3x3 matrics   1
how to swap the variables without using temp and operators   1
What is the difference between an object and a class?   3
Polymorphism with an example? emc2 8
i have to create a view in SQL as like in ORACLE DATA EXPRESS EDITION CTS 2
What are the OOPS concepts? Wipro 104
How to overload new operator in c++   2
Why is it so that we can have virtual constructors but we cannot have virtual destructors?   2
What is Hashing and how is it done? Pictorial form? emc2 2
Can we call a base class method without creating instance?   5
1. Wrie a function which returns the most frequent number in a list of integers. Handle the case of more than one number which meets this criterion. public static int[] GetFrequency(int[] list) Nagarro 1
 
For more OOPS Interview Questions Click Here 
         


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

ALLInterview.com   ::  KalAajKal.com