04-15-2011
Yes, I have debugged this whole code. But what do you mean why adding some debug?
Actually the runtime error here is that my postfix expression is showing only a single character.
For example:
Quote:
Enter the infix expression: a * ( b + c ) / d
The postfix expression is: a
Instead it should show something like this...
Enter the infix expression: a * ( b + c ) / d
The postfix expression is: abc+*d/
Would you please help me work it out?
9 More Discussions You Might Find Interesting
1. Solaris
My interprise use a UNIX mainform for a instrumentation process control. The control use the FOXBORO INVENSYS system and they donīt gonna solve the problem the run time error. The run time error happen without logic explication. When everything itīs run perfectely and happenly appears the run time... (1 Reply)
Discussion started by: marpin
1 Replies
2. UNIX for Dummies Questions & Answers
My system did stay appears the error Run Time Library Error. What itīs? When the error appear, iīve to reboot my system and lost all I did. Is there the UNIX System problem? Please. I need help!!! (4 Replies)
Discussion started by: marpin
4 Replies
3. Solaris
Thank u vgesh99
It works well.. (1 Reply)
Discussion started by: Nandagopal
1 Replies
4. Programming
All,
I am getting this when i try to ran a program in HP unix.
Things i came across
1. i have a system HP-UNIX where this same exe is working.
2. We have set a new HP_UNIX with the same configration and copied the exe to the new system we are getting this error.
3. Only... (3 Replies)
Discussion started by: arunkumar_mca
3 Replies
5. Shell Programming and Scripting
Hi
while trying to run few scripts
/afs/ae.ge.com/informatica/ardw/dev/bin/cdw_ar_update_recvbal.sh
this script contains the below data
load_dir=/afs/ae.ge.com/informatica/ardw/dev/data
prog_dir=/afs/ae.ge.com/informatica/ardw/dev/bin
ctl_dir=/afs/ae.ge.com/informatica/ardw/dev/ctl... (1 Reply)
Discussion started by: laxmi131
1 Replies
6. Programming
#include<iostream>
using namespace std;
int *a,size,heapsize;
void maxheap(int *a,int j)
{
int l,r,largest,temp;
l=2*j;
r=(2*j)+1;
for(j=0;j<size;++j)
{
if(l<=heapsize && a>a)
largest=l;
else
largest=j;
if(r<=heapsize... (5 Replies)
Discussion started by: poonam.gaigole
5 Replies
7. UNIX for Dummies Questions & Answers
Hi all,
I am trying to install a .bin file for that it requires IBMJava2-AMD64-142-JRE-1.4.2-13.8.x86_64.rpm to be installed. I have installed this rpm but when i try to install .bin file, it complains that no JRE found. How to solve this. Thanks in advance!
#... (0 Replies)
Discussion started by: lramsb4u
0 Replies
8. Programming
Hello,
I have some Fortran code that is providing the following error:
At line 1165 of lapc_shells_2.f
Fortran runtime error: Insufficient data descriptors in format after reversion
Here are the lines just above and including 1165:
WRITE (*,"('ATTEMPTING TO READ PLATE... (1 Reply)
Discussion started by: jm4smtddd
1 Replies
9. Red Hat
Hi
I am exactly according to this link
CentOS 6 - Apache httpd - Enable Userdir : Server World
I Enabled userDirectory
Server version: Apache/2.2.15
CentOS release 6.8 (Final)
But Iget this Error
Forbidden
You don't have permission to access /~mn/index.html on this server
Goal... (2 Replies)
Discussion started by: mnnn
2 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)