Scribd
Upload
2 views2 pages

Advanced Data Structures Assignment

The document outlines assignments for the II B.Tech-I Semester (R20) 2020 Admitted Batch in Advanced Data Structures at Avanthi Institute of Engineering & Technology. It includes various topics such as search algorithms, sorting techniques, tree structures, AVL trees, B-Trees, and graph representations, along with their complexities and applications. Each assignment consists of multiple questions aimed at assessing students' understanding of the subject matter.

Uploaded by

sivarathrilokesh6
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
2 views2 pages

Advanced Data Structures Assignment

The document outlines assignments for the II B.Tech-I Semester (R20) 2020 Admitted Batch in Advanced Data Structures at Avanthi Institute of Engineering & Technology. It includes various topics such as search algorithms, sorting techniques, tree structures, AVL trees, B-Trees, and graph representations, along with their complexities and applications. Each assignment consists of multiple questions aimed at assessing students' understanding of the subject matter.

Uploaded by

sivarathrilokesh6
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

AVANTHI INSTITUTE OF ENGINEERING & TECHNOLOGY

Tamaram ,Makaravarapalem, Narsipatnam (RD)

II. [Link]-I Semester (R20) 2020 Admitted Batch

Subject Name : Advanced Data Structure Academic Year:2020-21

Branch: CSE

ASSIGNMENT

Assignment – 1

[Link] Assignment Question CO BL


Explain Linear Search, Binary Search and Fibonacci Search algorithms.
1 CO1 L1
Compare their time complexities and applications.
2 Write algorithms for Bubble Sort, Insertion Sort and Selection Sort.
CO1 L2
Compare their performance in best, average and worst cases.
3 Explain Quick Sort with example. Analyze its time and space complexity. CO1 L2
4 Describe Merge Sort algorithm with suitable example. Explain divide and
CO1 L4
conquer strategy.
5 Explain External Sorting. Discuss multiway merge and polyphase merge
CO1 L6
techniques with examples.

Assignment – 2

[Link] Assignment Question CO BL


1 Define dictionary ADT. Explain implementation using hash tables. CO2 L3
2 Explain open hashing and closed hashing with suitable examples. CO2 L5
3 Describe collision resolution techniques including rehashing methods. CO2 L1
4 Explain hashing functions:
• Division method
• Multiplication method CO2 L6
• Universal hashing.

5 Explain skip lists with diagram and operations. CO2 L5

Assignment – 3

[Link] Assignment Question CO BL


1 Explain basic tree concepts and properties of binary trees. CO3 L4
2 Explain representation of binary trees using:
• Arrays
CO3 L2
• Linked lists.
3 Write algorithms for tree traversals:
• Preorder
• Inorder
CO3 L4
• Postorder.

4 Construct a binary tree from given inorder and preorder/postorder traversals. CO3 L2
5 Define Binary Search Tree (BST). Explain searching, insertion and deletion
CO3 L5
operations with examples.

Assignment – 4

[Link] Assignment Question CO BL


1 Define AVL Tree. Explain insertion and rotations required for balancing. CO4 L3
2 Explain deletion operation in AVL trees with suitable example.
CO4 L1
3 Define B-Tree and explain insertion and deletion operations. CO4 L5
4 Differentiate between B-Tree and B+ Tree. CO4 L3
5 Define priority queue. Explain implementation using lists and heaps.
CO4 L4

Assignment – 5

[Link] Assignment Question CO BL

1 Explain graph representations using adjacency matrix and adjacency list. CO5 L2

2 Explain Breadth First Search (BFS) and Depth First Search (DFS)
algorithms with examples. CO5 L5

3
Explain Breadth First Search (BFS) and Depth First Search (DFS)
algorithms with examples. CO5 L6

4
Describe Dijkstra’s shortest path algorithm with example.
CO5 L4

5 Explain transitive closure using Warshall’s algorithm and Floyd’s


algorithm.
CO5 L6

You might also like