(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.
Dijkestra s single source shortest path algorithm works if all edges weights are negative and there are no negative cost cycles?
(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 no negative cost cycles?
(A) True
(B) False
(C) NA
(D) NA
Depth first search is shortest path algorithm that works on un-weighted graphs?
(A) True
(B) False
(C) NA
(D) NA
Huffman algorithm uses a greedy approach to generate an antefix code T that minimizes the expected length B (T) of the encoded string?
(A) True
(B) False
(C) NA
(D) NA
The greedy part of the Huffman encoding algorithm is to first find two nodes with character frequency?
(A) True
(B) False
(C) NA
(D) NA
Using ASCII standard the string abacdaacac will be encoded with 32 bytes?
(A) True
(B) False
(C) NA
(D) NA
Using ASCII standard the string abacdaacac will be encoded with 100 bits?
(A) True
(B) False
(C) NA
(D) NA