Browse through 1000+ sample questions and get ready to hire the best technical talent

Suppose you have two classes “B” and “C” which inherits the class “A” using public derivation. Now, you have created a class “D” by inheriting both “B” and “C”. When you tried to access the methods of class “A” using object of “D”, you found an ambiguity problem.

Which of the following will help you solve this problem?

Which of the following would you find hard to achieve using Object Oriented Programming?

1. Source code reusability

2. Source code maintainability

3. Developing transparent control flow

Which of the following is NOT a gating mechanism used in LSTMs?

1. the forget gate

2. the update gate

3. the input gate

You have written the following pseudocode to find the symmetric elements in an array.

get the input of array in an array named array
initialise another array and store the reverse of previous array in an array name rev_array
declare a counter variable
now run a loop from i = 0 to end of array
X
update counter
print this element
end loop

if counter == 0:
print no symmetric element found

You need to display any symmetric elements found and display an appropriate message if there are no symmetric elements found. However a part X in the pseudo code is missing. Analyze the snippet and determine the appropriate statement to be placed in X?

[Note: A symmetric element is an element that does not change its position even if the array is reversed]

You have a text file called demo containing the following lines of text in a Linux system.

1. This is the first line of an experiment.

2. It is a text with experiment.

3. Lots of errors are present.

4. So much errors, all these errors are making me sick.

5. This is a line not containing any errors.

6. This is the last line of my experiment.

Now, you are asked to find all the lines containing the search pattern ‘experiment’ and print the lines matching the pattern in the shell. Which of these shell commands can you use for doing so?

Consider the given code snippet.

class Product {
    private:
    string type;

    Product(string type) {
        this->type = type;
    }

    int getBasePrice() {
        switch (this->type) {
            case food:
                return 10;
            case drinks:
                return 7;
            case books:
                return 3;
            default:
                return 0;
        }
    }

    int getTaxPercent() {
        switch (this->type) {
            case food:
            case drinks:
                return 24;
            case books:
                return 8;
            default:
                return 0;
        }
    }

    string getProductCategory() {
        switch (this->type) {
            case food:
            case drinks:
                return 'Food and Beverages';
            case books:
                return 'Education';
            default:
                return '-';
        }
    }
}

You notice that when introducing a new product type in the code, you’ll have to make changes in three different methods of the class. Which of these design smells does the given snippet have?

Analyze the code given below and determine the type of abstraction design smell present in the code snippet.

class Throwable
{
  //Prints the stack trace as a string to the standard output
  //write regex for processing stack trace
  public:
  void printStackTrace();
  //other methods are avoided
}

Which of these functions in the given code snippet depicts a lazy code smell?

#include <iostream>

using namespace std;
int remainder(int a, int b) //Fun1
{
  return(a % b);
}
  
int add(int a, int b) //Fun2
{
    return (a + b);
}

int multiply(int a, int b) //Fun3
{
  return (a * b);
}

int main() 
{

  int sum;
    sum = add(100, 78);
    cout << "100 + 78 = " << sum << endl;
    mul = multiply(10, 78);
    cout << "10 * 78 = " << mul << endl;
    return 0;
}

You are given an array A of N elements. You want to sort it in non-decreasing order using merge-sort algorithm. It involves using a recursive function mergeSort(A,l,r):

1. If the segment [l,r) is already sorted in non-decreasing order return.
2. Let mid = (l+r)/2.
3. Call mergeSort(A, l, mid)
4. Call mergeSort(A, mid, r)
5. Merge segments [l, mid) and [mid, r), making the segment [l, r) sorted in non-descending order.

The initial call made is mergeSort(A,0,N). Find the number of times mergeSort function is called to sort the given array in non-decreasing order.

A graph containing ‘a’ vertices and ‘b’ edges is run using a Breadth First Search algorithm. Select the appropriate expression that represents the running time.

You are using the algorithm given below to create a simple implementation of a Huffman tree.

loop a = EXTRACTMIN(N);
if N = ∅ then return a endif;
ν = EXTRACTMIN(N);
create node κ with children a and b
and weight w(k) = w(a) + w(b);
add k to N

Analyze the algorithm and predict the worst case running time complexity for the same.

Which of the following cross-validation techniques would you use in a Binary Classification problem when the target variable is unbalanced?

Which of the following would help increase the performance of a Machine learning model?

A famous chess grandmaster was analyzing one of his games in his head and… he suddenly forgot the positions of two important pieces.

However, he is sure about some facts:

• the location of the first piece on the board is (x1; y1) and xl1 <= x1 <= xr1, yl1 <= y1 <= yr1
• the location of the second piece on the board is (x2; y2) and xl2 <= x2 <= xr2, yl2 <= y2 <= yr2
• the chessboard cells corresponding to the pieces are of the same color

In other words, he doesn’t remember the exact positions of the pieces, however, for every piece, he is sure about the part of the board where it can be. Part of the board here is just a rectangular submatrix described by 4 coordinates.

Note: obviously, two pieces can’t be in the same location.

Now the grandmaster is wondering, how many placements of this two pieces are possible if he remembers everything correctly?

A server has to serve n customers(labelled 1 through n). The service time required to serve ith customer is t(i) and is known in advance and there is no parallelism. If the customers are served in order, i.e., i1, i2,….in, the waiting time for customer i1 is t(i1), for customer i2 is t(i1)+t(i2), and so on.

What strategy should be used to serve all the customers in a minimum total time?

You are using the following algorithm to implement a queue by reusing two stacks.

A(q, x)

1) Push x to stack1

B(q)

1) If both stacks are empty then error.

2) If stack2 is empty

While stack1 is not empty, X

3) Pop the element from stack2 and return it.

What can be used in place of X to complete the algorithm?

[Assume that the size of stacks is unlimited.]

Given is the set of four numbers that relate to each other in a certain way.

Determine the missing number in the third set.

[Assume the third set also works in the same way as the first and the second set]

Read the above tables of a database and write a SQL query to display the PRODUCT_ID,PRODUCT_NAME,ORDER_QUANTITY and list which of the other products were bought apart from ‘P01’ given their total ORDER_QUANTITY bought is greater than 75.

Consider the tables advisors and students given below.

CREATE TABLE `advisors` (
  `advisor_id` int(11) NOT NULL AUTO_INCREMENT,
  `first_name` varchar(255) NOT NULL,
  `last_name` varchar(255) NOT NULL,
  PRIMARY KEY (`advisor_id`)
)

CREATE TABLE `students` (
  `student_id` int(11) NOT NULL AUTO_INCREMENT,
  `first_name` varchar(255) NOT NULL,
  `last_name` varchar(255) NOT NULL,
  `advisor_id` int(11) DEFAULT NULL,
  PRIMARY KEY (`student_id`),
  KEY `advisor_id` (`advisor_id`),
  CONSTRAINT `students_ibfk_1` FOREIGN KEY (`advisor_id`) REFERENCES `advisors` (`advisor_id`)
);

Which of the following query can you use to get the information on students and their advisors, excluding students who are not assigned to an advisor?

You have created an Employee table as follows.

CREATE TABLE Employees (
   ID int NOT NULL,
   LastName varchar(255) NOT NULL,
   FirstName varchar(255),
   Age int,
   TerminationDate DATE,
   HireDate DATE,
   Primary Key(ID)
 );

In the given context, which of these is a correct way to define a constraint that says that the TerminationDate must be after the HireDate?

What is the range of the values that will be retrieved by the BETWEEN operator in the following snippet?

WHERE column_name BETWEEN 50 AND 100

You are tasked to design an encryption system which accepts 2 parameters below:

• A string which contains the message to be encrypted.
• A locale parameter (integer) which specifies the encryption method to be used.

The values for the locale parameter are as follows:

• Integer 0 is used to denote locale Asia.
• Integer 1 is used to denote locale United states.
• Integer 2 is used to denote locale Dubai.

The encryption techniques followed by each locale is described below:

• All messages sent via Asia will be sent by encrypting all characters by a caesar shift of 2 i.e. ABC will be encrypted as DEF.
• All messages sent via United States are represented in a dot separated ASCII format i.e ABC will encrypted as 65.66.67
• All messages sent via Dubai encryption reverse the string and send it i.e. ABC will be sent as CBA.

You are given N messages that need to be encrypted with respect to their locale parameter.

SEE FULL QUESTION

You want to build a collection class for a collection that does not meet the IList and IDictionary interface requirements.

Which of these can be used to derive the new collection in the given scenario?

Which of the following can be considered as valid reasons for the same?

What will happen when the code snippet given below is compiled and executed?

1. List list = Arrays.asList(2, 4, 6, 7, 8);
2. boolean allEven = list.stream().allMatch( i -> {
3. System.out.print(i);
4. return i%2 == 0;
5. });

You have to implement the concept of Exception Handling in Java. The final task is to return either the sum or difference of two numbers or the exception caught.

You’ve been provided with a starter code which contains sub-tasks as defined below:

Sub task 1: If n is a factor of x, display the sum of x and n. Otherwise, display the difference between x and n.

Sub task 2: Catch Arithmetic Exception if occurred and display the exception caught.

Sub task 3: Catch Number Format Exception if occurred and display the exception caught.

Sub task 4: Catch any other Exception occurred and display the exception caught.

The Python 3 set definition given alongside throws an error. Which of the following is the reason for the error?

s = {1, ‘a’, [3, ‘d’], (4, ‘c’)}.

Id’s have to be extracted from strings of format ‘[id] <email>’.

In order to perform the above operations optimally, which of the below three regular expression would you use?

1. /.*\[+(.*)+\].*/
2. /\[([^\]]+)\].*/
3. /\[([^\]]+)\]/

You have to implement the concept of JSON in JavaScript. You are given an array of objects WordGame of length N. Each array object contains two data fields Tile and Score denoting an alphabet and score of that alphabet respectively. The final task is to return the maximum possible score a player can achieve by adding score of K number of tiles.

You’ve been provided with a starter code which contains sub-tasks as defined below:

Subtask 1 : Parse the JSON object from the given string format and store into Array Scrabble.

Subtask 2 : Maximum possible score a player can achieve by adding K number of Tiles Array Scrabble.

The C++ program given below contains declarations of two function templates. Including which of these function templates will make the program ill-formed?

T1
T2
void m( int p ) {
f(0, p);
}