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)
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)
Can you help to adjust the void dijkstra(int s) function to find a path from source to every node so that the minimum cost on that path is maximum.
Ex:
From 1 to 2 we have 1 - 3 - 4 - 2 , costs(2+3+4+5)
From 1 to 2 we have 1 - 5 - 6 - 2 , costs(3+3+4+5)
I need the algorithm to choose path 1... (4 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:
It's a three step algorithm and it works fine. But I am trying to prove that it is not always true. See my... (3 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)
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 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)
Discussion started by: n78298
5 Replies
LEARN ABOUT V7
tm
TM(4) Kernel Interfaces Manual TM(4)NAME
tm - TM-11/TU-10 magtape interface
DESCRIPTION
The files mt0, ..., mt7 refer to the DEC TU10/TM11 magtape. When closed it can be rewound or not, see below. If it was open for writing,
two end-of-files are written. If the tape is not to be rewound it is positioned with the head between the two tapemarks.
If the 0200 bit is on in the minor device number the tape is not rewound when closed.
A standard tape consists of a series of 512 byte records terminated by an end-of-file. To the extent possible, the system makes it possi-
ble, if inefficient, to treat the tape like any other file. Seeks have their usual meaning and it is possible to read or write a byte at a
time. Writing in very small units is inadvisable, however, because it tends to create monstrous record gaps.
The mt files discussed above are useful when it is desired to access the tape in a way compatible with ordinary files. When foreign tapes
are to be dealt with, and especially when long records are to be read or written, the `raw' interface is appropriate. The associated files
are named rmt0, ..., rmt7. Each read or write call reads or writes the next record on the tape. In the write case the record has the same
length as the buffer given. During a read, the record size is passed back as the number of bytes read, provided it is no greater than the
buffer size; if the record is long, an error is indicated. In raw tape I/O, the buffer must begin on a word boundary and the count must be
even. Seeks are ignored. A zero byte count is returned when a tape mark is read, but another read will fetch the first record of the new
tape file.
FILES
/dev/mt?, /dev/rmt?
SEE ALSO tp(1)BUGS
If any non-data error is encountered, it refuses to do anything more until closed. In raw I/O, there should be a way to perform forward
and backward record and file spacing and to write an EOF mark.
TM(4)