GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1630 - 1632 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1630

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Consider the graph shown below: (Dec)

Image Shows the Graph

Use Kruskal՚s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is

Choices

Choice (4)Response

a.

13

b.

17

c.

14

d.

16

Question 1631

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Which of the following statements are true? (December)

  1. Every logic network is equivalent to one using just NAND gates or just NOR gates.
  2. Boolean expressions and logic networks correspond to labelled acrylic digraphs.
  3. No two Boolean algebras with a atoms are isomorphic.
  4. Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.

Choices

Choice (4)Response

a.

(1) and (4) only

b.

(1) and (2) only

c.

(2) , (3) and (4) only

d.

(1) , (2) and (3) only

Question 1632

Appeared in Year: 2018 (UGC-NET)

Question

MCQ▾

Which of the following statements is/are true? (Dec)

  1. Facebook has the world՚s largest Hadoop Cluster.
  2. Hadoop allows live stream processing of Real time data.

Choose the correct answer from the code given below:

Choices

Choice (4)Response

a.

(1) only

b.

Neither (1) nor (2)

c.

(2) only

d.

(1) and (2)

Developed by: