Re: Help need,Spanning Tree - Algorithms Discussion Boards

Alan Balkany9-Sep-09 5:12

9-Sep-09 5:12

For each pixel:

1. If the value, v, is 0 to 0.5, R = v * 510, G = B = 0.
2. If v is .5 to 1, R = 255, G = B = (v - .5) * 510.

So, at v = 0, the pixel is black. As we go from 0 to .5, red increases to its maximum (255) as we approach .5.

From total red at v = .5, it's blended with increasing shades of white, up to total white at v = 1.

comipler construction

rizwana rashid7-Sep-09 8:23

rizwana rashid

7-Sep-09 8:23

what is the regular expression of muliple line commment other then /* (a+n)* */ bcoz this expression donot accept /* hhhhhhhh*hhhhh*/ string ???????

Re: comipler construction

Christian Graus7-Sep-09 15:55

Christian Graus

7-Sep-09 15:55

You need to search for anything except a closing comment, including newlines.

Expresso is a great tool for testing and building regex.

Christian Graus

Driven to the arms of OSX by Vista.

Read my blog to find out how I've worked around bugs in Microsoft tools and frameworks.

Re: comipler construction

mabo428-Sep-09 1:36

mabo42

8-Sep-09 1:36

You should have a look at this step by step article for developing a multiline comment regex:

http://ostermiller.org/findcomment.html[^]

Re: comipler construction

Luc Pattyn8-Sep-09 2:32

Luc Pattyn

8-Sep-09 2:32

it is also conceivable to create a compiler without using any regex.

Smile | :)

Luc Pattyn

Have a look at my entry for the lean-and-mean competition; please provide comments, feedback, discussion, and don’t forget to vote for it! Thank you.

Re: comipler construction

molesworth10-Sep-09 7:27

molesworth

10-Sep-09 7:27

Just what I was going to say. Regexes are probably the least useful tool for writing a compiler. OK, a spanner is probably less useful, but you know what I mean Smile | :)

There are three kinds of people in the world - those who can count and those who can't...

Re: comipler construction

PIEBALDconsult24-Sep-09 17:44

PIEBALDconsult

24-Sep-09 17:44

You need to remember to escape the asterisks.

/\*.*?\*/

It doesn't handle nested comments, but I understand that balancing groups could be used to cover that.

One of the problems with trying to do it with a RegEx is that you have to read the entire file into a string before you process it and then use the SingleLine option.

Re: Help need,Spanning Tree

Moreno Airoldi8-Sep-09 9:18

Moreno Airoldi

8-Sep-09 9:18

I'm not a specialist about spanning trees, but if I remember correctly Prim's algorithm can be used only to find the minimum spanning tree.

Finding the maximum spanning tree should be an NP-hard problem and as such can be solved by using a greedy algorithm.

Check these links, I didn't read them thoroughly but they should give you some hints on the algorithm you need:

http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Greedy/mst.htm[^]
http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYW-4472K36-P&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1004846747&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=94c6c39b092858ddf62a008f9609ee36[^]

Good luck. Smile | :)

2+2=5 for very large amounts of 2
(always loved that one hehe!)

help needed for loops

aihcezs1444-Sep-09 0:11

aihcezs144

4-Sep-09 0:11

The question goes as follow.

1. Write a c++ program that finds and prints all the prime numbers less than 100. (Hint:For each number from 2 to 100, find reaminder = number%n, where n ranges from 2 to sqrt(number). If any remainder equals 0, the number is not a prime number.)

2. Write a c++ program that calculates the nth number in the Fibonacci sequence, where the user enters n into the program interactively. For example, if n=6, the program should display a value of 5.The Fibonacci sequence is 0, 1, 1, 2, 3, 5, 8, 13...; the first two terms are 0 and 1, and each term thereafter is the sum of the two preceding terms-that is, fib(n)=fib(n-1)+fib(n-2).

I have tried to run but my program would not work. Cry | :((

would anyone please help me out with this. thank you. Smile | :)

Re: help needed for loops

Richard MacCutchan4-Sep-09 0:18

Richard MacCutchan

4-Sep-09 0:18

What exactly would not work?

Re: help needed for loops

aihcezs1444-Sep-09 0:37

aihcezs144

4-Sep-09 0:37

after compiling the prime number question, the output of my program shows some weird numbers like 20887633892
20887633892
20887633892

Re: help needed for loops

Richard MacCutchan4-Sep-09 0:50

Richard MacCutchan

4-Sep-09 0:50

I'm sorry but my powers of divination are not working today. Can you give us a clue as to the code involved in producing these values? Please try and narrow the problem down to the actual statements that cause the problem, and the input values to whatever algorithm you are using.

Re: help needed for loops

aihcezs1444-Sep-09 1:00

aihcezs144

4-Sep-09 1:00

#include <iostream>
#include <cmath>
#include <conio.h>
using namespace std;

int main()
{
int num, n, remainder, prime, nonprime;

remainder = num % n;

for(num=2; num<=100; num++)
{

for(n=2; n<=sqrt(num); n++)
{
if(remainder==0)
break;
else
num=prime;
}
cout<<prime<<" "<<endl;

}

getche();
return 0;
}

Re: help needed for loops

Luc Pattyn4-Sep-09 1:09

Luc Pattyn

4-Sep-09 1:09

aihcezs144 wrote:
remainder = num % n;

aihcezs144 wrote:
num=prime;

I suggest you use the single-stepping capabilities of the debugger and either "watch" some variables or add some statements to print intermediate values, as there are major problems with your code.

Is this your first attempt to programming? FYI: statement order is important, and assignment statements work one way (right to left), not both ways (as in mathematical equations).

Smile | :)

Luc Pattyn

Badger | [badger,badger,badger,badger...]

Have a look at my entry for the lean-and-mean competition; please provide comments, feedback, discussion, and don’t forget to vote for it! Thank you.

Re: help needed for loops [modified]

aihcezs1444-Sep-09 2:13

aihcezs144

4-Sep-09 2:13

okay, i've tried a new one but there are sompilation errors of which i could not locate. would you please take a look and tell mw where did i go wrong. thank you

#include <iostream>
#include<cmath>
#include <conio.h>
using namespace std;

int main()
{
int num, n, remainder;
remainder=num % n;

for( num = 2; num <=100 ; num++ )
{
for (n=2; n<=sqrt(n); n++)
{
if( remainder != 0 )
break;
}
if(remainder)
{
cout <<num<< " ";
}
num++;
}

getche();
return 0;
}

modified on Friday, September 4, 2009 8:20 AM

Re: help needed for loops

Luc Pattyn4-Sep-09 2:45

Luc Pattyn

4-Sep-09 2:45

Seems you have removed one problem.

Compile-time and often run-time errors contain file name and line number information, use it to your advantage; and tell your IDE to always show line numbers in edit windows (for Visual Studio look here[^]).

I'm not going to provide any more help, the goal of exercises like these is for you to learn how to research, analyze, and debug; and not for others to do your work.

Smile | :)

Luc Pattyn

Have a look at my entry for the lean-and-mean competition; please provide comments, feedback, discussion, and don’t forget to vote for it! Thank you.

Re: help needed for loops

harold aptroot4-Sep-09 3:23

harold aptroot

4-Sep-09 3:23

aihcezs144 wrote:
remainder=num % n;

Note that remainder will not change if either num or n or both do, it's just set to num%n (which looks like an invitation to a division by zero) once when that statement is executed.

Random functions family

Quake2Player30-Aug-09 14:31

Quake2Player

30-Aug-09 14:31

Hi,

Would you give me an example of FAMILIES of functions that I could use in a Hashtable?

Notice that I need a FAMILY of functions (that means it should depend on some random constants previously defined)

It should go from {0, K} to {0, m}

Im trying

f(x) = (a*x + b) % prime % m

where prime is larger than x, a is between 1 and prime-1, and b is between 0 and prime-1

But its not good enough.. Dunno why though

Re: Random functions family

Nuri Ismail31-Aug-09 4:10

Nuri Ismail

31-Aug-09 4:10

Quake2Player wrote:
Would you give me an example of FAMILIES of functions that I could use in a Hashtable?

Example: SHA family[^]. This family and additional hash function implementations can be found here[^].
Also you can find some different hash function implementations here[^].

Regards,
Nuri Ismail

I need help decrypting an encrypted text (I also got cleartext examples)

SimpleData30-Aug-09 2:43

SimpleData

30-Aug-09 2:43

Hi I got an Access database encrypted by an application I bought years ago and I don't have that application anymore. This application encrypted everything before saving into the database and I would like to recover some data from that DB.

I am not sure but I think this algorithm needs a key and keys are saved to the database too so I got the keys. But I am not sure about the keys having a role in encryption. This algorithm produces a ciphertext which has same the same length as its cleartext.

Here are some examples:

Cleartext              Encrypted                                                    Key
Harita Mühendisi    KXsmaX büpxfdmYm     MA%7vbxWKIAgARC71+KEn8i3M4yIa+i6Zd384GWTZ6/bT+M+mKCKEFN35meeSE1OGzcxL8ukvvSeKh9c5o2bBF7vbZ+_14
ÇONA                     ÇkWq            MA%vPz9ClelvBm24BrRcVmsXPtD7OOie8xG73DumSdNLlSaAIhL7L5uPB+Q5+titBzXRDisXC4NnnEWoESLU2VIx845_16

I can provide more examples if needed but I don't think they will help. As far as I know if you encrypt a text with this algorithm and use the same key every letter means another letter. For example if you look at the first example H means K, i means m. If you want I can send you the database in private.

I really need you help.
Thanks.

Re: I need help decrypting an encrypted text (I also got cleartext examples)

annathor30-Aug-09 23:23

annathor

30-Aug-09 23:23

Only jones can help you, tell them that spider sent you.

Re: I need help decrypting an encrypted text (I also got cleartext examples)

SimpleData30-Aug-09 23:24

SimpleData

30-Aug-09 23:24

I'm aware that it's complicated.

Re: I need help decrypting an encrypted text (I also got cleartext examples)

Richard MacCutchan31-Aug-09 7:29

Richard MacCutchan

31-Aug-09 7:29

SimpleData wrote:
I'm aware that it's complicated.

I think that may be an understatement. In order to decrypt the data you will at the least need to know the algorithm that was used to encrypt it. Added to that the encryption may have been done with a key that the user has to enter (similar to entering a password). Without these elements I think you may be facing an uphill struggle.

Re: I need help decrypting an encrypted text (I also got cleartext examples)

SimpleData31-Aug-09 8:03

SimpleData

31-Aug-09 8:03

I don't know which encryption algorithm used to encrypt it but I thought that someone here might recognize the output and tell me which algorithm may have been used. Maybe someone could see a pattern etc.

I am sure that no password is needed while encrypting. Only this random key may have been used.

Re: I need help decrypting an encrypted text (I also got cleartext examples)

Richard MacCutchan31-Aug-09 9:21

Richard MacCutchan

31-Aug-09 9:21

The whole ethos of encryption is that it should be impossible to decrypt the data just by looking at the encrypted characters. What is the point of encrypting secure information if anyone can decrypt it just by looking at it?

Do you have the original program that did the encryption, or access to the people who wrote it?

SimpleData wrote:
I am sure that no password is needed while encrypting. Only this random key may have been used.

I don't think that encrypting with a random key would be a good idea!

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.