Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sh!va
1
votes
1
ISRO-DEC2017-21
For $\Sigma =\{a,b\}$ the regular expression $r=(aa)^{*}(bb)^{*}b$ denotes Set of strings with $2\,{a}'s$ and $2\,{b}'s$ Set of strings with $2\,{a}'s$ $2\,{b}'s$ followed by $b$ Set of strings with $2\,{a}'s$ followed by ${b}'s$ which is a multiple of $3$ Set of strings with even number of ${a}'s$ followed by odd number of ${b}'s$
For $\Sigma =\{a,b\}$ the regular expression $r=(aa)^{*}(bb)^{*}b$ denotesSet of strings with $2\,{a}'s$ and $2\,{b}'s$Set of strings with $2\,{a}'s$ $2\,{b}'s$ followed ...
1.3k
views
answered
Jan 11, 2018
Theory of Computation
isrodec2017
+
–
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...
3.4k
views
answered
Jan 11, 2018
Theory of Computation
isrodec2017
+
–
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...
1.2k
views
answered
Jan 11, 2018
Theory of Computation
isrodec2017
+
–
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$
3.1k
views
answered
Jan 11, 2018
DS
isrodec2017
+
–
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...
1.6k
views
answered
Jan 11, 2018
Computer Networks
isrodec2017
network-security
+
–
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}$
1.8k
views
answered
Jan 11, 2018
Computer Networks
isrodec2017
+
–
2
votes
7
GATE CSE 2012 | Question: 34, ISRO-DEC2017-32
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...
30.7k
views
answered
Jan 11, 2018
Computer Networks
gatecse-2012
computer-networks
subnetting
normal
isrodec2017
+
–
6
votes
8
ISRO-DEC2017-33
Assume that Source $S$ and Destination $D$ are connected through an intermediate router $R.$ How many times a packet has to visit the network layer and data link layer during a transmission from $S$ to $D$ ? Network layer$-4$ times, Data link layer$-4$ times ... layer$-6$ times Network layer$-2$ times, Data link layer$-4$ times Network layer$-3$ times, Data link layer$-4$ times
Assume that Source $S$ and Destination $D$ are connected through an intermediate router $R.$How many times a packet has to visit the network layer and data link layer dur...
1.7k
views
answered
Jan 11, 2018
Computer Networks
isrodec2017
+
–
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...
2.6k
views
answered
Jan 11, 2018
Computer Networks
isrodec2017
+
–
7
votes
10
ISRO-DEC2017-36
Station $A$ uses $32-byte$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip time delay between $A$ and $B$ is $40\,ms$ and the bottleneck bandwidth on the path $A$ and $B$ is $64\, kbps.$What is the optimal window size that $A$ should use? $5$ $10$ $40$ $80$
Station $A$ uses $32-byte$ packets to transmit messages to Station $B$ using a sliding window protocol.The round trip time delay between $A$ and $B$ is $40\,ms$ and the b...
1.6k
views
answered
Jan 11, 2018
Computer Networks
isrodec2017
+
–
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$
1.6k
views
answered
Jan 11, 2018
Digital Logic
isrodec2017
+
–
6
votes
12
ISRO-DEC2017-43
Consider an instruction of the type $\text{LW R1, 20(R2)}$ which during execution reads a $32$-$bit$ word from memory and stores it in a $32$-$bit$ register $R1.$ The effective address of the memory location is obtained ... $20$ and contents of $R2.$ Which one best reflects the source operand? Immediate addressing Register addressing Register Indirect addressing Indexed addressing
Consider an instruction of the type $\text{LW R1, 20(R2)}$ which during execution reads a $32$-$bit$ word from memory and stores it in a $32$-$bit$ register $R1.$ The eff...
1.6k
views
answered
Jan 11, 2018
CO and Architecture
isrodec2017
addressing-modes
+
–
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...
1.5k
views
answered
Jan 11, 2018
Algorithms
isrodec2017
+
–
11
votes
14
ISRO-DEC2017-46
In a compact one-dimensional array representation for lower triangular matrix (all elements above diagonal are zero) of size $n\times n,$ non zero elements of each row are stored one after another, starting from first row, the index of $(i,j)^{th}$ element in this niw representation is $i+j$ $j+\dfrac{i(i-1)}{2}$ $i+j-1$ $i+\dfrac{j(j-1)}{2}$
In a compact one-dimensional array representation for lower triangular matrix (all elementsabove diagonal are zero) of size $n\times n,$ non zero elements of each row are...
1.8k
views
answered
Jan 11, 2018
Programming in C
isrodec2017
+
–
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 ...
1.3k
views
answered
Jan 10, 2018
DS
isrodec2017
data-structures
binary-tree
+
–
7
votes
16
ISRO-DEC2017-58
A virtual memory system uses $FIFO$ page replacement policy and allocates a fixed number of frames to the process. Consider the following statements M: Increasing the number of page frames allocated to a process sometimes increases the page fault rate. N: Some programs do not exhibit locality of ... not the reason for $M$. Both $M$ and $N$ are false. $M$ is false, but $N$ is true.
A virtual memory system uses $FIFO$ page replacement policy and allocates a fixed number of frames to the process. Consider the following statements M:Increasing the numb...
1.2k
views
answered
Jan 10, 2018
Operating System
isrodec2017
+
–
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...
1.8k
views
answered
Jan 10, 2018
Operating System
isrodec2017
+
–
7
votes
18
ISRO-DEC2017-63
Which of the following is false? User level threads are not scheduled by the kernel. Context switching between user-level threads is faster than context switching between kernel-level threads. When a user thread is blocked all other threads of its processes are blocked. Kernel-level threads cannot utilize multiprocessor systems by splitting threads on different processors or cores.
Which of the following is false?User level threads are not scheduled by the kernel.Context switching between user-level threads is faster than context switching between k...
1.6k
views
answered
Jan 10, 2018
Operating System
isrodec2017
+
–
4
votes
19
ISRO-DEC2017-64
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if resulting state is safe. In deadlock avoidance, the request for ... safe. Deadlock avoidance requires knowledge of resource requirements a priori. Deadlock prevention is more restrictive than deadlock avoidance.
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?In deadlock prevention, the request for resources is always granted ...
1.9k
views
answered
Jan 10, 2018
Operating System
isrodec2017
+
–
12
votes
20
ISRO-DEC2017-67
Consider the code segment int i,j,x,y,m,n; n = 20; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(i%2) { x += ((4*j)+5*i); y += (7+4*j) } } } m=x+y; Which one of the following is false? ... loop invariant computation There is scope of common sub-expression elimination in this code There is scope of strength reduction in this code There is scope of dead code elimination in this code
Consider the code segmentint i,j,x,y,m,n; n = 20; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(i%2) { x += ((4*j)+5*i); y += (7+4*j) } } } m=x+y;Which one of the following is...
1.6k
views
answered
Jan 10, 2018
Compiler Design
isrodec2017
code-optimization
compiler-design
+
–
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...
3.2k
views
answered
Jan 10, 2018
Operating System
isrodec2017
semaphore
+
–
7
votes
22
ISRO-DEC2017-69
Consider a disk sequence with $100$ cylinders. The request to access the cylinder occur in the following sequence : $4,34,10,7,19,73,2,15,6,20$ Assuming that the head is currently at cylinder $50$, what is the time taken to satisfy all requests if it takes $2\,ms$ to move from one cylinder to adjacent one and shortest seek time first policy is used? $190$ $238$ $233$ $276$
Consider a disk sequence with $100$ cylinders. The request to access the cylinder occur in the following sequence :$4,34,10,7,19,73,2,15,6,20$Assuming that the head is cu...
1.3k
views
answered
Jan 10, 2018
Operating System
isrodec2017
+
–
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$
1.7k
views
answered
Jan 10, 2018
Programming in C
isrodec2017
+
–
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$
2.7k
views
answered
Jan 10, 2018
Digital Logic
isrodec2017
+
–
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...
2.4k
views
answered
Jan 10, 2018
Digital Logic
isrodec2017
functional-completeness
digital-logic
+
–
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...
2.1k
views
answered
Jan 10, 2018
Others
isrodec2017
+
–
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...
2.8k
views
answered
Jan 10, 2018
Others
isrodec2017
+
–
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 ...
3.8k
views
answered
Jan 10, 2018
Programming in C
isrodec2017
+
–
7
votes
29
ISRO-DEC2017-65
Which one of the following are essential features of object-oriented language? A. Abstraction and encapsulation B. Strictly-typed C. Type-safe property coupled with sub-type rule D. Polymorphism in the presence of inheritance $A$ and $B$ only $A,D$ and $B$ only $A$ and $D$ only $A,C$ and $D$ only
Which one of the following are essential features of object-oriented language? A.Abstraction and encapsulation B.Strictly-typed C.Type-safe property coupled with sub-type...
1.5k
views
answered
Jan 10, 2018
Programming in C
isrodec2017
+
–
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...
1.4k
views
answered
Jan 4, 2018
Computer Networks
computer-networks
+
–
Page:
1
2
3
4
5
6
...
17
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register