Algorithms-Greedy Approach [GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS)]: Questions 1 - 5 of 11

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Question 1

Appeared in Year: 2015

Question MCQ▾

In Activity-Selection problem, each activity i has a start time si and a finish time fi where si⩽fi. Activities i and j are compatible if: (December)

Choices

Choice (4)Response

a.

si ⩾ fj

b.

sj ⩾ fi

c.

si ⩾ fj or sj ⩾ fi

d.

si ⩾ fj and sj ⩾ fi

Edit

Question 2

Appeared in Year: 2016

Question MCQ▾

Consider a source with symbols A, B, C, D with probabilities respectively. What is the average number of bits per symbol for the Huffman code generated from above information?

Choices

Choice (4)Response

a.

1.75 bits per symbol

b.

1.50 bits per symbol

c.

2 bits per symbol

d.

1.25 bits per symbol

Edit

Question 3

Appeared in Year: 2016

Question MCQ▾

Consider the statement,

″ Either

The negation of this statement is

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 4

Question MCQ▾

It is not a Greedy algorithm.

Choices

Choice (4)Response

a.

Huffman encoding

b.

Dijkstra՚s Algorithm

c.

Egyptian fraction

d.

None of the above

Edit

Question 5

Appeared in Year: 2018

Question Match List-Ⅰ List-Ⅱ▾

Match List I with List II and Choose the correct answer from the code given below. (December)

List-Ⅰ (Coloum-1)List-Ⅱ (Coloum-2)
(A)

Greedy Best-First Search

(i)

Suffers from excessive node generation.

(B)

Recursive Best-First Search

(ii)

Selects a node for expansion if optimal path to that node has been found.

(C)

Iterative deepening Search

(iii)

Time complexity depends on the quality of heuristic.

(D)

Search

(iv)

Avoids substantial overhead associated with keeping the sorted queue of nodes.

Choices

Choice (4)Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (ii)
  • (i)
  • (iv)
  • (iii)

b.

  • (i)
  • (ii)
  • (iv)
  • (iii)

c.

  • (iii)
  • (i)
  • (iv)
  • (ii)

d.

  • (iv)
  • (iii)
  • (i)
  • (ii)

Edit