Scheduling: The Decreasing Time Algorithm

– WELCOME TO A LESSON ON THE DECREASING TIME ALGORITHM. IN THIS LESSON WE WILL APPLY THE DECREASING TIME ALGORITHM TO DETERMINE A PRIORITY LIST AND THEN CREATE A SCHEDULE USING THE LIST PROCESSING ALGORITHM. IN OUR PREVIOUS EXAMPLES WE WERE GIVEN THE PRIORITY LIST, BUT NOW WE’LL LOOK AT A METHOD OF CREATING A […]

Graph Theory: Kruskal’s Algorithm

– WELCOME TO A LESSON ON KRUSKAL’S ALGORITHM THAT’S USED TO FIND THE MINIMUM COSTS OF SPANNING TREE. FOR REVIEW, A SPANNING TREE IS A CONNECTED GRAPH USING ALL VERTICES IN WHICH THERE ARE NO CIRCUITS. IN OTHER WORDS, THERE’S A PATH FROM ANY VERTEX TO ANY OTHER VERTEX, BUT NO CIRCUITS. THE DARK BLUE […]

Scheduling: The List Processing Algorithm Part 1

– WELCOME TO A LESSON ON THE LIST PROCESSING ALGORITHM FOR SCHEDULING. IN THE INTRODUCTION LESSON, WE LOOKED AT COMPLETED SCHEDULES. SMALL SCHEDULES CAN BE EQUATED USING GUESS AND CHECK, BUT WOULD NOT WORK WELL WITH DOZENS OR HUNDREDS OF TASKS. TO CREATE A MORE PROCEDURAL APPROACH, WE MIGHT BEGIN WITH A PRIORITY LIST. ONCE […]

Graph Theory: Sorted Edges Algorithm (Cheapest Link Algorithm)

– WELCOME TO A LESSON ON THE SORTED EDGES ALGORITHM THAT CAN BE USED TO TRY TO FIND THE OPTIMAL OR LOWEST COST HAMILTONIAN CIRCUIT. SO AS AN ALTERNATIVE OUR NEXT APPROACH WE’LL STEP BACK AND LOOK AT THE BIG PICTURE. WE DETERMINE A HAMILTONIAN CIRCUIT BY SELECTING EDGES WITH THE LEAST WEIGHT AND THEN […]

Scheduling: The List Processing Algorithm Part 2

– WELCOME TO PART 2 OF THE LESSON ON THE LIST PROCESSING ALGORITHM FOR SCHEDULING. IN THIS LESSON, WE’LL TAKE A LOOK AT AN EXAMPLE WHERE WE ALSO CREATE THE DIAGRAPH FROM A PRIORITY LIST BEFORE EQUATING THE SCHEDULE. LET’S BEGIN BY REVIEWING THE LIST PROCESSING ALGORITHM. STEP 1 ON THE DIAGRAPH OR PRIORITY LIST, […]

Graph Theory: The Brute Force Algorithm

– WELCOME TO A LESSON ON THE BRUT FORCE ALGORITHM IN ORDER TO FIND THE LOWEST COST HAMILTONIAN CIRCUIT. TO REVIEW, A HAMILTONIAN CIRCUIT IS A CIRCUIT THAT VISITS EVERY VERTEX ONCE WITH NO REPEATS. BEING A CIRCUIT, IT MUST AND START AND END AT THE SAME VERTEX. TO ANSWER THE QUESTION OF HOW TO […]

THE WAV3OFFICIAL CYPHER PART 1 (REMASTERED) WARNING: HIGHLY FLAMMABLE

Aye, Aye, BLACKFIRE YUH BLACKFIRE BLACKFIRE…BLACKFIRE YUH………..HANGH!!!! THIS IS BLACKFIRE THE GOD AYE…..YUH THIS NOT THE WAVE THIS THE MOB MURDER BEATS IS MY PASSION DEFEAT THE BEAT IS MY JOB EAT THE BEAT CORN ON THE COB UNLEASH THE HEAT WHEN THE BEAT DROP THE WAVE OFFICIAL MY FASHION MY WRIST LOOKIN LIKE A […]

Scheduling: The Critical Path Algorithm Version 1 (Part 2)

– WELCOME TO THE SECOND LESSON ON VERSION 1 OF THE CRITICAL PATH ALGORITHM. IN THIS LESSON WE’LL APPLY VERSION 1 OF THE CRITICAL PATH ALGORITHM TO GREATER PRIORITY LIST AND THEN ALSO CREATE A SCHEDULE. SO FOR REVIEW FROM THE FIRST LESSON, HERE ARE THE FOUR STEPS FOR A VERSION 1 OF THE CRITICAL […]