بســم الله الـرحمــن الرحيــم
اخوانى الاعضاء اريد مساعدة فى عمل قاموس
console application
و ايضا
windows application
و كيفية ربط البرنامج بقاعدة بيانات اكسيس
---------------------------------------
و ايضا اريد عمل القاموس بهذة المواصفات
Build and maintain a data structure to efficiently locate, insert, or delete the record associated with any query q.
Implement dictionary using data structure from the list below:
A. Unsorted linked lists or arrays-for small data sets, say up to 10 to 20 items, an unsorted array is probably the easiest and most efficient data structure to maintain. They are easier to work with than linked lists, and if the dictionary will kept this small, you cannot possibly save a significant amount of space over allocating a full array .if your dictionary will be too much larger, search time will kill you in either case.
B. A particularly interesting and useful variant is a self-organizing list.
When ever a key is accessed or inserted, always move it to head of the list.
Thus if the key is accessed again in the near future, it will be near the front and so require only a short search to find it .since most applications exhibit both uneven access frequencies and locality of reference, the average search time for a successful search in a self-organizing list is typically much better than in assorted or unsorted list.
Of course, self-organizing data structure can be built from arrays as well as linked lists.
C. Sorted linked lists or arrays- Maintaining a sorted linked list is usually not worth the effort (unless you can are trying to eliminate duplicates), since we cannot perform binary search in such a data structure. A sorted array will be appropriate if and only if there are not insertion or deletions. When the array gets so large that it doesn't fit in real memory, think b-tree instead.
--------------------------------------
ارجو المساعدة منكم
وشكرا لكم