(A) O(n^2)
(B) O(nlogn)
(C) O(n+k)
(D) O(n^3)
Category: 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.
Dynamic programming algorithms need to store the results of intermediate subproblems?
(A) True
(B) False
(C) NA
(D) NA
Dijkestra’s single source shortest path algorithm works if all edges weights are nonnegative and there are negative cost cycles?
(A) True
(B) False
(C) NA
(D) NA
If you find yourself in maze the better traversel approach will be?
(A) BFS
(B) BFS and DFS both are valid
(C) Level order
(D) DFS
What algorithm technique is used in the implementation of kruskal solution for the MST?
(A) Greedy Technique
(B) Divide and Conquer Technique
(C) Dynamic Programming Technique
(D) The algorithm combines more than one of the above techniques
Cross Edge is __.
(A) (u, v) where u is ancestor of v and v is not descendent of u
(B) (u, v) where v is a proper descendant of u in the tree
(C) (u, v) where u and v are not ancestor or descendent of one another
(D) (u, v)where u and v are either ancerstor or descendent of each other
Forward Edge is __.
(A) (u, v) where u is a proper descendent of v in the tree
(B) (u, v) where v is a proper descendant of u in the tree
(C) (u, v) where v is a proper ancestor of u in the tree
(D) None of the given
Back edge is __.
(A) (u, v) where v is an ancestor of u in the tree
(B) (u, v) where u is an ancestor of v in the tree
(C) (u, v) where v is predecessor of u in the tree
(D) None of the given