This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Set Partition Problem”. 1. What is meant by the power set of a set? a) subset of all sets b) set of all subsets c) set of particular subsets d) an empty set 2. What is the set partition problem? … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Dominating Set Problem”. 1. A dominating set of graph G, is the subset D of vertices, if each vertex not in D is adjacent to how many vertices? a) At least 1 b) At most 1 c) 0 d) 1 … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Independent Set Problem”. 1. Which of the following refers to the set of non-adjacent vertices? a) Independent set b) Dominant set c) Vertex cover set d) Edge cover set 2. Which of the following refers to the independence number of … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Vertex Cover Problem”. 1. Vertex covering can be a good approach to which type of the problems? a) Where all the vertex in the graph need to be included b) Where all the edges in the graph need to be … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Subset Sum Problem”. 1. Under what condition any set A will be a subset of B? a) if all elements of set B are also present in set A b) if all elements of set A are also present in … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hamiltonian Path Problem”. 1. Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently? a) branch and bound b) iterative improvement c) divide and conquer d) greedy algorithm 2. The problem of finding a path … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “P, NP, NP-hard, NP-complete Complexity Classes”. 1. The worst-case efficiency of solving a problem in polynomial time is? a) O(p(n)) b) O(p( n log n)) c) O(p(n2)) d) O(p(m log n)) 2. Problems that can be solved in polynomial time … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hamming Code”. 1. The most common hamming codes are a generalized version of? a) Hamming(7, 4) code b) Hamming(8, 4) code c) Hamming(6, 3) code d) Hamming(5, 7) code 2. What is the minimal Hamming distance between any two correct … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Coalesced Hashing”. 1. Which of the following hashing technique is a combination of both separate chaining and open addressing techniques? a) Linear probing b) Quadratic probing c) Coalesced hashing d) Double hashing 2. By using which of the following data … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Affine Cipher”. 1. Which of the following cipher makes use of linear algebra for encrypting data? a) polybius square cipher b) affine cipher c) caesar cipher d) rail fence cipher 2. Which of the following cipher requires only one key … Read more
