Running Time (3.1) Analysis of Algorithms
Most algorithms transform input objects into output objects. The running time of an algorithm typically grows with the input size. Average case time is often difficult to determine. We focus on the worst case runn
Loop Invariants
It is hard to keep track of what is happening with loops. Loops which don't
terminate or terminate without achieving their goal behavior is a common problem
in computer programming. Loop invariants help. A loop invariant is a formal
statem
4/6/2013
Wasim Hasan
Lecturer in English
MS Applied Linguistics
M.A. English (Linguistics & Literature)
PGD in Computer Sciences
PGD in Linguistics
1
4/6/2013
Effective communication begins with a clearly
organized set of ideas following a logical,
consis
4/6/2013
Wasim Hasan
Lecturer in English
MS Applied Linguistics
M.A. English (Linguistics & Literature)
PGD in Computer Sciences
PGD in Linguistics
Wasim Hasan
Sample Letter
Wasim Hasan
1
4/6/2013
Block Style
Wasim Hasan
Modified Block Style
Wasim Hasan
2
4/6/2013
Wasim Hasan
Wasim Hasan
Lecturer in English
MS Applied Linguistics
M.A. English (Linguistics & Literature)
PGD in Computer Sciences
PGD in Linguistics
1
4/6/2013
Letter: A document that conveys information to
a member of one organization from som
3/26/2013
Wasim Hasan
Wasim Hasan
Lecturer in English
MS Applied Linguistics
M.A. English (Linguistics & Literature)
PGD in Computer Sciences
PGD in Linguistics
1
3/26/2013
A document intended to provide accurate and
unbiased information about a situation
Elevator Pitch: very brief, highly focused description of you or your idea.
Elevator Pitch Outline
Your name
Your tag line
A short explanation as to why are you unique
Task 1.
Presenting your Elevator Pitch before the class.
Your expected time: 1 minute
Elevator Pitch
Assignment
Elevator Pitch: very brief, highly focused description of you or
your idea.
Elevator Pitch Outline
Your name
Companys Name
Your tag line
A short explanation as to what makes your product unique
Task 1.
Presenting your Elevator Pi
Elevator Pitch
Ahmed Aleem
Product Name: The Kitchen Safe
Company Name: Aleema Private Limited
Tagline: Self Control? Not a Problem
I, Ahmed Aleem, representing Aleema Private Limited, will be presenting a very unique and
innovative product named The Kitc
Group Dynamics and Team Building
The term group dynamics refers to the interactions between people who are talking
together in a group setting. Any time there are three or more individuals interacting
or talking together, there are group dynamics.
In any
Acting ethically:
Helps a person live amicably and responsibly with other human beings.
Keeps an individuals conscience clear and provides peace of mind.
Defines a persons character, showing what kind of person he or she is.
When people do not behave e
Ethics and Globalism in the Workplace
Chapter: 2
The writing at workplace differs from writing in your college or university
because, the stakes are much higher at your job. Writing will directly
influence:
Your performance evaluation
Your professional
Mastering Team and Interpersonal Communication
Bovee and Thill
Communicating Effectively in Teams
A team is a unit of two or more people who share a mission and the
responsibility for working to achieve a common goal.
Problem-Solving
Task Forces
Committee
Outline
Proving
SelectionSort
Partition
CS 483 - Data Structures and Algorithm Analysis
Some notes on correctness proofs
R. Paul Wiegand
George Mason University, Department of Computer Science
February 20, 2006
R. Paul Wiegand
CS483 Lecture II
George Maso
Draw the decision tree corresponding to:
if (A[1] < A[2])
cfw_
if (A[0] > A[1])
cfw_
if (A[0] > A[2])
swap(A[0], A[2])
swap(A[0], A[1])
else
cfw_
if (A[0] > A[1])
swap(A[0], A[2])
else
cfw_
if (A[0] > A[2])
swap(A[0], A[2])
swap(A[1], A[2])
1
Radix
So
Lecture 2:
Divide and Conquer I:
Merge-Sort and Master Theorem
Shang-Hua Teng
Example Problem: Sorting
Input: Array A[1.n], of elements in
arbitrary order; array size n
Output: Array A[1.n] of the same elements,
but in the non-decreasing order
Algorithm
Graphs
Examples
Exercise Explore(A)
Explore(A)- Result
Execute DFS on given 12-node graph
Result DFS Search Forest
DFS Directed Graph
DFS Directed Graph
Directed Graph
DAG of Strongly Connected
Components
In decreasing order,
The strongly connected comp
Greedy algorithms
1. Introductory remarks
2. Basic examples:
The coin-changing problem
The traveling salesman problem
3. The activity-selection problem
Algorithms Theory
10 Greedy Algorithms
Prof. Dr. S. Albers
Winter term 07/08
Winter term 07/08
Greedy
Greedy
Algorithms
Amihood Amir
Bar-Ilan University
Idea
Simplest type of strategy:
1. Take a step that makes the problem
smaller.
2. iterate.
Difficulty: Prove that this leads to an
optimal solution.
This is not always the case!
Example: Centerstring Prob
Algorithms (VI)
Yijia Chen
Shanghai Jiaotong University
Chapter 3. Decompositions of graphs
Why graphs?
Why graphs?
A wide range of problems can be expressed with clarity and precision in
the concise pictorial language of graphs.
Graph coloring.
Graph con
Algorithms (IV)
Yijia Chen
Shanghai Jiaotong University
Review of the Previous Lecture
Primality Testing
Fermats little theorem. If p is prime, then for every 1 a < p,
ap1 1 (mod p).
primality(N)
/ Positive integer N
1. Pick a positive integer a < N at ra
Algorithms (IV)
Yijia Chen
Shanghai Jiaotong University
Review of the Previous Lecture
Cryptography
The typical setting for cryptography
Alice and Bob, who wish to communicate in private.
Eve, an eavesdropper, will go to great lengths to nd out what Alice
S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
81
5. And nally, notice that the FFT circuit is a natural for parallel computation and direct
implementation in hardware.
Figure 2.10 The fast Fourier transform circuit.
a2
A( 1 )
001
A( 2 )
010
A( 3 )
01
Design and Analysis of Algorithms
CS 302 Spring 2016
Homework # 4
Assigned: 3rd Feb 2016
Due 13th Feb 2016
Q1) Comparison of Sorting algorithms
In this question, you are going to implement several sorting algorithms and compare their
performance. The perf
Design and Analysis of Algorithms
CS 302 Spring 2016
Homework # 5
Assigned: 2nd March 2016
Due: 12th March 2016
B Tree Implementation
Implement algorithms for B trees as discussed in class in C + or Java. Your program should
take minimum degree t as input
Technical Writing
An introduction
You are a Technical Writer!
Have you ever:
Given someone written directions or drawn a map to your home?
written brief instructions on how to use a machine?
Told someone how to make French toast?
If you answered yes to