Appeals for MoedB | |
| Appeals for MoedB were checked. You can take it starting from today noon at mazkirut. |
| פורסם ב-5/5/2003, 09:57:36 Created on 5/5/2003, 09:57:36 Создано5/5/2003, 09:57:36 تم النشر ب-5/5/2003, 09:57:36 |
Appeals submission | |
| The appeals submission is delayed till Monday 28/4 noon (12:00). |
| פורסם ב-24/4/2003, 10:10:14 Created on 24/4/2003, 10:10:14 Создано24/4/2003, 10:10:14 تم النشر ب-24/4/2003, 10:10:14 |
Appeals for Moed B | |
|
Note that no appeals will be accepted without a copy of the exam. Those who already submitted only the appeal form, please add the copy of the exam. Also I just checked - my mailbox is 209. So you can put there or in Benny's mailbox. Eli |
| פורסם ב-15/4/2003, 20:14:16 Created on 15/4/2003, 20:14:16 Создано15/4/2003, 20:14:16 تم النشر ب-15/4/2003, 20:14:16 |
Appeals for Moed Bet | |
|
Since I was just informed that I don't have a mailbox anymore, please put all your appeals in Benny's mailbox on the 5th floor (there is a list on the wall of all mailboxes). Eli |
| פורסם ב-14/4/2003, 17:17:32 Created on 14/4/2003, 17:17:32 Создано14/4/2003, 17:17:32 تم النشر ب-14/4/2003, 17:17:32 |
Appeals for Moed B | |
|
Those of you who want to submit an appeal: The appeals should be submitted in a written form to my mailbox on the 5th floor. No appeals will be accepted without a formal form (can be obtaiend in secretariat). The appeals should be submitted till 24/04. No appeals will be accepted afterwards. Note that the work load in checking of moed B was as follows: Q1a - Gyora Benedek Q1b, Q1c - Ran El-Yaniv Q1Bonus - Nader Bshouty Q2 - Eli Q3 - Yakov Q4a - Liran Q4b - Benny Please attend only the corresponding lecturer/assistant. Also note that in the case of Q2, which I (Eli) checked, the appeals will be accepted only in written form (since I don't come to the Technion almost at all). If your appeal will not be accepted and you will not be satisfied with the reply, I will try to manage a personal meeting for each of you. |
| פורסם ב-10/4/2003, 13:56:37 Created on 10/4/2003, 13:56:37 Создано10/4/2003, 13:56:37 تم النشر ب-10/4/2003, 13:56:37 |
Moed Bet grades are published | |
|
Moed Bet grades are now published. The exams will be in the secretariat starting from today (09/04). You can appeal only (!!!) during the next two weeks - till 24/04. Afterwards no appeals will be accepted. |
| פורסם ב-9/4/2003, 08:25:14 Created on 9/4/2003, 08:25:14 Создано9/4/2003, 08:25:14 تم النشر ب-9/4/2003, 08:25:14 |
Moed B grades | |
|
Due to personal reasons, the grades for moed B are not available yet. They will appear, hopefully, during this weekend or at the start of the next week. Sorry for the delay and for inconvenience it causes. |
| פורסם ב-7/4/2003, 17:02:06 Created on 7/4/2003, 17:02:06 Создано7/4/2003, 17:02:06 تم النشر ب-7/4/2003, 17:02:06 |
Reception hours for Moed B | |
| Eli will hold reception hours for Moed B on Thursday 13:00-14:00. |
| פורסם ב-19/3/2003, 14:33:29 Created on 19/3/2003, 14:33:29 Создано19/3/2003, 14:33:29 تم النشر ب-19/3/2003, 14:33:29 |
Reception hours for Moed B | |
| Nader will hold reception hours for Moed B on Wednesday 16:00-17:00. |
| פורסם ב-17/3/2003, 15:07:58 Created on 17/3/2003, 15:07:58 Создано17/3/2003, 15:07:58 تم النشر ب-17/3/2003, 15:07:58 |
Reception hours for Moed B | |
|
Liran will hold reception hours for Moed B on Thursday 14:00 - 15:00. Note that his room and phone have changed: room 307, phone 5543. |
| פורסם ב-17/3/2003, 14:19:27 Created on 17/3/2003, 14:19:27 Создано17/3/2003, 14:19:27 تم النشر ب-17/3/2003, 14:19:27 |
Reception hours for MoedB | |
|
Benny will hold reception hours for the Moed B on Monday 15:30-16:30 (today). Yakov will hold reception hours on Wednesday 15:00-16:00. Reception hours of Liran and Eli will be notified soon. |
| פורסם ב-17/3/2003, 08:16:19 Created on 17/3/2003, 08:16:19 Создано17/3/2003, 08:16:19 تم النشر ب-17/3/2003, 08:16:19 |
appeals | |
| The appeals for Moed A were checked and returned to the Mazcirot (undergraduate secretary office). |
| פורסם ב-11/3/2003, 16:50:35 Created on 11/3/2003, 16:50:35 Создано11/3/2003, 16:50:35 تم النشر ب-11/3/2003, 16:50:35 |
Moed A | |
|
The Moed A exam version was added to the site. You can find it under the tab of "Course Material" in "Previous Exams". |
| פורסם ב-4/3/2003, 08:46:58 Created on 4/3/2003, 08:46:58 Создано4/3/2003, 08:46:58 تم النشر ب-4/3/2003, 08:46:58 |
MoedA grades are published | |
|
MoedA grades are published. You can take a copy of your exam from secretary. The appealing deadline is till 03/03/03. Appeals should be supplied with a formal appealing form (can be taken in secretary). All appeals should be placed in Eli Pozniansky's mailbox on 5th floor. |
| פורסם ב-13/2/2003, 08:26:52 Created on 13/2/2003, 08:26:52 Создано13/2/2003, 08:26:52 تم النشر ب-13/2/2003, 08:26:52 |
Wet2 problems | |
|
For any problem related to Wet2 grades, send mail to stefan@cs Do not forget to include your student id in the message. |
| פורסם ב-10/2/2003, 11:19:31 Created on 10/2/2003, 11:19:31 Создано10/2/2003, 11:19:31 تم النشر ب-10/2/2003, 11:19:31 |
Appealing for wet2 grades | |
|
Regarding the appeals for wet2 grades: 1. We do NOT accept modification of the programs after they were checked. 2. Before appealing, you must check your program by using the main_check.c file and the five test inputs. You should compile the submitted files with main_check.c and library2.h, and then run the executable with each of the test file as input. For example, if the executable is a.out, then you should give the command a.out < t1.txt at the t2 prompt, for the first test. Repeat the testing procedure that we did, and if you think that your grade was not calculated correctly, you may appeal. 3. If you come to appeal, make sure to bring with you the checked dry part. We do NOT accept an appeal if: - it refers to modification of the submitted programs; - the program was not checked (with the five tests) by its authors prior to appeal; - it refers to the grading policy. Please do not come to appeal with these issues, it will be a waste of time. The special reception hours for wet2 appeals are as follows: Time: Tuesday 11/01, 17:00 - 18:00 Sunday 16/01, 17:00 - 18:00 Place: room 712, Taub CS |
| פורסם ב-9/2/2003, 15:15:18 Created on 9/2/2003, 15:15:18 Создано9/2/2003, 15:15:18 تم النشر ب-9/2/2003, 15:15:18 |
wet2 grading | |
|
The grading policy for wet2 is as follows: Dry part (min 0, max 50): - no printouts: -20 - O(n) instead of O(log(n)): -30 - poor explanation: -2. Many of you did not explain how you update the data when the data structure changes. This is crucial to prove that the validity of data is maintained. - function too long: -3. The update function in some works is very, very long (6-10 pages) and unreadable. Wet part (min 0, max 50): The programs were tested using a special main file and five input tests. For each input, the main program computes a number of errors.Let's denote these numbers by e_i (i=1,5). The grade for each test was determined as follows: If the program terminates, then g_i = max(0, 100 - e_i/f_i) else g_i = max(0, r_i - e_i/f_i) endif where r_i = 100*(the number of last input command processed / the total number of commands of test i) and f_1 = 2, f_2 = 3, f_3 = 7, f_4 = 10, f_5 = 30. The grade of the wet part is thus (g_1 + g_2 + g_3 + g_4 + g_5 ) / 10. The main file is called main_check.c and the tests files are t1.txt, t2.txt, t3.txt, t4.txt, and t5.txt. You can get them from the Assignments section of the web page. |
| פורסם ב-9/2/2003, 14:57:44 Created on 9/2/2003, 14:57:44 Создано9/2/2003, 14:57:44 تم النشر ب-9/2/2003, 14:57:44 |
Wet2 grades | |
| Wet2 grades are published. The grading and appeal policies will be announced soon. |
| פורסם ב-5/2/2003, 10:52:16 Created on 5/2/2003, 10:52:16 Создано5/2/2003, 10:52:16 تم النشر ب-5/2/2003, 10:52:16 |
The PC Farm in Taub Bldg | |
|
Dear CS students, My name is Prof. Chaim Gotsman, and I am Associate-Dean for Computing in the Computer Science Faculty. The PC Farm in Taub Bldg that you use regularly falls under my responsibility. I am conducting a small unofficial survey of satisfaction among the users of the PC farm - you. I'm interested in whether you are satisfied with the number of PC's, printers, etc, the level of service and maintenance of the hardware and software, the distribution among Windows and Unix machines, and anything else that is relevant to your work there. So if you have any information on these issues that you would like to share with me (positive or negative), I would be happy to receive it (by email) as soon as possible. Please do not hesitate to describe precise situations that you found yourself in and prevented you from using the PC Farm in an optimal manner. For example: You needed to print your homework assignment the day before the submission, and found that *none* of the printers in the Farm worked. Or you discovered that Word did not work on one of the PC's, reported it promptly to the CS Helpdesk, but it was still not working two weeks later. Needless to say, any information that you give me will be held in strict confidence, and will be used to improve the conditions in the PC Farm in coming semesters. Thanks in advance for your cooperation, Chaim Gotsman ugotsmanatcs.technion.ac.il |
| פורסם ב-3/2/2003, 18:58:13 Created on 3/2/2003, 18:58:13 Создано3/2/2003, 18:58:13 تم النشر ب-3/2/2003, 18:58:13 |
The promised tutorial for Wednesday's 15:30 group | |
|
The promised tutorial for Wednesday's 15:30 group won't take place for personal reasons and every question will be answered during reception hours on Sunday. |
| פורסם ב-29/1/2003, 12:49:12 Created on 29/1/2003, 12:49:12 Создано29/1/2003, 12:49:12 تم النشر ب-29/1/2003, 12:49:12 |
Reception hours before exam | |
|
The assistants will hold the following reception hours before the exam: Liran: Thursday 15:00-17:00 Eli: Sunday 9:00-11:00 Yakov: Sunday 12:00-14:00 Benny: Sunday 14:00-16:00 We remind you that the exam will take place on Monday 03/02 at 8:00 in Ulman 600, 604-606, 701-709. It will be 2.5 hours long. Good luck. |
| פורסם ב-27/1/2003, 17:36:29 Created on 27/1/2003, 17:36:29 Создано27/1/2003, 17:36:29 تم النشر ب-27/1/2003, 17:36:29 |
Dry2 Solutions | |
|
Solutions for dry2 are published. These are students' works that were highly graded. The Q3 and Q4 were checked as well, and they appear to be correct. You can download the solutions form the Assignments tab. |
| פורסם ב-27/1/2003, 10:41:16 Created on 27/1/2003, 10:41:16 Создано27/1/2003, 10:41:16 تم النشر ب-27/1/2003, 10:41:16 |
Dry1 solution | |
| You can find it under the assignment section. |
| פורסם ב-27/1/2003, 00:04:38 Created on 27/1/2003, 00:04:38 Создано27/1/2003, 00:04:38 تم النشر ب-27/1/2003, 00:04:38 |
Exam - clarification | |
|
The exam will be with open material. You can bring lectures and recitations brochures, books, your HWs and anything that is not electronical equipment (calculator is allowed). The duration will be (probably) 2.5 hours with 4 questions (one is american style). Good luck. |
| פורסם ב-23/1/2003, 11:54:28 Created on 23/1/2003, 11:54:28 Создано23/1/2003, 11:54:28 تم النشر ب-23/1/2003, 11:54:28 |
Wet2 delayed again | |
|
Due to endless requests, I delay wet2 by additional day. This is final - 23/01/03 12:00 noon |
| פורסם ב-21/1/2003, 23:09:45 Created on 21/1/2003, 23:09:45 Создано21/1/2003, 23:09:45 تم النشر ب-21/1/2003, 23:09:45 |
Wet1 resubmission | |
|
The resubmitted files have been checked. if you have not resubmitted Please check the your grade is not effected if you have resubmitted Please check the your grade is updated correctly. |
| פורסם ב-21/1/2003, 13:32:48 Created on 21/1/2003, 13:32:48 Создано21/1/2003, 13:32:48 تم النشر ب-21/1/2003, 13:32:48 |
Wet2 is postponed by additiona day | |
| Wet2 is postponed by additional day - till 22/01/03 12:00 (noon) |
| פורסם ב-20/1/2003, 09:24:19 Created on 20/1/2003, 09:24:19 Создано20/1/2003, 09:24:19 تم النشر ب-20/1/2003, 09:24:19 |
Wet2 Postponed | |
| Wet2 is postponed by one day - till 21/01/03 12:00 (noon). |
| פורסם ב-19/1/2003, 18:08:33 Created on 19/1/2003, 18:08:33 Создано19/1/2003, 18:08:33 تم النشر ب-19/1/2003, 18:08:33 |
Solving Lights Out with BFS | |
|
Since Gyora finished all the material, he decided to give an extra lecture - "Solving Lights Out with BFS". The presentation can be foudn at the "Material" tab. |
| פורסם ב-19/1/2003, 15:15:13 Created on 19/1/2003, 15:15:13 Создано19/1/2003, 15:15:13 تم النشر ب-19/1/2003, 15:15:13 |
Wet2: month zero | |
|
You should not worry about whether or not zero is a legal value for a month or a worker id. If you need to use zero as a legal month, then use it. If you need to use zero for a special purpose (not a month number), then again use it as such. The input test will not contain zero as a month number (or worker id), so this will not generate errors. The focus of the exercise is not on defining and then checking legal input. Most of the test input will be legal and the illegal lines will refer to general (and clearly illegal) cases, and not to limit cases, or disputable particularities. |
| פורסם ב-15/1/2003, 11:05:39 Created on 15/1/2003, 11:05:39 Создано15/1/2003, 11:05:39 تم النشر ب-15/1/2003, 11:05:39 |
wet2 Fire | |
|
An answer was mistakenly added to the Wet2 FAQ, saying that a worker can be fired more than once. That item has been removed from the FAQ. To clarify this point: the same worker cannot be fired more than once. |
| פורסם ב-15/1/2003, 10:47:20 Created on 15/1/2003, 10:47:20 Создано15/1/2003, 10:47:20 تم النشر ب-15/1/2003, 10:47:20 |
Wet2 faq | |
| Several items on Wet2 were added to the FAQ section of the course web site. Please visit them. |
| פורסם ב-15/1/2003, 07:20:47 Created on 15/1/2003, 07:20:47 Создано15/1/2003, 07:20:47 تم النشر ب-15/1/2003, 07:20:47 |
Wet2 - additional reception hour | |
| Stefan will hold a special reception hour for Wet2 on Wednesday, 15/01, 16:00 - 17:00, at Taub 712. |
| פורסם ב-14/1/2003, 09:52:14 Created on 14/1/2003, 09:52:14 Создано14/1/2003, 09:52:14 تم النشر ب-14/1/2003, 09:52:14 |
Dry1 grading | |
|
Q1 - 40%, Q2 - 30%, Q3 - 30% (Q4 -was not checked) |
| פורסם ב-13/1/2003, 01:01:33 Created on 13/1/2003, 01:01:33 Создано13/1/2003, 01:01:33 تم النشر ب-13/1/2003, 01:01:33 |
change in library2.h - relevant to C++ users | |
|
Please take the new version of library2.h _cplusplus was replaced by __cplusplus (two underscores instead of one). |
| פורסם ב-12/1/2003, 18:54:12 Created on 12/1/2003, 18:54:12 Создано12/1/2003, 18:54:12 تم النشر ب-12/1/2003, 18:54:12 |
Wet2 questions | |
| Please read carefully the exercise (particularly the example within) before sending questions to Stefan. He will not answer questions (sent by e-mail) whose answers can be READILY seen in the exercise pages. |
| פורסם ב-11/1/2003, 19:25:20 Created on 11/1/2003, 19:25:20 Создано11/1/2003, 19:25:20 تم النشر ب-11/1/2003, 19:25:20 |
Wet2 implementation | |
| Remember that Wet2 is also a programming exercise. Thus, you should implement all data structures by yourselves. It is not allowed to use STL or implementations found on the Internet or elsewhere. |
| פורסם ב-11/1/2003, 19:16:28 Created on 11/1/2003, 19:16:28 Создано11/1/2003, 19:16:28 تم النشر ب-11/1/2003, 19:16:28 |
Dry2 grading | |
| Q1 - 35%, Q2 - 25%, Q3 - 15%, Q4 - 25% |
| פורסם ב-10/1/2003, 23:41:05 Created on 10/1/2003, 23:41:05 Создано10/1/2003, 23:41:05 تم النشر ب-10/1/2003, 23:41:05 |
Dry1 and Dry2 grades are published | |
|
The grades for Dry1 and Dry2 are published. The works will be returned at the beginning of the next week. Dry1 will be returned on Sunday. Dry2 will be returned on Monday. Please come to appeal only (!!!) during the next two weeks. No appeals will be accepted afterwards. The appeals for Dry1 should be discussed only (!!!) with Benny at his regular reception hours. The appeals for Dry2 should be discussed only (!!!) with me (Eli) at the following times: 1) Monday (sheni) 10:30-11:30 (my regular reception hours) 2) Wednesday (reviyi) 9:30-11:30 At other times I will not be in the office. Eli |
| פורסם ב-10/1/2003, 23:33:45 Created on 10/1/2003, 23:33:45 Создано10/1/2003, 23:33:45 تم النشر ب-10/1/2003, 23:33:45 |
Wet2 Postponed | |
| Wet2 is postponed till 20/1/03 12:00 (noon). |
| פורסם ב-10/1/2003, 20:58:18 Created on 10/1/2003, 20:58:18 Создано10/1/2003, 20:58:18 تم النشر ب-10/1/2003, 20:58:18 |
wet1 | |
| Grades changed to some of the student, due to a bug in the partial grading system, it is now fixed !. |
| פורסם ב-8/1/2003, 15:42:50 Created on 8/1/2003, 15:42:50 Создано8/1/2003, 15:42:50 تم النشر ب-8/1/2003, 15:42:50 |
wet2 hint | |
|
Try first to solve the following (easier) problem: Assume that after n successful Hire operations all the relevant month numbers are stored in a simply linked list in increasing order. Find the highest pay in O(n). Then split the list in two lists. Find the highest pay for each of the two lists INDEPENDENTLY of one another. Now you have two maximum payments. See how you can compute the highest pay for the whole initial list by using the two separate results from the sub-lists. You may additional information for each of the sub-lists. |
| פורסם ב-8/1/2003, 13:49:07 Created on 8/1/2003, 13:49:07 Создано8/1/2003, 13:49:07 تم النشر ب-8/1/2003, 13:49:07 |
Wet1 - grade (wet) | |
|
The grade Wet1Wet is from 0 to 50. Thus the total grade of wet1 is calculated by Wet1Dry/2 + Wet1Wet |
| פורסם ב-8/1/2003, 13:02:10 Created on 8/1/2003, 13:02:10 Создано8/1/2003, 13:02:10 تم النشر ب-8/1/2003, 13:02:10 |
Wet1 - grade | |
| The grade that you see on your work (that can be taken from mazkirut) is only for the dry part of Wet1. |
| פורסם ב-8/1/2003, 12:59:41 Created on 8/1/2003, 12:59:41 Создано8/1/2003, 12:59:41 تم النشر ب-8/1/2003, 12:59:41 |
Wet1 - Appeal | |
|
All of you who want to appeal, please do this till the end of the next week. No appeals will be accepted afterwards. All of you who think that changing one-two lines in the code will make your program run correctly, can resubmit the work (by email to Liran). However you should understand two things: 1) We will run diffs between the version you submit and the version we have saved. If there are more than 3 lines that differ, the resubmission will not be accepted. 2) If the program runs correctly after the changes (at least more correctly than the one you submitted at the first place), your wet grade will be calculated as an average between the old wet grade and the new wet grade. Thus you will not be fully graded after resubmission - it was your task to ensure that the program runs correctly before submitting it. Eli |
| עדכון אחרון ב-8/1/2003, 12:30:38 Last updated on 8/1/2003, 12:30:38 Последняя модификация8/1/2003, 12:30:38 تمت الحتلنة الأخيرة ب-8/1/2003, 12:30:38 |
wet1 | |
| Due to many requests, the dry part of the grade is published in Wet1Dry colomn. |
| פורסם ב-7/1/2003, 17:17:38 Created on 7/1/2003, 17:17:38 Создано7/1/2003, 17:17:38 تم النشر ب-7/1/2003, 17:17:38 |
wet1 | |
|
Due to many E-mail I got, the input and the correct ! output files are published. Before E-mailing Me (Liran) check that your program runs correctly on these output files. The files can be found in ~cs234218/wet1/*.txt Or in the assignment section. |
| פורסם ב-7/1/2003, 16:16:44 Created on 7/1/2003, 16:16:44 Создано7/1/2003, 16:16:44 تم النشر ب-7/1/2003, 16:16:44 |
Recitation #23 from today (7/1/03 10:30-11:30 Ullman 503) | |
|
I appologize for the unannounced cancelation of recitation #23 from today (7/1/03 10:30-11:30 Ullman 503). A complementry recitation will be held on Sunday (12/1/03) 1630-1730 in Taub 5 (this is supposed to a free hour for all of you). You can also come to my other recitation today (7/1) at 17:30-18:30 in Taub 6. If someone cannot come to neither of the recitations please send me a mail ASAP and we'll find a proper solution. Benny. |
| פורסם ב-7/1/2003, 11:52:44 Created on 7/1/2003, 11:52:44 Создано7/1/2003, 11:52:44 تم النشر ب-7/1/2003, 11:52:44 |
wet2 answer | |
|
Question: Is it possible to fire a worker several times ? Answer: No. Function Fire should fail and return -1 if the worker was already fired once. |
| פורסם ב-7/1/2003, 11:49:47 Created on 7/1/2003, 11:49:47 Создано7/1/2003, 11:49:47 تم النشر ب-7/1/2003, 11:49:47 |
wet1 checked | |
|
Wet1 is checked. The submitted works were very good, the median was 98. Most of the students got 100. If there is any problem with the grade contact Liran. |
| פורסם ב-7/1/2003, 00:04:23 Created on 7/1/2003, 00:04:23 Создано7/1/2003, 00:04:23 تم النشر ب-7/1/2003, 00:04:23 |
wet2 answer | |
|
Question: Is the number of months bounded? In other words, can I assume that the number of months is O(1)? Answer: No. |
| פורסם ב-6/1/2003, 17:26:23 Created on 6/1/2003, 17:26:23 Создано6/1/2003, 17:26:23 تم النشر ب-6/1/2003, 17:26:23 |
Wet2 - update | |
|
A line is missing from the example. Just before the last HighestPay and after Hire 7, 30, 36, 6000, it should be ChangeSalary 3, 28, -2000. The exercise files are updated accordingly. |
| פורסם ב-4/1/2003, 11:57:39 Created on 4/1/2003, 11:57:39 Создано4/1/2003, 11:57:39 تم النشر ب-4/1/2003, 11:57:39 |
Wet2 - Update | |
|
The file ~cs234218/wet2/main2.c was updated (some obvious bugs were fixed). Please take the new version. |
| פורסם ב-2/1/2003, 17:44:09 Created on 2/1/2003, 17:44:09 Создано2/1/2003, 17:44:09 تم النشر ب-2/1/2003, 17:44:09 |
Reminder - Recitation #32 is moved on 1/1/03 | |
|
On 1/1/03 the recitation #32 (Ullman 104) will take place at 13:30-14:30 (instead of 8:30-9:30) The topic - Heaps. |
| פורסם ב-31/12/2002, 12:12:44 Created on 31/12/2002, 12:12:44 Создано31/12/2002, 12:12:44 تم النشر ب-31/12/2002, 12:12:44 |
Reminder - Recitation #32 is moved on 1/1/03 | |
|
On 1/1/03 the recitation #32 (Ullman 104) will take place at 13:30-14:30 (instead of 8:30-9:30) The topic - Heaps. |
| פורסם ב-31/12/2002, 12:11:49 Created on 31/12/2002, 12:11:49 Создано31/12/2002, 12:11:49 تم النشر ب-31/12/2002, 12:11:49 |
Wet2 | |
|
Wet2 is published! Submission day is 16/01/03 12:00 (noon). Please send all your questions concerning Wet2 to Stefan Resmerita (ustefanatcs.technion.ac.il) |
| פורסם ב-26/12/2002, 13:47:20 Created on 26/12/2002, 13:47:20 Создано26/12/2002, 13:47:20 تم النشر ب-26/12/2002, 13:47:20 |
Dry2 - Q1 | |
|
Question: What is "linear order"? Answer: The linear order means that the elements are ordered as if they were in a linked list, according to the order of Inseret/Delete. In Q1c you need to simulate this order, so that all operations take O(lg n) in the worst case. Example of linear order: Insert(NULL, k1) k1 p = Find(k1) Insert(p, k2) k1->k2 p = Find(k2) Insert(p, k3) k1->k2->k3 p = Find(k2) Insert(p, k4) k1->k2->k4->k3 |
| פורסם ב-24/12/2002, 12:11:06 Created on 24/12/2002, 12:11:06 Создано24/12/2002, 12:11:06 تم النشر ب-24/12/2002, 12:11:06 |
Dry2 - Q4a | |
|
Question: Do we need to implement Insert/Delete in Q4a? Answer: NO!!!!!!!! Only inverts are necessary. No one will access the matrix directly. |
| פורסם ב-24/12/2002, 12:06:18 Created on 24/12/2002, 12:06:18 Создано24/12/2002, 12:06:18 تم النشر ب-24/12/2002, 12:06:18 |
Dry2 - Q1c | |
|
To all of you for whom this was not yet clear: In Q1 you can compare between the keys. Thus, for example, you can build a binary search tree consisting of the keys. |
| פורסם ב-19/12/2002, 13:56:15 Created on 19/12/2002, 13:56:15 Создано19/12/2002, 13:56:15 تم النشر ب-19/12/2002, 13:56:15 |
Dry2 - Q1c | |
|
Question: Can I give each element a value, and when I insert an element between two elements I'll give it the average of their values? Answer: No! The precision unit is limited. If we talk about floats (or even doubles) - how many times one can divide by 2 before getting 0? Obviously limited number of times, while N (the number of elements) is not limited. |
| עדכון אחרון ב-18/12/2002, 20:11:28 Last updated on 18/12/2002, 20:11:28 Последняя модификация18/12/2002, 20:11:28 تمت الحتلنة الأخيرة ب-18/12/2002, 20:11:28 |
Dry2 postponed | |
| Dry2 is postponed to Sunday 29/12/02 12:00 (noon) |
| פורסם ב-18/12/2002, 16:54:25 Created on 18/12/2002, 16:54:25 Создано18/12/2002, 16:54:25 تم النشر ب-18/12/2002, 16:54:25 |
Recitation #32 will be moved on 1/1/03 | |
| On 1/1/03 the recitation #32 (Ullman 104) will take place at 13:30-14:30 (instead of 8:30-9:30) |
| פורסם ב-18/12/2002, 10:15:26 Created on 18/12/2002, 10:15:26 Создано18/12/2002, 10:15:26 تم النشر ب-18/12/2002, 10:15:26 |
Dry2 - clarifications | |
|
Q1: You can add whatever fields you want to the "basic elements" defined in the question. Q2a: The proof you give, should not be 100% formal. However, the idea must be clear. It is possible to prove the requested in less than 10 lines of text. Use drawings if it helps. Q4a: You are not required to implement Insert or Delete. Only inverts. Q4b: Note that the 'd' can be negative. |
| פורסם ב-16/12/2002, 11:08:35 Created on 16/12/2002, 11:08:35 Создано16/12/2002, 11:08:35 تم النشر ب-16/12/2002, 11:08:35 |
Question for Dry2: In Q3, what is the meaning of the key? | |
|
Answer: The tree is ordered both by a key and by a priority. By the key it's a binary search tree (i.e., the bigger key goes to the right son) and by priority it's a heap. |
| פורסם ב-13/12/2002, 18:28:14 Created on 13/12/2002, 18:28:14 Создано13/12/2002, 18:28:14 تم النشر ب-13/12/2002, 18:28:14 |
Wet1 | |
| Those of you who were unable to submit come to Liran's office as soon as possible. |
| פורסם ב-12/12/2002, 15:41:13 Created on 12/12/2002, 15:41:13 Создано12/12/2002, 15:41:13 تم النشر ب-12/12/2002, 15:41:13 |
Wet1 | |
| Wet1 Hard copies have been collected |
| פורסם ב-12/12/2002, 15:40:27 Created on 12/12/2002, 15:40:27 Создано12/12/2002, 15:40:27 تم النشر ب-12/12/2002, 15:40:27 |
Dry2 files were corrupted | |
| I replaced the files for dry2. They were corrupted. The DOC file is now in Word97 format. |
| פורסם ב-11/12/2002, 11:17:47 Created on 11/12/2002, 11:17:47 Создано11/12/2002, 11:17:47 تم النشر ب-11/12/2002, 11:17:47 |
Dry2 is published | |
|
As many students, which already finished the wet1, asked me, I'm publishing the dry2 work today. Due date: 25/12/2002, 12:00 (noon) |
| פורסם ב-11/12/2002, 09:39:32 Created on 11/12/2002, 09:39:32 Создано11/12/2002, 09:39:32 تم النشر ب-11/12/2002, 09:39:32 |
Wet1 due date changed | |
| Wet1 due date changed to the 12/Dec/2002 at 12:00. |
| פורסם ב-3/12/2002, 16:43:33 Created on 3/12/2002, 16:43:33 Создано3/12/2002, 16:43:33 تم النشر ب-3/12/2002, 16:43:33 |
Wet1 E-mails | |
| If your mail was not answered, the answer appears in the F.A.Q. or the news web pages. |
| פורסם ב-1/12/2002, 18:12:25 Created on 1/12/2002, 18:12:25 Создано1/12/2002, 18:12:25 تم النشر ب-1/12/2002, 18:12:25 |
Wet1 - update | |
| result1.txt updated |
| פורסם ב-1/12/2002, 17:52:35 Created on 1/12/2002, 17:52:35 Создано1/12/2002, 17:52:35 تم النشر ب-1/12/2002, 17:52:35 |
Wet1 - memory complexity | |
|
The following announcement was wrongly published several days ago: ############################################# In Init function only O(1) additional memory can be used. But not only this (and this was the intention from the beginning) - we require that at any given moment (after any operation was completed and before the other was not yet started) the memory requirements of the program are N*sizeof(arrayType) + O(1) global variables. This, for example, means that you can not create additional linked list as elements are Inserted and Deleted. This requirement is higly essential. A work that will not stand it, will be low graded!!!!!! ############################################# This is of course NOT CORRECT. You have to store somewhere some of your intermediate results. However, the Init function should still allocate only the array + O(1) memory, and you sill cannot create dynamic linked lists as elements are Inserted and Deleted, since otherwise you will not be able to free all the memory in Quit in O(1). The old erroneous announcement was deleted. |
| פורסם ב-28/11/2002, 14:36:40 Created on 28/11/2002, 14:36:40 Создано28/11/2002, 14:36:40 تم النشر ب-28/11/2002, 14:36:40 |
Wet1 about SumMaxRange | |
|
The range length is defined by to-from thus empty space do affect the length of the range e.g. 5 6 7 -100 9 blank blank 9 should return [0,2] and NOT [4,7] |
| עדכון אחרון ב-28/11/2002, 14:30:21 Last updated on 28/11/2002, 14:30:21 Последняя модификация28/11/2002, 14:30:21 تمت الحتلنة الأخيرة ب-28/11/2002, 14:30:21 |
Wet1 About Sorted array | |
|
Wet1 You should allocate the array your self (O(m) space complexity) you should not use it in any of the other function. Once sort is called again the old array can ( and should ) be freed, and a new one should be allocated. After the array is printed in parser function it is not used by OUR main again. In Quit don't forget to free everything that was not freed yet |
| פורסם ב-28/11/2002, 13:58:30 Created on 28/11/2002, 13:58:30 Создано28/11/2002, 13:58:30 تم النشر ب-28/11/2002, 13:58:30 |
Wet1 Update | |
|
The policy of SumMaxRange has changed again(hopefully for the last time). Choose the range with maximum sum. If there are more than one choose the shortest one. If there are several shortest maximum sum ranges choose the first. Check the F.A.Q. for examples. Sorry for the inconvenience. |
| עדכון אחרון ב-26/11/2002, 19:24:21 Last updated on 26/11/2002, 19:24:21 Последняя модификация26/11/2002, 19:24:21 تمت الحتلنة الأخيرة ب-26/11/2002, 19:24:21 |
Wet 1 Clarifications | |
|
In Init function only O(1) additional memory can be used. There must be only one array of type arrayType of size N. i.e. arrayType A[N] !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! This is most important. All other implementation will not get graded at all !!!!!!!!!!!!!!!!!!!!!! No additional data structures should be allocated In Init. However, for the other operations (like Sort, NumInRange, etc.) you can allocate additional memory according to the restrictions posed by the operations. Note that the Quit function requires O(1) time and space complexity. |
| פורסם ב-26/11/2002, 18:19:39 Created on 26/11/2002, 18:19:39 Создано26/11/2002, 18:19:39 تم النشر ب-26/11/2002, 18:19:39 |
Wet1 - Important | |
| Note that Quit must work in O(1) time and space complexity, so using dynamic linked list (with pointers) will not work since it will take O( size of the list ) time to free its allocated memory. |
| פורסם ב-25/11/2002, 17:44:58 Created on 25/11/2002, 17:44:58 Создано25/11/2002, 17:44:58 تم النشر ب-25/11/2002, 17:44:58 |
Wet1 - Update | |
|
Please read the updated file of wet1.{doc, ps, pdf} it includes more detailed information, and it will answer most of your questions. Note that if you send an e-mail with a question to Liran, and he does not reply, the answer will appear in the F.A.Q. Please check the updated F.A.Q. |
| פורסם ב-25/11/2002, 17:43:00 Created on 25/11/2002, 17:43:00 Создано25/11/2002, 17:43:00 تم النشر ب-25/11/2002, 17:43:00 |
Wet1 - update | |
| library1.h was updated, for all you cpp users. |
| פורסם ב-21/11/2002, 13:48:33 Created on 21/11/2002, 13:48:33 Создано21/11/2002, 13:48:33 تم النشر ب-21/11/2002, 13:48:33 |
Wet1 - correction | |
|
As some of you probably noticed, there is a minor problem with the space complexity of Sort. The array B must contain m elements, which are not included in the additional space requirements. Therefore, the requirements for Sort are slightly changed: Sort should use O(m) space complexity for the output (array B) and O(|k|) additonal space complexity during the sorting itself. |
| עדכון אחרון ב-21/11/2002, 10:40:34 Last updated on 21/11/2002, 10:40:34 Последняя модификация21/11/2002, 10:40:34 تمت الحتلنة الأخيرة ب-21/11/2002, 10:40:34 |
Wet1 - FAQ | |
|
We have misguided some of you about what the 'Init' function is allowed to do. This might answer your questions: Q: In Init function, can addtional memory be used? A: Only O(1) additional memory can be used. There must be only one array of type arrayType of size N. No additional data structures should be allocated. However, for the other operations (like Sort, NumInRange, etc.) you can allocate additional memory according to the restrictions posed by the operations. |
| פורסם ב-20/11/2002, 16:13:00 Created on 20/11/2002, 16:13:00 Создано20/11/2002, 16:13:00 تم النشر ب-20/11/2002, 16:13:00 |
Wet1 update | |
|
Please download the newer version. Press F5 (refresh) just to be sure. |
| פורסם ב-18/11/2002, 17:33:42 Created on 18/11/2002, 17:33:42 Создано18/11/2002, 17:33:42 تم النشر ب-18/11/2002, 17:33:42 |
Wet1 is published | |
|
Wet1 is published. You can download it from "Assignments" tab. The deadline for submission is 09/12 12:00 (noon). |
| פורסם ב-18/11/2002, 12:14:59 Created on 18/11/2002, 12:14:59 Создано18/11/2002, 12:14:59 تم النشر ب-18/11/2002, 12:14:59 |
Recitation #23 - Room Changed | |
| The recitation #23 Tuesday (gimel) 10:30-11:30 has moved from Ullman 706 to 503 |
| פורסם ב-7/11/2002, 12:37:07 Created on 7/11/2002, 12:37:07 Создано7/11/2002, 12:37:07 تم النشر ب-7/11/2002, 12:37:07 |
Recitation #12 - Room Changed | |
| The recitation #12 Sunday (alef) 14:30-15:30 has moved from Ullman 304 to 303 |
| פורסם ב-6/11/2002, 13:18:20 Created on 6/11/2002, 13:18:20 Создано6/11/2002, 13:18:20 تم النشر ب-6/11/2002, 13:18:20 |
Dry1 is published | |
|
Dry1 is published. You can download it from "Assignments" tab in three formats - DOC, RTF and PS. The deadline for submission is 18/11 12:00 (noon). |
| פורסם ב-3/11/2002, 10:13:01 Created on 3/11/2002, 10:13:01 Создано3/11/2002, 10:13:01 تم النشر ب-3/11/2002, 10:13:01 |
Second Recitation | |
|
Due to a fact that one week was missed because of assistants' strike, you are kindly requested to complete recitation #2 (about arrays) by yourself. It's very easy material and some of it was presented in lecture, so you'll experience no problems reading it. Next week we will teach recitation #3 - recurrences (the handwrited pages in recitation's brochure). |
| עדכון אחרון ב-30/10/2002, 13:49:55 Last updated on 30/10/2002, 13:49:55 Последняя модификация30/10/2002, 13:49:55 تمت الحتلنة الأخيرة ب-30/10/2002, 13:49:55 |
Strike is over!!! | |
| The strike is over!!! All the recitations will start from Sunday (today, Wednesday, is already too late). |
| פורסם ב-23/10/2002, 08:48:43 Created on 23/10/2002, 08:48:43 Создано23/10/2002, 08:48:43 تم النشر ب-23/10/2002, 08:48:43 |
Happy new semester | |
|
Happy new semester! This is the first official mail from the "Data Structures 1" course stuff. Each student registered to the course, should get this mail. If somebody doesn't get it, then he is most probably not registered. Anyway, if you know about some of your friends registered to the course, which didn't get this mail, please inform them to register through the "Auto Update" feature appearing at the homepage. All information you need, appears at http://webcourse.technion.ac.il/234218. The lectures' slides and recitations' slides can be downloaded and printed from the site or obtained at Mihlol store. In addition all announcements, notifications, changes and etc. will be published on the web and through this mailing list. It's your responsibility to be updated and to check from time to time for new information posted on the web. Additional service that the home page suggests is partner finding. Remember - one brain is good, but two are better. Thus, statistically, works submitted in pairs get higher grades. Last thing - I want to inform you is that there will be no recitations during the first week of the semester (including next Sunday). I wish luck to all of you in the upcoming semester, Eli Pozniansky |
| פורסם ב-13/10/2002, 19:06:03 Created on 13/10/2002, 19:06:03 Создано13/10/2002, 19:06:03 تم النشر ب-13/10/2002, 19:06:03 |