Georgia Tech OMSCS (s9e1) - CS6515 Intro to Grad Algorithms
HTML-код
- Опубликовано: 24 июл 2024
- CS6515 - Intro to Graduate Algorithms was the last big hump I had in my journey through the Georgia Tech OMSCS program. Intro to Graduate Algorithms felt different from any other course I have taken in the OMSCS program both from a content and a grading perspective.
CS6515 - Intro to Grad Algorithms puts a HUGE enfaces on the exams, making up a total of 75% of the final grade. The remaining 25% is made from a combination of HWs, Polls, and Coding Projects. While Intro to Grad Algorithms may seem like a massive challenge to overcome, take each HW a step at a time and you will be able to pass the class and finish the OMSCS program.
As I said in the video, one of the best ways to study for each exam was to look over the HW and also make sure to understand the wikidot questions for that section. Check out the wikidot here:
omscs.wikidot.com/courses:cs6515
Lastly, here is a FREE PDF of the Dasgupta textbook you will need while taking CS 6515 - Intro to Graduate Algorithms:
algorithmics.lsi.upc.edu/docs/...
Sadly, Joves notes are only open while taking the class so I am unable to provide them as they contain answers to questions you will be asked during the course.
Don't forget to check out the CS6515 - Intro to Graduate Algorithms page on the Georgia Tech website here:
omscs.gatech.edu/cs-6515-intr...
To start this series from the beginning, click the link below:
www.youtube.com/watch?v=T3jyD...
I hope you enjoyed the video, if you did, leave a like and subscribe to the channel! If you have any questions or special video requests, leave a comment.
VIDEO CONTENT - TIMESTAMPS
0:00 - Intro
0:53 - What is the class about?
2:00 - Grading
5:16 - HW Assignments
9:04 - Polls and Coding Projects
11:08 - Exams
20:03 - Average student breakdown
20:57 - Pros and Cons
23:41 - Outro
Grading is currently:
HW - 14%
Quizzes - 7%
Coding Projects - 7%
Logistics Quizzes (free %) - 3%
Exams - 69%
Thank you Chris. I am taking exam 3 this weekend. I want to pass this course without taking the final. I managed to get an A from both exam 1 and exam2. Your review helped me a lot. Thank you for your reviews!
glad you did so well and congratulations! hopefully you wont have to take the final
Thank-you, Chris, for this breakdown! 😎👍
Nice review, Chris. Thanks for pulling it together.
Thank you so much Chris for the review! It is absolutely a great help! Do you mind if I ask what is your final grade for this course?
I was able to achieve an A with the final. I believe my score was either high 80s or low 90s. It took a good amount of work but I was happy with the results.
i really appreciate ur review!. im potential candidate have non-cs major. but studied some algorithm. cs knowledge. needed some research before i apply this program thank u. wish i can overcome this harsh test.. sigh
Do not worry, I had a non-CS background too an and am currently finishing my OMSCS career so if I can do it, you can do it. Best of luck and thank you for supporting the channel.
I have a non-stem background. You have to commit more time. I recommend taking some algorithms and data structures and computer systems courses before applying for OMS CS.
Great detailed video. Taking this next semsester. I have 2 Questions
1. How much time per week did you studied for the course.
2. How did you structured your study for this course.
That is great, best of luck in the course.
1. Each week, I probably spent around +10hrs. On weeks with HWs those hours were spent watching lecture videos and taking notes as well as completing the HW for the week. On weeks with an Exam, those hours were spent reviewing my notes and doing practice questions.
2. I took this course with the same mentality as when I would take my undergrad engineering courses. At the start of the week, watch all the lectures for the week and take notes. Then, do the polls to make sure you understand the material. After this, take a look at the HW and read the discussion boards to understand the problem and look for hints. Also, form a study group to bounce HW ideas across. For exams, review notes and Joves notes, memorize needed material, and do practice questions (a lot). For me, practice questions, especially the wikidot questions, were the biggest help.
I will be putting out a video soon about my tips for how to succeed in this class so watch out for that.
Considering OMSCS, but this is the course that makes me slightly hesitant on applying. I covered every topics on syllabus except linear programming during my ugrad but I hear horror stories about how finicky their "marking" is.
Good coures content but the grading is too harsh. I think it was my worst learning experience in this program.
You shouldn't let ONE course dissuade you from enrolling. It's a polarizing course, but public reviews tend to rate it around average for the program. Most students have a perfectly reasonable experience in the class. In the worst case, you can avoid the course altogether now with 2 specializations which don't require Graduate Algorithms.
@@Vim_Tim I am starting in this fall term 😅.
@@miaowcat1 Congratulations, and welcome to the program!
Hi, thanks for sharing, if this is the middle level of OMSCS, which is on the higher end of difficulty according to you?
What is the math requirement? What math courses would you recommend?
Can homeworks and coding projects be coded in any language or Python only? Is it the same for exams?
The homeworks and exams have no coding, and only Dynamic Programming has pseudocode. The coding projects are Python-only and students needed to fill a template function, no additional libraries allowed.
As @Time W says, HWs and Exams have NO CODING. This was very different than every other class in OMSCS that I had taken.
Coding Projects are done in Python because they supply you with a template that you add onto to solve the problem.