TCS Digital Advanced Aptitude Questions
Uploaded by
Yaqub AnsariTCS Digital Advanced Aptitude Questions
Uploaded by
Yaqub Ansari- Advanced Aptitude Problems
- Work and Time Problems
- Combinatorics and Probability
Common questions
Powered by AIGiven Usha takes 8 hours longer, and Renu takes 4.5 hours longer alone, the equations for work rates revolved around these conditions. Let t be the time taken if both work together. Renu's individual time computed as (t + 4.5) validates through these rates solving that Renu takes 10.5 hours alone, showing total design completion efficiency .
Finding the room arrangement involves calculating the Greatest Common Divisor for each group (120, 144, 192 students). The smallest divisor sets room size, directing room layout aligning uniformly to portrait students equally, showing 18 rooms optimally as minimal count .
The rate at which George, Mark, and Henry can paint boxes is determined by their combined rates from pairs: George and Mark paint 720 boxes in 20 days, Mark and Henry in 24 days, and Henry and George in 15 days. Solving for individual rates, then using their working times (George 4 days, Mark 8 days, Henry 8 days), the total painted boxes are calculated to be 492 .
The original price per chocolate was Rs. 2, yet all sold out at a reduced price, generating Rs. 164.90 total. Understanding conditions (new price no less than half the original) involves setting up cost equations. Solving these shows the number of chocolates that then align with known pricing constraints, with the most viable answer being 97 chocolates were sold at the reduced price .
The shortest path on the cone's slant surface, considering parameters set in the problem (R=270 cm, r=90 cm), involves draping the cone into a sector of a circle to measure direct path. Mathematically unfolding the cone delivers the shortest distance, which computing radially through trigonometry gives a distance of 282.6 cm .
The bug moves clockwise in increments of (1+r) places, where r is the remainder of the current position divided by 11. With the bug starting at position 23, for every position, the increment changes. By calculating the increments over 2012 seconds with cyclic array updates based on modulo 29, we find the final position on the circle to be at position 17 after 2012 seconds .
Using the pattern, the farmer's choices between plucking 6, 7, 23, or 24 roses dictate how many roses bloom the next day. Tracking the changes starting from 189 roses, and simulating several iterations can reveal feasible numbers that reflect predictable states such as 4, 7, 30, or 37 roses after known sequences of plucking and blooming. This analysis shows the cyclic change returning to a feasible count .
Anand needs to pack 304 marbles using bags of 9 and 11 marbles. Let's denote x as the number of bags of 9 marbles and y as the number of bags of 11 marbles. The total equation becomes 9x + 11y = 304. To maximize x, we need to minimize y but keep it at least 1. By trial, if y = 8, then 9x = 304 - 88 = 216, giving x = 24. Therefore, Anand needs 24 bags of 9 marbles and 1 bag of 11 marbles, totaling 25 bags .
By using area formulas and setting the pool area as πr² and path area (π(R² - r²)) = 11/25 of πr², solving these equations with known path width of 4 feet confirms the pool radius to be 25 feet .
To solve for static K across arrangements, constraining calculations ensures sum consistency for the number sets (6, 12, 21, 22, 27, 34). Aligning and calculating precise totals finds 69 to be the arrangement that maintains identical column-row sum integrity .
