# Recent activity by Debasmita Bhoumik

1
Consider the Boolean function F(x1, x2, . . . , x10) realised by the following combinational circuit. Determine the number of input combinations for which the output function F realised by the circuit becomes true (logic 1).
2
Let P = {P1(x1, y1), P2(x2, y2), . . . , Pn(xn, yn)} be a set of n points located within a rectangle such that none of the points touches its boundary. The top-left corner of the rectangle is at the origin O(0, 0). A plane mirror is placed along the ... R2 at angle θ2 (denoted by a dashed line), passes through only 2 points. You will get full credit only if your algorithm takes O(n log n) time.
3
Consider the use of Cyclic Redundancy Code (CRC) with generator polynomial $G(x)$ for error detection. Recall that error detection with a CRC works by appending the CRC value to the bit sequence to make it a multiple of $G(x)$ ... a burst error of length $5$ in such a way that the error cannot be detected by the CRC with the $G(x)$ given above.
4
Consider all possible permutations of eight distinct elements $a, b, c, d, e, f, g, h$. In how many of them, will $d$ appear before $b$? Note that $d$ and $b$ may not necessarily be consecutive.
5
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ______ automatically by server by exchanging information with neighbour nodes with back up database
6
Given a binary search trees for a set of n=5 keys with the following probabilities : $\begin{array}{|l|l|l|l|l|l|l|}\hline \textbf{i} & \text{0} & \text{1} & \text{2} & \text{3} & \text{4} & \text{5} \\\hline \textbf{$ ... The expected optimal cost of the search is 2.65 2.70 2.75 2.80
7
The initial basic feasible solution to the following transportation problem using Vogel's approximation method is $\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$D_1$} & \textbf{$D_2$} & \text{$D_3$} & \text{$D_4$} & \textbf{Supply} \\\hline \textbf{$ ... = 180 $x_{11}=20, x_{13}=10, x_{22}=20, x_{23}=20, x_{24}=10, x_{32}=10$, Total cost = 180 None of the above
8
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are 6 8 10 12
9
If dual has an unbounded solution, then its corresponding primal has no feasible solution unbounded solution feasible solution none of these
10
Consider the following two rules $R1$ and $R2$ ... Only R1 is correct Only R2 is correct Both R1 and R2 are correct Neither R1 nor R2 is correct
11
Consider following two rules R$1$ $\text{and}$ R$2$ in logical reasoning in Artificial Intelligence (AI): R$1$: From $\alpha \supset \beta\frac{and \alpha}{Inter \beta }$ is known as Modulus Tollens (MT) R$2$:From $\alpha \supset \beta\frac{and \neg \beta }{Inter \neg\alpha}$ is ... (MP) Only R$1$ is correct. Only R$2$ is correct. Both R$1$ and R$2$ are correct. Neither R$1$ nor R$2$ is correct.
12
Consider a standard additive model consisting of rules of the form of If $x$ is $A_i$ AND $y$ is $B_i$ THEN $z$ is $C_i$. Given crisp inputs $x=x_0, \: y=y_0$ the output of the model is $z=\Sigma_i \mu_{A_i} (x_0) \mu_{B_i} (y_0) \mu_{C_i} (z)$ ... $z=\text{centroid } (\Sigma_i \mu_{A_i} (x_0) \mu_{B_i} (y_0)$
13
A bell shaped membership function is specified by three parameters $(a,b,c)$ as follows: $\dfrac{1}{1+\bigg(\dfrac{x-c}{a} \bigg)^b} \\$ $\dfrac{1}{1+\bigg(\dfrac{x-c}{a} \bigg)^{2b}} \\$ $1+\bigg(\dfrac{x-c}{a}\bigg)^b \\$ $1+\bigg(\dfrac{x-c}{a} \bigg)^{2b}$
14
Post-order traversal of a given binary search tree $T$ produces following sequence of keys: $3,5,7,9,4,17,16,20,18,15,14$. Which one of the following sequences of keys can be the result of an in-order traversal of the tree $T$? $3,4,5,7,9,14,20,18,17,16,15$ $20,18,17,16,15,14,3,4,5,7,9$ $20,18,17,16,15,14,9,7,5,4,3$ $3,4,5,7,9,14,15,16,17,18,20$
15
Which of the following testing techniques ensures that the software products runs correctly after the changes in maintenance? Path Testing Integration Testing Unit Testing Regression Testing
16
Which of the following Super Computers is the fastest Super Computer? Sun-way TaihuLight Titan Piz Daint Sequoia
17
Which of the following statements about ERP systems is true? Most ERP software implementations fully achieve seamless integration ERP software packages are themselves combinations of separate applications for manufacturing, materials, resource planning, general ... implemented uniformly throughout an enterprise is likely to contain very flexible connections to allow charges and software variations
18
Which of the given wireless technologies used in IoT, consumes the least amount of power? Zigbee Bluetooth Wi-Fi GSM/CDMA
19
Which of the following is not a Clustering method? K-Means method Self Organizing feature map method K- nearest neighbor method Agglomerative method
20
Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) that represents non-negative decimal values, does not include even values? $0^*1^+0^*1^*$ $0^*1^*0^+1^*$ $0^*1^*0^*1^+$ $0^+1^*0^*1^*$ Where $\{+,\ * \}$ are quantification characters.
21
The octal equivalent of the binary number $1011101011$ is $7353$ $1353$ $5651$ $5657$
22
Which of the following statements is/are TRUE? The grammar $S \rightarrow SS \mid a$ is ambiguous. (Where $S$ is the start symbol) The grammar $S \rightarrow 0S1 \mid 01S \mid \epsilon$ is ambiguous. (The special symbol $\epsilon$ represents the empty string) (Where $S$ is the start symbol) The ... are TRUE. Only (a) and (c) are TRUE. Only (b) and (c) are TRUE. All of (a), (b) and (c) are TRUE.
23
Let $P$ and $Q$ be two propositions $\neg (P \leftrightarrow Q)$ is equivalent to $P\leftrightarrow \neg Q$ $\neg P\leftrightarrow Q$ $\neg P \leftrightarrow \neg Q$ $Q\rightarrow P$
24
How many distinguishable permutations of the letters BANANA are there 720 120 60 360
25
For the 8 bit word 00111001,the check bits stored with it would we 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory? 10011001 00011001 00111000 11000110
26
Let A and B be two fuzzy integers defined as: A={(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)} B={(10, 0.5), (11, 1), (12, 0.5)} Using fuzzy arithmetic operation given by $\mu_{A+B^{(Z)}} = \underset{x+y=z}{\oplus} (\mu_A (x) \otimes \mu_B(y))$ $f(A+B)$ ... 15, 1), (16, 0.5), (17, 0.2)} {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}
Let $f(n)$ and $g(n)$ be asymptotically non-negative functions. Which of the following is correct? $\theta (f(n)^*g(n))=min (f(n),g(n))$ $\theta (f(n)^*g(n))=max(f(n),g(n))$ $\theta (f(n)+g(n))=min(f(n),g(n))$ $\theta (f(n)+g(n))=max(f(n),g(n))$
Consider the two class classification task that consists of the following points: Class $C_1$ : [1 1.5] [1 -1.5] Class $C_2$ : [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: $x_1+x_2+1.5=0$ $x_1+x_2-1.5=0$ $x_1+1.5=0$ $x_1-1.5=0$
Let $f$ be the fraction of the computation (in terms of time) that is parallelizabl$e$. $P$ the number of processors in the system, and $s_p$ the speed up achievable in comparison with sequential execution – then the $s_p$ can be calculated using the relation: $\frac{1}{1-f-f/P}$ $\frac{P}{P-f(P+1)}$ $\frac{1}{1-f+f/P}$ $\frac{P}{P+f(P-1)}$