Awign Enterprises Interview Questions and Answers

Pure virtual functions are functions in a base class that have no implementation and must be overridden by derived classes.

• Pure virtual functions are declared with 'virtual' keyword and '= 0' at the end of the function declaration.

• Classes containing pure virtual functions are abstract classes and cannot be instantiated.

• Derived classes must provide implementation for pure virtual functions to become concrete classes.

• Pure virtual functions are used to create a common interface ...read more

JVM is utilized for running Java applications by converting Java bytecode into machine code.

• JVM stands for Java Virtual Machine.

• It is responsible for executing Java programs by converting Java bytecode into machine code.

• JVM provides platform independence as it can run on any operating system that has a compatible JVM implementation.

• Examples of JVM implementations include Oracle HotSpot, OpenJ9, and GraalVM.

Pillars of inheritance refer to the four key concepts of object-oriented programming: encapsulation, inheritance, polymorphism, and abstraction.

• Encapsulation: bundling data and methods that operate on the data into a single unit

• Inheritance: allows a class to inherit properties and behavior from another class

• Polymorphism: ability for objects to be treated as instances of their parent class

• Abstraction: hiding the implementation details and showing only the necessary features

Binary search is a search algorithm that finds the position of a target value within a sorted array.

• It works by repeatedly dividing in half the portion of the array that could contain the target value.

• It has a time complexity of O(log n).

• It is more efficient than linear search for large arrays.

• Example: Searching for the number 7 in the sorted array [1, 3, 4, 5, 7, 9, 10] would return index 4.

Quick Sort is a sorting algorithm that uses divide and conquer approach to sort elements in an array.

• It is a recursive algorithm

• It selects a pivot element and partitions the array around the pivot

• It has an average time complexity of O(nlogn)

• It is widely used in practice due to its efficiency

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.

• Start with the second element and compare it with the first element, swap if necessary

• Move to the third element and compare it with the second and first element, swap if necessary

• Repeat until all elements are sorted