Please explain the last statement.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+2 votes

Consider the following statements:

- Depth-first search is used to traverse a rooted tree
- Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
- Huffman's algorithm is used to find an optimal binary tree with given weights
- Topological sorting provides a labelling such that the parents have larger labels than their children

Which one of the above statements is true?

- a and b
- c and d
- a, b, and c
- a, b, c, and d

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2.1k
- Databases 4.1k
- CO & Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.4k
- Admissions 596
- Exam Queries 577
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

49,541 questions

54,071 answers

187,187 comments

70,978 users