Computer Science Ph.D. and professor at Rutgers University. Teacher, technologist, mentor, coach. Champion of aspirers everywhere. Knowledge hound, traveler, reader, writer. Occasional entrepreneur.
All Lessons by Dr. Sesh
-
12 minComputer Science lesson7 CQ
In this lesson, learn how the quicksort algorithm works as it recursively sorts items in an array, and how to analyze the algorithm's running time.
with Dr. SeshIn this lesson, learn how the quicksort algorithm works as it recursively sorts items in an array, and how to analyze the algorithm's running time.
-
16 minComputer Science lesson9 CQ
In this lesson, take a look at some basic computing graphs, including undirected and directed graphs, and learn how and when to use an adjacency matrix.
with Dr. SeshIn this lesson, take a look at some basic computing graphs, including undirected and directed graphs, and learn how and when to use an adjacency matrix.
-
18 minSoftware Development lesson10 CQ
Follow along for a tour of adjacency lists storage, including how to write a Java program that creates directed and undirected graphs based on text files.
with Dr. SeshFollow along for a tour of adjacency lists storage, including how to write a Java program that creates directed and undirected graphs based on text files.
-
13 minComputer Science lesson7 CQ
In this lesson, learn how to use Dijkstra's algorithm and its greedy, single-source approach to find the shortest distance between vertices in a graph.
with Dr. SeshIn this lesson, learn how to use Dijkstra's algorithm and its greedy, single-source approach to find the shortest distance between vertices in a graph.
-
10 minComputer Science lesson6 CQ
Learn how the DFS algorithm functions, when backtracking and restarting occurs, and the running time for DFS in both directed and undirected graphs.
with Dr. SeshLearn how the DFS algorithm functions, when backtracking and restarting occurs, and the running time for DFS in both directed and undirected graphs.