Explanation

2's complement allows easy addition and subtraction of signed integers without extra logic.

It eliminates the problem of having two zeros, unlike sign-magnitude or 1's complement.

Explanation

unsigned int cannot store negative numbers, so its range shifts from -2³¹ to 2³¹-1 to 0 to 2³²-1.

The memory size remains the same (4 bytes).

Explanation

Insertion in a binary heap requires adding the element at the end and then heapifying up to maintain heap property.

The heapify operation takes logarithmic time relative to the number of elements.

Explanation

Explanation

Hash Set is a collection that stores unique elements only, automatically ignoring duplicates.

It provides fast lookup and ensures data uniqueness.

It is commonly used in databases and programming applications.

Explanation

AVL Tree is a self-balancing BST where the heights of left and right subtrees differ by at most one, ensuring O(log n) search time.

It automatically rotates nodes during insertion or deletion to maintain balance and efficient operations.

Explanation

A heap efficiently supports priority queue operations like insertion and extraction of the highest (or lowest) priority element.

Common types include min-heap and max-heap, which maintain the heap property for fast access to priority elements.

Explanation

Hash tables use a hash function to map keys to indices, allowing O(1) average-time lookup.

They are widely used in databases, caching, and associative arrays for fast access to data.

Explanation

Queue operates on the First In, First Out (FIFO) principle, meaning the first element added is the first to be removed.

Common uses include print job management, task scheduling, and data buffering.

Explanation

ERD (Entity Relationship Diagram) is mainly used to design a database’s logical schema.

It shows entities, attributes, and relationships between data elements.