sarehu

[QUOTE=MidiMagic;614306]- At home, one compressed file format the unzip software responds to has the same file extension that a piece of music recording software I have uses for music encoding files. I had to uninstall the zip application from Windows to keep it from destroying the music files.[/QUOTE] Retarded people …

Your questions are too vague for us to help you. If you made them more specific, we might be able to provide something useful.

What do you mean "what do I need to do"? You need to write a program that meets the specifications. For example: [code]perl -pe '1 while (s^(-?[.\d]+) (-?[.\d]+) ([-+*/])(?!\d)^"$1 $3 $2"^ee)'[/code]

That's because J is deliberately cryptic and hides all the hard work behind pre-written combinators and functions, in this case ! being "choose". Given the equivalent of these two defined in Haskell: [code]comb n k = foldl' (\x y -> ((n - x + 1) * y) `div` x) 1 …

How to code?

You could go with an image recognition system for diagnosing sexually transmitted diseases. Try to see if the university would supply the images!

There's a different set of forums and a different culture.

[QUOTE=briansmall;499866]Insulting is never a good thing[/QUOTE] That is not true. Insulting is usually a good thing. The only kind of people that get affected by insults are those engaging in acts of self-deception. If one has an unjustifiably large opinion of himself, it is the duty of his fellow members …

How about a compiler. [quote]I will be programming using Visual Studio 2008 with C++/C#[/quote] How do you know?

[QUOTE=Salem;591139]Does your linear algebra text book describe a "less than" operation?[/QUOTE] No.

Ancient Dragon's first answer seems rather completely wrong. 'Busy waiting' is where a computer checks for input over and over again in a loop. I.e. something that looks like this: [code] while (eventsPending() == 0) { } e = nextEvent(); [/code] It is never good to busy wait when a …

I'm confused, is the sqrt function somehow deficient?

All of the above.

Start here: [url]http://www.htdp.org/[/url] That requires downloading a Scheme environment here: [url]http://drscheme.org/[/url] Good luck.

Hi, I'm going to lay some hate on you at first, but I don't hate you, and the interesting part of my message is the bottom half. This post might seem mildly disagreeable, and that's because I'm going to tell you that what you want (assembly or C++) is the …

Well, what do you expect? display_list([H|T]) will eventually get to display_list([]). You should make some predicate [icode]display_list_aux[/icode] that displays nothing when it gets an empty list.

[QUOTE=drichird;581217]1. Assume a growing, subset tree that both Kruskal and MST have in common. 2. Look at the first edge "e" = (x,y) added by Kruskal that does not yield an MST (vertex x is in common subset, vertex y is not). [/QUOTE] What do you mean by "the first …

Matlab? You never know with Matlab, maybe it does allow unmatched quotes :)

Narue's answer is interesting in that it's correct but useless. (Well, not entirely useless -- she probably expected me to explain things further if nobody else did, and it prompts an interesting discussion on what big O notation actually means.) If a function's growth rate is O(n^2), that means the …

Sophisticated shmophisticated! It is perfect the way it is.

It doesn't matter. The assignment is stupid and a waste of your time.

Well, it is possible that using [icode]==[/icode] there will get the right answer, maybe, in that particular case, because the constant string literals [icode]"hello"[/icode] and [icode]"hello"[/icode] could evaluate to the same pointer if the compiler is smart enough.

Make an argument regarding how many arguments are needed after a given formula in order to make it a PN formula.

The difference is that things are public by default in structs.

The fact that a left brace wasn't matched means that you're missing a right brace. And yes, your function [icode]DisplayDay[/icode] does not have a right brace ('}') at the end of its definition. So the compiler, when parsing your program, reached the end of the file without seeing a matching …

All of the algorithms MD5, SHA-1, SHA-256, ... are good for avoiding accidental collisions. If the running time is an issue for you, MD5 is faster than SHA-1 by a factor of say, 2, and a similar ratio exists for SHA-1 to SHA-256. That ratio is based on reading one …

[QUOTE=MidiMagic;549462]OK, so how does the CPU know whether the program it is running is doing a lot of work, or is just sitting there going through some status-checking loops? Does Windows tell it when it is doing work? It can't find out by analyzing the program, because a hardworking program …

Have you.. written any code in C or C++ for any Unix platforms?

It depends. What features of the stack language are there? What values could possible appear on the stack? Numbers? Integers, Doubles? Strings, arrays, linked lists? Do you want to have runtime checks to see what kind of data structure you're dealing with? Can pointers (to functions) go on the stack? …

One very convenient way to test this is with a regular expression, [icode]^\d+$[/icode] and [icode]^\d+\.\d+$[/icode] in this case. However, that would require the installation of a library for that purpose. But if you ever get this problem while using Perl or Ruby, that would be the solution. In the case …

That's not any sort of standard terminology. A successor is, by the English definition, the thing that comes next. For example, "the successor to the throne." You don't need to know what any terminology means, you just need to know what a binary search tree looks like in order to …

Could you be more specific? I take it you know how to say, write an expression that computes the sum of two integers in C++. Which mathematical operation do you want to use? Why can't you use it?

Flood the internet with lots of fake pirated copies of your company's software. People who want to pirate your software won't be able to tell the difference until they've downloaded it and tried it.

I wrote a whole bunch of stuff, but really, you just need to get out a pencil and a sheet of paper, and simulate your program by hand. You [i]must[/i] do that, and you must be able to do that. Also, review things like the scoping rules for variables. Here …

Why are you saying "2/n" when you mean "n/2"? For (b), I'd say you don't need to test any numbers for primality. For example, you don't need to test the even numbers, you don't need to test the multiples of three, etc. So I'm not sure what the teacher means …

Your problem is that you're wring your program in a way such that you are not able to restrict your thought to a few things at a time. You need to organize your program, and accordingly, your thoughts, so that you can manage the complexity of the component that you …

[QUOTE=henpecked1;560619] [code] void punchmeinthehead() { const int maxin = 16; char lastName[maxin] ; char firstName[maxin] ; char midName[maxin] ; size_t length = strlen(lastName) + strlen(firstName) + strlen(midName) + 1; char *fullName = new char[length]; strcpy (fullName, lastName); strcat (fullName, " "); strcat (fullName, firstName); strcat (fullName, " "); strcat (fullName, …

First of all, please use code tags. Second of all, the prefix form should usually have a return value different from [icode]void[/icode]; it should be the type of what you're implementing. Third, to specify the postfix form, give an [icode]int[/icode] argument: [icode]A& operator++(int);[/icode].

A smart one, that inhabits multiple bodies.

What types [i]they[/i] should be? What is [i]they[/i]?

You could ignore words with numbers in them, such as c3po and r2d2. You'll want to be case-sensitive, tolerating capitalization of the first word of a sentence. You'll want to worry about the capitalization after the colon: Sometimes it's reasonable to have a word capitalized after one. Or at least …

And don't forget to [icode]delete [] data;[/icode] when you're done using it, or else you'll never reclaim the memory. [quote]I used Visual C++ 6.0.[/quote] That's an antique, you know.

What does FreeBASIC [1] have to do with this conversation? [1] which I would editorialize as a worthless creation

[QUOTE=vijayan121;557515]note: *do not* do this: [icode]char( 'A' + ri )[/icode][/QUOTE] Vijayan is saying this because it is not guaranteed that the character set will have the alphabetical characters [icode]'A'[/icode] through [icode]'Z'[/icode]or [icode]'a'[/icode] through [icode]'z'[/icode] represented by a contiguous block of integers. However, it is very likely. Some character set uses …

[url]http://gnosis.cx/publish/programming/regular_expressions.html[/url] seems pretty good. I myself learned from [i]Programming Perl, 3rd Edition[/i]. Here's a good reference, but neither of these two links cover more advanced features: [url]http://www.cs.tut.fi/~jkorpela/perl/regexp.html[/url] I'd say that [url]http://perldoc.perl.org/perlre.html[/url] is good documentation for fancier extensions with perl-compatible regular expressions.

The same criteria I look for in any language: an expressive type system, the ability to do things without needing hoops.

Sorry for what? He was talking to the original poster, not you. :)

Use a sorting algorithm. See Google, Wikipedia for more details.

You probably need to install the MySQL-Devel RPM package.

I second that recommendation! Scheme is easier to learn. You could try that if you find Common Lisp to be baroque and disgusting. Also check out Factor, which is (i.m.o.) possibly a good language for having fun in. Edit: Shouldn't this thread be moved to the software developer lounge?