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!
What do we mean by algorithm? What are the characteristics of a good and relevant algorithm?
An algorithm is "a step-by-step procedure for finishing some task'' An algorithm can be specified in many ways. For example, it can be written down in English (or French, or any other language). However, we are interested in algorithms which have been specifically specified using an appropriate mathematical formalism--such as a programming language.
Each and Every algorithm should have the following five characteristics:
1.Input characteristics: The algorithm should be taking zero or more input.
2. Output characteristics: The algorithm should be producing one or more outputs.
3. Definiteness characteristics: All the steps of algorithm should be defined unambiguously.
4. Effectiveness characteristics: A person should be able to calculate the values involved in the process of the algorithm using paper and pencil.
5. Termination characteristics: An algorithm must terminate after a finite number of steps which means it should not be infinite.
Q. By making use of stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not.
Q. Explain the term hashing? Explain any five well known hash functions. Ans: Hashing method provides us the direct access of record from the f
A shop sells books, magazines and maps. Every item is identified by a unique 4 - digit code. All books have a code which starts with 1, all maps have a code starting with 2 and all
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
Threaded Binary Tree : If a node in a binary tree is not having left or right child or it is a leaf node then that absence of child node is shown by the null pointers. The spac
Explain the Interfaces in Ruby Recall that in object-oriented programming, an interface is a collection of abstract operations that cannot be instantiated. Even though Ruby i
Q. In the given figure find the shortest path from A to Z using Dijkstra's Algorithm. Ans: 1. P=φ; T={A,B,C,D,E,F,G,H,I,J,K,L,M,Z} Let L(A)
explain collision resloving techniques in hasing
(1) Sort a list of distinct numbers in ascending order, using the following divide- and-conquer strategy (Quicksort): divide the list of numbers into two lists: one that contains a
Write an algorithm for multiplication of two sparse matrices using Linked Lists.
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