Register
Filter

Answers by sh!va

9 votes
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...
6 votes
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...
12 votes
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$
7 votes
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...
2 votes
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}$
2 votes
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...
10 votes
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$
4 votes
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...
4 votes
15
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 ...
4 votes
17
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 votes
21
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...
5 votes
23
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$
11 votes
24
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 votes
25
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...
9 votes
26
ISRO-DEC2017-77
Consider the following : A. Condition Coverage p. Black box testing B. Equivalence Class partitioning q. System testing C. Volume Testing r. White box testing D. Beta Testing s. Performance testing Matching $A, B, C, D$ in the same order gives, r,p,s,q p,r,q,s s,r,q,p q,r,s,p
Consider the following : A.Condition Coveragep.Black box testing B.Equivalence Class partitioningq.System testingC.Volume Testingr.White box testingD.Beta Testings.Perfor...
5 votes
27
ISRO-DEC2017-79
Which of the following related to snowflake schema is true? Each dimension is represented by a single dimensional table Maintenance efforts are less Dimension tables are normalized It is not an extension of star schema
Which of the following related to snowflake schema is true?Each dimension is represented by a single dimensional tableMaintenance efforts are lessDimension tables are nor...
16 votes
28
ISRO-DEC2017-80
Consider the following $C$ function #include<stdio.h> int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; } The output of the program is $\text{SI}$ $\text{IT}$ $\text{T1}$ $17$
Consider the following $C$ function#include<stdio.h int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; }The output of the program is ...
2 votes
30
Computer Networks
Que 1 In character-oriented protocol, we use __________ Bit stuffing Byte stuffing Both None Que 2 which protocol has flow control but not error control? Stop-and-Wait Simplest Go-Back-N ARQ Selective-Repeat ARQ
Que 1 In character-oriented protocol, we use __________ Bit stuffing Byte stuffing Both NoneQue 2 which protocol has flow control but not error control? Stop-and-Wai...
Page: