Skip to content

Category Archives: UGC-NET

The Boolean function with the Karnaugh map is: (A) (A+C).D+B (B) (A+B).C+D (C) (A+D).C+B (D) (A+C).B+D Answer: (A) Explanation: To find the boolean function here… Read More
Consider the graph given below : Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the… Read More
How many distinguishable permutations of the letters in the word BANANA are there ? (A) 720 (B) 120 (C) 60 (D) 360 Answer: (C) Explanation:… Read More
Find the boolean product A⊙B of the two matrices. (A) (1) (B) (2) (C) (3) (D) (4) Answer: (A) Explanation: Here we have to follow… Read More
Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n. (A) (635)4 (B) (32312)4 (C) (21323)4 (D) (1301)4 Answer: (D) Explanation: We have m=(313)4… Read More
If the time is now 4 O’clock, what will be the time after 101 hours from now ? (A) 9 O’clock (B) 8 O’clock (C)… Read More
The Octal equivalent of the binary number 1011101011 is : (A) 7353 (B) 1353 (C) 5651 (D) 5657 Answer: (B) Explanation: Quiz of this QuestionPlease… Read More
Consider the graph given below :   Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree… Read More
Consider the graph given below : Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the… Read More
How many distinguishable permutations of the letters in the word BANANA are there ? (A) 720 (B) 120 (C) 60 (D) 360 Answer: (C) Explanation:… Read More
Find the boolean product A⊙B of the two matrices. (A) (1) (B) (2) (C) (3) (D) (4) Answer: (A) Explanation: Quiz of this QuestionPlease comment… Read More
Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n. (A) (635)4 (B) (32312)4 (C) (21323)4 (D) (1301)4 Answer: (D) Explanation: Quiz of this… Read More
Find the boolean product A⊙B of the two matrices. (A) (1) (B) (2) (C) (3) (D) (4) Answer: (A) Explanation: Quiz of this Question My… Read More

Start Your Coding Journey Now!