Analysis of Algorithm Classes Information Page <|> Content Updated
21st JANUARY 2005
Next Expected Class in ??th January 2005 (Class Duration: ...):
Expected Topics
Quiz of Last Class Topics.
etc etc...
12th January 2005, Class Duration: 10:00 AM to 11:00 AM
Minimum Spanning Tree.
10th January 2005, Class Duration: 11:30 AM to 12:20 PM
Network flow problems and its application in real life
05th January 2005, Class Duration: 09:30 AM to 10:45 AM
Shortest path (for cyclic, acyclic, directed and undirected graph with weighted and
unweighted) with its benefits and problems .
03rd January 2005, Class Duration: 11:15 AM to 12:15 PM
Topological Sort and its Complexity O(v), Shortest Path.
29th December 2004, Class Duration: 09:00 AM to 11:00 AM
Introduction of Topological Sort and Indegree,
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.
Discuss its Order of complexity.
27th December 2004, Class Duration: 11:15 AM to 12:15 PM
Logarithm in running time,
Large record sorting.
22nd December 2004, Class Duration: 09:00 AM to 11:00 AM
Definition of Tree,
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.
Discuss the different problem in one type of graph.
Definition of directed graph, undirected graph, strong connected, weakly connected etc.
20th December 2004, Class Duration: 11:15 AM to 12:15 PM
Solve the Mid Term Paper,
Algebraic algorithm:
What is NP?
Introduction of NP completeness
Easy vs. Hard
NP Complete problems
15th December 2004, Class Duration: 10:30 AM to 12:00 PM
Solve the practice problem Algorithm for the series and equations.
Drive/Solve (Numerically) the Best Case order of complexity O ( N log N ) for
Quick Sort and Merge Sort.
03rd November 2004, Class Duration: 08:30 AM to 10:30 AM
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.
Drive/Solve (Numerically) the Worst case order of complexity O( N2 ) for
Quick Sort.
And solve its numerical calculations.
02nd November 2004, Class Duration: 08:00 AM to 10:00 AM
Alanyze and Calculate the Running time and submit in next class
for Algo 2.2 from Data Structure (SCHAUM's Outline Series) Book.
Definition of the Worst Case, Best Case and Average Case.
27th October 2004, Class Duration: 09:15 AM to 10:15 AM
Two General Rules of order of complexity.
Insertion Sort and its Algorithm.
26th October 2004, Class Duration: 09:15 AM to 10:15 AM
Algorithm of Quick Sort with using stack and its Definition.
Running Time Calculation.
Discuss only two Rules of Order of Complexity.
20th October 2004, Class Duration: 08:00 AM to 10:00 AM
Quick Sort Definition and its procedure but without Algorithm.
Pivot and scanning pointer in Quick Sort.
19th October 2004, Class Duration: 08:00 AM to 10:00 AM
Definition of Queue.
Insertion of Queue and deletion of Queue.
05th October 2004, Class Duration: 09:00 AM to 11:00 AM
List topic Completed, Definition of Stack, TOP, PUSH and POP.
Algorithm of PUSH and POP. Search Algorithm for the particular Record in Stack.
29th September 2004, Class Duration: 10:00 AM to 11:00 AM
Check the quadric formula algorithm, discuss the H2=B2+P2 , and sum of series in algorithm form.
Complete the List with forward and backward pointer and discuss the circular link list and two way list. 28th September 2004, Class Duration: 09:00 AM to 11:00 AM
Discuss and write the algorithm for Traversing the List and its some steps like Searching by constant value and variable value,
display the searching value location etc etc. 25th September 2004, Class Duration: 09:15 AM to 10:40 AM
Difference between Array and List, How implement list in Memory, what are its advantages and disadvantages.
Traversing and start the algorithm for traversing.
Class suspend due to power failure.
24th September 2004, Class Duration: 09:00 AM to 11:20 AM
Definition: Data, Data Structure, Algorithm, Analysis of Algorithm.
Why Analyze?, Discuss analyze algorithm with others factors like Operating System, Compiler, Hardware etc etc.
Algorithm Writing rules and its notation with example.
Array, List, one way list, pointer node, null pointer and its values etc.
