Return to course list

ECE 2574 Introduction to Data Structures and Algorithms (3C)

Introduces fundamental data structures, algorithms, and abstract data types. Main topics include data structures such as arrays, linked lists, stacks, queues, graphs, and trees, and algorithms such as those that are used for list manipulation, graph searches, sorting, searching, and tree traversals. Implementation of data structures and algorithms in C++.

What is the reason for this course?

Required for all CPE majors. Typically offered: Fall, Spring. Program Area: Computers.

Prerequisites: C- or better in 1574.

Why are these prerequisites or corequisites required?

Department Syllabus Information:

Major Measurable Learning Objectives:

• design algorithms for solving problems that use data structures such as arrays, linked lists, stacks, queues, graphs, and trees, and algorithms such as those that are used for list manipulation, graph manipulation (e.g., depth-first search), sorting, searching, and tree traversals
• implement algorithms in C++ using good programming style.

---

Course Topics
Topic	Percentage
Algorithm Design Methodology Top-down design Hierarchical modularization Stepwise refinement	5%
Abstract Data Types Information hiding Encapsulation Physical vs. Logical abstraction Design and implementation of list ADTs using arrays and linked lists	20%
Recursion in Programming and Problem Solving Recursive valued functions: Factorial Classical problems: Ackermann’s function, 8-Queens problem, Towers of Hanoi, detecting palindromes Relation to mathematical induction	10%
Stacks Stack ADT Implementation using arrays, linked lists, and list ADTs Applications: Checking balanced braces, recognizing strings, depth-first searches on graphs	10%
Queues Queue ADT Implementation using arrays, linked lists, and list ADTs Applications: breadth-first searches, recognizing palindromes	10%
Searching Techniques Sequential search Binary search	5%
Sorting Algorithms Selection sort, Bubble sort, Insertion sort, Mergesort Non-comparison-based sorting: Counting sort	15%
Introduction to Algorithm Analysis Algorithm comparison Big O notation Orders of magnitude Analysis of sorting and searching algorithms	10%
Trees Introduction, Terminology Binary Trees Tree Traversals Applications: Huffman’s algorithm	15%

Return to course list