majorsilence

Finished reading chapter 19 Factory Pattern Method.

See http://www.majorsilence.com/design_patterns_explained.

Uploaded a new copy of ScreenVideoCapture2.

http://majorsilence.com/screen_video_capture

See https://github.com/majorsilence/MajorSilenceConnect

Read the chapter "The Template Method Pattern". Had a hard time concentrating on this chapter.

To quote the book: "Define the skeleton of an algorithm in an operation, deferring some steps to subclasses. Redefine the steps in an algorithm without changing the algorithm's structure." Design Patterns Explained chapter 18 page 283.

See http://www.majorsilence.com/design_patterns_explained

As of a few days ago I purchased a new house and moved in Sunday (16 May 2010).

Since I believe in its current state DeVeDe will never run as good on Windows as it does on Linux I have decided to write a small clone of the DeVeDe dvd module using .NET.

I am creating an IronPython port of DeVeDe. Progress can be tracked from:
http://majorsilence.com/commitlog?repo=1

I am currently planning on keeping the IronPython port of DeVeDe in sync with the main DeVeDe. I also still plan on packaging the main DeVeDe for Windows.

The IronPython port should have less problems with communicating with the underlying backed applications (IronPython has support for asynchronous sub-process communication built-in) and translations should work again.

This example of using IronPython and Gtk Sharp will show how to do the following:

• Layouts with Gtk.VBox
• Gtk.Buttons
• Gtk.Entry
• Widget Events (Callbacks)
• Message Dialogs

For the latest updates check http://majorsilence.com/PyGTK_Book.

This is my summary of the Graphs and Paths chapter. All code is written in c# (converted from java).

Types of Graphs (E - Edges, V - Vertices)
Unweighted: O(|E|) Breadth-first search
Weighted, no negative edges: O(|E| log|V|) Dijkstra's algorithm
Weighted, negative edges: O(|E| * |V|) Bellman-Ford algorithm
Weighted, acyclic: O(|E|) Uses topological sort

A class to represent the Edges:

using System;
using System.Collections;
using System.Collections.Generic;

	public class Edge
	{
		public Vertex dest; // Second vertex in Edge

As I no longer have the time or the money to go back to university to finish my degree I have decided that I will do my own self paced study. I am going to learn as much as I can on my own. I already have some books from when I was in university and I am going to finish them. Then I am going to get more an finish them.

The main purpose of this page is to track my progress as I move through study material. As I progress I will be adding more study material.

Code Complete

• Chapter 1 Welcome to Software Construction