The [course_title] is designed to introduce you with the fundamental data structures and algorithms used in software development, extending the object-oriented concepts taught in the pre-requisite subject Programming Principles and Practice. It covers searching and sorting, linked data structures such lists and trees as well as hash tables. You will be able to implement a variety of data structures and algorithms, and will have an expert knowledge of the scalability and design trade-offs of these algorithms.
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: Open Culture
Course Curriculum
| Module: 1 | |||
| Lecture 1: Introduction to Data Structures and Algorithms – Richard Buckland | 00:48:00 | ||
| Lecture 2: Data Structures and Algorithms – Richard Buckland | 00:46:00 | ||
| Lecture 3: Data Structures and Algorithms – Richard Buckland | 00:46:00 | ||
| Lecture 4: data structures and algorithms – Richard Buckland | 00:58:00 | ||
| Lecture 5: Data Structures and Algorithms – Richard Buckland | 00:58:00 | ||
| Lecture 6: Data Structures and Algorithms – Richard Buckland | 00:44:00 | ||
| Lecture 7: Data Structures and Algorithms – Richard Buckland | 00:47:00 | ||
| Lecture 8: Data Structures and Algorithms – Richard Buckland | 00:51:00 | ||
| Lecture 9: Data Structures and Algorithms – Richard Buckland | 00:55:00 | ||
| Module: 2 | |||
| Lecture 10a: Bucket Sort, Counting Sort – Richard Buckland | 00:22:00 | ||
| Lecture 10b: Exponential Growth – Richard Buckland | 00:20:00 | ||
| Lecture11: Data Structures and Algorithms – Richard Buckland | 00:40:00 | ||
| a priori VS a posteriori: Interview with Glen Kelley | 00:03:00 | ||
| Lecture12: Data Structures and Algorithms – Richard Buckland | 00:49:00 | ||
| Lecture13a: Data Structures and Algorithms – Richard Buckland | 00:37:00 | ||
| Lecture13b: Data Structures and Algorithms – Richard Buckland | 00:29:00 | ||
| Lecture14: Data Structures and Algorithms – Richard Buckland | 00:40:00 | ||
| Lecture15: Data Structures and Algorithms – Richard Buckland, UNSW | 00:55:00 | ||
| Lecture 16: Data Structures and Algorithms – Richard Buckland | 00:55:00 | ||
| Module: 3 | |||
| Lecture 17: Data Structures and Algorithms – Richard Buckland | 01:13:00 | ||
| Lecture 18: Data Structures and Algorithms – Richard Buckland | 00:32:00 | ||
| Lecture 19: Data Structures and Algorithms – Richard Buckland | 00:43:00 | ||
| Lecture 20: Data Structures and Algorithms – RIchard Buckland UNSW | 00:22:00 | ||
| Lecture 21: Search Design – Richard Buckland Computing2 UNSW | 00:58:00 | ||
| Lecture 22: Inside and Outside – Richard Buckland UNSW – Computing2 | 00:40:00 | ||
| Lecture 23: Hash Tables – Richard Buckland UNSW Computing2 | 00:59:00 | ||
| Lecture 24: Task 2 – Richard Buckland UNSW | 00:46:00 | ||
| Lecture 25: Hashing – Richard Buckland UNSW | 00:58:00 | ||
| Lecture 26: LOOPS!! – Richard Buckland UNSW | 00:44:00 | ||
| Module: 4 | |||
| 27: Introduction to Graphs – Richard Buckland UNSW | 01:06:00 | ||
| Lecture 29: Design and Discovery – Richard Buckland UNSW 2009 | 00:57:00 | ||
| About the Project: Fury of Dracula – Richard Buckland | 00:42:00 | ||
| Linked List ADT in C 2/2 – Richard Buckland UNSW | 00:06:00 | ||
| Linked List ADT in C 1/2 – Richard Buckland UNSW | 00:09:00 | ||
| 32: What is Life? The Amazing R.H. Conway – Richard Buckland UNSW | 00:37:00 | ||
| 33a: admin only – Richard Buckland UNSW | 00:21:00 | ||
| 33b: Graph Algorithms and Skepticism – Richard Buckland, UNSW | 00:38:00 | ||
| 34a: Controlling Errors – Richard Buckland, UNSW | 00:09:00 | ||
| 34b: Numerical Algorithms I – Richard Buckland UNSW | 00:34:00 | ||
| Module: 5 | |||
| 35a: The loneliest number – Richard Buckland UNSW | 00:09:00 | ||
| 35b: Numerical Algorithms II – Richard Buckland UNSW | 00:48:00 | ||
| not a lecture: just chitchat about the project and misc before extension lecture 36 | 00:24:00 | ||
| 36: Puzzles and Protocols (with Movie) – Richard Buckland UNSW | 00:24:00 | ||
| 37: Balancing – Richard Buckland UNSW | 00:47:00 | ||
| 38: Balanced Trees – Richard Buckland UNSW | 00:40:00 | ||
| 39: Things Go Wrong, Heaps – Richard Buckland UNSW | 01:01:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
