This course is the fourth of eight courses aiming to help you to become confident working with algorithms and data structure. You will learn the history of algorithms, discretisation and pseudocode and Euclidean algorithm in pseudocode.
This week, we will cover three key concepts: problems in computer science (CS), algorithms in CS, and flowcharts.
涵盖的内容
4个视频3篇阅读材料3个作业2个讨论话题
显示有关单元内容的信息
4个视频•总计24分钟
Introduction to this course in the specialisation•2分钟
What is a problem? What is an algorithm?•8分钟
Al-Khwarizmi and Euclid•4分钟
From mathematics to digital computers•10分钟
3篇阅读材料•总计23分钟
Course Syllabus•10分钟
Getting ready for this course
•10分钟
Maths in this course•3分钟
3个作业•总计30分钟
Problems in Computer Science•10分钟
The history of algorithms•10分钟
From mathematics to digital computers•10分钟
2个讨论话题•总计50分钟
Think of a problem•30分钟
Algorithms in the media•20分钟
Week 2: Problems, algorithms and flowcharts - Part 2
第 2 单元•小时 后完成
单元详情
This week, we will continue covering the three key concepts: problems in computer science (CS), algorithms in CS, and flowcharts.
涵盖的内容
4个视频3个作业2个讨论话题
显示有关单元内容的信息
4个视频•总计13分钟
Introduction to flowcharts•8分钟
My example of my morning routine as a flowchart•1分钟
Conclusion•2分钟
The Birthday Party problem•2分钟
3个作业•总计50分钟
Introduction to flowcharts•10分钟
Introduction to algorithms•10分钟
Summative Quiz•30分钟
2个讨论话题•总计50分钟
Your morning routine•20分钟
Solution to the Birthday Party problem•30分钟
Week 3: Pseudocode - Part 1
第 3 单元•小时 后完成
单元详情
This week, we will cover three key concepts: pseudocode, iteration and conversion from flowcharts to pseudocode.
涵盖的内容
5个视频2个作业3个讨论话题
显示有关单元内容的信息
5个视频•总计37分钟
Solution to the Birthday Party problem•6分钟
Discretisation and pseudocode•9分钟
Pseudocode and functions•5分钟
Introduction to loops in pseudocode•13分钟
Euclidean algorithm in pseudocode•5分钟
2个作业•总计25分钟
Pseudocode basics•15分钟
Iteration in pseudocode•10分钟
3个讨论话题•总计80分钟
Discussion of the solution•20分钟
Calculate mod 2 in any base•30分钟
Translate pseudocode into another language•30分钟
Week 4: Pseudocode - Part 2
第 4 单元•小时 后完成
单元详情
This week, we will continue covering three key concepts: pseudocode, iteration and conversion from flowcharts to pseudocode.
The University of London is a federal University which includes 17 world leading Colleges. With extensive experience in distance learning since 1858, University of London has enriched the lives of thousands of students, delivering high quality degrees across the globe. Today, University of London is a global leader in flexible study, offering degree programmes to over 45,000 students in over 190 countries, delivering world-leading research across the world. To find out more about University of London, visit www.london.ac.uk
确定
人们为什么选择 Coursera 来帮助自己实现职业发展
Felipe M.
自 2018开始学习的学生
''能够按照自己的速度和节奏学习课程是一次很棒的经历。只要符合自己的时间表和心情,我就可以学习。'
Jennifer J.
自 2020开始学习的学生
''我直接将从课程中学到的概念和技能应用到一个令人兴奋的新工作项目中。'
Larry W.
自 2021开始学习的学生
''如果我的大学不提供我需要的主题课程,Coursera 便是最好的去处之一。'
Chaitanya A.
''学习不仅仅是在工作中做的更好:它远不止于此。Coursera 让我无限制地学习。'
常见问题
When will I have access to the lectures and assignments?
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.