List of top Algorithms Questions on Algorithm design techniques

Let us consider for an Algorithm A, a nested loop and also a single loop is present what would be the time complexity for algorithm A ?
In bubble sort algorithm, every iteration through each element of a list is called?
Consider the following table of arrival time and burst time for three process Po P1 and P2
ProcessArrival Time Burst Time
Po0 ms 9 ms
P11 ms4 ms 
P22 ms9 ms 

The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. What is the average waiting time for the three process

Consider the string abbccddeee. Each letter in the string must be assigned a binary code satisfying the following properties:
1. For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter. 
2. For any two letters of the same frequency, the letter which occurs earlier in the dictionary order is assigned a code whose length is at most the length of the code assigned to the other letter. 
Among the set of all binary code assignments which satisfy the above two properties, what is the minimum length of the encoded string?

Define \(R_n\) to be the maximum amount earned by cutting a rod of length \(n\) meters into one or more pieces of integer length and selling them. For \(i>0\), let \(p[i]\) denote the selling price of a rod whose length is \(i\) meters. Consider the array of prices:
\[ p[1]=1,\; p[2]=5,\; p[3]=8,\; p[4]=9,\; p[5]=10,\; p[6]=17,\; p[7]=18 \] Which of the following statements is/are correct about \(R_7\)?