-
Institution:
-
Widener University-Main Campus
-
Subject:
-
-
Description:
-
Introduction to basic data structures and abstract data types such as arrays, tables, stacks, queues, trees, and graphs; use of recursive algorithms in problem solving; introduction to the notion of computational complexity and its use in analysis of algorithms; comparison of various algorithms for sorting and searching; algorithms for solving engineering problems, including depth-first and breadth-first search, shortest path, backtracking and maximal flow algorithms; introduction to the development of algorithms for parallel and distributed architectures. Students must complete a design project. Prerequisite: ENGR 112. Corequisite: EE 342 or by permission of instructor. 4 semester hours
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(610) 499-4000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.