What is an Object and how do you allocate memory to it?
Object is an instance of a class and it is a software unit that combines a structured set of data with a set of operations for inspecting and manipulating that data.... Read more »
‘C++ Interview Questions’ - KyaPoocha.com
What is the difference between an argument and a parameter?
While defining method, variables passed in the method are called parameters. While using those methods, values passed to those variables are called arguments. Read more »
What is guard condition?
Guard condition is one, which acts as a firewall. The access from a particular object can be made only when the particular condition is met. For Example:- customer ... Read more »
Suppose a class acts an Actor in the problem domain, how to represent it in the static model?
In this scenario you can use “stereotype”. Since stereotype is just a string that gives extra semantic to the particular entity/model element. It is given with... Read more »
Why does the function arguments are called as “signatures”?
The arguments distinguish functions with the same name (functional polymorphism). The name alone does not necessarily identify a unique function. However, the... Read more »
When does a name clash occur?
A name clash occurs when a name is defined in more than one place. For example., two different class libraries could give two different classes the same name. If... Read more »
What is a Null object?
It is an object of some class whose purpose is to indicate that a real object of that class does not exist. One common use for a null object is a return value from... Read more »
What are proxy objects?
Objects that stand for other objects are called proxy objects or surrogates. template class Array2D { public: class Array1D { public: T& operator[] (int index); const... Read more »
What do you understand by visibility modes in class derivations? What are these modes?
The visibility mode determines the availability of the members of a base class to the deriving class (and other classes, functions and the main function) from the... Read more »
Differentiate between functions read() and write().
Functions read() and write() are used for reading and writing blocks of binary data to a file. Their prototypes are istream &read(unsigned char *buf, int num); ostream... Read more »
Tell how to check whether a linked list is circular.
Create two pointers, each set to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if... Read more »
Suppose that data is an array of 1000 integers. Write a single function call that will sort the 100 elements data [222] through data [321].
quicksort ((data + 222), 100); Read more »
Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?
Mergesort always makes recursive calls to sort subarrays that are about half size of the original array, resulting in O(n log n) time. Read more »
What is the difference between an external iterator and an internal iterator? Describe an advantage of an external iterator.
An internal iterator is implemented with member functions of the class that has items to step through. .An external iterator is implemented as a separate class that... Read more »
Why are arrays usually processed with for loop?
The real power of arrays comes from their facility of using an index variable to traverse the array, accessing each element with the same expression a[i]. All the... Read more »
What is an HTML tag?
An HTML tag is a syntactical construct in the HTML language that abbreviates specific instructions to be executed when the HTML script is loaded into a Web browser.... Read more »
What are the advantages and disadvantages of B-star trees over Binary trees?
B-star trees have better data structure and are faster in search than Binary trees, but it’s harder to write codes for B-start trees. Read more »
Write the psuedo code for the Depth first Search
dfs(G, v) //OUTLINE Mark v as “discovered” For each vertex w such that edge vw is in G: If w is undiscovered: dfs(G, w); that is, explore vw, visit w, explore... Read more »
Describe one simple rehashing policy.
The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i]. The following function is used to generate... Read more »
Describe Stacks and name a couple of places where stacks are useful.
A Stack is a linear structure in which insertions and deletions are always made at one end, called the top. This updating policy is called last in, first out (LIFO).... Read more »