SDE - Intern

There is a country with 'N' cities and 'M' bidirectional roads of 3 types.

Type 1: Two Wheeler Road, It means only vehicles having two wheels can use this road.
Type 2: Four Wheeler Road, It means only vehicles having four wheels can use this road.
Type 3: Both two and four Wheeler Road, It means this road can be used by both type of vehicles.

The problem is to find the maximum number of roads that can be removed such that a path exists for every pair of cities for each two-wheeler and four-wheeler vehicle.

Note:

1. Roads may form a cycle.

2. The cities do not have multiple same roads i.e all the roads are unique.

3. If every city cannot be reached, then return -1.

You have been given a string 'S' containing only three types of characters, i.e. '(', ')' and '*'.

A Valid String is defined as follows:

1. Any left parenthesis '(' must have a corresponding right parenthesis ')'.
2. Any right parenthesis ')' must have a corresponding left parenthesis '('.
3. Left parenthesis '(' must go before the corresponding right parenthesis ')'.
4. '*' could be treated as a single right parenthesis ')' or a single left parenthesis '(' or an empty string.
5. An empty string is also valid.

Your task is to find out whether the given string is a Valid String or not.

• Explain deadlock and memory management
• What is the difference between paging and segmentation?
• What do you mean by Sockets in OS?
• What is SMP (Symmetric Multiprocessing)

• Explain normalization
• What do you mean by transparent DBMS
• What is Relational Calculus?
• What is functional Dependency?