-
Institution:
-
University of Missouri-Kansas City
-
Subject:
-
-
Description:
-
Abstract data structures and analysis of associated algorithms, abstractions as separate from implementation. Structures include lists, trees, priority queues, advanced tree structures,hashing tables, and graphs. Comparison of efficiency of algorithms as implemented with various data structures. Advanced searching and sorting algorithms, shortest paths, spanning tree and flow algorithms. Introduction to the basic concepts of NP-complete problems. Prerequisites:(must be passed with a C or higher) COMP-SCI 201(or E&C-ENGR 216 for ECE students), COMP-SCI 291, MATH 210. 3 hrs
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(816) 235-1000
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.