SDE - 1

The correct answer is:
D) Both B and C

Explanation:

First-Come-First-Serve (FCFS) (A) → Non-pre-emptive. Once a process starts execution, it cannot be interrupted until it completes.

Shortest Job Next (SJN) (B) → Can be pre-emptive (SRTF) or non-pre-emptive. If implemented as Shortest Remaining Time First (SRTF), it allows pre-emption, meaning if a new process with a shorter burst time arrives, it will pre-empt the currently running process.

Round Robin (RR) (C) → Pre-emptive. Uses a time quantum, meaning each process gets a fixed time slice before being pre-empted and moved back to the ready queue.

Tip 1:Study in detail about OS.
Tip 2:Also have deep knowledge of DSA.

Given:

Length of train = 180 meters

Speed of train = 54 km/h

Convert speed from km/h to m/s:

Speed in m/s=54×1000/60×60=15m/s

Time=Distance/Speed=180/15=12 seconds

Answer: 12 seconds

Tip 1: Brush up basic aptitude questions.

Observe the letter shifts:

Each letter in "TABLE" is transformed as follows:

T → G (Shift backward by 13)
A → Z (Shift backward by 1)
B → Y (Shift backward by 1)
L → O (Shift forward by 3)
E → V (Shift backward by 9)
 

Now applying the same shifts to CHAIR:

C → X (Shift backward by 13)
H → G (Shift backward by 1)
A → Z (Shift backward by 1)
I → L (Shift forward by 3)
R → I (Shift backward by 9)

Answer: XGZLI

Explanation:

Recursion works by using the call stack, where function calls are stored in a Last In, First Out (LIFO) order. When a recursive function is called, it is pushed onto the stack, and when it returns, it is popped from the stack.

Answer:B) Stack

Initialize pointers → left = 0, current_sum = 0.
Expand window → Iterate right from 0 to N-1, adding arr[right] to current_sum.
Shrink window → While current_sum > S, subtract arr[left] and move left forward.
Check for match → If current_sum == S, return [left + 1, right + 1] (1-based index).
Return result → If no subarray is found, return [-1].