Home Subjects Placement Papers

Placement Papers

TCS, Infosys, Wipro, Cognizant actual papers

654 Q 10 Topics Take Test
Advertisement
Difficulty: All Easy Medium Hard 561–570 of 654
Topics in Placement Papers
Q.561 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.

Take Test
Q.562 Hard TCS Questions
In a TCS project analyzing Big Data with MapReduce, what is the purpose of the 'Reducer' phase?
A To split input data across multiple nodes
B To aggregate intermediate results from Mappers into final output
C To eliminate all duplicate data permanently
D To compress files for storage
Correct Answer:  B. To aggregate intermediate results from Mappers into final output
EXPLANATION

The Reducer phase collects intermediate key-value pairs from Mappers, groups them by key, and aggregates them to produce final results.

Take Test
Q.563 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.

Take Test
Q.564 Hard TCS Questions
In a complex algorithm with multiple nested loops, the time complexity is O(n²m) where n and m are independent variables. If n=100 and m=50, approximately how many operations?
A 150 operations
B 500,000 operations
C 1,000,000 operations
D 2,500,000 operations
Correct Answer:  B. 500,000 operations
EXPLANATION

Operations = 100² × 50 = 10,000 × 50 = 500,000 operations. This represents the actual computational load for the given input sizes.

Take Test
Q.565 Easy TCS Questions
A transaction in database systems at TCS must satisfy ACID properties. What does the 'I' in ACID stand for?
A Integration
B Isolation
C Instruction
D Initialization
Correct Answer:  B. Isolation
EXPLANATION

ACID stands for Atomicity, Consistency, Isolation, and Durability. Isolation ensures concurrent transactions don't interfere with each other.

Take Test
Q.566 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.

Take Test
Q.567 Easy TCS Questions
A TCS developer encounters a null pointer exception in Java. What is the PRIMARY cause?
A Accessing or invoking methods on an object reference that points to null
B Using too many if-else statements
C Declaring variables without initialization
D Using loops excessively
Correct Answer:  A. Accessing or invoking methods on an object reference that points to null
EXPLANATION

NullPointerException occurs when trying to call methods or access properties on a null object reference, which has no actual instance allocated in memory.

Take Test
Q.568 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.

Take Test
Q.569 Easy TCS Questions
TCS employees working on REST APIs should follow which HTTP method for retrieving data without side effects?
A POST
B GET
C PUT
D DELETE
Correct Answer:  B. GET
EXPLANATION

GET is the HTTP method for safe, idempotent data retrieval without modifying server state. POST creates resources, PUT updates, and DELETE removes resources.

Take Test
Q.570 Hard TCS Questions
A coding problem requires finding the longest common substring of two strings. What is the optimal approach?
A Brute force checking all substrings - O(n³) time
B Dynamic Programming approach - O(n²) time and space
C Using two pointers - O(n) time
D Recursive approach without memoization
Correct Answer:  B. Dynamic Programming approach - O(n²) time and space
EXPLANATION

Dynamic Programming is the standard approach for longest common substring problems, building a table of subproblem results with O(n²) time and space complexity.

Take 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