Carnegie Mellon logo * We aren't endorsed by this school

15 251 GREAT THEORETICAL IDEAS IN COMPUTER SCIENCE

  • Average Course Rating (from 3 Students)

    4.0/5
    Overall Rating Breakdown
    • 3 Advice
    • 5
      67%
    • 4
      0%
    • 3
      0%
    • 2
      33%
    • 1
      0%
  • Course Difficulty Rating

    • Easy 0%

    • Medium 0%

    • Hard 100%

  • Top Course Tags

    Great Intro to the Subject

    Background Knowledge Expected

    Go to Office Hours

* We aren't endorsed by this school

GREAT THEORETICAL IDEAS IN COMPUTER SCIE... Questions & Answers

GREAT THEORETICAL IDEAS IN COMPUTER SCIE... Flashcards

GREAT THEORETICAL IDEAS IN COMPUTER SCIE... Advice

GREAT THEORETICAL IDEAS IN COMPUTER SCIE... Documents

Showing 1 to 30 of 65

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

GREAT THEORETICAL IDEAS IN COMPUTER SCIE... Advice

Showing 1 to 3 of 3

View all
    • Profile picture
    May 17, 2017
    | Would highly recommend.

    This class was tough.

    Course Overview:

    This class is an absolute must for those interested in computer science. Additionally, it is important to note that this class is pretty much everyone's favorite, whether you aced the course or barely passed. The class covers a variety of CS-theory concepts ranging from Turing machines to approximation algorithms to crypto, and it is taught such that every students has a solid understanding. No matter what, you will leave the class significantly smarter and more prepared for future CS classes.

    Course highlights:

    This class focused on CS-theory-related topics. The syllabus included material such as finite automata, TMs, graph theory, approximation algorithms, decidability, P v. NP (my favorite topic), and cryptography. Homeworks are weekly. There are two midterms and a final exam. I definitely suggest practicing proof-writing for this class as proofs will either make you or break you!

    Hours per week:

    6-8 hours

    Advice for students:

    I would definitely recommend going to lecture (obvious, but a lot of people surprisingly skipped). Secondly, I would re-watch lectures on material you are uncertain about. Professor Ada has someone record his lectures, so you can watch the entire thing or skip to parts you feel iffy about. Lastly OFFICE HOURS. My 251 group literally did all of our homework during office hours - and it was the best decision we ever made. The TAs are super helpful and Ada himself often gives some important hints during his office hours.

    • Spring 2017
    • AnilAda
    • Yes
    • Great Intro to the Subject Go to Office Hours Lots of Writing
    • Profile picture
    Apr 25, 2017
    | Would highly recommend.

    This class was tough.

    Course Overview:

    For those who seek to become great computer specialist I recommend this field to further test yourselves for the bets of yourself and the technology world.

    Course highlights:

    Innovation is the key for all success in these operations.

    Hours per week:

    12+ hours

    Advice for students:

    Study everything the Speaker says because it can benefit your performance in being the best in the room.

    • Spring 2017
    • UmutAcar
    • Background Knowledge Expected Great Intro to the Subject Great Discussions
    • Profile picture
    Jan 28, 2016
    | Probably wouldn’t recommend.

    This class was tough.

    Course Overview:

    Attendance is not mandatory and most people don't attend class.

    Course highlights:

    You can do well by just studying the slides. I never even opened the book.

    Hours per week:

    9-11 hours

    Advice for students:

    Dr. Essig is a kind older professor with an obvious passion for botany.

    • Winter 2010
    • GUPTA,LAFFERTY

Ask a homework question - tutors are online