Posts by Rashakil Fol

You're pulling definitions out of your ass. All those services are provided by the kernel, if they're provided at all.

I pray to God that by 'memory allocation' you consider that to be part of process management.

No, it's O(n^2).

Well, first, do you know anything about parsing, or just about recursion? Because you'll have to use a bit of that, for your program to understand the expressions the user types in.

I love geek jokes SOOOOOOOO much because they make me feel so much more special than all the other people.

Only I can understand them, and the jokes remind me of how awesome I am. The puny-minded nincompoops who don't understand the jokes are wasteful idiots who should be shot.

HEREZ MY FAVORITE GEEK JOKE:

Why was six afraid of twenty?

Because twenty ate four hundred ninety-six!

HAHAHAHHAHAHAHAHAHAHAHAHAHHA!

People who don't understand that joke are pricks for living in the same universe as me.

Ans(1) T(n) = O(n^3)

Wrong.

(exact time complexity=(10*(n^2)*(n+1))/2

There's no such thing as 'exact' time complexity unless you define what abstract machine it's running on.

You should consider looking up what the word "operating system" means then. It doesn't refer to just the kernel.

no

nicotene is more toxic than cyanide by the way

Citation needed.

Forks don't create new threads; they create new processes.

...

Neither of these have anything to do with the problem at hand...

Here's a simple in-place (albeit quadratic) one that's more for English words than C++ identifiers.

bool isword(char x) {
  return std::isalnum(x) || x == '_' || x == '\'';
}

// reverses [beg,end)
void reverse(char* beg, char* end) {
  while (beg < --end) {
    char tmp = *beg;
    *beg = *end;
    *end = tmp;
    ++ beg;
  }
}

// reverses words of [beg, end)
void reverse_words(char* beg, char* end) {
  char* b = beg;
  char* e = end - 1;

  while (b < e) {
    while (b < e && ! isword(*b))
      ++b;
    while (e > b && ! isword(*e))
      --e;
    if (b < e) {
      reverse(b, e + 1);
      
      while (++b < e && isword(*b));
      while (b < --e && isword(*e));

      if (b < e) {
	reverse(b, e + 1);
      }
    }
  }

  // Now reverse individual words.

  b = beg;
  e = end;

  while (b < e) {
    while (b < e && ! isword(*b)) {
      ++b;
    }

    if (b == e) {
      break;
    }

    char *wordEnd = b;
    while (++wordEnd < e && isword(*wordEnd));

    reverse(b, wordEnd);

    b = wordEnd;
  }

  return;
}

Use the kind of image map that sends x-y coordinates.

The competency behind wanting to send 1 MB of image map coordinates could be considered questionable...

It's spelled kernel, by the way.

What do you mean, the design of a "desktop"? What's a desktop? That's a rather general term. Of course, you can see where it matters, in that features like multitasking are considered useful (as opposed to batch processing). Then you see features like threads becoming more prevalent as a result of the needs of programmers.

This is an assignment for you to do, so do your own damn homework.

I don't think there's any purpose to this. Getting knighted by an online forum is like getting a diploma for graduating kindergarten.

> Instead of simply informing Dani when there's a technical glitch or hole, he demonstrates how it could possibly be used in a bad way.

I wouldn't say that. I decided that some people behave too materialistically about reputation points, as if they carried any meaning whatsoever. And I thought it would be fun. And it was.

>For example, not too long ago he created a thread that was full of profanity.

And I reported it twice! I was really just confused, because it seemed like there was no profanity filter at all anymore.

> as far as I know (someone correct me if I am wrong here), did not abuse his powers,

More out of laziness than benevolence :P

Guys... Word God is Bad Math.

>My first thought which springs to mind, is, how would you define a 'word'?
That's an excellent reaction. After a moment's thought, I'm thinking we (the imaginary company you're interviewing for) could use something like this to process subroutine parameters in a compiler while building a stack frame. The parameters are evaluated from last to first, but written first to last. So for our needs a word is a valid identifier (our compiler uses the same identifier rules as C++).

WHAT??? That's an asinine way of doing things.

Typically, either you'd learn how to program and do it yourself, or you'd hire somebody else (or a group of people) to do it for you. How much money do you have?

Exe files have to follow a certain format, and not every piece of machine code forms valid instructions. Yours was broken. You'd probably want to take some source code and compile it, if you want to create an exe.

This game sucks as much as it always did.

instead I'd recommend going through all the appropriate identifiers and parsing their camelcasedness.

In otherwords, go through all the identifiers and make a two-way mapping of camelcase fragments and where they appear. So if you found identifiers "abcDefGhi", "abcKoopa", "caterpillar", "snowCat" and "abcbomb", you'd get in your dictionary "abc", "def", "ghi", "koopa", "carbomb", "snow", "cat", and "caterpillar", with pointers (in the abstract sense) to the places in source code where those fragments appeared.

Then use some magic algorithm that searches for fragments that are concatenations of others or prefixes of others, and if they don't form some ordinary English word, then they're bad. For example, "abc" is a prefix of abcbomb. Maybe abcBomb was meant? But while cat is a prefix of caterpillar, caterpillar's in the dictionary.

Of course, that's dumb. If you want to enforce the camelcase rule, just tell people to do it and threaten to fire them, or if your company's in North Korea, threaten to imprison them, if they don't comply. If you disallow underscores from the names, that'll be enough to compel them to use camelcase. Right? Then again, if people can get through three years of CS thinking a std::vector's implemented with a linked list, maybe it isn't. Sigh.

Carbon credits are 21st century indulgences.

So... could jbennet and serunson play their game soon? Josh and I are waiting on you.

he did the same thing to me, i had a whole page of it, this was a while ago

Now this is an interesting accusation...

A description of how the number of steps it takes for an algorithm changes with respect to the algorithm's input.

Let me summarize the situation here: You're all idiots. Get over yourselves.

Caning for jaywalkers? You people have serious psychological issues. Or maybe just jtwenting.

Hrm? I just experimented this with joshSCH. There have been multiple times where I have played Yahoo chess and didn't notice the person leave. The notion that somebody else made the move is not ridiculous.

The only reason josh thinks you'd have to have noticed somebody leaving and another rejoining is that he's immaturely latching onto whatever is the first opinion he has publicly spouted.

The Yahoo Chess client is very buggy. I don't see how Nichito would have been notified in an obvious fashion. A random person could have joined the table and continued the game.

Seriously, everybody sins from time to time, so they should electrocute entire cities at a time.

You need to generate it. Some program such as rsa-keygen or such can generate a public/private key pair for you. Then you send the public key to whomever is on the other end, so that you can form an encrypted connection.

Well.... do you have any reason you need to fork off a process in the first place?

Rashakil defeats Nichito.

I'm ready to play whenever you want to, probably... go on IRC.

Certain words are taboo for the same reason that certain combinations of musical notes and certain colors of light are taboo.

What is a religon?

Or is it one of the pokémans? I prefer Porygon, myself.

1301

What unoriginal fluff. This wouldn't even be copyrightable. Why don't you come up with something new, something youthful and interesting, something unpredictable???//slash Do you have no spirit? How do you want to spend your life: as a mere drone, a spiteless follower of a soporophized forum-mangler? Or will you strive to meet the conflux of human achievement? I think not; this posts exhibits the you-are-too-petty factor of your personality.

> You and I don't take drugs not because the goverment prohibit it,
> nor because is expensive or hard to find.
But considering the fact that once these things get legalized, it won't be long before everyone starts taking it. Remember, the people around you influence you; evil is known to stick fast and hard.

I guess everybody will have to conform to ~s.o.s~'s standards of how people should live.

Your suggestion could be rephrased as: "if we legalize drugs, their use won't be a crime anymore, so crime will go down."

Only by morons :-)

The point was that organized crime (with its bad side-effects) would decline.

>>they should be legal to purchase, possess, transport, produce, and do anything with, with the exception of consumption

If someone does all those things then you can get your boots that they are either drug pushers (prisonable offense) or consuming the drugs too. Drug pushers should be casterated for their crimes.

No, it would make drugs acquirable freely. Prices would collapse to nothing, and 'drug pushing' would not be profitable; who would want to 'push' them when people could just buy them cheaply at a nearby store?

And if you don't want schoolbus drivers spaced out on crack, consider enforcing preexisting DUI laws...

I think Serunson was referring to use of the military in ways that, you know, benefit the U.K.

If you ask me, if 'hard' drugs are going to be illegal, they should be legal to purchase, possess, transport, produce, and do anything with, with the exception of consumption. This would force the end of the worst aspect of drug use, the War On Drugs (and the criminals who profit from this so-called war).

and it can bring in some $$ for the U.S. government..

You mean it can take $$ from U.S. citizens.

Just generate the non-Fibonacci series the same way you'd generate the Fibonacci series -- just print out all the numbers between your current and the previous one, instead of only the current. You don't need to fill any containers.

>how to find out the maximum and the second maximum number from an array of integers

You sort them out in ascending order and then you pick the last two.

Use a heap ^_^ to store the top two elements as you walk through the array. Then finding the top K elements takes O(N log K) time instead of O(N log N).

About Israel, I have no freakin idea who's right or wrong there - for me they're all wrong.

In my opinion they're right and their parents or grand-parents (at least on one side) are wrong. Nobody can be blamed for being born into a conflict.

That doesn't involve function pointers though :-/

Mentioning function pointers must be a sign of being completely lost, since there's only a finite constant set of values a function pointer can attain in any given executable; you might as well implement a stack using a bounded set of integers, or something crazy like that.

Skin already has a special chemical that repels water.

The playstation version of MGS is one of the greatest games ever.

Yay!!!!!

Well it could be done,
IF
The water was 'heavy water'
Or
He put a special chemical on his feet that repels the water allowing him to 'walk' on it.

To quote some awesome teacher I had: Shut up, that's retarded.

Edit: Hey, maybe that comes across as mean-sounding. Whatever.