In serial data transmission, every byte of data is padded with a $$‘0’$$ in the beginning and one or two $$‘1’s$$ at the end of byte because

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (arising out of functional dependencies) in the resulting set of relations is