-
Institution:
-
The University of Texas at Dallas
-
Subject:
-
-
Description:
-
Analysis of algorithms including time complexity and Big-O notation. Analysis of stacks, queues, and trees, including B-trees. Heaps, hashing, and advanced sorting techniques. Disjoint sets and graphs. Course emphasizes design and implementation. Prerequisites: CE/CS 2336, and one of CS 3305 or SE 3306. Students cannot get credit for both CS/SE 3345 and CE/TE 3346. Prerequisite or corequisite: CS/SE 3341. (Same as CS 3345) (3-0) S
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(972) 883-2111
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.