Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Example of asymptotic notations?
The function f (n) belongs to the set (g(n)) if there exists positive constants c such that for satisfactorily large values of n we have 0<= c*g(n) <=f(n). In another words,
O(g(n)) ={ 0<= c*g(n) <=f(n) for all n >= no }.
Assume we have a function f (n) = 4n2 + n then order of function is O(n2). The asymptotic notations give information about the upper and lower bounds on complexity of an algorithm with help of O and ? notations. E.g. in the sorting algorithm the upper bound is O (n ln n) and lower bound is ? (n ln n). But problems such as matrix multiplication have complexities such as O (n3) to O (n2.38).
Algorithms that have similar lower and upper bounds are called optimal algorithms. So a few sorting algorithms are optimal whereas matrix multiplication based algorithms are not.
Example of ANN - artificial intelligence: ANNs look like this: Notice that the x, w, z and y represent actual valued weights and that every the edges in this graph
Q. Explain about Control Memory Organization? One of the simplest ways to organize control memory is to organize micro-instructions for different sub cycles of machine instruct
Predicates in propositional model: The predicates take a number of arguments in which for now we assume are ground terms and represent a relationship between those arguments t
How does dynamic memory allocation help in managing data
How will you reuse a plan? Reuse is an benefit of OO technology. Two aspects of reuse: Using existing things and making reusable new things It is simpler to reus
Convert 2222 in Hexadecimal number ? Ans. = 8AE
State the criteria which a trusted publisher should meet before adding him? Ans) The following criteria should be met by the publisher before adding him to the list. ? The
Q. Design Odd-Even Transposition Algorithm? Algorithm: Odd-Even Transposition for I=1 to N { If (I%2 != 0) //i.e. Odd phase {
Which approaches do not require knowledge of the system state? Ans. Deadlock detection, deadlock prevention and deadlock avoidance; none of the given require knowledge of the s
List the steps needed to perform page replacement. The steps required to perform page replacement are: 1. Find out which page is to be removed from the memory. 2. Perfor
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd