If your programming becomes complex, you will need to know how to write well-structured and well-tested code that is easy to maintain. The [course_title] course will guide you to write complex codes efficiently and simply so that it can be easily understood.
The course teaches you the use of abstraction that will help you to get shorter and better-tested codes. The course also teaches you to design search programs and to design puzzle solvers like Sudoku and others.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: The University of British Columbia
Course Curriculum
Mutual Reference | |||
Mutually Recursive Data | 00:09:00 | ||
Templating Mutual Recursion | 00:05:00 | ||
Functions on Mutually Recursive Data – Part 1 | 00:13:00 | ||
Functions on Mutually Recursive Data – Part 2 | 00:12:00 | ||
Backtracking Search, Part 1 | 00:04:00 | ||
Backtracking Search, Part 2 | 00:05:00 | ||
Backtracking Search, Part 3 | 00:04:00 | ||
Backtracking Search, Part 4 | 00:06:00 | ||
Two One-of Types | |||
Cross Product Table | 00:11:00 | ||
Cross Product Code | 00:15:00 | ||
Local | |||
Introduction | 00:01:00 | ||
Forming and Intuition | 00:05:00 | ||
Lexical Scoping | 00:08:00 | ||
Evaluation Rules | 00:08:00 | ||
Encapsulation | 00:18:00 | ||
Avoiding Recomputation | 00:10:00 | ||
Evaluation Tutorial Video | 00:07:00 | ||
Abstraction | |||
Introduction | 00:01:00 | ||
From Examples 1 | 00:11:00 | ||
From Examples 2 | 00:10:00 | ||
From Examples 3, Part 1 | 00:11:00 | ||
From Examples 3, Part 2 | 00:06:00 | ||
Using Built In Abstract Functions, Part 1 | 00:13:00 | ||
Using Built in Abstract Functions, Part 2 | 00:06:00 | ||
Closures | 00:12:00 | ||
Fold Functions, Part 1 | 00:09:00 | ||
Fold Functions, Part 2 | 00:01:00 | ||
Fold Functions, Part 3 | 00:11:00 | ||
Generative Recursion | |||
Introduction | 00:02:00 | ||
Fractals, Part 1 | 00:17:00 | ||
Fractals, Part 2 | 00:08:00 | ||
Termination Arguments, Part 1 | 00:07:00 | ||
Termination Arguments, Part 2 | 00:04:00 | ||
Search | |||
lambda Expressions | 00:09:00 | ||
Introduction | 00:02:00 | ||
Sudoku — Terminology | 00:03:00 | ||
Sudoku – Data Definitions and Primitives | 00:12:00 | ||
Sudoku — The Search Intuition | 00:06:00 | ||
Sudoku — Template Blending | 00:14:00 | ||
Sudoku — Making the Wish List | 00:04:00 | ||
Sudoku — Making the Wish List Come True Part 1 | 00:03:00 | ||
Sudoku — Making the Wish List Come True Part 2 | 00:21:00 | ||
Sudoku — Making the Wish List Come True Part 3 | 00:21:00 | ||
Accumulators | |||
Context Preserving Accumulators Part 1 | 00:06:00 | ||
Context Preserving Accumulators, Part 2 | 00:10:00 | ||
Sample Problem: skipn Part 1 | 00:02:00 | ||
Sample Problem: skipn Part 2 | 00:09:00 | ||
Tail Recursion Part 1 | 00:06:00 | ||
Tail Recursion Part 2 | 00:02:00 | ||
Tail Recursion Part 3 | 00:01:00 | ||
Tail Recursion Part 4 | 00:10:00 | ||
Worklist Accumulators 1, Part 1 | 00:02:00 | ||
Worklist Acumulators 1, Part 2 | 00:03:00 | ||
Worklist Accumulators 1, Part 3 | 00:13:00 | ||
Worklist Accumulators 2, Part 1 | 00:09:00 | ||
Worklist Accumulators 2, Part 2 | 00:11:00 | ||
Worklist Accumulators 2, Part 3 | 00:09:00 | ||
Worklist Accumulators 2, Part 4 | 00:15:00 | ||
Graphs | |||
Introduction | 00:04:00 | ||
Constructing Cyclic Data Part 1 | 00:08:00 | ||
Constructing Cyclic Data Part 2 | 00:08:00 | ||
Templating | 00:14:00 | ||
Problem: reachable? | 00:08:00 | ||
Introducing: The Career Development Series | 00:03:00 | ||
Part 1: The Question | 00:01:00 | ||
Merge Sort, Part 1 | 00:07:00 | ||
Merge Sort, Part 2 | 00:11:00 | ||
Assessment | |||
Submit Your Assignment | 00:00:00 | ||
Certification | 00:00:00 |
Course Reviews
No Reviews found for this course.