COMPUTER S CS 261
COMPUTER S CS 261 * We aren't endorsed by this school

COMPUTER S CS 261 Data Structures

  • Average Course Rating (from 2 Students)

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

    • Easy 0%

    • Medium 0%

    • Hard 100%

  • Top Course Tags

    Background Knowledge Expected

    Meetings Outside of Class

    Always Do the Reading

* We aren't endorsed by this school

Data Structures Questions & Answers

Data Structures Flashcards

Data Structures Advice

Data Structures Documents

Showing 1 to 17 of 17

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

Data Structures Advice

Showing 1 to 2 of 2

View all
    • Profile picture
    Oct 10, 2016
    | No strong feelings either way.

    This class was tough.

    Course Overview:

    This class was a requirement and the course was basically about data structures. Data structure is a particular way of organizing data in a computer so that it can be used efficiently.

    Course highlights:

    Different data structures and implementing those data structures. Stacks, bags, AVL trees etc. Also, visiting the Big O for each data structure.

    Hours per week:

    6-8 hours

    Advice for students:

    Take the weekly worksheets and the test example seriously. They were very helpful in working through what would be on the tests. Know your pointers because all the programming is based on C. Get help early and don't fall behind.

    • Winter 2016
    • Samina Ehsan
    • Yes
    • Background Knowledge Expected Go to Office Hours Meetings Outside of Class
    • Profile picture
    May 10, 2016
    | Would highly recommend.

    This class was tough.

    Course Overview:

    Data Structures is the class that really starts to get to the meat and potatoes of computer science. The info here is super helpful for both interviews and actually writing code. Plus, it's interesting to evaluate the usefulness of different implementations of abstract data structures (ie, should I use a linked list or floating dynamic array for this?).

    Course highlights:

    Highlights - the content, the usefulness

    Hours per week:

    6-8 hours

    Advice for students:

    Study early and often. Draw diagrams of structures. Google visualizations (this really helps for linked lists and binary search trees).

    • Spring 2016
    • Samina Ehsan
    • Yes
    • Background Knowledge Expected Always Do the Reading Meetings Outside of Class


Related Courses

Ask a homework question - tutors are online