1,684 Posted Topics
 | [QUOTE=guideseeq]I thought [I]Perl[/I] is [I]CGI[/I]? I can run a Perl script and rename it with [B].pl[/B] or [B].cgi[/B] extension; it doesn't matter! Do, I rename my C++ program as .cgi? How can it run online .. :!: Please help me: I'm very much confused .. (I knew now .. I …  |
 | I noticed that if I visit the 'Web development' forum index, the background turns blue (and ugly). That's all for today!  |
| | It looks like a fine implementation of the behavior of the Scheme function, LIST?. I don't know why you'd use [inlinecode](and t (isList (cdr list)))[/inlinecode] when that means the same thing as [inlinecode](isList (cdr list))[/inlinecode]. However, Common Lisp (I'll assume that's the variant you're using, since you didn't specify) has … |
| | Due to precision limits in floating point approximations, you are running into cycles where the quotient flops back and forth between two very close approximations. Instead of testing (divisor != quotient) and (divisor == quotient), you need to see if they are sufficiently close, e.g. test (abs(divisor - quotient) < … |
| | [QUOTE=sahil_logic]hello everyone i was trying to make my own own string concatenation function but wasnt able to do so. i need ur help.[/QUOTE] What don't you understand that prevents you from doing this? What do you think would be a subroutine that does work?  |
| | Re: induction [QUOTE=SNA]can anyone please explain me in simple words about induction and how to use induction to prove something.[/QUOTE] Sure. Take a proposition, i.e. a statement that can either be true or false. For example: "For all positive integer values of N, the sum of the first N odd numbers equals … |
| | [QUOTE=eachowcc]Ok. I am trying to write a perl program to automate installation of certain softwares (as root) on a linux machine. I want my perl program to call an installation script and provide parameters to that script such that I do not have to enter 'yes', 'no', 'continue', create directory?', …  |
| | |
| | |
| | |
| | [QUOTE=Ancient Dragon]system() function takes a lot of time to execute.[/QUOTE] So?  |
| | Which part of the logic and the sequence do you not know how to do? |
 | In my high school, a referral meant that the kid got in trouble. This does not necessarily mean he did anything wrong. |
| | Is the IRC Chat network up? I'm having trouble connecting to irc.daniweb.com. |
 | [QUOTE=TKS]You might check Qt. Qt is a graphical C++ compiler for the Xwindow environment in Linux...[/QUOTE] A compiler? I thought it was a library. And it's a GPL'ed library, forcing all your code to be GPL, as well. If you want the non-GPL'ed version, you have to fork over thousands … |
| | I'd go with interpretation b, since the third bullet says "[b]Return[/b] the Hamiltonian Cycle ..." which means that the algorithm ends there. The fourth and fifth bullets are just informative. Why don't you ask the person who gave you this assignment? Unless there is no such person. |
| | Pretend you're the computer, and keep track of the values of money and moneyspent given some arbitrary input values to the program. You'll see your problem.  |
 | Better at what? What are you using the processors for? |
| | [code] if (nums[start] > nums[end]) { int temp = nums[start]; nums[start] = nums[end]; nums[end] = temp; } [/code] Since end can iterate down to zero, the comparison can result in swappage in the wrong direction. Here's what happens. When this algorithm is run, the value 'start' ends up dragging up … |
| | I don't see what the problem is with causing a few radio frequencies to become unusable. Internet access is a much better use of that portion of the spectrum. |
| | Re: who is sexiest? Note that DMR's only vote happened because I felt uncomfortable with the number 69999 :-) |
| | He either throws a nickel first or a dime first. The number of ways to pay is equal to the number of ways to pay by throwing a nickel first added to the number of ways to pay by throwing a dime first. |
| | Use a recurrent relation. Or don't.  |
 | A method based on continued fractions will get you the answer in less than a millisecond. (Ooh I'm being so unhelpful :twisted: ) |
| | [QUOTE=Narue]Linear search performs O(N) comparions in the worst case, and O(N/2) comparisons in the average case.[/QUOTE] In a related note, linear search also performs O(N/10000) comparisons in the average case! |
| | [quote][code] for (int pass = 0; pass < arraysize - 1; pass++) for (int loop = 0; loop < arraysize - 1; loop++) if ( a[ loop ] < a [ loop + 1] ) increasing = 1; if (increasing == 1) cout << "The array is increasing."; else cout … |
| | [QUOTE=mrsmole]I Need To Write A Program Using Pascal To Calculate Coinage I.e 1 X 20p, 3 X 5p Etc. Im New To This And Need Urgent Help. :-| :-| :-| :-| :-|[/QUOTE] Use a text editor? HTH.... :-| |
| | Re: What is Big O ? Do you know what it means for two functions to grow at the same speed and for one function to grow faster than another? The notation O(f) denotes the set of all functions that grow at the same speed as or slower than f. E.g. if the amount of time … |
| | [QUOTE=Tarek]I think the answer to time complexity is : nm+n+m+2 but I can't give the Big Oh for it .[/QUOTE] Don't worry about the other poster. Your answer for the time complexity is generally correct. The question is, do you know what Big O notation really means? It is used … |
| | I think it's real. That is, no laws of physics have been disobeyed, nobody square-rooted a negative number, and that really is a video, not some puny animated GIF. When he tapped the paper to show how the glass behind it was 'solid,' it actually sounded like there was nothing … |
| | It uses deprecated header names and it doesn't output the answer. Also, you have a variable and a function with the same name. That's making the compiler confused. Rename your variables and such so that they do not collide. |
| | |
| | Use a 'for' loop. Show what you think works, and tell us exactly what each line does and why. In doing this, you'll probably solve your problem, but if that fails, you'll have people here willing to help you. |
| | Re: Perl Script Help If you don't post the code that is causing this problem, people are unlikely to be able to help you. |
| | [url]http://www.eternallyconfuzzled.com/tuts/random.html[/url]  |
| | [QUOTE=Quan Chi2]lol Im passed that already. I declared my variables in header files that I coded. Im looking for atleast a hint on how to get the program to respond to user input so that I can execute the action from a declared variable.[/QUOTE] This is what if statements are … |
| | [QUOTE=Narue]Besides, I don't know about you, but the only time I look at anything that says "About" is to get a version and build number. ;)[/QUOTE] About that. I noticed that your website's about.html page doesn't specify your version and build number. Being a little hypocritical, aren't we? ;-) |
| | Re: project idea's If you go that route, make it real-time with "AJAX." (Otherwise the project could take less than 10 lines of code.) Then write a tetris in Python, and run it over the Javascript console. :-) |
| | Which way are you trying to build the list? Are you trying to have the most-recently entered element be at the front of the list, or are you trying to have the most-recently entered element be at the end of the list. Right now, it looks like you want the … |
| | There is a function in C++ that does what you want. But it might not have been written for you. So you're going to have to write it yourself. You should also try figuring out _exactly_ what you are trying to do. Right now, you are being ambiguous. After all, … |
| | You shouldn't have $Dog::obj be a package global there. Make it a local variable in _init. Your getColour, getName subroutines are returning the attributes of whatever hash reference is contained in $Dog::obj. This happens to point to the hash of whatever Dog was initialized most recently. They should return the … |
| | [QUOTE=sunnypalsingh]When a structure is assigned, passed, or returned, the copying is done monolithically....what does this monolithic mean any example??[/QUOTE] It means that every member variable gets copied over. For example, this C code: [code] #include <stdio.h> struct cat { int id_num; int age; int HP; int MP; }; int main(void) … |
| | I think you want front and back to be of type node*. |
| | [QUOTE=mumbojumbo]:!: I am tryin to convert latitudes and longitude values from degrees to binary. Does any one know of a method to do this. I am having a hard time with it. I have a plane trackin software that only intakes 429 signals. And am trying to move it around … |
| | Re: zenos series We can't see the problem until we see what you've tried. Just telling you the answer wouldn't do any good, of course.  |
 | Before: compiler.exe ... -o aol_8.9.exe After: compiler.exe -O3 ... -o AOL_9.0_OPTIMIZED!!!111!.exe At least that's my theory :-) |
| | [QUOTE=md_salman]although this question is basically related to a data structure, still I think that a good progrmmer should be able to answer it. My question is that [B]"is it possible to determine the order in which some ( numbers or characters etc ) are arrived for insertion into a min … |
| | [QUOTE=sunnypalsingh]why does everyone gets so heated up..when it comes to turbo C++ compiler...can someone give me reasons[/QUOTE] It is not a C++ compiler. |
| | Re: Just learning [QUOTE=kahaj]Actually, Dev C++ is what I'm currently using.[/QUOTE] What version? Older versions came with an older, non-conformant compiler. Get the newest version. |
| |
The End.