Welcome to the home page for Section 1 of TE3346. Students should use this site whenever possible in order to reduce everyone's paper load (and copying costs).
Please visit this page frequently. It will be the most promptly updated source of information for the class. This page will also provide lecture outlines, homework assignments for those who are traveling out of town, hints for the problems, simulation software, etc.
Basic data structures such as arrays, stacks, queues, lists, trees. Algorithmic complexity. Sorting and search techniques. Fundamental graph algorithms.Prerequisites: CS 2315, TE 3307 or their equivalents.
Announcements
(Nothing Yet!)
Assignments
(None Yet!)
(due dates, solutions and hints)
Syllabus
(last updated 12/13/02)
Lectures
(None Yet!)
Handouts
(last updated 2/19/03)
Please feel free to communicate with Prof. Pervin by email at any time.
Send email to Prof. Pervin (pervin@utdallas.edu)