Heuristic Algorithm Example Analysis Post: 302618277

8 More Discussions You Might Find Interesting

1. Programming

Feedback algorithm

Hi I search an exemple of scheduling Feedback algorithm, or help about how to create one. Thanks

2. Shell Programming and Scripting

PID USERNAME SIZE RSS STATE PRI NICE TIME CPU PROCESS/NLWP 21444 tomusr 213M 61M sleep 29 10 1:20:46 0.1% java/43 21249 root 93M 44M sleep 29 10 1:07:19 0.2% java/56 is there anyway i can use a command to get the total of the SIZE? 306M (Derive from...

3. UNIX for Advanced & Expert Users

Algorithm In Pseudocode

A) produce an algorithm in pseudocode and a flowchart that gets n from the user and calculate their sum. B) Write an algorithm in pseudocode and a flowchart that gets number x from he user and calculates x5 ( X to the power of %5). Calculate by using multiplication. ...

4. Programming

Please help me to develop algorithm

Hi guys , in my study book from which I re-learn C is task to generate all possible characters combination from numbers entered by the user. I know this algorithm must use combinatorics to calculate all permutations. Problem is how to implement algortihm. // This program reads the four numbers...

5. Homework & Coursework Questions

Heuristic Algorithm Example

Give a counter example such that the following heuristic algorithm, for the 2-tape problem, doesn't always produce the best solution: Algorithm: Sort {Xi} in descending order. Place files in tapes one at a time. For a file being considered, assign the file to the smaller tape. Thanks in...

6. UNIX for Dummies Questions & Answers

banker's algorithm.. help

i'm doing banker's algorithm.. got some error there but i cant fix it.. please help!! #!/bin/bash echo "enter no.of resources: " read n1 echo -n "enter the max no .of resources for each type: " for(( i=0; i <$n1; i++ )) do read ${t} done echo -n "enter no .of...

7. Homework & Coursework Questions

Banker's algorithm

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: shell scripts to simulate Banker’s algorithm on a collection of processes (process details are entered as inputs...

8. Shell Programming and Scripting

Masking algorithm

I have a requirement of masking few specific fields in the UNIX file. The details are as following- File is fixed length file with each record of 250 charater length. 2 fields needs to be masked – the positions are 21:30 and 110:120 The character by character making needs to be done which...

LEARN ABOUT DEBIAN

mixal

MIXAL(1)							Mixal user's manual							  MIXAL(1)

NAME

       mixal - a load-and-go MIX assembler

SYNOPSIS

       mixal [ file ...  ]

DESCRIPTION

       Mixal  is  an  implementation of the hypothetical MIX computer and its assembly language called MIXAL.  The computer was designed by Donald
       Knuth for use in his monumental and yet to be finished book series The Art of Computer Programming.  All programs and all programming exer-
       cises in the book are written in the MIXAL language.

       This  implementation  is  a  load-and-go  assembler,  meaning that you provide it with a MIXAL program source, which it translates into MIX
       machine code, which it promptly executes by acting as a MIX emulator.

       You give Mixal zero or more program source files in the command line, which the program interprets.   If  you  give  it	no  arguments,	it
       expects	to  find  a  program  in  the standard input stream.  After the program has executed, the final state of the machine registers are
       printed to the standard output stream.

       The card punch and line printer devices are connected to the standard input and output stream, respectively.  Console input and output  are
       connected  to  standard	input and output, and the disk devices are connected to files named diskN in the current directory, where N is the
       device number.  Those files are created on demand.

BUGS

       This MIXAL implementation does not do floating-point.  The tape devices are not implemented.

AUTHOR

       This MIXAL implementation was designed and written by Darius Bacon, and then ported to Unixish systems and debugged  by	Eric  S.  Raymond.
       This  version includes corrections to multiplication and division by Larry Gately.  This manual page was written for Debian by Antti-Juhani
       Kaijanaho, with changes by Darius Bacon.

SEE ALSO

       The files /usr/share/doc/mixal/READ.ME and /usr/share/doc/mixal/NOTES.gz contain some information about this MIXAL implementation.  Be sure
       to read /usr/share/doc/mixal/README.Debian, too.

       A  description  of  the MIX system and the MIXAL language can be found in Donald E. Knuth's book The Art of Computer Programming, Volume 1:
       Fundamental   Algorithms;   3rd	 Edition   (Addison-Wesley   1997).    (Or   see   the	 home	 page	 at    http://www-cs-faculty.stan-
       ford.edu/%7Eknuth/taocp.html.)

Debian project							    18 May 2003 							  MIXAL(1)