Analysis of Algorithm Classes Information. <|> Content Updated 21st
JANUARY 2005
Next Expected Class in ??th January 2005 (Class Duration: ...):
Expected Topics
Quiz of Last Class Topics.
etc etc...
10th January 2005, Class Duration: 07:30 PM to 08:30 PM
Network Flow Problem. Spanning Tree.
03rd January 2005, Class Duration: 07:45 PM to 09:00 PM
Topological Sort and its complexity O(v), Shortest Path.
28th December 2004, Class Duration: 07:00 PM to 08:00 PM
What is merging and Merge Sort with Algorithm techniques.
Compare the much large elements record with small elements record, why use others algorithm with merge sort algorithm.
Order of complexity.
27th December 2004, Class Duration: 07:00 PM to 09:00 PM
Logarithm in running time,
Sorting large records,
Introduction of Tree.
21st December 2004, Class Duration: 07:45 PM to 08:45 PM
Definition of Graph Algorithm,
Define the term G ( V , E ) and its detail of its Application
in Traffic, Gas and Water Pipes, Computer networks, Routers etc with examples.
Why solve in graphics and how use graph algorithm for that problems.
The different problem in one type of graph.
Definition of directed graph, undirected graph, strong connected, weakly connected etc.
20th December 2004, Class Duration: 07:40 PM to 08:40 PM
Solve the Mid Term Paper,
Algebraic algorithm:
What is NP?
Introduction of NP completeness
Easy vs. Hard
NP Complete problems 14th December 2004, Class Duration: 08:00 PM to 09:00 PM
Solve the Practice problem Algorithm for the series and equations.
Find the X value from this equation X = 4 a + y
and find the S value from this series
S = 1/3 + 1/6 + 1/9 + … + 1/n
02nd November 2004, Class Duration: 03:30 PM to 05:00 PM
Analyze and Calculate the Running time and submit in next class
for Algo 2.2 from Data Structure (SCHAUM's Outline Series) Book.
Define the Big O and Big Sigma and Big theta notations,
Define the Order of complexity and its three General Rules for solving the running
time calculation in term of Order of complexity. 01st November 2004, Class Duration: 03:00 PM to 04:00 PM
Drive/Solve (Numerically) the Worst Case order of complexity O( N2 ) for Quick Sort.
and
Drive/Solve (Numerically) the Best Case order of complexity O( N log N ) for Quick Sort and Merge Sort. 26th October 2004, Class Duration: 03:00 PM to 04:00 PM
Insertion Sort and its Algorithm.
25th October 2004, Class Duration: 03:00 PM to 05:00 PM
Running Time calculation and its four general rules.
What is order of complexity and discuss in detail
Test of Quick Sort.
19th October 2004, Class Duration: 03:00 PM to 04:00 PM
Quick Sort Algorithm with lower and upper stack.
18th October 2004, Class Duration: 03:30 PM to 05:00 PM
Definition of Sort:-
Bubble Sort.
Quick Sort is application of Stack.
Factorial Programme.
05th October 2004, Class Duration: 07:00 PM to 08:00 PM
Definition of Queue, Front and Rear.
Discuss Insertion Algorithm with dry run, Also Assignment of Deletion algorithm of
Queue etc etc.
04th October 2004, Class Duration: 07:00 PM to 09:00 PM
List. One way, two way and circular.
Stack, Top, Pop, Push and Queue definitions.
PUSH and POP Procedure Algorithm and discuss its problem.
28th September 2004, Class Duration: 07:00 PM to 08:00 PM
Traversing Algorithm from Data Structure Book, Display the all list data, Display the Location of value and
also search the data by constant and variable values.
List Header, Avail, inserting and delete techniques etc.
Check the programme in which display the name with reverse order numbers, Assignment for Quadric equation for
algorithm form.
27th September 2004, Class Duration: 07:00 PM to 09:00 PM
Definition of Analysis of Algorithm, Algorithm Notations, Why
Analyze, and
depend on which factors like OS, Compiler and Hardware etc.
What is list and array, advantages and disadvantages, pointers and its properties.
21st September 2004, Class Duration: 07:40 PM to 08:45 PM
Definition: Data, Data Structure, Algorithm, Array, List.
