CSE 2010 Algorithms and Data Structures
Phil Chan
322 Harris Center, 6747280
pkc@cs.fit.edu
Office Hours: TR 11am1pm (or by appointment)
Teaching Assistant:
Taher Patanwala, tpatanwala2016@my.fit.edu, MW 11am12pm, 211 Harris
Syllabus
Textbook
Seating of groups during lectures
Assignments (Submit Server)
HW1  HW1.java,
SinglyLinkedList.java,
Sample Input File 1, Sample Output 1,
Sample Input File 2, Sample Output 2
HW2  HW2.java, HW2crypto.class, Sample Input File 1, Sample Output 1, Sample Input 2, Sample Output 2
Lecture Notes
 Introduction
 Growing your mind, The power of believing that you can improve, Neuroplasticity (cartoon), Neuroplasticity (Lara Boyd)

 Fundamental Data Structures (Ch3)
Arrays,
Singly Linked Lists,
Doubly Linked Lists
 Algorithm Analysis (Ch 4) Analysis, BigO in How to: Prepare for a Google Engineering Interview
 Recursion (Ch 5) Recursion
 Stacks and Queues (Ch 6) Queues, Stacks
 Trees (Ch 8) Trees
 Priority Queues (Ch 9) Priority Queues, Heaps, Heap Sort, Adaptable PQ, Obama on sorting
 Maps and Hash Tables (Ch 10) Maps, Hash Tables, Sorted Maps and Skip Lists, Sets
 Graph Algorithms (Ch 14) Graphs, Depthfirst Search, Breadthfirst Search, Directed Graphs, Shortest Path, Minimum Spanning Tree
 Text/String Processing (Ch 13) Pattern Matching, Tries, Text Compression (Greedy), Longest Common Subsequence (Dynamic Programming)
 Search Trees (Ch 11) Binary Search Trees, AVL Trees, (2,4) Trees
 Sorting (Ch 12) Mergesort, Quicksort, Bucket and Radix Sort, []
 Data Structures and Algorithms: A Summary