- Home
- Interview Questions
- Data structures and Algorithms
Abstraction can be thought of as a mechanism for suppressing irrelevant details while at the same time emphasizing relevant ones. The main benefit of abstraction is that it makes it easier for the programmer to think about the problem to be solved.
Encapsulation is the mechanism of enforcing information hiding. Objects encapsulate data and the procedures for manipulating that data, thus the object hides the details of the implementation from the user of that object.
An abstract data type is a mathematical model for a certain class of data structures that have similar behavior. It is defined by three main characteristics: encapsulation, inheritance and polymorphism.
Early binding is the binding done statically by the compiler - it is realized by method overloading.
Late binding is done dynamically at run-time and it is realized through inheritance and polymorphism.
A binary numbering system is a system consists of two digits called binary digits (bits): zero and one. A switch in the off state represents zero, and a switch in the on state represents one. This means that one transistor can represent one of two digits.