iGET

Placement Papers - MCQ Practice Questions

Practice free Placement Papers multiple-choice questions with detailed answers and explanations. Perfect for competitive exam preparation.

654 questions | 100% Free

Q.21Medium

If 3 men can complete a task in 8 days, how many men are needed to complete it in 6 days?

Q.22Medium

What is the probability of getting a sum of 7 when two dice are rolled?

Q.23Medium

A number is 5 more than another number. If their sum is 25, find the larger number.

Q.24Medium

Which data structure is most efficient for implementing a priority queue in competitive programming?

Q.25Medium

What is the space complexity of the merge sort algorithm?

Q.26Medium

TCS's Digital platform focuses on which emerging technologies as of 2024-25?

Q.27Medium

Which sorting algorithm is most suitable when memory is limited?

Q.28Medium

A database query has time complexity O(n log n). For n=1000, approximately how many operations occur?

Q.29Medium

What is the primary advantage of using microservices architecture in TCS projects?

Q.30Medium

Which of the following is NOT a characteristic of NoSQL databases?

Q.31Medium

If you have an array [3,1,4,1,5,9,2,6], what is the median?

Q.32Medium

A software engineer at TCS needs to optimize a search operation in a large database containing 1 million records. Which data structure would be most efficient?

Q.33Medium

TCS developers working on cloud-based projects often use microservices architecture. What is a PRIMARY advantage of this approach?

Q.34Medium

An array [7, 3, 9, 1, 4, 2, 8] needs to be sorted. If memory is extremely limited, which sorting algorithm should be preferred?

Q.35Medium

In a TCS project using Git version control, a developer needs to undo committed changes. Which command should be used?

Q.36Medium

A circular queue has size 10. If front=3 and rear=8, how many elements are currently in the queue?

Q.37Medium

TCS follows Agile methodology for most projects. Which practice is NOT a part of core Agile principles?

Q.38Medium

In a binary tree with 7 nodes, what is the maximum possible height?

Q.39Medium

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?

Q.40Medium

In TCS technical assessments, a question asks about polymorphism. Which is NOT a type of polymorphism in OOP?