IT Trainee

Tip 1: The answer is either the circle or the star.
Tip 2: Joey does not pick the square, rhombus, or hexagon; therefore, Joey can pick the rectangle, circle, and star.
Tip 3: Similarly, you can analyze and provide an answer just like in Tip 2.

Step 1: consider N-1, numbers of bowls
Array of size N-1, storing numbers of marbles in the missing bowl
Step 2: Write a function to find the last modified bowl
int solve(int N, int A[])
{
for (int i = N - 1; i >= 0; i--) {
if (A[i] != 9) {
return i + 1;
}
}
return 0;
}

Step 3: Write driver code and call the function
int main()
{
int A[] = { 3, 1, 4, 5 };
int N = sizeof(A) / sizeof(A[0]);
int result = solve(N, A);
cout << result << endl;
return 0;
}

Tip 1: Atomicity: The entire transaction takes place at once or doesn't happen at all.
Tip 2: Consistency: Integrity constraints must be maintained so that the database is consistent before and after the transaction.
Tip 3: Isolation: Ensures that multiple transactions can occur concurrently without leading to an inconsistent database state.
Tip 4: Durability: This property ensures that once the transaction has completed execution, the updates and modifications to the database are stored on disk and persist even if a system failure occurs.

Tip 1:
select *from employee 
group by salary 
order by salary desc limit 1,1;
Tip 2: learn these kinds of questions, these are mostly asked questions in an interview

Tip 1: FCFS stands for First Come, First Served.
Tip 2: In the FCFS scheduling algorithm, the job that arrives first in the ready queue is allocated to the CPU, followed by the job that arrived second, and so on.
Tip 3: FCFS is a non-preemptive scheduling algorithm, meaning that a process holds the CPU until it either terminates or performs I/O.