学习笔记 什么是计算机科学

计算机科学并不是单纯的研究电脑，也不是单纯地学习如何编写一个计算机程序，也不是仅仅学习对电脑和软件的使用和应用。

计算机科学研究电脑，但同时更在于学习解决问题的思维方式；编程对计算机科学来说十分重要，但并不是计算机科学学习的本质，它只是一个工具；计算机科学家将理论专业知识应用于实际问题，去寻找解决问题方法，开发新的技术。

 

计算机科学

所以，计算机科学是研究计算，信息和自动化的学科。它包含理论学科和应用学科。

计算机科学的核心概念是解决问题（看待问题的思维方式，解决问题的方法探索和创造，以及解决方法的运用）对于解决方法，计算机科学家设计和开发算法来解决问题，有一下四个研究方向：1.计算理论2.硬件实现3.语言实现4.应用

 

算法

定义：用有限的步骤（一步一步的）解决数学问题（完成任务）的过程，经常涉及重复的步骤。

可以用人，机器，计算机，生物有机体进行计算。通常代理是计算机或机器人。

算法的正式定义:一种有序的，明确的，可有效计算的操作合集，在执行时产生一个结果并在有限的时间内停止。

 

伪代码中的算法

类似于编程语言的指令

简单易读，在一个抽象层面思考问题

 

算法由涉及变量的操作组成

 

变量

可以储存一个值，当程序运行的时候，这个值可以改变

 

算法的种类

basic operations，一个简单的任务，当这个任务完成的时候，算法会移动到下一个操作。

conditional operations,提出问题并选择下一步操作，以回答为基础以执行下一个操作。

iterative operations,算法中的循环指令，重复某一步操作。

 

算法的重要性

若我们能够设计并指定某种算法去解决问题，我们就可以实现自动化而去解决问题。因此计算机科学也是用算法解决问题的科学。

 

算法的必须条件

1.有序且无二义性的操作，是计算机可明确精准的识别并执行操作，可直接理解和执行，不需要做过多的解释和简化。

2.可有效计算的，要确保可有效计算（如分母不能为零，不能取负值平方根等数学问题不会出现不能计算的）

3.可解决问题，一个算法必须要产生结果，并需要展示给使用者，如果算法不产生结果，我们将无法判断算法的正确性，甚至无法判断算法是否已经完成计算。

4.可在有限的时间内停止，算法的结果必须在有限数量的运算后产生。

 

English

Computer science is not simply about studying computers, nor is it simply about learning how to write a computer program, nor is it just about learning how to use and apply computers and software.
Computer science studies computers, but at the same time, it is more about learning problem-solving thinking; Programming is very important for computer science, but it is not the essence of learning computer science. It is just a tool; Computer scientists apply theoretical expertise to practical problems, seek solutions to problems, and develop new technologies.
computer science
So, computer science is a discipline that studies computation, information, and automation. It includes both theoretical and applied disciplines.
The core concept of computer science is problem-solving (the way of thinking about problems, the exploration and creation of problem-solving methods, and the application of problem-solving methods). For problem-solving, computer scientists design and develop algorithms to solve problems. There are four research directions: 1. Computational theory 2. Hardware implementation 3. Language implementation 4. Applications
algorithm
Definition: The process of solving mathematical problems (completing tasks) in finite steps (step by step), often involving repeated steps.
It can be calculated using humans, machines, computers, and biological organisms. Usually, agents are computers or robots.
The formal definition of an algorithm is an ordered, explicit, and computationally efficient set of operations that produce a result during execution and stop within a limited time.
Algorithms in pseudocode
Instructions similar to programming languages
Simple and easy to read, thinking about problems at an abstract level
Algorithms consist of operations involving variables
variable
Can store a value that can be changed when the program runs
Types of Algorithms
basic operations， A simple task, when completed, the algorithm will move to the next operation.
conditional operations, Ask a question and choose the next action, based on the answer to execute the next action.
iterative operations, A loop instruction in an algorithm that repeats a certain step of operation.
The Importance of Algorithms
If we can design and specify an algorithm to solve a problem, we can achieve automation to solve the problem. Therefore, computer science is also a science that uses algorithms to solve problems.
Necessary conditions for algorithms
1. Ordered and unambiguous operations are operations that can be clearly and accurately recognized and executed by computers, and can be directly understood and executed without the need for excessive explanation and simplification.
2. If it can be effectively calculated, it is necessary to ensure that it can be effectively calculated (such as the denominator cannot be zero, negative square roots cannot be taken, etc., mathematical problems that cannot be calculated will not occur)
3. Problem solving: An algorithm must produce results and display them to the user. If the algorithm does not produce results, we will not be able to determine its correctness, or even whether the algorithm has completed the calculation.
4. It can be stopped within a limited time, and the result of the algorithm must be generated after a limited number of operations.

 

内容部分参考老师课件，总结所学知识

第二课！！！

Refer to the teacher's courseware for the content section and summarize the knowledge learned
Lesson 2!!!