Want to win in an interview? Then enrol the [course_title] course and explore the pattern of technical interviews.
All virtual technical interviews have a specific pattern and style. The course will introduce you to the pattern so that you can be successful in any technical interview. You will learn how to interact with the interviewer.
The course includes the algorithms and data structures concepts which are commonly asked in technical interviews. The course also provides some practice problems, quizzes and mock interviews for judging your present condition and understanding.
Shortly, the course will prepare you for a technical interview.
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: Udacity
Course Curriculum
| Lesson 1: Introduction and Efficiency | |||
| Course Introduction | 00:02:00 | ||
| Syntax | 00:01:00 | ||
| Efficiency | 00:03:00 | ||
| Notation Intro | 00:03:00 | ||
| Notation Continued | 00:02:00 | ||
| Worst Case and Approximation | 00:03:00 | ||
| Lesson 2: List-Based Collections | |||
| Welcome to Collections | 00:01:00 | ||
| Lists | 00:01:00 | ||
| Arrays | 00:03:00 | ||
| Linked Lists | 00:02:00 | ||
| Linked Lists in Depth | 00:03:00 | ||
| Stacks | 00:01:00 | ||
| Stacks Details | 00:02:00 | ||
| Queues | 00:02:00 | ||
| Lesson 3: Searching and Sorting | |||
| Binary Search | 00:02:00 | ||
| Efficiency of Binary Search | 00:09:00 | ||
| Recursion | 00:07:00 | ||
| Intro to Sorting | 00:02:00 | ||
| Bubble Sort | 00:03:00 | ||
| Efficiency of Bubble Sort | 00:03:00 | ||
| Merge Sort | 00:04:00 | ||
| Efficiency of Merge Sort | 00:05:00 | ||
| Quick Sort | 00:04:00 | ||
| Efficiency of Quick Sort | 00:03:00 | ||
| Lesson 4: Maps and Hashing | |||
| Introduction to Maps | 00:01:00 | ||
| Sets and Maps | 00:02:00 | ||
| Introduction to Hashing | 00:02:00 | ||
| Hashing | 00:03:00 | ||
| Collisions | 00:03:00 | ||
| Hash Maps | 00:01:00 | ||
| String Keys | 00:02:00 | ||
| Lesson 5: Trees | |||
| Trees | 00:01:00 | ||
| Tree Basics | 00:02:00 | ||
| Tree Traversal | 00:02:00 | ||
| Depth-First Traversals | 00:03:00 | ||
| Search and Delete | 00:02:00 | ||
| Insert | 00:02:00 | ||
| Binary Search Trees | 00:01:00 | ||
| BSTs | 00:02:00 | ||
| BST Complications | 00:01:00 | ||
| Heaps | 00:02:00 | ||
| Heapify | 00:01:00 | ||
| Heap Implementation | 00:02:00 | ||
| Self-Balancing Trees | 00:02:00 | ||
| Red-Black Trees – Insertion | 00:02:00 | ||
| Tree Rotations | 00:02:00 | ||
| Lesson 6: Graphs | |||
| Graph Introduction | 00:01:00 | ||
| What Is a Graph? | 00:03:00 | ||
| Directions and Cycles | 00:02:00 | ||
| Connectivity | 00:02:00 | ||
| Graph Representations | 00:02:00 | ||
| Adjacency Matrices | 00:02:00 | ||
| Graph Traversal | 00:01:00 | ||
| DFS | 00:03:00 | ||
| BFS | 00:02:00 | ||
| Eulerian Path | 00:03:00 | ||
| Lesson 7: Case Studies in Algorithms | |||
| Case Study Introduction | 00:01:00 | ||
| Shortest Path Problem | 00:01:00 | ||
| Dijkstra’s Algorithm | 00:03:00 | ||
| Knapsack Problem | 00:02:00 | ||
| A Faster Algorithm | 00:03:00 | ||
| Dynamic Programming | 00:03:00 | ||
| Traveling Salesman Problem | 00:01:00 | ||
| Exact and Approximate Algorithms | 00:03:00 | ||
| Lesson 8: Technical Interviewing Techniques | |||
| Interview Introduction | 00:02:00 | ||
| Clarifying the Question | 00:02:00 | ||
| Confirming Inputs | 00:01:00 | ||
| Test Cases | 00:01:00 | ||
| Brainstorming | 00:03:00 | ||
| Runtime Analysis | 00:01:00 | ||
| Coding | 00:10:00 | ||
| Coding 2 | 00:10:00 | ||
| Debugging | 00:03:00 | ||
| Interview Wrap-Up | 00:01:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
