Register
Filter

Answers by ManojK

9 votes
3
Congestion Control
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. How big will the window be if the next four transmission bursts are all successful? Assume that the maximum segment size is 1 KB
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. Howbig will the window be if the next four transmission bursts are all successful? Assumethat...
7 votes
4
Regular language
L= {(ap)* | p is a prime number} is this regular? if yes, then how?
L= {(ap)* | p is a prime number} is this regular? if yes, then how?
2 votes
5
What is the value of 10%-3?
What is the value of 10%-3 in C language ? A. 0 B. 1 C. -1 D. 10
What is the value of 10%-3 in C language ?A. 0B. 1C. -1D. 10
3 votes
6
class of language
is the language L is CFL ?? L={w| w is a palindrome over (a,b,c)}
is the language L is CFL ??L={w| w is a palindrome over (a,b,c)}
2 votes
8
Kerala PSC AP Exam
What will be the value of f after the execution of following program void main() { char a; float f = 10; for(a=1; a<=5; a++) { f-=.2; printf("\nf = %g", f); } } A) 5.0 B) 9 C) 9.0 D) error
What will be the value of f after the execution of following programvoid main() { char a; float f = 10; for(a=1; a<=5; a++) { f-=.2; printf("\nf = %g", f); } }A) 5.0B) 9C...
8 votes
10
Ace Page# 102, Q#13
4 votes
11
Program
void main(){ int i; float a=5.2; char *ptr; ptr=(char *)&a; for(i=0;i<=3;i++) printf("%d ",*ptr++); } (a)0 0 0 0 (b)Garbage Garbage Garbage Garbage (c)102 56 -80 32 (d)102 102 -90 64 (e)Compiler error
void main(){ int i; float a=5.2; char *ptr; ptr=(char *)&a; for(i=0;i<=3;i++) printf("%d ",*ptr++); }(a)0 0 0 0(b)Garbage Garbage Garbage Garbage(c)102 56 -80 32(d)102 10...
12 votes
12
TOC
Consider the language $ L=\{a^{n}b^{n} \mid n\geq 0\}$ What is the compliment of the language L?
Consider the language $ L=\{a^{n}b^{n} \mid n\geq 0\}$What is the compliment of the language L?
2 votes
13
c programming
int main() { int i,n; int x = 123456789; void *a = &x; unsigned char *c1 = (unsigned char*)a; for(i=0;i< sizeof a;i++) { printf("%u ",*(c1+i)); } char *c2 = (char*)a; printf("\n %d", *(c2+1)); char *c3 = (char*)a; printf("\n %u \n", *(c3+1)); } Output ?
int main() { int i,n; int x = 123456789; void *a = &x; unsigned char *c1 = (unsigned char*)a; for(i=0;i< sizeof a;i++) { printf("%u ",*(c1+i)); } char *c2 = (char*)a; pri...
4 votes
16
#Toc #PeterLinz
Find a DFA for the following language on {a,b} L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }
Find a DFA for the following language on {a,b}L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }
15 votes
17
ISRO2016-25
What will be output of the following program? Assume that you are running this program in little-endian processor. #include<stdio.h> int main() { short a=320; char *ptr; ptr=(char *)&a; printf("%d",*ptr); return 0; } 1 320 64 Compilation error
What will be output of the following program? Assume that you are running this program in little-endian processor.#include<stdio.h int main() { short a=320; char *ptr; pt...
7 votes
18
ISRO2016-5
A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are of same degree even degree odd degree different degree
A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are ofsame degree even degreeodd degree ...
7 votes
20
Theory Of Computation
To complement the language , we complement the machine by altering final/non-final states. My question is , should that machine necessarily be a DFA? Can't we apply the same concept to NFA?
To complement the language , we complement the machine by altering final/non-final states.My question is , should that machine necessarily be a DFA? Can't we apply the sa...
4 votes
21
ISRO2007-35
The output $0$ and $1$ level for TTL Logic family is approximately $0.1$ and $5 \text{ V}$ $0.6$ and $3.5 \text{ V}$ $0.9$ and $1.75 \text{ V}$ $-1.75$ and $0.9 \text{ V}$
The output $0$ and $1$ level for TTL Logic family is approximately$0.1$ and $5 \text{ V}$$0.6$ and $3.5 \text{ V}$$0.9$ and $1.75 \text{ V}$$-1.75$ and $0.9 \text{ V}$
0 votes
23
Limit
Can we calculate. $\textstyle \lim_{n \to \infty}\frac{2^{n}}{3^{n}}$ if yes then what is the value.
Can we calculate. $\textstyle \lim_{n \to \infty}\frac{2^{n}}{3^{n}}$ if yes then what is the value.
8 votes
24
ISRO2014-72
The rank of the matrix $A=\begin{pmatrix} 1 & 2 & 1 & -1\\ 9& 5& 2& 2\\ 7& 1& 0 & 4 \end{pmatrix}$ is ______ . $0$ $1$ $2$ $3$
The rank of the matrix $A=\begin{pmatrix} 1 & 2 & 1 & -1\\ 9& 5& 2& 2\\ 7& 1& 0 & 4 \end{pmatrix}$ is ______ .$0$$1$$2$$3$
0 votes
25
Which of the following can be recognized by a Turing machine?
Which of the following can be recognized by a Turing machine? 1. Palindrome recognition 2. GCD computation 3. SQUARE(SQUARE(.....(x)) where SQUARE(x) = x 2 4. All the above
Which of the following can be recognized by a Turing machine?1. Palindrome recognition2. GCD computation3. SQUARE(SQUARE(.....(x)) where SQUARE(x) = x 24. All the above
3 votes
26
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
13 votes
27
ISRO2011-49
Consider a 32-bit machine where four-level paging scheme is used. If the hit ratio to TLB is 98%, and it takes 20 nanosecond to search the TLB and 100 nanoseconds to access the main memory what is effective memory access time in nanoseconds? 126 128 122 120
Consider a 32-bit machine where four-level paging scheme is used. If the hit ratio to TLB is 98%, and it takes 20 nanosecond to search the TLB and 100 nanoseconds to acce...
13 votes
28
ISRO2011-77
In a system using single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is the CPU utilization? 70% 30% 60% 64%
In a system using single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is th...
Page: