McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 151. |
There are 70 patients admitted in a hospital in which 29 are diagnosed with typhoid, 32 with malaria, and 14 with both typhoid and malaria. Find the number of patients diagnosed with typhoid or malaria or both. |
| A. | 39 |
| B. | 17 |
| C. | 47 |
| D. | 53 |
| Answer» C. 47 | |
| 152. |
At a software company, skilled workers have been hired for a project. Out of 75 candidates, 48 of them were software engineer; 35 of them were hardware engineer; 42 of them were network engineer; 18 of them had skills in all three jobs and all of them had skills in at least one of these jobs. How many candidates were hired who were skilled in exactly 2 jobs? |
| A. | 69 |
| B. | 14 |
| C. | 32 |
| D. | 8 |
| Answer» B. 14 | |
| 153. |
In a renowned software development company of 240 computer programmers 102 employees are proficient in Java, 86 in C#, 126 in Python, 41 in C# and Java, 37 in Java and Python, 23 in C# and Python, and just 10 programmers are proficient in all three languages. How many computer programmers are there those are not proficient in any of these three languages? |
| A. | 138 |
| B. | 17 |
| C. | 65 |
| D. | 49 |
| Answer» B. 17 | |
| 154. |
In class, students want to join sports. 15 people will join football, 24 people will join basketball, and 7 people will join both. How many people are there in the class? |
| A. | 19 |
| B. | 82 |
| C. | 64 |
| D. | 30 |
| Answer» D. 30 | |
| 155. |
From 1, 2, 3, …, 320 one number is selected at random. Find the probability that it is either a multiple of 7 or a multiple of 3. |
| A. | 72% |
| B. | 42.5% |
| C. | 12.8% |
| D. | 63.8% |
| Answer» B. 42.5% | |
| 156. |
If each and every vertex in G has degree at most 23 then G can have a vertex colouring of |
| A. | 24 |
| B. | 23 c) 176 |
| C. | d |
| D. | 54 |
| Answer» D. 54 | |
| 157. |
Berge graph is similar to due to strong perfect graph theorem. |
| A. | line graph |
| B. | perfect graph |
| C. | bar graph |
| D. | triangle free graph |
| Answer» B. perfect graph | |
| 158. |
A is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges). |
| A. | subgraph |
| B. | hamiltonian graph |
| C. | euler graph |
| D. | self complementary graph |
| Answer» D. self complementary graph | |
| 159. |
In a the vertex set and the edge set are finite sets. |
| A. | finite graph |
| B. | bipartite graph |
| C. | infinite graph |
| D. | connected graph |
| Answer» B. bipartite graph | |
| 160. |
If G is the forest with 54 vertices and 17 connected components, G has total number of edges. |
| A. | 38 |
| B. | 37 |
| C. | 17/54 d |
| D. | 17/53 |
| Answer» B. 37 | |
| 161. |
An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G? |
| A. | 1/2101 |
| B. | 1/50 c) 1/100 |
| C. | d |
| D. | 1/20 |
| Answer» B. 1/50 c) 1/100 | |
| 162. |
If each and every vertex in G has degree at most 23 then G can have a vertex colouring of |
| A. | 24 |
| B. | 23 c) 176 |
| C. | d |
| D. | 54 |
| Answer» A. 24 | |
| 163. |
Triangle free graphs have the property of clique number is |
| A. | less than 2 |
| B. | equal to 2 |
| C. | greater than 3 |
| D. | more than 10 |
| Answer» D. more than 10 | |
| 164. |
Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex? |
| A. | 4 |
| B. | 0 |
| C. | 2 |
| D. | 5 |
| Answer» C. 2 | |
| 165. |
A bridge can not be a part of |
| A. | a simple cycle |
| B. | a tree |
| C. | a clique with size ≥ 3 whose every edge is a bridge |
| D. | a graph which contains cycles |
| Answer» A. a simple cycle | |
| 166. |
Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called |
| A. | subgraph |
| B. | tree |
| C. | hamiltonian cycle |
| D. | grid |
| Answer» B. tree | |
| 167. |
G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is |
| A. | complete bipartite graph |
| B. | hamiltonian cycle |
| C. | regular graph |
| D. | euler graph |
| Answer» D. euler graph | |
| 168. |
Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50. |
| A. | 98 |
| B. | 13 |
| C. | 6 |
| D. | 34 |
| Answer» C. 6 | |
| 169. |
What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6? |
| A. | 11 |
| B. | 14 |
| C. | 18 |
| D. | 19 |
| Answer» C. 18 | |
| 170. |
is the maximum number of edges in an acyclic undirected graph with k vertices. |
| A. | k-1 |
| B. | k2 |
| C. | 2k+3 |
| D. | k3+4 |
| Answer» A. k-1 | |
| 171. |
The minimum number of edges in a connected cyclic graph on n vertices is |
| A. | n – 1 |
| B. | n |
| C. | 2n+3 |
| D. | n+1 |
| Answer» B. n | |
| 172. |
The maximum number of edges in a 8- node undirected graph without self loops is |
| A. | 45 |
| B. | 61 |
| C. | 28 |
| D. | 17 |
| Answer» C. 28 | |
| 173. |
Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between and |
| A. | n-1 and n+1 |
| B. | v and k |
| C. | k+1 and v-k |
| D. | k-1 and v-1 |
| Answer» D. k-1 and v-1 | |
| 174. |
The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be |
| A. | n+2 |
| B. | 3n/2 |
| C. | n2 |
| D. | 2n |
| Answer» B. 3n/2 | |
| 175. |
Every Isomorphic graph must have representation. |
| A. | cyclic |
| B. | adjacency list |
| C. | tree |
| D. | adjacency matrix |
| Answer» D. adjacency matrix | |
| 176. |
A cycle on n vertices is isomorphic to its complement. What is the value of n? |
| A. | 5 |
| B. | 32 |
| C. | 17 |
| D. | 8 |
| Answer» A. 5 | |
| 177. |
A complete n-node graph Kn is planar if and only if |
| A. | n ≥ 6 |
| B. | n2 = n + 1 |
| C. | n ≤ 4 |
| D. | n + 3 |
| Answer» C. n ≤ 4 | |
| 178. |
A graph is if and only if it does not contain a subgraph homeomorphic to k5 or k3,3. |
| A. | bipartite graph |
| B. | planar graph |
| C. | line graph |
| D. | euler subgraph |
| Answer» B. planar graph | |
| 179. |
An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if |
| A. | f(u) and f(v) are contained in g but not contained in h |
| B. | f(u) and f(v) are adjacent in h |
| C. | f(u * v) = f(u) + f(v) |
| D. | f(u) = f(u)2 + f(v2) |
| Answer» B. f(u) and f(v) are adjacent in h | |
| 180. |
What is the grade of a planar graph consisting of 8 vertices and 15 edges? |
| A. | 30 |
| B. | 15 |
| C. | 45 d |
| D. | 106 |
| Answer» A. 30 | |
| 181. |
A is a graph with no homomorphism to any proper subgraph. |
| A. | poset |
| B. | core |
| C. | walk |
| D. | trail |
| Answer» B. core | |
| 182. |
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 |
| Answer» A. branch and bound | |
| 183. |
The problem of finding a path in a graph that visits every vertex exactly once is called? |
| A. | hamiltonian path problem |
| B. | hamiltonian cycle problem |
| C. | subset sum problem |
| D. | turnpike reconstruction problem |
| Answer» A. hamiltonian path problem | |
| 184. |
Hamiltonian path problem is |
| A. | np problem |
| B. | n class problem |
| C. | p class problem |
| D. | np complete problem |
| Answer» D. np complete problem | |
| 185. |
Which of the following problems is similar to that of a Hamiltonian path problem? |
| A. | knapsack problem |
| B. | closest pair problem |
| C. | travelling salesman problem |
| D. | assignment problem |
| Answer» C. travelling salesman problem | |
| 186. |
Who formulated the first ever algorithm for solving the Hamiltonian path problem? |
| A. | martello |
| B. | monte carlo |
| C. | leonard |
| D. | bellman |
| Answer» A. martello | |
| 187. |
In what time can the Hamiltonian path problem can be solved using dynamic programming? |
| A. | o(n) |
| B. | o(n log n) |
| C. | o(n2) |
| D. | o(n2 2n) |
| Answer» D. o(n2 2n) | |
| 188. |
Who invented the inclusion-exclusion principle to solve the Hamiltonian path problem? |
| A. | karp |
| B. | leonard adleman |
| C. | andreas bjorklund |
| D. | martello |
| Answer» C. andreas bjorklund | |
| 189. |
For a graph of degree three, in what time can a Hamiltonian path be found? |
| A. | o(0.251n) |
| B. | o(0.401n) |
| C. | o(0.167n) |
| D. | o(0.151n) |
| Answer» A. o(0.251n) | |
| 190. |
What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)? |
| A. | o(n!) |
| B. | o(n! * n) |
| C. | o(log n) |
| D. | o(n) |
| Answer» B. o(n! * n) | |
| 191. |
How many Hamiltonian paths does the following graph have? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» A. 1 | |
| 192. |
How many Hamiltonian paths does the following graph have? |
| A. | 1 |
| B. | 2 |
| C. | 0 |
| D. | 3 |
| Answer» C. 0 | |
| 193. |
If set C is {1, 2, 3, 4} and C – D = Φ then set D can be |
| A. | {1, 2, 4, 5} |
| B. | {1, 2, 3} |
| C. | {1, 2, 3, 4, 5} |
| D. | none of the mentioned |
| Answer» C. {1, 2, 3, 4, 5} | |
| 194. |
Let C and D be two sets then C – D is equivalent to |
| A. | c’ ∩ d |
| B. | c‘∩ d’ |
| C. | c ∩ d’ |
| D. | none of the mentioned |
| Answer» C. c ∩ d’ | |
| 195. |
For two sets C and D the set (C – D) ∩ D will be |
| A. | c |
| B. | d |
| C. | Φ |
| D. | none of the mentioned |
| Answer» C. Φ | |
| 196. |
Which of the following statement regarding sets is false? |
| A. | a ∩ a = a |
| B. | a u a = a |
| C. | a – (b ∩ c) = (a – b) u (a –c) |
| D. | (a u b)’ = a’ u b’ |
| Answer» D. (a u b)’ = a’ u b’ | |
| 197. |
Let C = {1,2,3,4} and D = {1, 2, 3, 4} then which of the following hold not true in this case? |
| A. | c – d = d – c |
| B. | c u d = c ∩ d |
| C. | c ∩ d = c – d |
| D. | c – d = Φ |
| Answer» C. c ∩ d = c – d | |
| 198. |
Let Universal set U is {1, 2, 3, 4, 5, 6, 7, 8}, (Complement of A) A’ is {2, 5, 6, 7}, A ∩ B is {1, 3, 4} then the set B’ will surely have of which of the element? |
| A. | 8 |
| B. | 7 |
| C. | 1 |
| D. | 3 |
| Answer» A. 8 | |
| 199. |
Let a set be A then A ∩ φ and A U φ are |
| A. | φ, φ |
| B. | φ, a |
| C. | a, φ |
| D. | none of the mentioned |
| Answer» B. φ, a | |
| 200. |
If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be? |
| A. | 8 |
| B. | 14 |
| C. | 22 |
| D. | 15 |
| Answer» A. 8 | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.