Scribd
Upload
81 views

ADVANCEDDATASTRUCTURES

The document contains 4 exam sets for an Advanced Data Structures course. Each set contains 8 questions related to data structures topics like pattern matching, trees (AVL, Red-Black), heaps, skip lists, and C++ concepts. Students must answer any 5 of the 8 questions in the set they are assigned. The questions involve explaining algorithms, drawing examples, justifying properties, writing programs, and describing data structure implementations and operations.

Uploaded by

Samiullah Mohammed
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
81 views

ADVANCEDDATASTRUCTURES

The document contains 4 exam sets for an Advanced Data Structures course. Each set contains 8 questions related to data structures topics like pattern matching, trees (AVL, Red-Black), heaps, skip lists, and C++ concepts. Students must answer any 5 of the 8 questions in the set they are assigned. The questions involve explaining algorithms, drawing examples, justifying properties, writing programs, and describing data structure implementations and operations.

Uploaded by

Samiullah Mohammed
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
You are on page 1/ 4

Code No: 07A3EC15 R07 Set No.

2
II B.Tech I Semester Examinations,December 2011
ADVANCED DATA STRUCTURES
Common to Electronics And Computer Engineering, Computer Science And
Engineering
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. Elucidate Brute Force pattern matching algorithm with an example. [16]


2. Write a C++ program to create or destroy a list or a chain using constructors or
destructors. [16]
3. Describe the following AVL Tree rotations.
(a) LL Rotation
(b) RR Rotation
(c) LR Rotation
(d) RL Rotation [16]
4. (a) Explain the need for “Virtual Constructors”
(b) Can we have “Virtual Constructors”? [8+8]
5. (a) The root of Red Black tree be always black after performing a deletions.
Justify.
(b) Explain LLr , LRr imbalances of a Red Black Tree. [8+8]
6. Illustrate the following:
(a) Copy constructor
(b) Data hiding
(c) Polymorphism
(d) This pointer [16]
7. Create a minheap and maxheap for the following list
(a) L =< A, B, C, D, E, F, G >
(b) L =< G, F, D, B, A, H, I, J, K >
(c) L =< 20, 10, 5, 4, 25, 70, 60, 40 >
(d) L =< 5, 8, 3, 9, 2, 10, 1, 40, > [16]
8. (a) What is level assignment of a skip list structure?
(b) Enumerate the advantages and drawbacks of level assignment skiplist. [6+10]

?????

1
Code No: 07A3EC15 R07 Set No. 4
II B.Tech I Semester Examinations,December 2011
ADVANCED DATA STRUCTURES
Common to Electronics And Computer Engineering, Computer Science And
Engineering
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Explain the need for “Virtual Constructors”


(b) Can we have “Virtual Constructors”? [8+8]
2. Create a minheap and maxheap for the following list
(a) L =< A, B, C, D, E, F, G >
(b) L =< G, F, D, B, A, H, I, J, K >
(c) L =< 20, 10, 5, 4, 25, 70, 60, 40 >
(d) L =< 5, 8, 3, 9, 2, 10, 1, 40, > [16]
3. Illustrate the following:
(a) Copy constructor
(b) Data hiding
(c) Polymorphism
(d) This pointer [16]
4. Elucidate Brute Force pattern matching algorithm with an example. [16]
5. Write a C++ program to create or destroy a list or a chain using constructors or
destructors. [16]
6. (a) What is level assignment of a skip list structure?
(b) Enumerate the advantages and drawbacks of level assignment skiplist. [6+10]
7. (a) The root of Red Black tree be always black after performing a deletions.
Justify.
(b) Explain LLr , LRr imbalances of a Red Black Tree. [8+8]
8. Describe the following AVL Tree rotations.
(a) LL Rotation
(b) RR Rotation
(c) LR Rotation
(d) RL Rotation [16]

?????

2
Code No: 07A3EC15 R07 Set No. 1
II B.Tech I Semester Examinations,December 2011
ADVANCED DATA STRUCTURES
Common to Electronics And Computer Engineering, Computer Science And
Engineering
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) What is level assignment of a skip list structure?


(b) Enumerate the advantages and drawbacks of level assignment skiplist. [6+10]
2. (a) Explain the need for “Virtual Constructors”
(b) Can we have “Virtual Constructors”? [8+8]
3. Elucidate Brute Force pattern matching algorithm with an example. [16]
4. (a) The root of Red Black tree be always black after performing a deletions.
Justify.
(b) Explain LLr , LRr imbalances of a Red Black Tree. [8+8]
5. Create a minheap and maxheap for the following list
(a) L =< A, B, C, D, E, F, G >
(b) L =< G, F, D, B, A, H, I, J, K >
(c) L =< 20, 10, 5, 4, 25, 70, 60, 40 >
(d) L =< 5, 8, 3, 9, 2, 10, 1, 40, > [16]
6. Write a C++ program to create or destroy a list or a chain using constructors or
destructors. [16]
7. Describe the following AVL Tree rotations.
(a) LL Rotation
(b) RR Rotation
(c) LR Rotation
(d) RL Rotation [16]
8. Illustrate the following:
(a) Copy constructor
(b) Data hiding
(c) Polymorphism
(d) This pointer [16]

?????

3
Code No: 07A3EC15 R07 Set No. 3
II B.Tech I Semester Examinations,December 2011
ADVANCED DATA STRUCTURES
Common to Electronics And Computer Engineering, Computer Science And
Engineering
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. Elucidate Brute Force pattern matching algorithm with an example. [16]


2. (a) What is level assignment of a skip list structure?
(b) Enumerate the advantages and drawbacks of level assignment skiplist. [6+10]
3. Describe the following AVL Tree rotations.
(a) LL Rotation
(b) RR Rotation
(c) LR Rotation
(d) RL Rotation [16]
4. (a) Explain the need for “Virtual Constructors”
(b) Can we have “Virtual Constructors”? [8+8]
5. Illustrate the following:
(a) Copy constructor
(b) Data hiding
(c) Polymorphism
(d) This pointer [16]
6. Create a minheap and maxheap for the following list
(a) L =< A, B, C, D, E, F, G >
(b) L =< G, F, D, B, A, H, I, J, K >
(c) L =< 20, 10, 5, 4, 25, 70, 60, 40 >
(d) L =< 5, 8, 3, 9, 2, 10, 1, 40, > [16]
7. Write a C++ program to create or destroy a list or a chain using constructors or
destructors. [16]
8. (a) The root of Red Black tree be always black after performing a deletions.
Justify.
(b) Explain LLr , LRr imbalances of a Red Black Tree. [8+8]

?????

You might also like