Data Structures

Dear Students…

Mid#2 will be on Mon 18/1/1431H (4/Jan/2010) from 3:00 PM to 5:00 PM.

csc212 Announcements, Calendar

Dear Students…

Quiz#2 has been postponed to Tuesday 21/12/1430H from 12:15 To 12:45.

csc212 Announcements, Calendar

For those of you who have an old version of the problem and kept asking what is ‘heap sort’. The question actually is:

2.      Write a program to compare the performance of two sorting techniques:

·         Insertion sort

·         Quicksort

 

Your program should provide the user with a menu of 4 items:

1. Test insertion sort: where the user can enter 15 integers to be sorted using insertion sort
2. Test quicksort: where the user can enter 15 integers to be sorted using quicksort
3. Compare performance: where the program outputs a table of timing values for the following cases for each type of sorting:

·         An array of 1000 elements filled with integer values sorted in ascending order

·         An array of 1000 elements filled with integer values in random order

·         An array of 1000 elements filled with integer values sorted in descending order

 

·         An array of 100000 elements filled with integer values sorted in ascending order

·         An array of 100000 elements filled with integer values in random order

·         An array of 100000 elements filled with integer values sorted in descending order

 

·         An array of 10000000 elements filled with integer values sorted in ascending order

·         An array of 10000000 elements filled with integer values in random order

·         An array of 10000000 elements filled with integer values sorted in descending order

1. Exit: to exit the program

 

Notes:

• the quicksort should use median-of-three method for pivot selection and should use insertion sort for partitions of 10 elements or less.
• during comparison, both algorithms should be performed on the same data.

 

Bonus: in the comparison option:

• Allow the user to enter a number X from 1-1000.
• Repeat each case X times.
• Display the average time for each case for each sorting method.

 

csc212 غير مصنف

Dear students, Sheet 5 has been updated. Please download the updated sheet and hand in your solutions next Saturday 14-Nov-2009.

Good luck.

csc212 Announcements, Assignments

Dera students..

Due to the emails I have recieved which indicate that you have extra network lecture from 12p.m to 1p.m, I have changed the tutorial time to be 1p.m-3p.m. I hope it is suitable for every one.

Regards..

csc212 Announcements

Dear students..

your coming tutorial(Sat 7-Nov) will be from 12:00p.m-2:00p.m (two hours) instead of 1:00p.m-2:00p.m. If you have a problem with this time please email:

a.al-thnian@hotmail.com

thanks..Al-Hanoof

csc212 غير مصنف

Midterm#1

• Date and Time: Sunday 20\11\1430H  From 3:00 To 4:30 
• Contents: Until end of CH12
• Rooms: 
  • Room#17: Dr.Nadia’s section + I.Entesar’s section
  • Room#49: I.Maha’s sections + I.Samira’s section

*Please do not forget to print and bring the ADTs Specifications (write your name ONLY on it)

csc212 Announcements

We expect you to hand sheet 4 next week as usual (7th of November). Problem 2 in sheet 4 should be handed fully coded with a running application a week after (14th of November) with sheet 5 en sha’ Allah. Please abide by all the policies mentioned in the Policies page.

Good luck.

csc212 Announcements, Assignments

Dear Students

Please Print these ADT Specifications and bring it during your exams (write your name on it and nothing else!!)

csc212 Announcements

Please check Calender Page for the new dates of your exams.

csc212 Calendar