Two different objects having same hashcode can add to the same hash table. If yes can any one explain how can we add and remove the keys from the hash table.\n\nThanks in advance.
209538
yse u can.Why because u r getting the values based on the hashcode.So hashcode is unique based on the u will get that object
165508
There are absolutley hundreds of thousands if not millions of identical keys in the world, simply because it is impossible to make every one unique.  For example, a certain brand of door lock has 5 pins, each of which can be at one of 5 different settings.  this means that for this brand there are only 3125 different keys made (5^5).  if for example they made 1 million locks last year that means that if you bought one of those locks there would be 320 identical locks also sold.\n\nobviously manufacturers make many more than a million locks in a year, so really the security provided by a lock is not provided by that lock being unique, but instead by the fact that it would be impractical to find one of the identical keys (think of a theif carrying three thousand keys to your door and trying each and every one of them to try and break in)
163193
It has 2-bytes code, so you need to examine two consequent bytes. It is not C++ specific, it is PC-specific.
590560
One question: when you type "2" in the field t4f3, what do you want to lookup in table 2? Fields? Records? All fields? All records? I believe you're not designing the right way your database. Please be more specific.\n\nMakiavel
408554
Why do you need to implement it yourself? Why not use the Crypt::Rijndael_PP module from CPAN?\n\nIf anything, you could use the module as a working implementation to study ( or copy from ).\n\nEDIT: Changed module name.
21438
Better way is to creat an instance of Random class.\nIt has methods, nextInteger(), nextdouble(), and others.
341994
Sounds impossible.  Could you post the code you already have?
455741
1. Your description is not entirely wrong, except that a link list is not an array (ie not the array as you read in data structures). The arrays can contain a fixed-max number of elements, whereas a linked list can grow dynamically. Also, as you might know already, inserting an element anywhere in a link list is very easy as compared to inserting an element in an array (except when the element is inserted at the end).\n\n2. I am not sure how helpful will this be - but you can try it out - Use linked list to store a sorted list of employees. Create methods to add and delete employees - each time an employee is added, you have to ensure that the sorted order is preserved (you can choose any field of employee structure to sort the records on - emp no, name, lastname)\n\n3. Rest assured that data-structure is not even close to being obsolete. With all the advanced languages/products that inundate the markets today - data structure still have their own importance. Agreed, not every type of programming will use data structure, but there are a lot of scenarios, that can be best coded using data structures. Though you can still survive if you don't know this topic well (as there are always more than one way to solve a problem), but then your solution may not be as optimized as it would be with use of data structures.
493242
Both have almost the same effect.\n\nbut it mostly depends on how efficient val.getName() works.\nbut if you using the same method to fetch the value and use it as a parameter,the first one would be better it will at least save a couple of object creations.
358627
... have the WHAT ??????????????????\nwhat the f@$# is that ???\nget outa here ... please!
380360
I don't see how you could access elements in an array past MAXINT. (Using array syntax.)\n\nSo the practical answer is MAXINT.
27383
each node is homogeneous with a reference to the next node. instead of storind data in contiguous locations, we can have linked lists to store the same data, by utilizing the free space wherevr it's available in memory. u can have singly, doubly linked lists and circular linked lists. stakcs and queues can also be omplemented thru them.
285622
The trick with C++ arguments (regardless of whether they are structures are not), is that C++ passes arguments by value. That is, it will pass the value of the argument into the method, not the argument itself. If you change the matching parameter in the method, the change will not be represented back in the calling method.\n\nPassing by value can also get expense. If the parameter/argument is large, as in a large class, the compiler may spend a lot of time and space resources making a copy.\n\nI recommend passing the parameter as a reference, i.e., add a & between the type and the variable on the method definition line. The rest of your code will look the same. Now, a reference to the argument is used in the method rather than a copy.\n\nThis solves the time and space resouce problem as well, but it introduces a new problem. What if you want to update the paremeter in the method? Then you place a const before the parameter type. This will allow a reference to be passed in without changing the value.\n\nGet a copy of Scott Meyer's first Effective C++ book. It talks a lot about how to use C++ well, and how you can screw it up royally if you're not careful.
576091
That will not be a database program because no database is involved!\n\nWhat language is the answer to be coded in?\n\nHow will the data be organised?\nOne line per data item?  \nThis will need x reads per property.  Will also leave blank lines where items missing.\n\nOne line per property.  Will there be fixed size data items or will you have a seperator? The seperator cannot be used in the data item!
20428
I hope you can understand the pseudocode, it's pretty loose.\n\nConstruct two arrays P and Q.\nLet P be empty, and Q contain the n numbers you want to permute.\nTo start, call the function PrintPermute below passing in the arrays P and Q.\n\nPrintPermute( P, Q)\n{\n  if Q is empty, print the values in P in order and return\n  else\n\n  for each value q in Q,\n  {\n       Create the strings P' and Q' where P' = P + q and Q' = Q - q\n       Call PrintPermute(P', Q')\n }\nreturn\n}
226974
brackets....beheaded becomes rackets...add a j becomes jackets.\n\n\n\nHey, NoMercy...By rights, I should be chosen because I am the only one that showed what it was if 'brackets' was beheaded.  And I got it first!
341887
What you are trying to do is actually part of a larger sorting algorithm called "Merge Sort".\n\nhere is an example:\nhttp://mathbits.com/MathBits/CompSci/Arrays/Merge.htm\n\nYou would keep merging the sorted arrays in set K into the "master" sorted array.  Thus, you would only be working with two sorted arrays at any one time.\n\nSearch the net for "Merge Sort" for other implementations.