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!
Write an algorithm for searching a key from a sorted list using binary search technique
1. if (low > high)
2. return (-1)
3. mid = (low +high)/2;
4 .if ( X = = a [mid])
5 return (mid);
6 if ( X < a [mid])
7 search for X in a (low) to [mid -1];
8 else
9 search for X in a [mid + 1] to a [high];
Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.
A queue is a, FIFO (First In First Out) list.
The complexity of multiplying two matrices of order m*n and n*p is mnp
sdsd.
2. Write a note on i) devising ii) validating and iii) testing of algorithms.
An interesting application or implementation of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can depict the sequence of possible moves
sir how can i explain deletion process in a data structure
In file access: what is the difference between serial, sequential and indexed sequential searching
If a node in a BST has two children, then its inorder predecessor has No right child
Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case? Ans: The worst case performance occurs in insertion
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