A data structure is said to be linear if its elements form a sequence or a linear list.
Examples:
1. Array
2. Linked List
3. Stacks
4. Queues

The total number of comparisons in a bubble sort is O(n²)

→ Fibonacci Series using recursion using condition is
Condition: fibonacci(n-1) + fibonacci(n-2)
Recurrence relation is: T(n)=2T(n-1)+C
Time Complexity: O(2ⁿ)
→ Factorial number using recursion is
Condition: fact(n-1)*n
Recurrence relation is: T(n)=T(n+1)+1
Time Complexity: O(n)
→ Tower of Hanoi using recursion is
Step-1: Hanoi(disk - 1, source, aux, dest)
Step-2: move disk from source to dest
Step-3: Hanoi(disk - 1, aux, dest, source)
Recurrence relation is: T(n)=2T(n-1)+C
Time Complexity: O(2ⁿ)
→ Tree traversals like Preorder,Postorder and Inorder using recursion only
Note: Recursion is best in the case of Tower of Hanoi,Factorial number and Tree traversals but it is not give good performance to fibonacci numbers.

The set of vertices has size n, the number of such subsets is given by the binomial coefficient C(n,2)⋅C(n,2) = n(n-1)/2

Given data,
-- Hash table has space =75 slots.
-- For 6% filling it must take =6 slots.
-- Probability of no collision for first 6 entries=?
Step-1: According to given data,
= (⁷⁵P_{6) / (75⁶)
= 0.814586387
Step-2: We have to find at least one collision occurs in 6 entries
=1-Probability of no collision for first 6 entries
= 1-0.814586387
= 0.185413613
Note: Given options are wrong. Given option-B is correct answer according to original key.}

→ Blind carbon copy(BCC) is a useful way to let others see an email you sent without the main recipient knowing. It is faster than sending the original message and then forwarding the sent message to the other recipients. It is also good netiquette to use Bcc when copying a message to many people.

→ Hub is a term used with a star networks. When compare to switch, it is not an intelligent device.

→ The amount of uncertainty in a system of symbol is called entropy. → Generally we can call entropy is disorder or uncertainty.

An X.25 WAN consists of packet-switching exchange (PSE) nodes as the networking hardware, and leased lines, plain old telephone service connections, or ISDN connections as physical links.

→ Hot-potato routing is the practice of passing traffic off to another autonomous system as quickly as possible, thus using their network for wide-area transit. → Cold-potato routing is the opposite, where the originating autonomous system holds onto the packet until it is as near to the destination as possible.

Start and stop bits are used in serial communications for Synchronization.