SCCI Digital Library and Forum

Menu

Home
About Us
Video Library
eBooks
SCCI Forum

Home » Applied Sciences » Computer Science » Fundamentals of Algorithms (V-U) » Plane-sweep Algorithm its analysis and Comparison to Brute-force Algorithim (V-U)

Plane-sweep Algorithm its analysis and Comparison to Brute-force Algorithim (V-U)

Course:Fundamentals of Algorithms (V-U)
Discipline:Applied Sciences
Institute:Virtual University
Instructor(s): Dr. Sohail Aslam
Level:Undergraduate

Fundamentals of Algorithms (V-U)

Analysis of Merge Sort (V-U)
Analysis of Selection, Sorting, Heaps (V-U)
Analysis of the brute-force maxima algorithm (V-U)
Asymptotic Notation (V-U)
Average-case Analysis of Quicksort (V-U)
Boolean Satisfiability Problem:Cook''s Theorem,Independent Sets (V-U)
Breadth-first Search,Generic Graph Traversal Algorithm (V-U)
Breadth-first Search,Generic Graph Traversal Algorithm II (V-U)
Brute-Force Algorithm,Running Time Analysis (V-U)
Chain Matrix Multiply (V-U)
Chain Matrix Multiply II (V-U)
Complexity Theory,Classes P,NP (V-U)
Computing MST: Generic Approach,Greedy MST (V-U)
Correctness of Dijkstra''s Algorithm, Bellman-Ford Algorithm (V-U)
Correctness of Greedy Activity Selection (V-U)
DFS – Timestamp Structure ,DFS – Cycles (V-U)
Dijkstra''s Algorithm (V-U)
Divide and Conquer Strategy,Merge Sort (V-U)
Dynamic Programming ,Edit Distance Applications and Algorithim (V-U)
Edit Distance: Dynamic Programming Algorithm and its Analysis (V-U)

Sialkot Chamber of Commerce & Industry P.O. Box 1870, Shahrah-e-Aiwan-e-Sanat-o-Tijarat, Sialkot City 51310 – Pakistan

Facebook Twitter Instagram

Need help?

+92-52-4261881-3

sialkot@scci.com.pk

Copyright © 2026 SCCI Digital Library and Forum | All Right Reserved. Developed By FARAZ SALEEM