Courses tagged with "Evaluation" (733)

从操作系统与虚拟化平台面临的安全问题和应该采取的安全机制入手，帮助你学习和掌握计算机系统安全的基本理论、技术、方法和评测标准。Learn about operating system and virtualization security issues, related security theories, technologies, methods and evaluation criteria, as well as gain a deeper understanding of computer system security.

《操作系统原理》是针对计算机科学技术专业三年级本科生开设的一门专业基础课程。本课程着重学生系统观的培养，通过重点讲述操作系统的内部结构、工作原理及典型技术的实现，使学生建立起对操作系统的整体及各个功能模块的认识，从而系统掌握计算机的专业知识，进一步提升学生的软件开发能力乃至系统软件开发能力。

Despite the large volume of data mining papers and tutorials available on the web, aspiring data scientists find it surprisingly difficult to locate an overview that blends clarity, technical depth and breadth with enough amusement to make big data analytics engaging. This course does just that.

Each module starts with an interesting real-world example that gives rise to the specific research question of interest.

Students are then presented with a general idea of how to tackle this problem along with some intuitive and straightforward approaches.

Finally, a number of representative algorithms are introduced along with concrete examples that show how they function in practice.

While theoretical analysis sometimes overcomplicates things for students, here it’s applied to help them better understand the key features of the techniques.

本课程完整覆盖数据挖掘领域的各项核心技术，包括数据预处理、分类、聚类、回归、关联、推荐、集成学习、进化计算等。强调在知识的广度、深度和趣味性之间寻找最佳平衡点，在生动幽默中讲述数据挖掘的核心思想、关键技术以及一些在其它相关课程和教科书中少有涉及的重要知识点。本课程适合对大数据和数据科学感兴趣的各专业学生以及工程技术人员学习，不追求纯粹的理论推导，而是把理论与实践有机结合，让学生学到活的知识、有用的知识和真正属于自己的知识，特别是数据分析领域的研究方法和思维方式。    

“数据结构与算法”是计算机学科中的核心基础课程。课程的主要目标培养学生较全面地理解基本数据结构的概念和经典算法的思想及各种实现方法，掌握数据结构和算法的设计分析技术。根据所求解问题的性质选择合理的数据结构并对时间空间复杂性进行必要的控制，提高程序设计的质量。使得学生在将来的学习、研究和工作中，具备设计和实现高效的数据结构和算法的能力。

课程介绍视频也可以访问中国网站

点击上方绿色按钮报名。

计算机是现代社会中用于解决问题的重要工具。利用计算机解决实际问题需要将问题抽象，并对数据进行操作，最后通过计算机程序求解问题。而本门课程主要内容就是对以上内容进行研究。

图灵奖获得者N.Wirth写了一本经典著作“程序=算法+数据结构”。数据结构，是抽象的表示数据的方式；算法，则是计算的一系列有效、通用的步骤。算法与数据结构是程序设计中相辅相成的两个方面。

我 们会围绕着“算法+数据结构=程序”的思路，以问题求解为导向进行学习。希望能够帮助大家提高理论、抽象、设计的能力。在扎实的经典理论基础上，运用问题 抽象、数据抽象、算法抽象来分析问题，应用适当的数据结构和算法来设计和实现相应的程序。通过课程学习，大家的抽象思维能力、问题求解能力将得到较大提 升，编程能力和代码质量会有质的飞跃！

在求解实际问题方面，我们会学习到通过权衡时空和其他资源开销，利用数据结构来组织数据、设计高效的算法、完成高质量的程序以满足错综复杂的实际应用需要。

此外，课程所学到的内容会被利用到计算机科学后续的各个课程中，如操作系统、软件工程、数据库概论、编译技术、计算机图形学、人机交互等。希望可以为大家将来从事计算机相关的学习、研究和开发工作打下扎实的基础。

本课程采用张铭主编的国家“十一五”规划教材《数据结构与算法》（高等教育出版社）。适合计算机以及相关理工专业的大二本科生学习，需要先修过计算概论等课程，具有结构化和面向对象的程序设计基础。

课程主要包括的内容有：线性表，栈与队列，字符串，二叉树，树，图，排序（内排序，外排序），检索，索引，高级数据结构、以及数据结构应用。课程持续16周（分为两个session，每个8周），学习者每周在本课程上需要投入4－8小时。

本课程的本次开设得到Google研究经费支持。

Computers are an important tool for problem solving and are deeply involved in modern life. Computers perform operations on data. What is the logical relationship among data? How is data stored in computers? What algorithms are required to solve particular problems? These are the questions that will be answered in “Data Structures and Algorithms,” an important core course in Computer Science. The course also introduces students to fundamental data structures and classical algorithms used in more specialized courses, including Operating Systems, Software Engineering, Database Systems, Compiler Principles, Computer Graphics and Human Computer Interaction.

Niklaus Wirth described the important and indivisible link between algorithms and data structure in his book, Algorithms + Data Structures = Programs.

The course will build on Wirth’s ideas as it helps students improve their knowledge of theory and their ability to think abstractly to solve problems. Building on a solid theoretical foundation, students will analyze problems using data and algorithm abstraction. Students will learn how to organize data efficiently and make tradeoffs between space and time complexity, design efficient and effective algorithms, and implement high quality programs to solve complex real-world problems. After studying this course, students will be well prepared for further study and research in engineering and other computer-related areas.

This is an intermediate-level course appropriate for sophomore students majoring in computer science or other science/engineering disciplines. Students should have learned "introduction to computing", with the knowledge of structured and object-oriented programming.

This course is presented in two eight-week sessions.

Students who score 60% or higher will receive an Honor Code Certificate.

The Autumn 2014 Sessions of this course are supported by Google.

课程采用的算法语言? Which programming languages does the course use?

本课程采用基于C++的伪代码授课和出习题。编程作业是POJ自动评判的，该平台目前接受 C、C++、Java等都可以。

The course’s content and exercises are both based upon C++ pseudo code. Programming assignments are automatically assessed by POJ which accepts code written in C/C++ and JAVA.

课程介绍视频也可以访问中国网站

计算机是现代社会中用于解决问题的重要工具。利用计算机解决实际问题需要将问题抽象，并对数据进行操作，最后通过计算机程序求解问题。而本门课程主要内容就是对以上内容进行研究。

图灵奖获得者N.Wirth写了一本经典著作“程序=算法+数据结构”。数据结构，是抽象的表示数据的方式；算法，则是计算的一系列有效、通用的步骤。算法与数据结构是程序设计中相辅相成的两个方面。

我 们会围绕着“算法+数据结构=程序”的思路，以问题求解为导向进行学习。希望能够帮助大家提高理论、抽象、设计的能力。在扎实的经典理论基础上，运用问题 抽象、数据抽象、算法抽象来分析问题，应用适当的数据结构和算法来设计和实现相应的程序。通过课程学习，大家的抽象思维能力、问题求解能力将得到较大提 升，编程能力和代码质量会有质的飞跃！

在求解实际问题方面，我们会学习到通过权衡时空和其他资源开销，利用数据结构来组织数据、设计高效的算法、完成高质量的程序以满足错综复杂的实际应用需要。

此外，课程所学到的内容会被利用到计算机科学后续的各个课程中，如操作系统、软件工程、数据库概论、编译技术、计算机图形学、人机交互等。希望可以为大家将来从事计算机相关的学习、研究和开发工作打下扎实的基础。

本课程采用张铭主编的国家“十一五”规划教材《数据结构与算法》（高等教育出版社）。适合计算机以及相关理工专业的大二本科生学习，需要先修过计算概论等课程，具有结构化和面向对象的程序设计基础。

在 第一部分学完了线性表、栈与队列、字符串、二叉树、树和图这些基础数据结构之后，第二部分我们将深入学习排序、检索、索引、高级数据结构以及数据结构应用 等内容。涉及快速排序、外排序等各种经典排序算法，集合、散列、位图等检索方法，B/B+树、Trie树等索引结构，广义表、多维数组等高级线性结 构，AVL、红黑树、伸展树等平衡二叉树。第二部分课程持续8周，学习者每周在本课程上需要投入4－8小时。本课程的本次开设得到Google研究经费支 持。

Computers are an important tool for problem solving and are deeply involved in modern life. Computers perform operations on data. What is the logical relationship among data? How is data stored in computers? What algorithms are required to solve particular problems? These are the questions that will be answered in “Data Structures and Algorithms,” an important core course in Computer Science. The course also introduces students to fundamental data structures and classical algorithms used in more specialized courses, including Operating Systems, Software Engineering, Database Systems, Compiler Principles, Computer Graphics and Human Computer Interaction.

Niklaus Wirth described the important and indivisible link between algorithms and data structure in his book, Algorithms + Data Structures = Programs.

The course will build on Wirth’s ideas as it helps students improve their knowledge of theory and their ability to think abstractly to solve problems. Building on a solid theoretical foundation, students will analyze problems using data and algorithm abstraction. Students will learn how to organize data efficiently and make tradeoffs between space and time complexity, design efficient and effective algorithms, and implement high quality programs to solve complex real-world problems. After studying this course, students will be well prepared for further study and research in engineering and other computer-related areas.

This is an intermediate-level course appropriate for sophomore students majoring in computer science or other science/engineering disciplines. Students should have learned "introduction to computing", with the knowledge of structured and object-oriented programming.

This course is presented in two eight-week sessions. In session 1, we learnt Linear Lists, Stacks, Queues, Strings, Binary Trees, Trees and Graphs, which are fundamental data structures. In the second session, we will study advanced data structures and algorithms, such as Sorting, Searching, Indexing, as well as their applications thoroughly. More detailed, these chapters include a variety of classic Sorting algorithms (Quicksort, External Sorting), Searching methods (Sets, Hash Tables, Bitmaps), Indexing structures (B/B+ trees, Trie trees), Advanced List-Structure (generalized lists, Multi-dimensional arrays) and Balanced Binary Trees (AVL, Red-Black trees, Splay trees). The second part of the course lasts eight weeks. Each week, student will spend 4-8 hours to follow this course.

Students who score 60% or higher will receive an Honor Code Certificate.

The Autumn 2014 Sessions of this course are supported by Google.

课程采用的算法语言? Which programming languages does the course use?

本课程采用基于C++的伪代码授课和出习题。编程作业是POJ自动评判的，该平台目前接受 C、C++、Java等都可以。

The course’s content and exercises are both based upon C++ pseudo code. Programming assignments are automatically assessed by POJ which accepts code written in C/C++ and JAVA.

Data structures play a central role in computer science and are the cornerstones of efficient algorithms. Knowledge in this area has been at the kernel of related curriculums. This course aims at exploring the principles and methods in the design and implementation of various data structures and providing students with main tools and skills for algorithm design and performance analysis. Topics covered by this course range from fundamental data structures to recent research results. "Data Structures and Algorithm Design Part I" is an introductory course focusing on basic data structures, including vectors, lists, stacks, queues, binary trees, and graphs. They are important in programming practice, as well as fundamental to our advanced course: "Part II."

数据结构是计算机科学的关键内容，也是构建高效算法的必要基础。其覆盖的知识，在相关专业的课程体系中始终处于核心位置。本课程旨在围绕各类数据结构的设 计与实现，揭示其中的规律原理与方法技巧；同时针对算法设计及其性能分析，使学生了解并掌握主要的套路与手法。讲授的主题从基础的数据结构，一直延伸至新 近的研究成果。本学期的数据结构（上），是数据结构的入门课程，着重讲解向量、列表、栈、队列、二叉树、图等基本的数据结构，它们不仅本身具有重要实用价值，而且为学习后续课程“数据结构（下）"提供了基础。更多介绍详见：http://dsa.cs.tsinghua.edu.cn/~deng/ds/mooc/，或加入本课之后查看FAQ栏目。

Data structures play a central role in computer science and are the cornerstones of efficient algorithms. Knowledge in this area has been at the kernel of related curriculums. This course aims at exploring the principles and methods in the design and implementation of various data structures and providing students with main tools and skills for algorithm design and performance analysis. Topics covered by this course range from fundamental data structures to recent research results. "Data Structures and Algorithm Design Part II" is an advanced course extending the materials in "Part I". We will cover more powerful and sophisticated data structures & algorithms, including:  splay trees, B-trees, red-black trees, hash tables, priority queues, strings and sorting.

数据结构是计算机科学的关键内容，也是构建高效算法的必要基础。其中涉及的知识，在相关专业的课程系统中始终处于核心位置。本课程旨在围绕各类数据结构的设计与实现，揭示其中的规律原理与方法技巧；同时针对算法设计及其性能分析，使学生了解并掌握主要的套路与手段。讲授的主题从基础的数据结构，一直延伸至新近的研究成果。    

这门课程将帮助学生学习如何运用基础的数据结构和相关算法解决实际应用问题。 This course will help students learn how to use basic data structures and algorithms solving real-world problems.

Machine learning is the study that allows computers to adaptively improve their performance with experience accumulated from the data observed. The course teaches the most fundamental algorithmic, theoretical and practical tools that any user of machine learning needs to know. [機器學習旨在讓電腦能由資料中累積的經驗來自我進步。本課程將介紹各領域中的機器學習使用者都應該知道的基礎演算法、理論及實務工具。]

The course extends the fundamental tools in "Machine Learning Foundations" to powerful and practical models by three directions, which includes embedding numerous features, combining predictive features, and distilling hidden features. [這門課將先前「機器學習基石」課程中所學的基礎工具往三個方向延伸為強大而實用的工具。這三個方向包括嵌入大量的特徵、融合預測性的特徵、與萃取潛藏的特徵。]

点击上方绿色按钮报名。

本课程的 教学内容包括：形式语言与自动机理论、可计算性理论、计算复杂性理论等三个部分。这些内容分别回答下列问题：（1）有哪些计算装置？它们的能力如何？ （2）什么是计算？哪些问题是（不）可计算的？（3）什么是有效计算？哪些问题是（不）可有效计算的？通过这门课程的学习，学生将了解计算理论的基础知 识，掌握有效计算的概念。
本课程的教学方式包括教学录像片段（每段录像8-20分钟，内含1-2个测验问题），教学录像之外的书面作业，以及（必须参加的）期末考试。
本课程课程的总长度为8周，每周教学录像长度大约120分钟。需要的预备知识是离散数学（集合论、数理逻辑、图论等）的基本概念。

本课程需要哪些资源才能进行学习？

答：一台联网的电脑，纸和笔，以及最重要的好奇心。

本课程最有趣的内容是什么？

答：本课程将告诉你计算机不可能做到的一些事情。

本课程需要什么先修课程？

答：离散数学的基础知识，包括集合、关系、函数、逻辑、图等。

本课程面向非计算机软件专业本科生及相关IT行业从业人士，介绍计算机科学和信息技术理论基础的概念和思想方法。

本课程为面向中学生的零基础大学先修课。课程内容为依托C++讲授C语言程序设计,即讲授C++语言中除面向对象特性以外的部分（与C语言重叠的部分）、C++ STL中最常用的用于排序和查找的算法和容器，以及简单排序，顺序查找、二分、递归初步等基础编程思想。

Course Introduction video can also visit China website

"Program Design Basics" is the computer science and technology professional core courses are compulsory subjects basis. School of Computer Science and Technology, Jilin University "program design" course is a national boutique lesson.

The course for the university first semester, no undergraduate Prerequisite, but requires high school students to better grasp of English, mathematics and other subjects related knowledge, and have basic computer skills.

The course in C language as the carrier, the introduction of PAD indicates that the program logic, the main contents include: algorithms, structured programming, functions, recursion, data types, arrays, pointers, structures, documents, lists and so on.

This course teaches basic video main ideas and methods of programming. Focus on training and the ability to train students in computational thinking and programming capabilities. Teaching guiding principle is "the main line to program design," teaching method is "driven by the case." Teaching PAD describe the algorithm used in the process, leads to knowledge through practical examples, and through programming examples to explain knowledge to enhance students understanding. To familiarize students with the main programming language structure, to understand the basic idea of ​​program design, program design master the basic method has certain computational thinking ability and preliminary program design capabilities.

This course is offered by Jilin University, recommended by the Peking University.

本课程采用哪本教材？

张长海，陈娟. 程序设计基础（第2版）. 高等教育出版社，2013.09，国家级精品教材。

本课程采用何种授课形式？

本课程由视频课程、在线测试、编程练习、期中/期末考试等部分组成。

课程采用什么编程语言?

C语言。

课程是否有作业？

There is. Objective questions and programming operations into question in two parts. "Objective questions" is used to examine students' mastery of the knowledge involved in the course. "Programming Operations" course examination focus. Programming assignments in this course through the "Online" program submission, you need to log classmates designated website, online submission program code, online instant viewing program execution results. Programming assignments in this course will begin the third week of the start of the course layout, then, we will give the appropriate prompt, please log on to the site and complete the job. Every job open seven days, after the deadline to submit invalid.

《程序设计实习》课程是北京大学的本科生主干基础课程。课程的主要目标有二： 一、掌握C++语言的语法和标准模板库，能用C++语言以面向对象的方法来编写规模较大的程序。 二、掌握枚举、递归、搜索、动态规划等基本的算法思想。通过大量的高强度的编程训练，提高动手能力，做到能较为熟练、完整、准确地实现自己设计的程序，为进一步学习其他计算机专业课程，或在其他专业领域运用计算机编程解决问题奠定良好的基础。

*Note - This is an Archived course*

点击上方绿色按钮报名

关于课程：
本课程内容程涵盖枚举、二分、贪心、递归、深度优先搜索、广度优先搜索、动态 规划等基本算法，配以适量的在线评测例题，使得学员通过本课程的学习，不但能够掌握这些算法的原理，还能够对这些算法进行灵活应用以及准确实现。本课程的 中的编程任务，将充分训练学员的思维能力和动手能力，促成对学员全面、缜密思考问题的习惯。达到本门课程的要求，即意味者学员具备了初步的算法基础和较强 的编程实现能力。
 
教学大纲：
第1周 枚举算法
第2周 递归算法
第3周 动态规划算法 (1)
第4周 动态规划算法 (2)
第5周 深度优先搜索算法 (1)
第6周 深度优先搜索算法 (2)
第7周 广度优先搜索算法
第8周 二分与贪心算法
 
课程配套教材：
《程序设计导引及在线实践》，李文新，郭炜，余华山，清华大学出版社，2007
 
课程形式：
本课程由视频课程、在线练习、编程练习以及在线编程考试等部分组成。

学这门课需要数学基础吗?

不需要，是算法课，不是数学课。有高中数学知识足矣。

这门课的程序用什么语言编写? 学这门课是否一定要会C++?

课堂的例程都是用C++编写的，要看懂需要一定C++的知识。至于完成作业，用C, C++, Java,Pascal语言都可以。

还是不明白算法到底有什么用。会各种编程语言不就行了吗？

语言只是实现算法的工具。没有好的算法，许多问题，计算机是不能够在人可以接受的时间内计算出结果的。各大IT公司招聘时往往会考察算法，而不是只问你会哪些语言。不会算法，掌握再多种语言，也很难说是一个好的程序员。

This is a past/archived course. At this time, you can only explore this course in a self-paced fashion. Certain features of this course may not be active, but many people enjoy watching the videos and working with the materials. Make sure to check for reruns of this course.

学习面对实际问题如何设计算法与分析算法。

算法设计与分析是计算机科学的核心课程之一。在了解了分治策略、动态规划、贪心法、回溯和分支限界等基本的算法设计技术的基础上，通过线性规划和网络流算法的学习，可以进一步掌握两类重要问题的建模和算法设计方法。此外，面对实际问题，只有对问题的性质有着清晰的分析，才能提出有效的解决方案。需要进一步考虑的是：怎么估计这个问题的难度？最好的算法的效率有多高？这些都涉及到问题复杂度的分析与计算复杂性理论。通过本课程的学习，可以了解有关计算复杂性理论的基础知识、方法和应用，学习近似算法、随机算法等更多的算法设计技术和分析方法，进一步提高处理复杂问题的能力。

This course will introduce basic concepts of computer programming. We will use C as the language to teach student how to write computer programs to solve problems.