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:
It's a three step algorithm and it works fine. But I am trying to prove that it is not always true. See my example tries below both example 1 and 2 works fine according to the algorithm. but is there any counter example anyone can show which does not work with algorithm. (cannot use negative numbers).
2. Relevant commands, code, scripts, algorithms:
Code:
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.
3. The attempts at a solution (include all code and scripts): Example1:
Let's say we have 4 numbers, 10, 9, 8, and 7 (sorted in decending order)
Tape1: 10
Tape2: 9
Next:
Tape1:10
Tape2: 9, 8 (assigned the file 8 to the smallest tape. now the total of tape2=17)
Example2: if we have numbers say 100, 50, 2, 1
The solution will be:
Tape1: 100
Tape2: 50, 2, 1
4. Complete Name of School (University), City (State), Country, Name of Professor, and Course Number (Link to Course):
UC Dresden, Dussolders, Deutchland, Prof Martan (online tutor), 206.
Note: Without school/professor/course information, you will be banned if you post here! You must complete the entire template (not just parts of it).
This appears to be part of a theoretical computer science class, about a problem on a hypothetical device/automaton, called a Turing machine:
Quote:
A Turing machine is a device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer.
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... (5 Replies)
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... (4 Replies)
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... (1 Reply)
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... (1 Reply)
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... (0 Replies)
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.
... (1 Reply)
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... (5 Replies)
