For the sieve technique we solve the problem?
(A) recursively (B) mathematically (C) accurately (D) precisely [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: A [/showhide]
Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
[wpdreams_ajaxsearchlite]
In Sieve Technique we do not know which item is of interest?
(A) True (B) False (C) NA (D) NA [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: A [/showhide]
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of __.
(A) n items (B) phases (C) pointers (D) constant [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: A [/showhide]
For the Sieve Technique we take time?
(A) T(nk) (B) T(n / 3) 4 (C) n^2 (D) n/3 [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: A [/showhide]
Consider the following Algorithm: Factorial (n){ if (n=1) return 1 else return (n * Factorial(n-1)) } Recurrence for the following algorithm is:
(A) T(n) = T(n-1) +1 (B) T(n) = nT(n-1) +1 (C) T(n)= T(n-1) +n (D) T(n)=T(n(n-1)) +1 [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: D [/showhide]
How much time merge sort takes for an array of numbers?
(A) (n^2) (B) T(n) (C) T( log n) (D) T(n log n) [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: B [/showhide]
What is the solution to the recurrence T(n) = T(n/2)+n?
(A) O(logn) (B) O(n) (C) O(nlogn) (D) O(n^2) [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: A [/showhide]
If algorithm A has running time 7n^2 + 2n + 3 and algorithm B has running time 2n^2, then?
(A) Both have same asymptotic time complexity (B) A is asymptotically greater (C) B is asymptotically greater (D) None of others [showhide type=”post” more_text=”►Correct Option” less_text=”Show less…”] Correct Option is: A [/showhide]