# Questions by vijaycs

1
How option B would confirm - Bounded waiting.??
2
3
Q1. How many flip-flops are required to construct mod 4 counter? Ans - 2 right ? Alway it should be 2 or it may not be 2. Q2 . If We want to design a synchronous counter that counts the sequence 0−1−0−2−0−3 and then repeats. A) What is mod of this ... required-to-design-modulo-272-counter https://gateoverflow.in/82111/is-bcd-or-mod-10-counter-are-same https://gateoverflow.in/39670/gate-2016-1-8
4
A community of 5 members is to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. So how many chits will go into the same box? Anyone, please make me understand this question.
5
All the respected members, I need your valuable suggestion on how to solve questions during the exam so that we can avoid making more no of mistakes. Types of mistakes I commit - 1. Sometimes, I do not have sufficient concept regarding that particular topic, ... your experience if you have overcome this problem. @Arjun sir, @Digvijay sir, @Kapil, @Habib, @Manojk .. and all other members too.
6
What is the time complexity of the following code snippet? sum=0; for(i=0;i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=0;k<=n;k++) { sum=sum+k; } } } }
7
8
1. Does starvation freedom imply bounded- waiting ? 2. Does bounded- waiting imply starvation freedom ? Explain with example.
9
char buffer[6]=”hello”; char *prt1=buffer -1; /* undefined behavior */ char *ptr2 = buffer +5; /*Ok, pointing to the ‘\0’ inside the array */ char *ptr3 = buffer +6; /* OK, pointing to just beyond */ char *ptr4 = buffer +7; /* undefined behavior */ Please clear last two line.. and why 2nd last is not undefined behavior.
10
There are n distinct numbers are given not in sorted order. How much time it will take to select a number say k which is neither k-th minimum nor k-th maximum. A. O$(n)$ B. O$(1)$ C. O$(k)$ D. O$(k\log k)$.
1 vote
11
Please give one example of each following logic in english sentence - 1. ($\forall$xP(x) -> $\exists$xQ(x)) == $\exists$x(P(x) -> Q(x)) 2. ($\exists$xP(x) -> $\forall$xQ(x)) -> $\forall$x(P(x) -> Q(x)) 3. $\forall$x(P(x) -> R) -> ($\exists$xP(x) -> R)
1 vote
12
1 vote
13
On which of the following recurrence relation Masters theorem can not be applied ? A. T(n)= 2T(n/2) + n (log n). B. T(n) = T(n/2) + 1. C. T(n) = 8T(n/2) + (log n). D. T(n) = 7(T(n/4) + n2.
14
The minimum number of states in a DFA that recognizes the language L = (000 + 0000)* over the alphabet {0}.
15
1 vote
16
Let S = { (a1 , a2 , a3 ) | 0 $\leq$ ai $\leq$ 9 and a1 + a2 + a3 is divisible by 3}. Then the number of elements in S is 327 333 334 336
Let $0 < \theta < \pi$. The area of the triangle in the plane formed by the vertices $(-1,0), (1,0), (\cos\theta, \sin\theta)$ is not more than $1$ can be more than $1$ but not more than $2$ can be more than $2$ but not more than $\pi$ can be more than $\pi$ but not more than $2\pi$
If $\sqrt{3}$ + 1 is a root of equation 3 x$^{3}$ + ax$^{2}$ + bx + 12 = 0 where a and b are rational numbers, then b is equal to -6 2 6 10