World Mentoring Academy "An Open Community for Successful Learning"
Free World class mobile education, earn a Bachelors for less than $5,000 books & Test Fees from State Universities, using Experiential, Design & Project based education. Supporting credit-by-exam & Challenging University courses.
Information for lesson "Data Structures and Algorithms NPTEL CC-E"
Description: Introduction to object oriented programming through stacks, queues and linked lists. Dictionaries: skip-lists, hashing, analysis of collision resolution techniques. Trees, traversals, binary search trees, optimal and average BST’s. 2-4 trees and red-black trees. Tries and pattern matching. Priority queues and binary heaps. Sorting: merge, quick, radix, selection, heap. Graphs, Breadth first search and connected components. Depth first search in directed and undirected graphs and strongly connected components. Spanning trees: Prim's and Kruskal’s algorithm, union-find data structure. Dijkstra’s algorithm for shortest paths, shortest path tree.
Resources: OpenCourseware from NPTEL (India), Sheridan College, MIT, UC Berkeley, Stanford & many other of the World's finest University's.
Professors: Michael Williams
Interested in Mentoring? We are looking for mentors/teachers who are amateurs or professionals in every field. Drop me a line at mike @ worldmentoringacademy . com (in subject line "teaching course")