/ ACTIVITY SELECTION
#include<iostream>
#define MAX 50
using namespace std;
int Start[MAX],Finish[MAX],Activity[MAX];
int loc,NUM;
void GreedyActivitySelector()
cfw_
Activity[loc]=0;
int n=0;
for(int m=1;m<NUM;m+)
cfw_
if(Start[m]>=Finish[n])
cfw_
loc+;
A
Greedy Algorithms
Greedy Algorithms
Comp 122, Spring 2004
Overview
Like dynamic programming, used to solve optimization
problems.
Problems exhibit optimal substructure (like DP).
Problems also exhibit the greedy-choice property.
When we have a choice
CSE 3101
Prof. Andy Mirzaian
Greedy
Algorithms
STUDY MATERIAL:
[CLRS]
chapter 16
Lecture Notes 7, 8
2
TOPICS
Combinatorial Optimization Problems
The Greedy Method
Problems:
Coin Change Making
Event Scheduling
Interval Point Cover
More Graph Optimization p
Creational Design PatternsSummary
Software Design, Dr. Fadi Wedyan, Fall
2011
Software Design Course
Faculty of Information
Technology
Hashemite University
Fall 2011
1
What are they?
Design
patterns that deal with object
creation mechanisms, trying to cre
These courseware materials are to be used in conjunction with Software Engineering: A Practitioners Approach, 7/e
and manipulated by Dr. Fadi Wedyan to be used only for the Software Design course at Hashemite University
A complete set of software componen
Introduction to AspectJ
Presented By:
Fadi Wedyan
Software Design Course
Department of Software
1
basic mechanisms
overlay onto Java
join points
points in the execution of Java programs
small additions to Java
pointcuts
pick out join points and values at
Aspect-Oriented Software
Development
This slides are prepared by Dr. Fadi Wedyan to be used for the software Design Course,
Department of Software Engineering
Hashemite University
Introduction
Concern: a particular goal, concept, or area
of interest.
A so
Abstract factory pattern
Intent: Provide an interface for creating
families of related or dependent objects
without specifying their concrete classes.
Also known as Kit
1
Example: pizza store
2
Example: Email editor
Email editors will allow for editing in
Analysis of Algorithms
CS 477/677
Instructor: Monica
Nicolescu
Lecture 2
Algorithm Analysis
The amount of resources used by the algorithm
Running time:
Space
Computational time
The number of primitive operations (steps) executed
before termination
Order o
The Computer
a computer system is made up of various elements
each of these elements affects the interaction
0 input devices text entry and pointing
0 output devices screen (small&large), digital paper
0 virtual reality special interaction and display dev