1,2,3,4,5,6,7,8,9,10 – Best case - Sorted in ascending order 10,9,8,7,6,5,4,3,2,1 – Worst case - Sorted in reverse order
1,3,2,5,4,7,9 ,6,8,10 – Avg case – numbers are in random order

For the given numbers, please use the following algorithms (bubble sort, insertion sort & selection
sort) to sort in ascending order. Please also find out number of comparisons and data movements
for each algorithm. Based on comparisons and data movements please rate algorithm for each input
case.

All of the following are characteristics that must be contained in any knowledge representation scheme except

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?

Write pseudocode to represent the logic of a program that allows the user to enter a value. the program multiplies the value by 10 and outputs the result.