Scribd
Upload
57 views1 page

Assign 1

The document contains 4 questions about data structures. Question 1 explains skip lists and asks to create one by inserting keys of varying levels. Question 2 deals with hashing using a modulo function and asks about statements and a hash table. Question 3 explains Red Black Trees and asks to construct one from a list using rotations and coloring. Question 4 explains Binary Search Trees and asks to write an algorithm to delete an element.

Uploaded by

Rizwan Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
57 views1 page

Assign 1

The document contains 4 questions about data structures. Question 1 explains skip lists and asks to create one by inserting keys of varying levels. Question 2 deals with hashing using a modulo function and asks about statements and a hash table. Question 3 explains Red Black Trees and asks to construct one from a list using rotations and coloring. Question 4 explains Binary Search Trees and asks to write an algorithm to delete an element.

Uploaded by

Rizwan Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

AMRITSAR COLLEGE OF ENGINEERING & TECHNOLOGY, AMRITSAR

(AUTONOMOUS COLLEGE)

M. Tech. (CSE) – 1st Sem

Advanced Data Structures

Subject Code: MTCS 102-18

Assignment-1

(4 Ques*6=24 marks)

Q1. Explain the working and operation on Skip List in data structure? Why is it required? Create a skip
list, we want to insert these following keys in the empty skip list.

6 with level 1.

29 with level 1.

22 with level 4.

9 with level 3.

17 with level 1.

4 with level 2.

Q2. a) Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash
function x mod 10, which of the following statements are true?

b) The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10
using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant
hash table?

Q3. Explain Red Black Tree. Construct the red black tree for the following list with rotation and coloring
7,5,6,3,9,14,15.

Q4. Explain Binary Search Tree. Write an algorithm to delete an element from BST.

You might also like