Course learning outcomes document for CSC 231

advertisement
COURSE LEARNING OUTCOMES
1. Students develop knowledge of basic data structures for storage and retrieval of ordered
or unordered data. Data structures include: arrays, linked lists, binary trees, heaps, and
hash tables.
2. Students develop knowledge of applications of data structures including the ability to
implement algorithms for the creation, insertion, deletion, searching, and sorting of each
data structure.
3. Students learn to analyze and compare algorithms for efficiency using Big-O notation.
4. Students implement projects requiring the implementation of the above data structures.
Relationship between Course Outcomes and Program Outcomes
Course Outcomes Mapped to Program Outcomes
Program Outcomes
Course Outcomes
1
2
1
X
X
2
X
X
3
X
X
4
X
X
3
4
5
X
X
6
Major Topics Covered in the Course
1. Data structures: lists, stacks, queues, binary search trees, AVL trees, heaps, hash tables.
2. Applications: searching, sorting, evaluation of infix/postfix expressions, priority
scheduling.
3. Algorithm analysis: time and space complexity, asymptotic behavior, estimating runtime,
comparison of algorithms.
4. Implementation of data structures.
For a computer science program
Estimate Curriculum Category Content (Semester hours)
Area
Core
Algorithms
1.0
Software design
0.5
Data structures
1.0
Concepts of programming
languages
0.5
Computer organization
and architecture
Advanced Area
Core
Advanced
Download