Explain how the shuttle sort algorithm works, Data Structure & Algorithms

Question 1

Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps.

Question 2

Write the outputs for the following Matlab codes
for i = 1 : 10

Question 3

(a) List and describe the operations that can be performed on a stack.

(b) For each operation given in (a), write the implementation using Matlab codes.

Question 4

(a) Construct a tree for the following list of alphabets assuming that a number smaller than the node goes to the left else it goes to the right.

16, 8, 4, 24, 9, 5, 23, 13, 22, 28, 6, 3, 7, 2, 15, 10, 12, 14, 19, 27, 29, 26, 31, 25, 30, 1, 11, 18, 21, 17, 20

(b) Perform inorder, postorder and preorder traversal with the following tree.

163_Explain how the shuttle sort algorithm works.png

Question 5

Use Prim's algorithm (matrix form) to find a minimum spanning tree and calculate the minimum cost for the graph given below.

109_Explain how the shuttle sort algorithm works1.png

Question 6

Using Big-O estimate the execution time for the Matlab codes given below. Show clearly all your workings.

1. for i = 1:n-1
2. for j = 1:n-i
3. if a(j) > a(j+1)
4. c=a(j);
5. a(j)=a(j+1);
6. a(j+1)=c;
7. end
8. end
9. end

Question 7

Given the set of items S = {4, 8, 5, 1, 7, 6, 1, 4, 2, 2} and bins of size 10, pack the items into as few bins as possible using Best Fit and Worst Fit. Show all the intermediate steps.

Posted Date: 10/22/2013 5:11:01 AM | Location : United States

Related Discussions:- Explain how the shuttle sort algorithm works, Assignment Help, Ask Question on Explain how the shuttle sort algorithm works, Get Answer, Expert's Help, Explain how the shuttle sort algorithm works Discussions

Write discussion on Explain how the shuttle sort algorithm works
Your posts are moderated
Related Questions
Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

As we talked in class, a program with two integer variables is universal. Now, we consider a special form of four variableprograms. Let G = (V; E) be a directed graph, where V is a

Determine the class invariants- Ruby Ruby has many predefined exceptions classes (like ArgumentError) and new ones can be created easily by sub-classing StandardError, so it's

Enumerate about the carrier set members Ruby is written in C, so carrier set members (which is, individual symbols) are implemented as fixed-size arrays of characters (which is

#question bubble sort..

Speed cameras read the time a vehicle passes a point (A) on road and then reads time it passes a second point (B) on the same road (points A and B are 100 metres apart). Speed of t

Example 1:  Following are Simple sequence of statements Statement 1;  Statement 2; ... ... Statement k; The entire time can be found out through adding the times for

What are the conditions under which sequential search of a list is preferred over binary search? Sequential Search is a preferred over binary search when the list is unordered

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.