GATE CSE 2024 Paper 2 — page 17

Home
GATE
Computer Science and Information Technology
2024 Paper 2

Complete GATE CSE 2024 Paper 2 overview, original pages and practice · Timed previous-paper practice

Questions 49–51 of 65. Imported answers require review unless explicitly marked reviewed.

Paper practice 65 questionsPage 17 of 22

Which of the following is/are EQUAL to 224 in radix-5 (i.e., base-5) notation?

Your answerSelect all correct options. You can choose more than one.

64 in radix-10

100 in radix-8

50 in radix-16

121 in radix-7

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider 4-variable functions f1, f2, f3, f4 expressed in sum-of-minterms form as given below.

f1 = Σ(0,2,3,5,7,8,11,13) f2 = Σ(1,3,5,7,11,13,15) f3 = Σ(0,1,4,11) f4 = Σ(0,2,6,13)

Diagram for Computer Science and Information Technology question 50

With respect to the circuit given above, which of the following options is/are CORRECT?

Your answerSelect all correct options. You can choose more than one.

Y = Σ(0,1,2,11,13)

Y = Π(3,4,5,7,9,10,12,14,15)

Y = Σ(0,1,2,3,4,5,6,7)

Y = Π(8,9,10,11,12,13,14,15)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the following statements is/are TRUE for every such graph G?

Your answerSelect all correct options. You can choose more than one.

All edges in G have even weight

All edges in G have even weight OR all edges in G have odd weight

In each cycle C in G, all edges in C have even weight

In each cycle C in G, either all edges in C have even weight OR all edges in C have odd weight

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

2024 · Paper 2

Question 49

Question 50

Question 51