lecture1 - CPE 360 – Computational Data Structures and...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CPE 360 – Computational Data Structures and Algorithms all 2009 Fall 2009 Prof. Yingying (Jennifer) Chen Department of Electrical and Computer Engineering tevens Institute of Technology 1 Stevens Institute of Technology Course Administrative ¡ Instructor: Prof. Yingying (Jennifer) Chen ¡ Contact: [email protected] Phone: 201-216-8066 ¢ Please include CPE360 in your email subject line for quick response ¡ Grader: ¡ Contact: Phone: ¡ Course Time and Location: uesday 11AM – :15PM E A Stevens 231 ¢ Tuesday 11AM 12:15PM, E.A. Stevens 231 ¢ Thursday 11AM – 12:15PM, E.A. Stevens 231 ¡ Office Hours: Tuesday and Thursday 12:15PM – 1:30PM ourse Webpage: ¡ Course Webpage: ¢ http://personal.stevens.edu/~ychen6/cpe360/index.html ¢ For important class announcements, homework, solutions , and etc. 2 Course Administrative ¡ Textbook: ¢ Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, 3rd Edition, Published by Addison-Wesley, 2006. ¡ Reference books: ¢ Data Structures, Algorithms, and Applications in C++, 2nd dition Sartaj Sahni Silicon Press Edition, Sartaj Sahni, Silicon Press. ¢ Introduction to Algorithms, 2nd Edition. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, IT Press MIT Press. 3 Course Administrative ¡ Main topics ¢ Introduction of algorithm analysis and running time ¢ Elementary data structures: arrays, stacks, queues, linked lists ¢ Advanced data structures: trees, hashing, heaps ¢ Searching algorithms: linear and binary search ¢ Sorting and order statistics: heap sort, merge sort, bubble sort, quick sort, insertion sort, bucket sort ¢ Elementary graph algorithms: representations, breath-first search, depth-first search ' ' ¢ Minimum spanning trees: Prim s Algorithm, Kruskal s Algorithm ¢ Single-source shortest paths and all-pairs shortest paths 4 Course Administrative ¡ Grading ¢ Homework: (25%) There will be four to five regular homework assignments including theory problems and programming assignments. ¢ Quiz: (15%) There will be three in-class quizzes to test students. understanding of the current materials. For each quiz, a notice will be given one class ahead to allow students prepare to prepare....
View Full Document

This note was uploaded on 05/25/2010 for the course CPE CPE 360 taught by Professor Jenniferchen during the Spring '10 term at Stevens.

Page1 / 26

lecture1 - CPE 360 – Computational Data Structures and...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online