-
Institution:
-
Utah Tech University
-
Subject:
-
Computer Science
-
Description:
-
Required of students pursuing a Computer Science or Information Technology degree or emphasis, open to any student with a strong interest in computer programming. Covers the design and use of common data structures, lists, stacks, queues, trees, hash tables, and graphs through completion of several challenging programming projects. Introduces computational complexity and algorithm analysis. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Discuss the basic principles of many software data structures, including efficiencies and tradeoffs. 2. Implement and use several data structures, including Binary Search Trees, Hash Tables, and Graphs. 3. Demonstrate a working knowledge of Big-O complexity. 4. Demonstrate a working knowledge of Algorithm Analysis. 5. Parse mathematical expressions into a functioning graphics calculator. 6. Implement several recursive algorithms. 7. Implement and analyze several sorting algorithms. Course fee required. Prerequisites: CS 1410 (Grade C or higher). FA, SP
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(435) 652-7500
-
Regional Accreditation:
-
Northwest Commission on Colleges and Universities
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.