None
This course explores advanced programming concepts such as stacks, queues, recursion, linked lists, trees, searching and sorting in order to write effective and efficient code for large-scale problems. Students model real-world scenarios by implementing various data structures within event-driven applications.
Obtain current textbook information by viewing the campus bookstore online or visit a campus bookstore. Check your course schedule for the course number and section.
Access to high-speed Internet.
None
- Differentiate among various types of data structures. (CCC 2, 5, 6; PGC 1, 3)
- Create computer programs using various data structures. (CCC 2, 5, 6; PGC 1, 3, 4)
- Implement various data structures for optimal use in real world scenarios. (CCC 2, 5, 6; PGC 1, 3, 4, 5)
See Core Curriculum Competencies and Program Graduate Competencies at the end of the syllabus. CCPOs are linked to every competency they develop.
Upon completion of this course, the student will:
- Differentiate among various types of data structures.
- Describe types of data structures such as stacks, queues, recursion, and linked lists.
- Describe primitive and abstract data types.
- Explain fundamental computing algorithms of data structures such as binary search trees, searching, and sorting in computer programs.
- Compare and contrast how various types of data structures are used to construct computer programs.
- Create computer programs using various data structures.
- Evaluate different data structures for optimal use in real world scenarios.
- Identify the steps to incorporate data structures in programs and applications.
- Illustrate the use of each data structure in real world applications.
- Create code to implement selected data structures in different situations.
- Implement various data structures for optimal use in real world scenarios.
- Compare and contrast the performance of different data structures with various data sets.
- Demonstrate the performance of alternative implementations of data structures.
- Explain the costs and benefits in terms of time and memory storage of dynamic and static data structure implementations.
- Select and implement the appropriate data structure for a given set of problem specifications.
The grade will be determined using the Delaware Tech grading system:
| 90 | – | 100 | = | A |
|---|---|---|---|---|
| 80 | – | 89 | = | B |
| 70 | – | 79 | = | C |
| 0 | – | 69 | = | F |
Students should refer to the Student Handbook for information on the Academic Standing Policy, the Academic Integrity Policy, Student Rights and Responsibilities, and other policies relevant to their academic progress.
- Apply clear and effective communication skills.
- Use critical thinking to solve problems.
- Collaborate to achieve a common goal.
- Demonstrate professional and ethical conduct.
- Use information literacy for effective vocational and/or academic research.
- Apply quantitative reasoning and/or scientific inquiry to solve practical problems.
- Solve technology-related problems using critical thinking and troubleshooting skills.
- Articulate the role of the technology professional in organizations to support the ethical use of information technology.
- Apply fundamental security concepts and strategies for maintaining and securing information technology.
- Read and interpret technical information and effectively communicate to a wide range of audiences using oral, print, and multimedia strategies.
- Demonstrate the importance of lifelong learning that empowers personal and professional growth.
The College is committed to providing reasonable accommodations for students with disabilities. Students are encouraged to schedule an appointment with the campus Disabilities Support Counselor to request an accommodation needed due to a disability. A listing of campus Disabilities Support Counselors and contact information can be found at the disabilities services web page or visit the campus Advising Center.