Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Partition Algorithm - Advanced Data Structures and Algorithms - Quiz, Exercises of Data Structures and Algorithms

Chennai Mathematical InstituteData Structures and Algorithms

Main points of this past exam are: Advanced Data Structures, Partition Algorithm, Depth-First Search, Ancestor, Node, Children, Visited, Returned., Dominant, Ancestors

Typology: Exercises

2012/2013

Uploaded on 03/23/2013

saruy
saruy 🇮🇳

4.5

(120)

130 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 542 – Advanced Data Structures and Algorithms
Quiz 3
J
onathan Turne
r
3/2/2010
1. (5 points) In the basic analysis of the partition algorithm, a node x is said to be dominant if
Δ(x) is more than twice Δ(y) for all ancestors y of x. In the tree shown below, which nodes
are dominant?
a
c
b
d
e
rank
1
8
9
12
13
- 1 -
pf2

Partial preview of the text

Download Partition Algorithm - Advanced Data Structures and Algorithms - Quiz and more Exercises Data Structures and Algorithms in PDF only on Docsity!

CS 542 – Advanced Data Structures and Algorithms

Quiz 3

Jonathan Turner 3/2/

  1. (5 points) In the basic analysis of the partition algorithm, a node x is said to be dominant if

Δ( x ) is more than twice Δ( y ) for all ancestors y of x. In the tree shown below, which nodes are dominant?

a

c

b

d

e

rank

  1. (5 points) Consider a depth-first search in the tree shown below, assuming that at each vertex, the children are visited in “left-to-right” order. Suppose that the search has reached node k but has not yet returned.

List the nodes that are open:

List the nodes that are closed:

What is the nearest open ancestor of node h?

a

c

b

d

e

f h

j

k

m n

r

p