menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Questions by vijaycs

0 votes
0 answers
1
Made-Easy | Synchronization
How option B would confirm - Bounded waiting.??
How option B would confirm - Bounded waiting.??
asked Jan 26, 2017 in Operating System 384 views
6 votes
1 answer
3
Self Doubt | Modulus Counter
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 ... design-modulo-272-counter https://gateoverflow.in/82111/is-bcd-or-mod-10-counter-are-same https://gateoverflow.in/39670/gate-2016-1-8
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
asked Nov 22, 2016 in Digital Logic 732 views
4 votes
1 answer
4
MadeEasy Test Series: Combinatory - Pigeonhole Principle
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.
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.
asked Nov 1, 2016 in Combinatory 524 views
17 votes
1 answer
5
Self - doubt | How to avoid committing mistakes in the paper?
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 ... you have overcome this problem. @Arjun sir, @Digvijay sir, @Kapil, @Habib, @Manojk .. and all other members too.
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.
asked Oct 22, 2016 in Revision 1.8k views
4 votes
3 answers
6
Gate cse facebook group doubt
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; } } } }
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; } } } }
asked Sep 29, 2016 in Programming 471 views
5 votes
2 answers
7
User|Kernel threads
Assume that process A has 3 user level threads and process B has 4 kernel-level threads. Consider while process A is running in CPU, process B is waiting in ready queue. If one of the thread in A is blocked then find status of A threads and B threads? A. ... A threads are blocked and B threads are not blocked. C. All B threads are blocked and A threads are not blocked. D. None.
Assume that process A has 3 user level threads and process B has 4 kernel-level threads. Consider while process A is running in CPU, process B is waiting in ready queue. If one of the thread in A is blocked then find status of A threads and B threads? A. All A threads ... . All A threads are blocked and B threads are not blocked. C. All B threads are blocked and A threads are not blocked. D. None.
asked Sep 20, 2016 in Operating System 816 views
6 votes
1 answer
8
Synchronization | Self-Doubt
1. Does starvation freedom imply bounded- waiting ? 2. Does bounded- waiting imply starvation freedom ? Explain with example.
1. Does starvation freedom imply bounded- waiting ? 2. Does bounded- waiting imply starvation freedom ? Explain with example.
asked Sep 19, 2016 in Operating System 950 views
2 votes
2 answers
9
Self-Doubt
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.
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.
asked Sep 4, 2016 in Programming 321 views
5 votes
1 answer
10
Maximum And Minimun
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)$.
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)$.
asked Aug 22, 2016 in Algorithms 665 views
1 vote
2 answers
11
Propositional Logic | Self doubt
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)
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)
asked Aug 19, 2016 in Mathematical Logic 718 views
1 vote
2 answers
13
TestBook Test Series: Algorithms - Time Complexity
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.
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.
asked Jul 11, 2016 in Algorithms 400 views
2 votes
1 answer
15
Minimum number of nodes in a full binary tree with height 3?
asked May 25, 2016 in DS 3.2k views
1 vote
2 answers
16
B. Math. 2005
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 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
asked Mar 23, 2016 in Quantitative Aptitude 404 views
0 votes
1 answer
17
B.Math. 2005
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$
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$
asked Mar 23, 2016 in Quantitative Aptitude 109 views
0 votes
1 answer
18
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals 175000 225500 149500 124000
asked Mar 23, 2016 in Quantitative Aptitude 863 views
1 vote
1 answer
19
B.Stat. 2005
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
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
asked Mar 23, 2016 in Quantitative Aptitude 207 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...