COMS 250 Computer Science and Programming 2
This course examines data structures using a high level language such as C++. Stacks, queues, linked lists, trees and graphs are presented and explored through manipulation methods specific to each. Additional topics are dynamic memory use and external files.
COMS 250Computer Science and Programming 2
Please note: This is not a course syllabus. A course syllabus is unique to a particular section of a course by instructor. This curriculum guide provides general information about a course.
I. General Information
II. Course Specification
Course Type
Program Requirement|{D7A8FC71-978F-4003-9933-512C476323B2}
Credit Hours Narrative
4 Credits
Semester Contact Hours Lecture
3
Semester Contact Hours Lab
3
Prerequisite Narrative
COMS 229
Corequisite Narrative
COMS 250L
III. Catalog Course Description
This course examines data structures using a high level language such as C++. Stacks, queues, linked lists, trees and graphs are presented and explored through manipulation methods specific to each. Additional topics are dynamic memory use and external files.
IV. Student Learning Outcomes
Upon completion of this course, a student will be able to:
- 1.Implement linked data structure such as linked list and binary trees
- 2.Interpreting advanced data structures such as balanced search tree, recursion, stacks and queue
- 3.Recognize the basic techniques of algorithm analysis
- 4.Designing and analyzing written program solutions to advanced problems
V. Topical Outline (Course Content)
VI. Delivery Methodologies