s_sridhar

I guess you have variable sized memory partitions... In first fit, take the first job loop through the memory list and find a memory partition which has enough available memory to hold that particular job. The moment a partition is found with enough memory space fill it with that job. …

Nothing splendid has ever been achieved except by those who dared believe that something inside them was superior to circumstances.

Both IE and Firefox.

However be the graphics... Counterstrike rocks!

yeah, even i'm looking for the same

You must check whether all elements present in B is present in A or not. Union is just not copying two arrays in a single array, you must check for duplicates.

Use some graphics library.

Hi all, I'm working on conference room booking software with MS-Access as the back end. I need to retrieve the records which doesn't clash with the already booked dates. I have a table called conference_room_status which has the fields Conference_Room_Name | BookedPerson | DateFrom | DateTo | TimeFrom | TimeTo …

Well guys, I am from India.. and i believe NIIT is not worth coming from Malaysia to India. But I do believe that there are better institutes in India.

It contains the HTML and VB.net code that makes up thepage. It's important to note that the VB.Net code is placed within the page_load event. This just means that every time the page is requested the page_load event is raised or run and the code we've written is executed. The …

It is a bad practice to use upper case letters in this fashion... It is equivalent to yelling..

Try giving the full path of the applet codebase say 'www.mycollege.edu/~myself/myapplet.class'.

Of course it will... use System.out.println(node.YOURSTRING);

May I know what exactly you changed?

Ha ha ha :D

Cheats?? :-O

I think it is rather self explanatory... from q0 if you apply either a or b (given by (a+b) you go to q1. Then there is a self loop from q1 on application of a. So you get that a* term. From q1 when you apply b you go to …

An easy method would be tokenize the whole String using the StringTokenizer available in java.util... your job will be much simpler.

@jwenting... you are rude.. but right.. Why discourage him?? I think he is just trying to be polite.

You can use some rapid Java GUI builder like JFrameBuilder... I'm not sure about photoshop though!

I would go for "Data Structures and algorithm analysis" by Mark Allen Weiss.

There is not much difference between these too... in the way the calls occur and all, however function pointers provide an easy way to select a function to execute based on run-time values.

Are you familiar with basic system calls like fork() and sleep() ??

I thought English was the medium here!! Post your code within code tags

Try to create seperate threads for reading from socket and from the user.

what was the best moment of your life so far?? common start sharing ur memories here!!! :)

Brilliant, but not quite enough [code]User: Do you know about me? Cleverbot: Why would I want to? User: Because I'm chatting with you. Will you chat with strangers? Cleverbot: And i'm doing the same. [/code]

He didn't want his nose to be in the same shape as his father's.

Postfix expression is used to aid the order of evaluation of a mathematical expression. When higher level programming languages came into existence one of the major hurdles faced by computer scientists was to generate machine language instructions that would properly evaluate any arithmetic expression. for eg. A*B/C is AB*C/ in …

Loop through and convert the group of characters next to c's,v's,m's ..... into integer datatype, take each character and change ascii value or perhaps use atoi function and multiply by powers of 10. You'll get your required numbers

Even my handwriting was poor (my teacher used to compare it with Gandhi's handwriting) but somewhat legible, among students i was called an intelligent 'kid'

I'll vote for computer engineering.

Switching contents is not recommended as it becomes tiresome when the contents of the node are huge. Check out this one, [url]http://alumnus.caltech.edu/~pje/llmsort.html[/url]

Inside a loop use if condition to check the level, and proceed as long as the list exhausts. for eg. [code=c] /*Inside a loop */ if(node->level==1) list1->next=node [/code] The loop terminates when node->next==NULL.

post the code in the appropriate forum. This is a Community introduction site.

campfire means your thread is running hot, with a huge number of views.

[quote]The program gives them the Spanish, then they give it the English. [/quote] Could you be a bit more specific :).

"cout" doesn't support any specific formatting. You can use printf defined under stdio. Use a corresponding qualifier.

To start with this routine must do, build on it. [code=c]function { sum+=function(string[i+1])*pow(base,i); return sum; } [/code] This is not a functional code, work on it. See the pattern and try it yourself. :)

Hey, there is a difference in the number of arguments. So if you pass the required number of arguments, the corresponding function will be evaluated.

Yeah, obviously they can recognise only two states on or off. But it may undergo radical changes in future. Read about quantum computers. :)

What else do you want? It is fairly good. But what you'll get includes the root. So subtract by 1, you'll get the size of the subtree.

This should help. [code=c] for(i=0;string[i]!='\0';) { for(j=0;j<3;j++,i++) { tempstring[i]=string[j] /*this seperates into 3s, tweak this and you'll get necessary output each time tempstring is overwritten, write a code to avoid it */ } }[/code]

Your 3rd line is wrong. It must be fp=fopen("/usr/lib/htmlexamples/default.html", "r"); because fp is the pointer to the string not fopen, you somewhat muddled it. Or otherwise you can have it this way FILE *fp=fopen("/usr/lib/htmlexamples/default.html", "r");

Here you have not created any structure variables, a structure variable is created as follows, struct moviedata variablename. If you more structure members, include them in the structure definition. [code=cplusplus] struct moviedata { member1; member2; member3; newmember1; ..... } [/code] Pass the structure variable to the function and display all …

What is that "size" you are passing?????? It is a local variable and it is not defined. And by the way average is sum/50.0 and not 5.0.

what is this??? [code=c]for(int i = 0; i , index; i++) { total += dataItem; } [/code] Why that ','

Hey you want people to send you the entire code?? You must know your talents, your abilities and do accordingly :).

You are recursively traversing the tree right. In each stage you must push the element into a particular queue based on its level. So if the depth of the tree is 3, you'll have 3 queues. 40 30 50 20 35 40 45 you'll be at root at first when …

I'm not sure, but maybe it is a convention that global variables are allocated memories in the first few slots.