# Recent activity by commenter commenter

1
X AND Y is an arbitrary sets, F: $X\rightarrow Y$ show that a and b are equivalent F is one-one For all set Z and function g1: $Z\rightarrow X$ and g2: $Z\rightarrow X$, if $g1 \neq g2$ implies $f \bigcirc g1 \neq f \bigcirc g2$ Where $\bigcirc$ is a fucntion composition.
2
Given that $B(a)$ means “$a$ is a bear” $F(a)$ means “$a$ is a fish” and $E(a,b)$ means “$a$ eats $b$” Then what is the best meaning of $\forall x [F(x) \to \forall y(E(y,x)\rightarrow b(y))]$ Every fish is eaten by some bear Bears eat only fish Every bear eats fish Only bears eat fish
3
Avalanche effect in cryptography refers Large changes in cipher text when the keyword is changed minimally Large changes in cipher text when the plain text is changed Large Impact of keyword change to length of the cipher text None of the above
4
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
5
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
6
Remote Procedure Calls are used for communication between two processes remotely different from each other on the same system communication between two processes on the same system communication between two processes on the separate systems none of the above
7
The roots of $ax^{2}+bx+c = 0$ are real and positive. $a, b$ and $c$ are real. Then $ax^{2}+b\mid x \mid + c =0$ has no roots $2$ real roots $3$ real roots $4$ real roots
8
A IP packet has arrived in which the fragmentation offset value is 100,the value of HLEN is 5 and the value of total length field is 200. What is the number of the last byte? 194 394 979 1179
9
An aggregation association is drawn using which symbol? A line which loops back on to the same table A small open diamond at the end of a line connecting two tables A small closed diamond at the end of a line connecting two tables A small closed triangle at the end of a line connecting two tables
10
Consider the following pseudo- code while (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end while What is cyclomatic complexity of the above pseudo -code? 2 3 4 5
11
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below. Search key field = $12$ field Record pointer = $10$ bytes Block pointer = $8$ bytes Block size = $1$KB $P_{leaf}$ = 51 & p = 46 $P_{leaf}$ = 47 & p = 52 $P_{leaf}$ = 46 & p = 51 $P_{leaf}$ = 52 & p = 47
12
When two $\text{BCD}$ numbers $0\times14$ and $0\times08$ are added what is the binary representation of the resultant number ? $0\times22$ $0\times1c$ $0\times16$ results in overflow
13
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code? $5$ $6$ $7$ $8$
14
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy Index Linked Contiguous Bit Map
15
Which of the following are NOT shared by the threads of the same process? Stack Registers Address space Message queue a and d b and c a and b a, b and c
16
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
17
18
An even function $f(x)$ has left derivative $5$ at $x=0$. Then the right derivative of $f(x)$ at $x=0$ need not exist the right derivative of $f(x)$ at $x=0$ exists and is equal to $5$ the right derivative of $f(x)$ at $x=0$ exists and is equal to $-5$ none of the above is necessarily true
19
What is the main reason for RACE condition while synchronzing the process? A)The two processes trying to update the variable at same time. B) More than one process entering into the critical section at same time. C)Mutual Exclusion condition not satisfies. D)All of the above
20
Networks that use different technologies can be connected by using Packets Switches Bridges Routers
21
An algorithm is made up of $2$ modules $M_{1}$ and $M_{2}$ . If time complexity of modules $M_{1}$ and $M_{2}$ are $h(n)$ and $g(n)$ respectively, the time complexity of the algorithm is $\min (h(n), g(n))$ $\max (h(n), g(n))$ $h(n) + g(n)$ $h(n) * g(n)$
22
Which of the following statement(s) is (are) not correct ? i. The $2$&rsquo;s complement of $0$ is $0$. ii. In $2$&rsquo;s complement, the left most bit cannot be used to express a quantity. iii. For an $n$-bit word ($2$&rsquo;s complement) which includes the sign bit, ... contained in the $1$&rsquo;s of positive numbers and $0$&rsquo;s of the negative numbers. $i$ & $iv$ $i$ & $ii$ $iii$ $iv$
23
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. -------------------------------------------------------------------------------------------------------------------------- 2)The number of min heap trees are possible with 15 elements_________________
24
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
25
Let a schedule be Strict Recoverable then it will suffer from which problem? a) ww problem b) rw problem c)wr problem d) Lost update problem
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar unambiguous? Is so, what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.