SDE - 1

In a certain code 'MISSIONS' is written as 'MSIISNOS'. How is 'ONLINE' written in that code?

1. What is the difference between process and thread in an Operating System?
2. How does virtual memory work, and why is it important?
3. Describe the various process scheduling algorithms used in Operating Systems.
4. Explain the difference between symmetric and asymmetric multiprocessing.
5. What are deadlock and starvation in the context of Operating Systems, and how can they be prevented?

Ninja is taking part in a food festival and he decided to prepare ‘N’ dishes with the spiciness of ith dish being ‘DISHES[i]’.

He has an unlimited supply of ‘N’ types of ingredients and the spiciness of ith type of ingredient is ‘INGREDIENTS[i]’.

The spiciness of a dish is defined as the sum of the spiciness of ingredients used in it.

Find the minimum number of ingredients needed to make all the dishes.

It is always possible to make every dish with the required spiciness from the combination of given ingredients.

Note: In the Problem Statement 1-based indexing is used and in the code 0-based indexing is used.

Example:

Input: ‘N’= 4  ‘DISHES’ =[2, 4, 6, 8] ‘INGREDIENTS’=[1, 4, 5, 3]

Output: 7

First dish can be made using 2 ingredients of type 1. 
Second using 1 ingredient of type 2. 
Third using 2 ingredients of type 4. 
Fourth using 2 ingredients of type 2. 
So total 7 ingredients.

You're given a string 'STR' containing ‘0’, ‘1’ and ‘?’ special characters. Your task is to generate all the strings that are possible by replacing the special character ‘?’, with either of the characters ‘0’ or ‘1’.

You are given a reference/address of a node in a connected undirected graph containing N nodes and M edges. You are supposed to return a clone of the given graph which is nothing but a deep copy. Each node in the graph contains an integer “data” and an array/list of its neighbours.

The structure of the graphNode class is as follows:

class graphNode 
{  
    public:
        int data;
        vector<graphNode*> neighbours;
}

Note :

1. Nodes are numbered from 1 to N.

2. Your solution will run on multiple test cases. If you are using global variables make sure to clear them.