Skip to content
VUBuddy

CS502 Important Topics

Fundamentals of Algorithms PDF 299 KBUpdated 23 Oct 2026
Quiz CS502 Important Topics PDF 299 KB
vubuddy.com
Type
Quiz
Course
CS502 Fundamentals of Algorithms
Size
PDF 299 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 299 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from page 1 of 1. Download the file for all 1 page.

CS502 IMP TOPICS

  •  Graph Traversal
  •  Kruskal’s Algorithm
  •  Greedy Algorithm Concept
  •  Non-Hamiltonian NP-Completeness
  •  Huffman Encoding
  •  Knapsack Problem
  •  Breadth first Search
  •  Depth first search
  •  Pirm’s Algorithm
  •  Dijkstra’s Algorithm
  •  Bellman Form Algorithm
  •  Hamiltonian Cycle
  •  Digraph and Strong Components
  •  The Digraph
  •  GT MINIMUM SPANNING TREEs
All CS502 files →
CS502 Fundamentals of Algorithms All CS502 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.