Assessment 1 includes IO (lecture 7) + Assembly 1 (Lecture 8) + Assembly 2 (Lecture 9) Assessment 2 includes IO in Assembly (lecture 10) + CPU 1 (Lecture 11) + CPU 2 (Lecture 12)
Assessment 1 will cover the first three online lectures and Assessment 2 will cover the other three. Note that HTML, CSS and JavaScript may be included as part of the tests.
I hope everybody is fine. The upcoming on-line assessments will respectively cover (i) shift-reduce parsing (Lecture 5) and (ii) LR(1) parsing (Lecture 7). The duration of these assessments will be 15 minutes.
due date is now Friday March 6th, 11:50PM.
We will have it on Tuesday Dec. 10th, 5th slot in H3 and H5. Tuesday lecture students should go to H3. Wednesday lecture students should got to H5. Topics are recurrence tree and master methods (master method gap cases and Akra-bazzi not included). I will pick best 3 of 5 quizzes.
Based on the Facebook poll result that ended last night at 8PM, I am postponing the due date to Nov. 2nd., 11PM.
When calling the update method, if the clustering key is a polygon, the second parameter will pass it as: "(10,20),(30,30),(40,40),(50,60)" You can use Java's StringTokenizer to process such a string.
https://drive.google.com/file/d/1IiEYmmn2MmGSdPTnd3kvWJrM_e6nxocx/view?usp=sharing
Due to the extension of midterms by 1 day, the quizzes schedule has to be modified to ensure that both lectures are taking the quiz at the same week and you have taken the required tutorials. Your quiz 3 which was scheduled on the 7th lecture will be moved to the 9th lecture (i.e. It will be on 12th and 13th of November lectures). The quiz will be on asymptotic analysis.
moved to Nov. 3rd 11:55PM.
Deadline moved to Dec 19th Thursday 11:50PM. Email me a link to your submission before then.
Due to excessive confusion about this issue, I am waiving it from milestone 1. However, it is required for milestone 2.
Not included in final exam.
Regarding the two design problems: the problem statements have been made quite concise with no constraints to enable you to come up with the solution! For example, I did not specify how your algorithm will perform in relation to known ones. So, in sorting, you can do it in worse n log n. Also, I did not specify how your algorithm will be invoked. For example, in sorting again you can load all the data first then do the sorting later on and you do not have to sort the whole data, it might just sort portions of the data that the client code will request access to etc.. For balancing a binary search tree, a randomized approach should involve rolling a dice among a set of balancing options and balancing the part that comes out and consequently analyzing the effect of that. That's just one approach. We will accept submissions of the assignment from Dec 15th 11:50PM to Dec 22nd 11:50PM!
I've added few clarifications to answer most common questions to the doc. Updates are highlighted in red. Please, re-download. Also, check Piazza for answers to your questions.
to December 15th.
To those who were absent on a quiz and I have given permission to take a substitute quiz instead. Come after the Analysis final to the TA office to take that.
3 questions: each has 2 unrelated problems. 1. Divide and conquer design (20/60), 1. Greedy Design (20/60), Dynamic Programming Design (20/60)
mac users try this: http://blog.terasic.com/running-quartus-ii-with-a-mac-no-problem/
moved from H4 to H15 (only for tomorrow).
1- The assessment will contain 2 questions one Prolog and one Haskell 2- We do not advise that you use SWI Prolog and WinHugs although you are allowed to. You have 15 minutes to solve both questions so we believe that writing and testing your code will consume your time. 3- Treat the assessment as a written quiz. We will treat it the same way. This means that we mark the logic and the steps and not only the compilation and the test cases. Whatever you write will be graded. Don't worry about having to perfect the solution to pass. 4- The Prolog question is a predicate that you have to write. 5- The Haskell question is a function that you will need to change/rewrite. 6- Thus, in your place, we would give more time to the Prolog question. We would suggest 9 minutes to Prolog and 5 to Haskell. 7- The questions are doable within the 15 minutes and remember this is only a pass/fail assessment. 8- Please take it easy and do not stress. Treat the assessment lightly.
Dear all, To download Quartus Prime, use the following link to create and account (preferably via your GUC Email): https://www.intel.com/content/www/us/en/forms/fpga/fpga-individual-registration.html?tgt=http%3A%2F%2Ffpgasoftware.intel.com%2Fsaml_login%2F%3Fsso2&fbclid=IwAR1Hdjg0vFT6E2MlAO0lpip8r6mM1IBYPXUCTNjMcCcNi2Ho3zGQ0Euu258 and then go to the following link: http://fpgasoftware.intel.com/18.1/?edition=lite&platform=windows&download_manager=direct in order to download : a) Quartus Prime Lite 18.1 (19.1 isn't available for windows yet) b) Modelsim (it's in the download options just make sure you download it as well) c) 'Max 10 FPGA device support' Good luck to you all <3
Dear All, This is to announce the extension of the project deadline to Friday Dec 6, instead of Tuesday Dec 3.
I got several requests to extend the projects. Consequently, I am extending it again to April 20th, 11:50PM.
Please be careful, in the Intel specs I have used in class, a thread is seen as a "logical core" and not as Software threads. Each physical core has 2 logical cores. We'll talk about Software threads in the OS course.
Extended to April 6th, 11:50PM.
Assessment 1 is MCQ. Each student will be given 6 questions, randomly selected from a pool of MCQ questions I have put. The duration of the assessment is 15 minutes. You will need a calculator. I have uploaded to MET website previous exams and their solutions. While previous exams were not MCQ, the MCQ question styles are not much different except that each MCQ asks for 1 answer. So, if you practice on problems based on lectures 7,8 , and 9, in previous exams, you should be able to do well tomorrow ISA.
Don't forget: you have 6 quizzes during lectures every week starting Lecture 2.
one issue that arises from using java.awt.Polygon is that it does not implement the comparable interface, which will hinder your effort to sort a column of type Polygon. To solve this problem, define your own class that will internally retrieve the points from the passed Polygon. In that class, you can implement the interface comparable and consequently, you will need to add the method compareTo. To compare polygons, you can use the bounding box to get the enclosing rectangle and use the area of the rectangle, as follows: Dimension dim = poly1.getBounds( ).getSize( ); nThisArea = dim.width * dim.height;
Will be held on Tuesday, March 03, 2020, from 4-5 in exam halls. Topics included are those covered in lectures 1 and 2.
Due to current circumstances, I am extending the project further to April 12th, 11:50PM.
this week of January 25th.
Milestone 2 submission moved to March 31.
All seminars will be pushed one week due to taking today Feb 25th off.
to fix a typo. Please, re-download.
If you have a team member not working on the project, fill the form available on MET and submit it to your TA. We will be conducting individual evaluations for such cases and those not contributing will not bet the team mark.
Moved to May 20th.
to May 15th, 11:50PM.
Assessment 1 will cover lectures 7, 8 and 9. Assessment 2 will cover lectures 10, 11 and 12. Material before midterm not included.
Please, redownload mini project II folder as I have fixed few typos related to schema 5.
Please note that you need to attend the quiz with the lecture group that you have been assigned to. Taking the quiz with a different group will result systematically in a 50 % penalty.