What This Document Is
This is the official syllabus for EEL 4851: Engineering Data Structures, offered at the University of Central Florida. It serves as a comprehensive overview of the course, outlining expectations, policies, and the learning journey students will undertake. This document details the foundational elements required for success in the course and provides a roadmap for the entire semester.
Why This Document Matters
This syllabus is essential for any student enrolled or considering enrollment in EEL 4851. It’s crucial to review this document at the beginning of the course to understand grading criteria, required materials, and important dates. Prospective students can use it to assess if the course aligns with their academic goals and prerequisites. Current students should refer to it throughout the semester as a point of reference for all course-related questions and policies.
Topics Covered
* Fundamental concepts of recursion and algorithmic analysis.
* Core abstract data types, including stacks, queues, and linked lists.
* Tree-based data structures and their applications, such as binary search trees and AVL trees.
* Hashing techniques for efficient data retrieval.
* Various sorting algorithms and their performance characteristics.
* Introduction to graph theory and related algorithms.
* Exploration of computational complexity and problem intractability.
What This Document Provides
* Instructor contact information and office hours.
* Required textbook details.
* A clear outline of course prerequisites.
* A detailed breakdown of the grading scheme, including the weight of homework, labs, midterm exams, and the final exam.
* University policies regarding academic integrity and grade dispute resolution.
* Information regarding a potential grade curving policy.
* Important dates and deadlines for assignments and exams.