Home Subjects Placement Papers

Placement Papers

TCS, Infosys, Wipro, Cognizant actual papers

312 Q 10 Topics Take Test
Advertisement
Difficulty: All Easy Medium Hard 271–280 of 312
Topics in Placement Papers
Q.271 Medium TCS Questions
A TCS team is developing a microservices architecture where each service maintains its own database. Which of the following is the PRIMARY challenge they will face?
A Data consistency across distributed services
B Increased CPU utilization
C Reduced network bandwidth
D Simplified authentication mechanisms
Correct Answer:  A. Data consistency across distributed services
EXPLANATION

In microservices architecture, maintaining data consistency across independently managed databases (polyglot persistence) is a significant challenge. ACID transactions cannot span multiple databases, requiring eventual consistency patterns.

Test
Q.272 Medium TCS Questions
TCS cybersecurity team emphasizes password security. Which is the STRONGEST password practice?
A Using dictionary words with birth year
B 12-character minimum with mix of uppercase, lowercase, numbers, and special characters
C Same password across multiple systems
D Writing passwords in documentation
Correct Answer:  B. 12-character minimum with mix of uppercase, lowercase, numbers, and special characters
EXPLANATION

Strong passwords require length (12+ characters), character variety, and complexity. Reusing passwords and storing them insecurely significantly increases security risks.

Test
Q.273 Medium TCS Questions
In TCS technical assessments, a question asks about polymorphism. Which is NOT a type of polymorphism in OOP?
A Compile-time (Method Overloading)
B Runtime (Method Overriding)
C Static Polymorphism
D Sequential Polymorphism
Correct Answer:  D. Sequential Polymorphism
EXPLANATION

The two main types of polymorphism are compile-time (static overloading) and runtime (dynamic overriding). Sequential polymorphism is not a recognized OOP concept.

Test
Q.274 Medium TCS Questions
In a graph traversal problem with 10 nodes and 15 edges, DFS (Depth-First Search) time complexity is O(V+E). What is the complexity here?
A O(10)
B O(25)
C O(150)
D O(100)
Correct Answer:  B. O(25)
EXPLANATION

DFS complexity = O(V + E) = O(10 + 15) = O(25). This includes visiting each vertex once and exploring each edge once.

Test
Q.275 Medium TCS Questions
In a binary tree with 7 nodes, what is the maximum possible height?
A 2
B 3
C 6
D 7
Correct Answer:  C. 6
EXPLANATION

Maximum height occurs in a skewed (linear) tree where height = n - 1 = 7 - 1 = 6. Minimum height would be 2 for a balanced tree.

Test
Q.276 Medium TCS Questions
TCS follows Agile methodology for most projects. Which practice is NOT a part of core Agile principles?
A Daily stand-up meetings
B Fixed scope with no changes once project starts
C Iterative development with regular feedback
D Continuous integration and delivery
Correct Answer:  B. Fixed scope with no changes once project starts
EXPLANATION

Agile embraces changing requirements even late in development. Fixed scope with no flexibility contradicts Agile's core principle of adaptability.

Test
Q.277 Medium TCS Questions
A circular queue has size 10. If front=3 and rear=8, how many elements are currently in the queue?
A 5
B 6
C 7
D 8
Correct Answer:  B. 6
EXPLANATION

In a circular queue, number of elements = (rear - front + 1) = (8 - 3 + 1) = 6 elements.

Test
Q.278 Medium TCS Questions
In a TCS project using Git version control, a developer needs to undo committed changes. Which command should be used?
A git reset --hard HEAD~1
B git delete commit
C git remove --force
D git undo --all
Correct Answer:  A. git reset --hard HEAD~1
EXPLANATION

git reset --hard HEAD~1 is the standard command to undo the last commit and discard changes. HEAD~1 refers to the previous commit.

Test
Q.279 Medium TCS Questions
An array [7, 3, 9, 1, 4, 2, 8] needs to be sorted. If memory is extremely limited, which sorting algorithm should be preferred?
A Merge Sort (requires O(n) extra space)
B Quick Sort (requires O(log n) extra space on average)
C Heap Sort (requires O(1) extra space)
D Bubble Sort with any space complexity
Correct Answer:  C. Heap Sort (requires O(1) extra space)
EXPLANATION

Heap Sort is an in-place sorting algorithm requiring only O(1) extra space, making it optimal for memory-constrained environments despite having O(n log n) time complexity.

Test
Q.280 Medium TCS Questions
TCS developers working on cloud-based projects often use microservices architecture. What is a PRIMARY advantage of this approach?
A Single point of failure for entire application
B Independent scalability, easier maintenance, and resilience
C Reduced development time by 50%
D Eliminates need for testing
Correct Answer:  B. Independent scalability, easier maintenance, and resilience
EXPLANATION

Microservices architecture allows individual components to scale independently, improves fault isolation, enables easier updates, and promotes team autonomy in development.

Test
IGET
iget AI
Online · Ask anything about exams
Hi! 👋 I'm your iget AI assistant.

Ask me anything about exam prep, MCQ solutions, study tips, or strategies! 🎯
UPSC strategy SSC CGL syllabus Improve aptitude NEET Biology tips