(A) True
(B) False
(C) NA
(D) NA
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.
The term “coloring” came form the original application which was in architectural design?
(A) True
(B) False
(C) NA
(D) NA
Bellman-Ford allows negative weights edges and negative cost cycles?
(A) True
(B) False
(C) NA
(D) NA
Dijkestra’s single source shortest path algorithm works if all edges weights are non-negative and there are negative cost cycles?
(A) True
(B) False
(C) NA
(D) NA
Shortest path problems can be solved efficiently by modeling the road map as a graph?
(A) True
(B) False
(C) NA
(D) NA
The Huffman algorithm finds a polynomial solution?
(A) True
(B) False
(C) NA
(D) NA
The Huffman algorithm finds an exponential solution?
(A) True
(B) False
(C) NA
(D) NA
The Huffman algorithm finds a (n) __ solution.
(A) Optimal
(B) Non-optima
(C) Exponential
(D) Polynomial