CS 344 * We aren't endorsed by this school

CS 344 Design and Analysis of Algorithms

  • Average Course Rating (from 2 Students)

    4.5/5
    Overall Rating Breakdown
    • 2 Advice
    • 5
      50%
    • 4
      50%
    • 3
      0%
    • 2
      0%
    • 1
      0%
  • Course Difficulty Rating

    • Easy 0%

    • Medium 100%

    • Hard 0%

  • Top Course Tags

    Go to Office Hours

    Background Knowledge Expected

    Competitive Classmates

* We aren't endorsed by this school

Design and Analysis of Algorithms Questions & Answers

Design and Analysis of Algorithms Flashcards

Design and Analysis of Algorithms Advice

Design and Analysis of Algorithms Documents

Showing 1 to 30 of 145

Sort by:
{[$select.selected.label]}

Recent Documents


Design and Analysis of Algorithms Questions & Answers


Design and Analysis of Algorithms Advice

Showing 1 to 2 of 2

View all
    • Profile picture
    Jan 11, 2017
    | Would highly recommend.

    Not too easy. Not too difficult.

    Course Overview:

    This class is a bit tough, but the professor presents research opportunities to students who get an A. The material is interesting, but the professor's wit makes the class great.

    Course highlights:

    Farach's an interesting guy. The stories he tells are funny and a great way to break up class when he suspects people are bored or confused.

    Hours per week:

    0-2 hours

    Advice for students:

    The homework is optional to hand in, but the professor insists you do it, since it should help you understand the material better (lecture is great, but if you want an A, you need to do more than just that). Thus, it's not really optional if you want a good grade. Recitation probably also helps.

    • Fall 2016
    • Farach-Colton
    • Yes
    • Background Knowledge Expected Go to Office Hours Competitive Classmates
    • Profile picture
    Nov 28, 2016
    | Would recommend.

    Not too easy. Not too difficult.

    Course Overview:

    I highly recommend this course for aspiring Programmers. This course teaches proper efficiencies of algorithms, procedures to derive an algorithm for any such problem, and designing techniques for those algorithms. The professor is very knowledgeable, and serves as a role model given his experience and efforts to further his students career. The class began rather difficult for me but I just had to change my study habits. If you do the work and focus, you'll succeed.

    Course highlights:

    As I've mentioned, this course teaches efficiencies of algorithms, procedures to derive an algorithm for any such problem, and designing techniques for those algorithms. Alongside, the professor gives bi-weekly riddles that require a different way of thinking; riddles where your given a problem, and you need to solve with an algorithm.

    Hours per week:

    3-5 hours

    Advice for students:

    Pay attention at all times! Getting distracted for even a second can lose you crucial details of the lecture, but if you go to class and read the notes it'll become second nature.

    • Fall 2016
    • Farach-Colton
    • Yes
    • Math-heavy Go to Office Hours Great Discussions

Ask a homework question - tutors are online