SDE - Intern

Step 1: Take two pointers slow and fast.
Step 2: While slow moves one step forward, fast moves two steps forward.
Step 3: When fast reaches the end, slow happens to be in the middle of the linked list.

Step 1: Sort the array
Step 2: Based on a + b + c = 0 we can say that b + c = -a and based on this we fix the element as a and then find b and c using two pointers lo and hi (same as in Two Sum Problem)

Virtual Memory is a storage scheme that provides users with the illusion of having a very large main memory. This is achieved by treating a portion of secondary memory as the main memory.

Semaphores are integer variables that are used to solve the critical section problem by using two atomic operations, wait and signal that are used for process synchronization.

A Database is a logical, consistent, and organized collection of data that can easily be accessed, managed, and updated.

The Data model is specified as a collection of conceptual tools for describing data, data relationships, data semantics, and constraints. These models are used to describe the relationship between the entities and their attributes.

Data abstraction in DBMS is a process of hiding irrelevant details from users. Because database systems are made of complex data structures so, it makes accessible the user interaction with the database.

Step 1 − First put 1 in the stack and mark it as visited.
Step 1 − Visit the adjacent unvisited vertex. Mark it as visited. Print it. Push it in a stack.
Step 2 − If no adjacent vertex is found, pop up a vertex from the stack. (It will pop up all the vertices from the stack, which do not have adjacent vertices.)
Step 3 − Repeat Step 1 and Step 2 until the stack is empty.

Step 1: Initialize two pointers, prev and curr, with the first and the second nodes of the linked list, respectively.
Step 2: While curr is not NULL, compare the value of curr and prev nodes.
Step 3: If they have the same value, update prev->next to curr->next and move curr to the next node.
Step 4: If they have different values, move both prev and curr to their next nodes.
Step 5: Return the head of the modified linked list.

Kernel is the core and most important part of a computer operating system which provides basic services for all parts of the OS.

Process: Processes are the programs that are dispatched from the ready state and are scheduled in the CPU for execution.
Thread: Thread is the segment of a process which means a process can have multiple threads and these multiple threads are contained within a process. A thread has three states: Running, Ready, and Blocked.

Demand paging specifies that if an area of memory is not currently being used, it is swapped to disk to make room for an application's need.

Once the DBMS informs the user that a transaction has been completed successfully, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called durability.

ATOMICITY: Atomicity is more generally known as the "all or nothing" rule, which implies that all actions within a transaction are considered as one unit. They either run to completion or are not executed at all.

CONSISTENCY: This property refers to the uniformity of the data. Consistency implies that the database maintains consistency before and after the transaction.

ISOLATION: This property states that several transactions can be executed concurrently without leading to inconsistencies in the database state.

DURABILITY: This property ensures that once the transaction is committed, it will be stored in non-volatile memory, and a system crash will not affect it anymore.