Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH. [...]

A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes of a file that can be accessed by quadruple pointer is 4TB using the I-Node then how many bits are required to address disk block?   Answer: 32bits i'm bit confused in the difference between I-Node disk block size and the given disk block size. [...]

Let $G(V,E)$ be the simple undirected graph where $V = \{v_1, v_2, \dots, v_{2n}\}$ and $E = \{(v_i,v_j) | v_i \text{ and } v_j \text{ are friends}\}$. Now, it is given that every $v_i$ has more friends than enemies. This implies that any $v_i$ has atleast $n$ friends and atmost $n-1$ enemies. Mathematically, $\forall_i \ deg(v_i) \ge n$, in other words, every vertex of graph $G$ has degree more than $n$. If total guests are $2$, then both must be friends and we will have a hamiltonian path. If total guests are $2n\ge4$ and degree of every vertex is atleast [...]

The answer should be C) Bina. Here is a stepwise solution ->  1. China is sitting 3rd to the left of Dipa.(both facing inside) 2. Elina is not sitting adjacent to either of China or Dipa => only one position is left for her 3. One sitting between Dipa and Fiona will be facing outside => Dipa and Fiona need to have one empty place between them, this fixes the position of Fiona. 4. Gita sits 3rd to the right of Aina => it is not possible if we consider that Aina is facing inside(no empty place with a gap [...]

nth group starts with $(n-1)$$^{2}$ $+$ $1$ and ends with $n$$^{2}$ and every group consists $2n-1$ numbers $15th$ group starts with 196 and ends with $225$ $sum$ = $\frac{No of terms}{2}$ * $[first$ $term$+$last$ $term]$ = $\frac{29}{2} * [(196+1) + 225]$ = $6119$ [...]

acknowledge-Ignored [...]