Register
Filter

Recent activity by sh!va

2 answers
2
ISRO-DEC2017-22
Consider the grammar with productions $S\rightarrow aSb\mid SS \mid \varepsilon$ This grammar is not context-free, not linear not context-free, linear context-free, not linear context-free, linear
Consider the grammar with productions$S\rightarrow aSb\mid SS \mid \varepsilon$This grammar is not context-free, not linearnot context-free, linearcontext-free, not linea...
2 answers
3
ISRO-DEC2017-26
Which of the following are context-free? $A=\{a^n b^n\, a^mb^m\mid m,n\geq0\}$ $B=\{a^m b^n\, a^mb^n\mid m,n\geq0\}$ $C=\{a^mb^n\mid m\neq 2n,\,m,n\geq0\}$ A and B only A and C only B and C only C only
Which of the following are context-free?$A=\{a^n b^n\, a^mb^m\mid m,n\geq0\}$$B=\{a^m b^n\, a^mb^n\mid m,n\geq0\}$$C=\{a^mb^n\mid m\neq 2n,\,m,n\geq0\}$A and B only A and...
2 answers
4
ISRO-DEC2017-28
The number of structurally different possible binary trees with $4$ nodes is $14$ $12$ $336$ $168$
The number of structurally different possible binary trees with $4$ nodes is $14$$12$$336$$168$
2 answers
5
ISRO-DEC2017-29
Using public key cryptography, $X$ adds a digital signature $\sigma$ to a message $M,$ encrypts $\langle M,\sigma \rangle$ and sends it to $Y,$ ... public key followed by ${Y}'s$ private key; Decryption:${Y}'s$ public key followed by ${X}'s$ private key.
Using public key cryptography, $X$ adds a digital signature $\sigma$ to a message $M,$ encrypts $\langle M,\sigma \rangle$ and sends it to $Y,$ where it is decrypted. Whi...
3 answers
6
ISRO-DEC2017-31
In the IPv4 addressing format, the number of networks allowed under Class C addresses is $2^{20}$ $2^{24}$ $2^{14}$ $2^{21}$
In the IPv4 addressing format, the number of networks allowed under Class C addresses is$2^{20}$$2^{24}$$2^{14}$$2^{21}$
1 answer
9
ISRO-DEC2017-34
Generally, TCP is reliable and UDP is not reliable. DNS which has to be reliable uses UDP because UDP is slower. DNS servers has to keep connections. DNS requests are generally very small and fit well within UDP segments. None of these.
Generally, TCP is reliable and UDP is not reliable. DNS which has to be reliable uses UDP becauseUDP is slower.DNS servers has to keep connections.DNS requests are genera...
1 answer
11
ISRO-DEC2017-40
Let $M=11111010$ and $N=00001010$ be two $8$-$bit$ two's complement number.Their product in two's complement is $11000100$ $10011100$ $10100101$ $11010101$
Let $M=11111010$ and $N=00001010$ be two $8$-$bit$ two's complement number.Their product in two's complement is$11000100$$10011100$$10100101$$11010101$
2 answers
13
ISRO-DEC2017-44
A sorting technique is called stable if If it takes $O(n\log n)$ time. It uses divide and conquer technique. Relative order of occurrence of non-distinct elements is maintained. It takes $O(n)$ space.
A sorting technique is called stable ifIf it takes $O(n\log n)$ time.It uses divide and conquer technique.Relative order of occurrence of non-distinct elements is maintai...
1 answer
15
ISRO-DEC2017-48
Quick-sort is run on $2$ inputs shown below to sort in ascending order : $1,2,3\ldots n$ $n,n-1,n-2\ldots 1$ Let $C$1 and $C2$ be the number of comparisons made for A and B respectively. Then, $C1>C2$ $C1=C2$ $C1<C2$ Cannot say anything for arbitrary $n$
Quick-sort is run on $2$ inputs shown below to sort in ascending order :$1,2,3\ldots n$$n,n-1,n-2\ldots 1$Let $C$1 and $C2$ be the number of comparisons made for A and B ...
1 answer
16
IEs 2018- Computer Networks
Which of the following statements is correct in respect of TCP and UDP protocols? (a) TCP is connection-oriented, whereas UDP is connectionless (b) TCP is connectionless, whereas UDP is connection-oriented (c) Both are connectionless (d) Both are connection-oriented
Which of the following statements is correct in respect of TCP and UDP protocols?(a) TCP is connection-oriented, whereas UDP is connectionless(b) TCP is connectionless, w...
2 answers
17
ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary ...
0 answers
20
ISRO-DEC2017-60
A process executes the following code for(i=0;i<n;i++) fork(); The total number of child processes created is $n^2$ $2^{n+1}-1$ $2^n$ $2^{n}-1$
A process executes the following codefor(i=0;i<n;i++) fork();The total number of child processes created is$n^2$$2^{n+1}-1$$2^n$$2^{n}-1$
2 answers
21
ISRO-DEC2017-61
Consider the following scheduling: A. Gang scheduling s. Guaranteed scheduling B. Rate monotonic scheduling t. Thread scheduling C. Fair share scheduling u. Real-time scheduling Matching the table in the order $A,B,C$ gives t,u,s s,t,u u,s,t u,t,s
Consider the following scheduling: A.Gang schedulings.Guaranteed schedulingB.Rate monotonic schedulingt.Thread schedulingC.Fair share schedulingu.Real-time schedulingMatc...
2 answers
25
ISRO-DEC2017-70
A counting semaphore was initialized t o $7$. Then $\text{20 P (wait)}$ operations and$\text{x V (signal)}$ operations were completed on this semaphore. If the final value of semaphore is $5$, then the value $x$ will be $0$ $13$ $18$ $5$
A counting semaphore was initialized t o $7$. Then $\text{20 P (wait)}$ operations and$\text{x V (signal)}$ operations were completed on this semaphore. If the final valu...
1 answer
27
ISRO-DEC2017-68
Consider the following table : ... $a-q, b-r, c-s, d-p$ $a-r, b-s, c-q, d-p$ $a-r, b-s, c-p, d-q$
Consider the following table :$\begin{array}{|l|l|l|} \hline \textbf{A.} & \text{Activation record} & \textbf{p.} & \text{Linking loader} \\\hline \textbf{B.} & \text{Loc...
2 answers
28
ISRO-DEC2017-74
Consider the function int func(int num) { int count=0; while(num) { count++; num>>=1; } return(count); } For $func(435)$ the value returned is $9$ $8$ $0$ $10$
Consider the functionint func(int num) { int count=0; while(num) { count++; num>>=1; } return(count); }For $func(435)$ the value returned is$9$$8$$0$$10$
2 answers
29
ISRO-DEC2017-75
In $\text{IEEE}$ floating point representation, the hexadecimal number $\text{0xC0000000}$ corresponds to $-3.0$ $-1.0$ $-4.0$ $-2.0$
In $\text{IEEE}$ floating point representation, the hexadecimal number $\text{0xC0000000}$ corresponds to$-3.0$$-1.0$$-4.0$$-2.0$
1 answer
30
ISRO-DEC2017-76
Which of the following set of components is sufficient to implement any arbitrary Boolean function? $XOR$ gates, $NOT$ gates $AND$ gates, $XOR$ gates and $1$ $2$ to $1$ multiplexer Three input gates that output $(A.B)+C$ for the inputs $A, B, C$
Which of the following set of components is sufficient to implement any arbitrary Boolean function?$XOR$ gates, $NOT$ gates$AND$ gates, $XOR$ gates and $1$$2$ to $1$ mult...