CS 502: Analysis of
Algorithms
Divide and conquer
Binary search
Powering a number
Fibonacci sequence
Matrix multiplication
Strassens algorithm
VLSI tree layout
Divide and conquer design
paradigm
Divide and conquer design
paradigm
Merge sort
Merge sort
Mas

CS 502: Analysis of
Algorithms
O-, -, - notation
Solving Recurrences
Substitution method
Iterating the recurrence
Recursion tree
Master method
Asymptotic notation
A polynomial of degree k is O(nk)
Asymptotic notation
Asymptotic notation
Asymptotic notatio

CPSC 502: Analysis of
Algorithms
Introduction and course information
Insertion sort
Asymptotic analysis
Merge Sort
Solving Recurrences
Giving credit where credit is due
Thanks to Erik Demaine and Charles
Leiserson (MIT), David Luebke
(University of Virgin

CPEG572Data and Computer Communications
ASSIGNMENT#2
NAME: MOHAMMED ABDUL AHAD YAHIYA
STUDENT ID: 1016601
Ch3:
Q.1
What is the bit rate for each of the following signals?
a. A signal in which 1 bit lasts 0.001 s
Bit rate=
Ans:
1
bit duration
1
0.001
1000