SDE - 1

1.Hash Map data structure is taken which works with the key-value pair.
2.Loop the strings, character by character, and verify if that character of the string exists in the hash map or not.
3.If the result is true, the counter for the character in the hash map is increased or else then put a count as 1.
4.Once the loop ends, then the Hash map is traversed and print the characters with more than 1 count.

1.Initialize two strings in two variables.
2.Check if the length of the two strings is similar, if not then the strings are not an anagram.
3.If the result is true, take the two strings and store them in a character array.
4.Sort the two character arrays, then check if the two sorted arrays are alike.
5.If the result is true, the two strings are anagram else, not anagram.

Tip 1: Explain all of these in single sentence

It is a process of analyzing the given relation schemas based on their functional dependencies and primary keys to achieve the following desirable properties: 
1. Minimizing Redundancy 
2. Minimizing the Insertion, Deletion, And Update Anomalies Relation schemas that do not meet the properties are decomposed into smaller relation schemas that could meet desirable properties.

Processes can be in one of three states: running, ready, or waiting
(Explain all three in one sentence)