CIS * 2520 – Data Structures F (3-2) [0.50]

Basic data structures are studied including: stacks, queues, lists, trees, hashing, search trees, and graphs. Topics include their representation, uses, and algorithms for their traversal and manipulation. The emphasis is on using these structures and assessing the relative effectiveness of alternative implementations.


Posted By : Anonymous
Posted On : March 29, 2014

Is the textbook recommended by the student? No
Did the student enjoy the professor? Yes
Professor : Pascal Matsakis

Comment :
There's a fair amount of theory (at least with Pascal as your professor, which seems usual for him). Assignments had you implement a linked list, stack, queue, and binary heap/search tree along with some algorithm complexity theory and recursion. Concepts from this course will help you to some extent with CIS*2750 and CIS*3110.
Recommendation Rating
Overall Difficulty
Posted By : Josh Gaber
Posted On : December 8, 2010

Comment :
Good source for practical, hands-on problem-solving experience. Understanding this course will help you in later courses. If you don't get it right away, you will understand it later. Remember the concepts!
Recommendation Rating
Posted By : Anonymous
Posted On : October 25, 2010

Comment :
This course is a course that has a fair bit of math involved. You learn about queues and stacks and some recursive functions that are useful in some ways. The course was not taught the best way, but it still had some effect.
Recommendation Rating