SDE - Intern

Which networking device operates at the Network layer of the OSI model and is used to forward packets between different networks?

1. Hub
2. Switch
3. Router
4. Proxy Server

Differences between user-level threads and kernel-level threads in operating systems. (Learn)

The turnaround time for process P2 using a preemptive priority CPU scheduling algorithm is (in ms):
Process Number Arrival Time Burst Time Priority

1. P1 0 ms 5 ms 10
2. P2 1 ms 4 ms 20
3. P3 2 ms 2 ms 30
4. P4 4 ms 1 ms 40

You are given an undirected, connected and weighted graph G(V, E), consisting of V number of vertices (numbered from 0 to V-1) and E number of edges.

Find and print the total weight of the Minimum Spanning Tree (MST) using Kruskal's algorithm.

By definition, a minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

Choose the most appropriate word from the options given below to complete the following sentence. He could not understand the judges awarding her the first prize, because he thought that her performance was quite __________.

1. superb
2. medium
3. mediocre
4. exhilarating

In Operating Systems, which of the following is/are CPU scheduling algorithms?

1. Priority
2. Round Robin
3. Shortest Job First
4. All of the mentioned

A vendor sold two apples each at rupees 30. The vendor made a profit of x% on the first apple and a loss of
x% on the second apple. The net loss percentage is 4.84%. Find the value of x.

In a certain code, NEWYORK is written as 111, how is NEWJERSEY written in that code?

"CURATED" is encoded as "UFEASVD". How would "AMAZING" be encoded?

def func(x, y):
if y == 0:
return x
else:
return func(y, x % y)
result = func(108, 192)
print(result)

Which of these MySQL join types returns all records from the left table and the matched records from the right table?

1. LEFT JOIN
2. LEFT INNER JOIN
3. LEFT RIGHT JOIN
4. LEFT OUTER JOIN

Which indexing algorithm is designed to handle range queries efficiently?

1. B-tree
2. Hashing
3. Bitmap index
4. Clustered index

A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.

You are given a sorted array 'A' of length 'N', two integers 'K' and 'X'. Your task is to print 'K' integers closest to 'X', if two integers are at the same distance return the smaller one.

The output should also be in sorted order

Note:

An integer 'a' is closer to 'X' than an integer 'b' if: 
|a - X| < |b - X|  or (  |a - X| == |b - X| and a < b )

For Example:

if X = 4,  3 is closer to 'X' than 9, as |3-4| < |9-4|  i.e., 1 < 5   and if X = 4, 2 and 6 are equally close to it, as |2-4| == |6-4| = 2, but we say 2 is closer to 4 than 6, as 2 is smaller.

You are given two positive integers ‘N’ and ‘K’. Your task is to find the smallest ‘N’ digit number whose sum of digits equals ‘K’. If no such number exists then you need to print -1.

A lady makes a purchase of Rs 200/- in a store. The shopkeeper sells the goods with zero profit. He receives a Rs 1000/- note from the lady. The shopkeeper gets the change from the next shop, retains Rs.200 for himself, and gives the lady Rs.800 back. Later, the shopkeeper at the next shop comes with the Rs.1000 note saying “duplicate” and takes his money back.
How much Loss did the shopkeeper face?

The interviewer asked for a brief overview of each project and posed several standard questions, such as why I chose specific features and tech stacks. One of my projects involved working with APIs, prompting a query about my understanding of APIs.

Alok has three daughters. His friend Shyam wants to know the ages of his daughters. Alok gives him a first hint. 

1. The product of their age is 72. Shyam says this is not enough information Alok gives him a second hint.
2. The sum of their ages is equal to my house number. Shyam goes out and looks at the house number and says “I still do not have enough information to determine the ages”. Alok admits that Shyam can not guess and gives him the third hint
3. The oldest girl likes strawberry ice cream.

Shyam is able to guess after the third hint. Can you guess what are the ages of the three daughters? 

There are two empty bowls in the room. You have 50 white balls and 50 black balls. After you place the balls in the bowls, a random ball will be picked from a random bowl. Distribute the balls (all of them) into the bowls to maximize the chance of picking a white ball. 

Given N pairs of parentheses, write a function to generate and print all combinations of well-formed parentheses. That is, you need to generate all possible valid sets of parentheses that can be formed with a given number of pairs.

You have been given an integer array/list (ARR) of size N. You have to return an array/list PRODUCT such that PRODUCT[i] is equal to the product of all the elements of ARR except ARR[i]

 Note :

Each product can cross the integer limits, so we should take modulo of the operation. 

Take MOD = 10^9 + 7 to always stay in the limits.

Follow up :

Can you try solving the problem in O(1) space?

Given a binary search tree and an integer ‘K’. Your task is to find the ‘K-th’ smallest element in the given BST( binary search tree).

BST ( binary search tree) -

If all the smallest nodes on the left side and all the greater nodes on the right side of the node current node.

Example -

Order of elements in increasing order in the given BST is - { 2, 3, 4, 5, 6, 7, 8, 10 }

Suppose given ‘K = 3’ then 3rd smallest element is ‘4’.

Suppose given ‘K = 8’ then 8th smallest element is ‘10’.

Note:

1. You are not required to print the output explicitly, it has already been taken care of. Just implement the function and return the ‘K-th’ smallest element of BST.
2. You don’t need to return ‘K-th’ smallest node, return just value of that node. 
3. If ‘K-th’ smallest element is not present in BST then return -1.

Similar to the previous round, we then discussed my first two projects, focusing on React features. They asked me to explain the concept of APIs as if they were 9th-grade students, and I used the analogy of a restaurant waiter to illustrate the idea.

The interviewers also inquired about the distinctions between a “set” and an “unordered_set,” along with the underlying principles of these data structures.

Determine the number of solutions for the equation x + y + z = n, where all variables (x, y, z, and n) are integers.

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

Define encapsulation, and I was asked to write an example class illustrating this concept.

I mentioned that my favourite data structure was a graph, which led to a series of questions about graph traversal algorithms. I explained Breadth-First Search (BFS) and Depth-First Search (DFS) to the interviewer. (Learn)

Consistent with previous rounds, I discussed my projects and their details. In one of my projects, I was asked to describe the JavaScript code I used to fetch data from an API.