qwerty123
@qwerty123-ZuiVHD Member
- Member since
- Joined
- Last active
- Active
- Member number
- Member #124,698
- Posts
- 7
- Replies
- 5
- Reactions
- 0
- Active days
- 0
Contributions
Last 12 months
0 contributions
- Active days
- 0
- Longest run
- 0 days
- Current run
- 0 days
Trophies
Featured trophies
0 / 8
Swipe or scroll to see more trophies
Recent contributions
-
Posted #Threads
Gate question: detailed answer?
A bag contains 10 blue marbles, 20 green marbles and 30 red marbles. A marble is drawn from the bag, its colour recorded and it is...
2 replies -
Posted #Threads
Answer with detailed steps?
In an enhancement of a design of a CPU, the speed of a floating point until has been increased by 20% and the speed of a...
1 reply -
Replied #Threads
Solve: Program p calls two subprogram P1 and P2. P1 fails 50% times..
hey this is probabilty concept.......... p(p1 U p2)= p1+p2-(p1*p2) =70% answer
-
Posted #Threads
Solve: Program p calls two subprogram P1 and P2. P1 fails 50% times..
A program p calls two subprogram p1 and p2.p1 can fails 50% times and p2 can fails 40% times .then p can fail a)50% b)60% c)10%...
5 replies -
Replied #Threads
anybody solved the question with detailed answer
Suppose the cache and main memory access times are 100 ns and 1200 ns respectively. The cache is used for paging and the hit ratio of...
-
Posted #Threads
solve the recurrence eqn(time complexity) with detailed answer
a) T(n)=2T(n/2)+√n, n>=2 T(1)=1 b) T(n)= mT(n/2)+an^2
1 reply -
Replied #Threads
solve the recurrence problem with detail(time complexity)
Suppose the cache and main memory access times are 100 ns and 1200 ns respectively. The cache is used for paging and the hit ratio of...
-
Replied #Threads
solve the recurrence problem with detail(time complexity)
hi, this problem uses log n series ....i can evalute only up to sum of n term ...........thanx for reply to this question........i already posted one...
-
Posted #Threads
solve the recurrence problem with detail(time complexity)
solve the recurrence problem with detail(time complexity) T(n)=T(n-1)+1/n, if n>1 = 1 otherwise
4 replies -
Replied #Threads
Introduce
godfatherWelcome to CE. 😀 Do not share Email ID in public it increases Spam only.Thank u for this information....further i cant mentioned my email id
-
Posted #Threads
Introduce
hi CE, I'm a postgraduate software engineering student in anna university trichy.further i want to do pusue research(ph.d) in reputed institution like iit, nits.i will prepare...
3 replies -
Posted #Threads
anybody solved the question with detailed answer
Suppose the cache and main memory access times are 100 ns and 1200 ns respectively. The cache is used for paging and the hit ratio of...
5 replies
Activity by month
Where qwerty123 contributes
-
#Threads 12 · 100%
Highlights
- Reactions per contribution
- 0.0
- Best answers
- 0
- Member for
- 14 years