Scribd
Upload
56 views1 page

Writing Assignment 2

Uploaded by

vandana u
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
56 views1 page

Writing Assignment 2

Uploaded by

vandana u
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

SHRI MADHWA VADIRAJA INSTITUTE OF TECHNOLOGY AND MANAGEMENT

A Unit of Shri Sode Vadiraja Mutt Education Trust® Udupi


(Affiliated to Visvesvaraya Technological University, Belagavi)
Vishwothama Nagar, Bantakal – 574 115, Udupi District, Karnataka, INDIA

Writing Assignment 2 Date of Submission: 13/03/2024

Department: AI-ML AY: 2023-24 Class: 2nd Year

Course Name: Data Structures &


Faculty Members: Vandana U Course Code: BCS304
Applications

Qn. Assignment Questions Blooms CO Marks


No Level

1 Explain Hashing and Collision. What are the methods to resolve L2 5 5


collision. Explain any one method in detail.

2 Explain dynamic hashing in detail. L2 5 5

3 How do we calculate the cost of an optimal binary search L3 5 5


tree? Explain with an example.

4 Write a note on Double Ended Priority Queue. L2 5 5

5 Explain the array and linked representation of binary trees with L3 4 5


suitable examples.

Signature of the Course Co-Ordinator Signature of HOD

You might also like