COMP 2140 * We aren't endorsed by this school

COMP 2140 data structure

  • Average Course Rating (from 1 Student)

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

    • Easy 0%

    • Medium 100%

    • Hard 0%

  • Top Course Tags

    A Few Big Assignments

    Background Knowledge Expected

    Great Intro to the Subject

* We aren't endorsed by this school

data structure Questions & Answers

data structure Flashcards

data structure Advice

data structure Documents

Showing 1 to 30 of 159

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

Recent Documents


data structure Questions & Answers


data structure Advice

Showing 1 to 1 of 1

View all
    • Profile picture
    Dec 16, 2016
    | Would recommend.

    Not too easy. Not too difficult.

    Course Overview:

    I would recommend this course because the material is easy to follow along and the professor is a caring and knowledgeable individual. The material you learn in this course (linked lists, stacks, queues) is quite useful in later courses.

    Course highlights:

    Being able to to use recursion in Java to solve database problems, solidifying my understanding of linked lists and learning new types of linked lists, learned about stacks, queues and hash tables, their implementations in the real world and how to properly code these data types.

    Hours per week:

    6-8 hours

    Advice for students:

    Need to have a basic understanding of the Java programming language. Knowing how to use recursion and linked lists/nodes is strongly recommended. Depending on the professor teaching this course, there may be no textbook (my course's textbook was optional). If that is the case, the professor may present an online alternative which is free. Wait for the first day of class to determine if a textbook is required. Highly recommend getting comfortable with writing code on paper without a computer since this is the format for the midterm and final exam. Need to know how to code the insertion, deletion, viewing and sorting in linked lists, stacks and queues (stacks and queues don't utilize sorting). The system libraries and classes are given as reference sheets on the midterm and final. Knowledge on O-notation and worst case running times would be an asset.

    • Fall 2016
    • Helen Cameron
    • Yes
    • Background Knowledge Expected Great Intro to the Subject A Few Big Assignments

Ask a homework question - tutors are online