A code C runs T seconds to obtain results for an input of size S. How to find the order of runtime for the code C for given pairs (a) (S1,T1), (S2,T2)? (b) (S1,T1), (S2,T2), (S3, T3)?

You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes of the first and last elements, and returns the minimum and maximum values in that range. Now write the pseudo code of a divide and conquer (and therefore, recursive) algorithm with the same time complexity (Θ(n)). You can assume that p ≤ r. Also, in your code, you can return two numbers by returning a pair, e.g. “return (a, b)”, and can save the output in a similar way, e.g. “(a, b) = minMax(parameters)”. (Short answer please)

You are given an integer n and an array of unique integers blacklist. Design an algorithm to pick a random integer in the range [0, n − 1] that is not in blacklist. Any integer that is in the mentioned range and not in blacklist should be equally likely to be returned. Optimize your algorithm such that it minimizes the number of calls to the built-in random function of your language.

Read Scnerio carefully :  Make a Propose and optimal database design in RDBMS for a super store. In which clients came and can purchase products according to their likes and dislikes. Super store have same products of different companies. In the end client received a receipt of their purchase from counter he/she go for bill. Database also save records of stock according to FIFO system. Required to define Entities and their attributes Attributes Types  Each Attribute Required  Define keys of each entity Define relationship between the entities.