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!
Determine the greatest common divisor (GCD) of two integers, m & n. The algorithm for GCD might be defined as follows:
While m is greater than zero:
If n is greater than m, swap m and n.
Subtract n from m.
n is the GCD
Code in C
int gcd(int m, int n)
/* The precondition are following: m>0 & n>0. Let g = gcd(m,n). */
{
while( m > 0 )
if( n > m )
{ int t = m; m = n; n = t; } /* swap m & n*/
/* m >= n > 0 */
m - = n;
}
return n;
Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.
Given are the definitions of some important terms: 1) Field: This is an elementary data item characterized by its size, length and type. For instance, Name
Sort the following array of elements using quick sort: 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8.
Explain the array and linked list implementation of stack
Q. Write down the binary search algorithm and trace to search element 91 in following given list: 13 30 62 73 81 88 91
circular queue using c
Explain what are circular queues? Write down routines required for inserting and deleting elements from a circular queue implemented using arrays. Circular queue:
how to reduce the number of passes in selection sort
Write an algorithm to test whether a Binary Tree is a Binary Search Tree. The algorithm to test whether a Binary tree is as Binary Search tree is as follows: bstree(*tree) {
Q. Write down any four applications or implementation of the stack. Ans. (i) The Conversion of infix to postfix form (ii)
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