Govt. Exams
For searching in large datasets, Binary Search Trees provide O(log n) complexity and Hash Tables provide O(1) average case, both significantly better than linear search in unsorted structures.
Sorted: [1,1,2,3,4,5,6,9]. Median of 8 elements = (3+4)/2 = 3.5
NoSQL databases typically follow eventual consistency rather than strict ACID properties.
Microservices allow independent scaling, deployment, and development of different services.
O(n log n) with n=1000: 1000 × log₂(1000) ≈ 1000 × 10 = 10000 operations.
Heap Sort uses O(1) extra space, making it ideal for memory-constrained environments.
TCS's digital transformation strategy emphasizes AI/ML, cloud computing, and cybersecurity as core competencies.
Merge sort requires O(n) extra space for creating temporary arrays during the merge process.
Heaps provide O(log n) insertion and deletion, making them optimal for priority queues compared to other structures.
Let smaller number = x. Larger = x+5. Sum: x + (x+5) = 25 → 2x = 20 → x = 10. Larger = 15
