| Question: |
what is the proper defination of thita used in the lectures? |
| Answer: |
Theta (which show asymptotic notation) is a measurement tool from mathematic to measure the efficiency of algorithm. |
|
| Question: |
how can we get the values of log base to 2 in calculater.? |
| Answer: |
The following formula is used to calculate any base of logarithm Logb x = ln x / ln 2 e.g. for X = 1000000 and base b = 2 we calculate the value Log2 1000000 = ln 1000000 / ln 2. Log2 1000000 = 13.82 / .69 Log2 1000000 = 20.02 |
|
| Question: |
what are parallel machines or parallel computers. |
| Answer: |
Parallel computers are the sort of computer containing more than one microprocessor. |
|
| Question: |
what is difference b/w data structure and algorithm ? |
| Answer: |
Algorithm An algorithm is any well-defined computational procedure that takes some values, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into output. Data Structure While data structure is the organization of data and define operation on that data. |
|
| Question: |
What main difference between pseudo code and language code(c++ , java)? |
| Answer: |
Here two space means 2D Space in which x and y coordinates are involved. Pseudo code is the english like lanugage which is used to write the program (The set of instrution in english lanugage). Where as C++, Java lanugages have their predefined grammer and you have to follow those grammer rules inorder to write usefull program in these languages |
|
| Question: |
what is difference b/w quardratic and linear |
| Answer: |
A linear equation with one variable is a polynomial equation of degree one—that is, of the form ax + b = 0. These are called linear equations because graphing these equations results in straight lines. A quadratic equation in one variable is a polynomial equation of degree two—that is, of the form ax2 + bx + c = 0. |
|
| Question: |
What is the worst case for any Algorithm?diff between order n2 and nlogn algorithm ? |
| Answer: |
Worst-case time is the maximum running time over all (legal) inputs of size n. "n2" and "n log n" is the time take to different type of algorithm in which "n2" produce bigger value than n log n which mean the algorithm having time "n2" will take more time to run then the algorithm having time n log n, which produce less value than "n2". |
|
| Question: |
What is random access and sequential access? And what is difference ? Z = w[10]; , Z=a+b ; both are separate or not ?because the array 10 time execute and the second 1 time execute and how many time spend the both instruction? What is 2-dimension ? What is maximal point? |
| Answer: |
Sequential Access A method of storing or retrieving information that requires the program to start reading at the beginning and continue until it finds the desired data Random Access The ability of a computer to find and go directly to a particular storage location without having to search sequentially from the beginning location. Maximal point Given a set of n points, P = {p1, p2, . . . , pn} in 2-space a point is said to be maximal if it is not dominated by any other point in P. For more detail of Maximal point please see the handouts of lecture No.2 topic "2-dimension maxima" |
|
| Question: |
measures of efficiency are just speed and space ?. |
| Answer: |
Efficiency means how much faster/slower an algorithm runs. Speed and space are the factors which effect on efficiency. |
|
| Question: |
what are the differences between pseudo code and algorithems |
| Answer: |
Pseudo code is English like language which is used to explain some sort of program or be algorithm |
|
| Question: |
what is parallel Algorithm |
| Answer: |
An algorithm in which more than one portion of the algorithm can be followed at one time. Parallel algorithms are usually used in multiprocessing environments |
|
| Question: |
what do u mean optimal value |
| Answer: |
Optimal values are such values which cause the algorithm run fast. |
|
| Question: |
what difference between the O(n log n) and and theta(n log n)? |
| Answer: |
The O-notation is used to state only the asymptotic upper bounds. While theta notation deals with the upper and lower bound of the asymptote. So O(n log n) deals with uppper asymptotic bounds while theta(n log n) deals with lower as well as upper asymptotic bound. |
|
|
