Application Developer

Given two arrays, Array1 and Array2, of equal size S, the objective is to track down the least value of Array1[0] * Array2[0] + Array1[1] * Array2[1] +…+ Array1[S-1] * Array2[S-1]. Shuffling of elements of arrays are allowed.

You are given with an array of integers and an integer K. You have to find and print the count of all such pairs which have difference K.

Note: Take absolute difference between the elements of the array.

ProRam is given an array of distinct ‘DIGITS’ sorted in ascending order. ProRam wants to know how many possible numbers can be formed from a ‘DIGITS’ array such that it is less than or equal to the given integer ‘N.' ProRam can use the digits from the ‘DIGITS’ array as many times as he wants. For Example:- ‘DIGITS’ = [1, 2, 3] . The possible numbers are 11, 1, 2, 3, 22, 221, 321, 123 etc.

ProRam is busy with some work. Can you solve this for ProRam to find the number of possible numbers formed from digit array which are less than or equal to ‘N’?

Explain OOPS.
What is Abstraction?
What is Polymorphism?
Explain the virtual function, friend class, an abstract class?
What is Inheritance and explain multi-level inheritance?

Different types of keys and differences between Primary key and Unique key.
What is an interface in C++?
Explain Normalization, 1NF, 2NF, 3NR.
Explain Partial dependency and Transitive dependency.
Explain prime attributes.

Difference between array and set.
Add two numbers without using the + operator. Explain the logic for this question
Which language do you prefer C++/ Java and why?

Explain DDL, DML commands