tailieunhanh - INTRODUCTION TO COMPUTER SCIENCE - PART 1

INTRODUCTION TO COMPUTER SCIENCE HANDOUT #1. REVIEWS K5 & K6, Computer Science Department, Vaên Lang University Second semester -- Feb, 2002 Instructor: Traàn Ñöùc Quang Major themes: 1. Introduction to Computer Science 2. Three Columns: Data Models, Data Structures, and Algorithms 3. C Essentials 4. Arrays and Linked Lists Reading: Sections , , , and (textbook), C Reference (Microsoft Studio Books Online) INTRODUCTION TO COMPUTER SCIENCE A science of abstraction: creating the right model of a real world. Example: In Windows, we can use a small program called Paint for drawing simple pictures. Paint has tools such as Pencil, Brush,. | INTRODUCTION TO COMPUTER SCIENCE HANDOUT 1. REVIEWS K5 K6 Computer Science Department Văn Lang University Second semester -- Feb 2002 Instructor Trăn Đức Quang Major themes 1. Introduction to Computer Science 2. Three Columns Data Models Data Structures and Algorithms 3. C Essentials 4. Arrays and Linked Lists Reading Sections and textbook C Reference Microsoft Studio Books Online INTRODUCTION TO COMPUTER SCIENCE A science of abstraction creating the right model of a real world. Example In Windows we can use a small program called Paint for drawing simple pictures. Paint has tools such as Pencil Brush Airbrush Eraser etc. They are not real tools rather they are the models of real tools. How to use a computer to solve a problem 1. Choose the important features of the problem analysis 2. Build a model to reflect those features abstraction 3. Write a program to solve it mechanization How to write a good computer program 1. Design data structures 2. Design good algorithms 3. Choose an appropriate programming language to implement the program Example You are hired to implement a computer system for a travel agency. Your system must determine the best route for a traveler to get from location A to location B best means shortest distance traveled . How would you do it 6 INTRODUCTION TO COMPUTER SCIENCE HANDOUT 1. REVIEWS 1. Specify the locations that the system can handle. 2. Create a database of distances between all the locations. Such a database must have a structure that allows for easy updates and quick searches. 3. Create algorithms that will operate on the database. 4. Create an algorithm that finds the shortest route between two locations. 5. Implement a program that takes as input location A and B and outputs the shortest route between the two. There are several examples of abstraction in this example representing the locations and distances as names and numbers placing this data in some kind of abstract data structure in a computer .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.