# Fundamentals of Algorithms

## CS502-Fundamentals of Algorithms Quiz MCQs Lecture 23-45 Finalterm Objective Questions | SUPERSTARWEBTECH

CS502-Fundamentals of Algorithms Quiz  MCQS #Objective #Questions #Finalterm 1. There are no ___ edges in an undirected graph. Forward Back  Cross ✔ Both forward and back 2. Those problems in which Greedy finds good, but not always best is called a greedy Algorithm Solution Heuristic ✔ Result 3. For an undirected graph, there is no …

## CS502-Fundamentals of Algorithms Quiz MCQs Lecture 1-22 Midterm Objective Questions | SUPERSTARWEBTECH

CS502-Fundamentals of Auditing Quiz  MCQS #Objective #Questions #Midterm 1. While solving Selection problem, in Sieve technique we partition input data ___ in increasing order in decreasing order according to Pivot ✔ randomly 2. In Selection problem, the Sieve technique works in ___ Non-recursive manner constant time phases ✔ one complete go 3. While analyzing Selection …

## CS502-Fundamentals of Algorithms Assignment no. 1 Solution FALL 2019 Due date: 14 November, 2019 | SUPERSTARWEBTECH

Subject: CS502-Fundamentals of Algorithms Semester: FALL 2019  Assignment No. 1 Due date: 14 November 2019 CS502-Fundamentals of Algorithms Assignment 1 #Questions Question no. 1:You are required to design(write) a simple algorithm (only pseudo-code) to identify a number to be prime or not prime. Question no. 2:You are required to calculate the worst-case time complexity T(n) …