It is horses for courses, some tools may be better for you then others. Have you tried looking?[^] Panic, Chaos, Destruction. My work here is done. Drink. Get drunk. Fall over - P O'H OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett

Unless you run the web application locally on the client I would avoid using Javascript to access any database. If the application is not running locally, try ASP.Net as an alternative and run the database on the server. V.

If they're stored on a piece of paper its going to be real difficult to write the ODBC driver ;)

So you start off with the buttons enabled property as False then when the start button is clicked you go through each control in Panel.Controls and if it is a button and not the start button set the enabled property to True. You may want to put the alphabet buttons in a groupbox to further segregate them from any other controls, in this case you go through the GroupBox.Controls collection instead.

ok. i understand now. i'll just transfer the code to a method (which didn't occured to me a while ago). what i first thought is if i put the code inside the method of the listbox the database will be opened once i clicked the listbox and since i need the data to be in the listbox before i click the listbox it will be too late so i put it in the constructor which i think is the best place because once the method of the form has ran the database will be open until i close the form.

Ok. Thanks for your answer. :)

While a lot of folks will get mad at people "having others do their homework for them" you handled this very well. You attempted the code, had some problems and asked an intelligent question. You listened to advice, tried the solution and again did everything correct. You did your best and this stuff is not easy at all. Don't give up and keep going, with your attitude you can do it. :) Threads like these are part of why this place exists.

Your book using SQL Server examples should give you enough to get things working. In the .Net Framework, the System.Data namespace are classes for several types of provider, and the syntax for each is nearly identical. For a connection, SQL Server needs SqlConnection, for MS Access you use OleDbConnection. Similarly, while SQL Server uses SqlCommand, Access uses OleDbCommand. The slight differences, if any, in the arguments each method requires can be resolved with the clues given by IntelliSense, or simply using Help in Visual Studio. Try searching Help for 'System.Data.OleDb' and see what classes are revealed. "A Journey of a Thousand Rest Stops Begins with a Single Movement"

gamer1127 wrote: I just need to know which is the most commonly used AUTOLISP or COMMON LISP Programming Software? Where can i download that software? I need it for my concepts in programming language class. See how easy this[^] is! MVP 2010 - are they mad?

Hi, wikipedia seems to say that Common LISP is the most widely known dialect: http://en.wikipedia.org/wiki/LISP[^] Found also a forum discussion comparing .net with lisp: http://forums.asp.net/t/1185409.aspx[^] Hope this helps... Regards Sebastian It's not a bug, it's a feature! Check out my CodeProject article Permission-by-aspect. Me in Softwareland.

Yes, you can, but you have to be careful and post your questions to the right forum. In the left pane there is a link to the Hardware & Devices forum - that's where you want to go. Curiously, when I reply to a message, the link disappears, but it's there in the normal Lounge view. If you post such questions here in the Lounge you're likely to get your most precious parts toasted by the flames, but if you post them in the proper place you will receive a hero's welcome. Well, in truth, that might be asking a lot, but the denizens of this site will be much nicer if you use the correct forum for your questions. And we'll try really hard to find you a helpful answer... :) "A Journey of a Thousand Rest Stops Begins with a Single Movement"

If you already have the image as a MemoryStream, then why go to all that bother? Isn't it simpler to use byte[] bytes = ms.GetBuffer(); and then compare the two buffers directly? No trees were harmed in the sending of this message; however, a significant number of electrons were slightly inconvenienced. This message is made of fully recyclable Zeros and Ones "Rumour has it that if you play Microsoft CDs backwards you will hear Satanic messages.Worse still, is that if you play them forwards they will install Windows"

Eddy Vluggen wrote: In VB6 that explains it :-D V. Stop smoking so you can: Enjoy longer the money you save. Moviereview Archive

Ok. I have a book that explains how delegates work but it seems that the explanation is insufficient for me. I think I really need to buy more books for OO.

gamer1127 wrote: Is it possible for me to ... if you can explain it properly, then you can program it. :) Luc Pattyn :badger: :jig: :badger: Have a look at my entry for the lean-and-mean competition; please provide comments, feedback, discussion, and don’t forget to vote for it! Thank you. :jig: :badger: :jig:

OK Now SortedList is not dealing with duplicate keys and not doing Radix Sort, so it is a bad choice. What you need is create your own collection class, probably inheriting from List<string> or List<MyType>, start by using its normal Sort method, later on override the Sort method with your own (for which I already gave the basic principles in another thread). :) Luc Pattyn :badger: :jig: :badger: Have a look at my entry for the lean-and-mean competition; please provide comments, feedback, discussion, and don’t forget to vote for it! Thank you. :jig: :badger: :jig:

Hi, I don't know why you insist on using radix sort, as it will be slower than a regular sort when sorting strings. Here is how it could work: - determine the length L of the longest string; - treat all strings as having length L by virtually appending NULL characters; - the Nth "digit" of a string has a value that equals the (int) value of its Nth character (where you use zero if N exceeds the string length). So sort all strings according to their (L-1)th character then sort according to their (L-2)th character etc and finally sort according to their first character As I said, it will be slow, as you have to get the characters, one by one, and compare those, whereas a normal sort would be based on a comparer method (such as string.Compare) that takes the whole string into account right away. :) Luc Pattyn :badger: :jig: :badger: Have a look at my entry for the lean-and-mean competition; please provide comments, feedback, discussion, and don’t forget to vote for it! Thank you. :jig: :badger: :jig:

jai eto nkita ko code public void RadixSort(int[] a) { // our helper array int[] t=new int[a.Length]; // number of bits our group will be long int r=4; // try to set this also to 2, 8 or 16 to see if it is //quicker or not // number of bits of a C# int int b=32; // counting and prefix arrays // (note dimensions 2^r which is the number of all possible values of a //r-bit number) int[] count=new int[1<<r]; int[] pref=new int[1<<r]; // number of groups int groups=(int)Math.Ceiling((double)b/(double)r); // the mask to identify groups int mask = (1<<r)-1; // the algorithm: for (int c=0, shift=0; c<groups; c++, shift+=r) { // reset count array for (int j=0; j<count.Length; j++) count[j]=0; // counting elements of the c-th group for (int i=0; i<a.Length; i++) count[(a[i]>>shift)&mask]++; // calculating prefixes pref[0]=0; for (int i=1; i<count.Length; i++) pref[i]=pref[i-1]+count[i-1]; // from a[] to t[] elements ordered by c-th group for (int i=0; i<a.Length; i++) t[pref[(a[i]>>shift)&mask]++]=a[i]; // a[]=t[] and start again until the last group t.CopyTo(a,0); } // a is sorted }