Consider a B-tree of height, minimum degree t ≥ 2 that contains any n-key, where n > 1. Which of the following is correct?

Maintaining a graph in memory by means of its adjacency matrix is known as:

Which of the following trees are height balanced?
A. Binary Search Tree
B. AVL Tree
C. Red-Black Tree
D. B Tree
Choose the correct answer from the options given below:

The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?

Suppose a B⁺ tree is used for indexing a database file. Consider the following information:
Size of the search key field = 10 bytes
Block size = 1024 bytes
Size of the record pointer = 9 bytes
Size of the block pointer = 8 bytes
Let K be the order of the internal node and L be the order of the leaf node of B⁺ tree, then (K, L) = ______.

A double-ended queue (dequeue) supports adding and removing items from both the ends of the queue. The operations supported by dequeue are AddFront(adding item to the front of the queue), AddRear(adding item to the rear of the queue), RemoveFront (removing item from the front of the queue), and RemoveRear (removing item from the rear of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing AddFront() and AddRear(), assuming m is the size of the stack and n is the number of elements?

Given a fixed-length record file that is ordered on the key field. The file needs B disk blocks to store R number of records. Find the average access time needed to access any record of the given file using binary search.

The number of nodes of height h in any n-element heap is atmost:

Consider a B-tree of height, minimum degree t ≥ 2 that contains any n-key, where n > 1. Which of the following is correct?

Which of the following algorithm design approach is used in Quick sort algorithm?

_____________ is a Self-Balancing binary search tree, where the path from the root to the furthest leaf is no more than twice as long as the path from the root to nearest leaf.