1. Welcome to Data Structures

2. Course Introduction Instructor : r 신 용 태 r 愼 鏞 台 r Yongtae Shin r 정보과학관 422 호 r 820-0681 r shin@comp.ssu.ac.kr r Homepage : m http://cherry.ssu.ac.kr/shin r Office Hour : m 10:30-11:30 Tue, 15:00-16:00 Wed or by appointment

4. Course Introduction Readings : r Text book: Horowitz, Sahni, and Metha, Fundamentals of Data Structures in C++, 2 nd Edition. r Supplements: m Class notes will be provided m Any C++ programming language book Goal : r Throughout the semester, we will learn about m Principle of data structures implement via C++ m Various types of data structures and algorithms Linear Hierarchical Mesh type m Searching m Sorting

5. Course Introduction Grading : Exams: 60% Midterm 30% Final 30% Program Assignments: 30% Three programming assignments Attendance: 10% Must be no less than 6% to avoid F grade Program grading criteria - Completeness? - Clearness? - Reusable?

6. Course Introduction Late and Makeup Policies : r Assignments may be turned in one class period late with a 10% penalty. For example, if you turn in an assignment on Monday which was due Friday, your score for the assignment will be maximum 90 out of 100. Assignments more than one class period late will not be accepted. r No make-up exams will be permitted without prior approval. r No credit for cheating of any form (i.e., copying assignments or programs, looking at others exams). A second offense will result in an F for the semester.

7. Course Introduction Conflict : r If you have any concerns about the course, please see me during my office hours or make an appointment. We will try to resolve the problem together.

8. Course Introduction ?  오스카 와일드 [ 아일랜드 ] - 드라마작가 1854.10.16 ~ 1900.11.30 질문들은 경솔한 법이 없다, 답들은 가끔 그러하지만.  스티비 원더 [ 미국 ] - 대중음악인 1950.05.13 ~ 질문하지 않으면 아무것도 얻을 수 없습니다.

9. Course Introduction r Data structures is concerned with the representation and manipulation of data. r All programs manipulate data. r So, all programs represent data in some way. r Data manipulation requires an algorithm. r We shall study ways to represent data and algorithms to manipulate these representations. r Study of data structures is fundamental to Computer Science & Engineering.

10. Prerequisites r C and/or C++ r Why C++? m An ideal language for expressing data structure representation and manipulation. m Support all aspects of object-oriented programming : information hiding, data abstraction and inheritance. r Free Compilers (for Windows) m http://cywin.com m http://www.delorie.com/djgpp/

11. Computer Science r What is the COMPUTER SCIENCE? r How many programming languages?

12. Father of Modern Computer Science r 1936, Turing machine r provided an influential formalization of the concept of the algorithm. Alan Turing(1912-1954)

13. von Neumann Architecture r A computer design model, 1945 John von Neumann (1903-1957)

14. ENIAC r Electronic Numerical Integrator And Computer r The first general purpose electronic computer, 1945 r A Turing-complete device

15. EDVAC r Electronic Discrete Variable Automatic Computer, 1946 r Binary data and a stored program

16. UNIVAC I r UNIVersal Automatic Computer 1 r First commercial computer made in US, 1952 r First customer was US Census Bureau

17. Fields of Computer Science r Mathematical foundations r Theory of computation r Algorithms and data structures r Programming languages and compilers r Concurrent, parallel, and distributed systems r Software engineering r System architecture r Communications Networks r Databases r Artificial intelligence r Visual rendering (or Computer graphics) r Human-Computer Interaction r Scientific computing

18. Computing Careers r Artificial Intelligence r Computer Design and Engineering r Computer Architecture r Information Technology r Software Engineering r Computer Theory r Operating Systems and Networks r Software Applications

19. Lifelong Learning r the fastest growing segments of industry r the fastest changing areas technologically r Success requires an ongoing commitment to learning to maintain knowledge, skills, and career opportunities