Docsity
Log inSign up
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
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 Store documents

The best documents sold by students who completed their studies

Search through all study resources
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

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

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

From our blog

Exams and Study
Go to the blog

CS 542 Quiz 3: Analysis of Data Structures and Algorithms, Exercises of Data Structures and Algorithms

Chennai Mathematical InstituteData Structures and Algorithms

Two questions from a cs 542 quiz focused on advanced data structures and algorithms. The first question deals with the concept of find steps and dominant nodes in the context of a partition data structure. The second question involves identifying open and closed nodes during a depth-first search of a tree.

Typology: Exercises

2012/2013

Uploaded on 03/23/2013

saruy
saruy 🇮🇳

4.5

(114)

132 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
- 1 -
1. (6 points) In the analysis of the number of find steps performed by the partition data
structure, we defined the function Δ(x) and the concept of a dominant node. In the diagram
below, what is the value of Δ(e)? Which nodes are dominant?
CS 542 – Advanced Data Structures and Algorithms
Quiz 3
Jonathan Turner 2/29/2012
y 16
7 17
x 8
1 a
b
2
c
3
g
21
f
18
e
14
d
5
j
rank=27
i
26
h
23
pf2

Partial preview of the text

Download CS 542 Quiz 3: Analysis of Data Structures and Algorithms and more Exercises Data Structures and Algorithms in PDF only on Docsity!

  1. ( 6 points) In the analysis of the number of find steps performed by the partition data structure, we defined the function Δ( x ) and the concept of a dominant node. In the diagram below, what is the value of Δ( e )? Which nodes are dominant?

CS 542 – Advanced Data Structures and Algorithms

Quiz 3

Jonathan Turner 2/29/

y^16

7^17

x^8

1 a

2 b

3 c

g

18 f

14 e

5 d

rank=27 j

26 i

h

  1. ( 4 points) In the analysis of the nearest-common ancestor, we defined three categories of nodes, relative to a depth-first tree traversal: open , closed or unreached. Consider a depth-first search of the tree shown below that has reached node j. Which nodes are open? Which nodes are closed? Assume that subtrees are searched in left-to-right order. b k a d i j h e f c n p g m