Lecture1Blackboad

Lecture1Blackboad - EECS 233 Introduction to Data...

Info iconThis preview shows pages 1–7. 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: EECS 233 Introduction to Data Structures Spring 2008 Michael Rabinovich (Slides acknowledgements: Shudong Jin)-2- Welcome to EECS 233 An introductory CS course in computer science. Primary objective: An introduction to various methods of organizing large amounts of data, and simple analysis of algorithms that use these methods. Linked lists, stacks and queues, hashing, searching and sorting, some trees and basics of graphs. Simple analysis of running time of short computer programs. The instructor: Michael Rabinovich Email: misha@eecs.case.edu OfFce: Olin 507 OfFce Hours: Tuesday & Thursday, 1:45-2:45pm Teaching assistants: TBA-3- Prerequisites ENGR 131 Good knowledge of Java or C++ programming Comfortable with object-oriented programming concepts If your programming skills are not good, you may need put more effort into this course But: EECS 233 is not about programming skills only, it is mainly about data structures and simple algorithm analysis Familiarity with mathematics Algorithm analysis mostly needs simple algebra, understanding the basics of exponents and logarithms, etc. Some simple calculations, and growth rate of expressions 1+2+3++N=? What grows faster, or ? N log N-4- Textbooks Data Structures and Algorithm Analysis in Java (Second Edition), by Mark Allen Weiss, Addison-Wesley, ISBN: 0-321- 37013-9, 2006. or Data Structures and Algorithm Analysis in C++ (Third Edition), by Mark Allen Weiss, Addison-Wesley, ISBN: 0-321-44146-X, 2006.-5- Course Requirements Attendance of lectures Programming assignments, 25% 4 assignments Electronic submissions (Blackboard dropbox) File format: P1Rabinovich_mxr136 Written assignments, 15% 4 assignments Electronic submissions (Blackboard dropbox) File format: W1Rabinovich_mxr136 Midterm exam, 20% Quiz, 10% For the instructor to better know the background and progress of the class May or may not happen Final exam, 30%-6- Policies Grading - will be posted on Blackboard Late and missed submissions 10% off each day for 3 days (not acceptable after 3 days) e.g., due midnight Thursday 23:59:59pm, submitted on Saturday, receive 90 points: 90*80%=72 points Academic conduct - see statement on Blackboard-7-...
View Full Document

This note was uploaded on 04/07/2008 for the course EECS 233 taught by Professor Rabinovich during the Spring '08 term at Case Western.

Page1 / 19

Lecture1Blackboad - EECS 233 Introduction to Data...

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

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