Home Subjects Placement Papers

Placement Papers

TCS, Infosys, Wipro, Cognizant actual papers

654 Q 10 Topics Take Test
Advertisement
Difficulty: All Easy Medium Hard 491–500 of 654
Topics in Placement Papers
Q.491 Medium Infosys Questions
A sorting algorithm with space complexity O(1) is known as:
A In-place sorting
B Unstable sorting
C External sorting
D Hybrid sorting
Correct Answer:  A. In-place sorting
EXPLANATION

In-place sorting algorithms use constant extra space O(1), modifying the input array directly (e.g., quicksort, heapsort).

Take Test
Q.492 Medium Infosys Questions
Infosys collaborates with which major cloud provider for hybrid cloud solutions?
A Only AWS
B AWS, Azure, and Google Cloud
C Only on-premise solutions
D No cloud partnerships
Correct Answer:  B. AWS, Azure, and Google Cloud
EXPLANATION

Infosys works with multiple cloud providers including AWS, Microsoft Azure, and Google Cloud for comprehensive hybrid cloud services.

Take Test
Q.493 Medium Infosys Questions
In distributed systems at Infosys, what does CAP theorem stand for?
A Capacity, Availability, Performance
B Consistency, Availability, Partition tolerance
C Cache, Access, Protocol
D Centralization, Asynch, Priority
Correct Answer:  B. Consistency, Availability, Partition tolerance
EXPLANATION

CAP theorem states that distributed systems can guarantee at most two of three properties: Consistency, Availability, and Partition tolerance.

Take Test
Q.494 Easy Infosys Questions
What is the time complexity of a well-optimized binary search algorithm?
A O(n)
B O(log n)
C O(n²)
D O(2^n)
Correct Answer:  B. O(log n)
EXPLANATION

Binary search has logarithmic time complexity O(log n) on sorted arrays by dividing the search space in half each iteration.

Take Test
Q.495 Medium Infosys Questions
Which programming paradigm is most suitable for developing scalable microservices at Infosys?
A Procedural programming
B Object-oriented programming
C Functional programming
D Assembly language
Correct Answer:  B. Object-oriented programming
EXPLANATION

Object-oriented programming provides modularity, encapsulation, and reusability necessary for scalable microservices architecture.

Take Test
Q.496 Medium Infosys Questions
In 2024-25, what is Infosys' primary focus for digital transformation services?
A Legacy system maintenance only
B Cloud, AI, and automation-driven solutions
C Hardware sales
D Real estate investment
Correct Answer:  B. Cloud, AI, and automation-driven solutions
EXPLANATION

Infosys' 2024-25 strategy emphasizes cloud migration, artificial intelligence, and process automation for digital transformation.

Take Test
Q.497 Medium Infosys Questions
A developer at Infosys needs to optimize a recursive function that calculates Fibonacci numbers. Which approach would be most efficient?
A Simple recursion with no modifications
B Memoization or dynamic programming
C Increasing the system RAM
D Using multiple threads
Correct Answer:  B. Memoization or dynamic programming
EXPLANATION

Memoization or dynamic programming reduces time complexity from exponential to linear by caching previously computed results.

Take Test
Q.498 Easy Infosys Questions
Infosys' headquarters is located in which city?
A Mumbai
B Bangalore
C Hyderabad
D Pune
Correct Answer:  B. Bangalore
EXPLANATION

Infosys headquarters is in Bangalore (now Bengaluru), Karnataka, India.

Take Test
Q.499 Medium Infosys Questions
Infosys' Vision 2040 framework emphasizes which key area?
A Maximizing profit only
B Sustainable and responsible business practices
C Market dominance through aggressive expansion
D Reducing employee benefits
Correct Answer:  B. Sustainable and responsible business practices
EXPLANATION

Infosys Vision 2040 focuses on sustainable business practices, environmental responsibility, and creating positive societal impact.

Take Test
Q.500 Hard Infosys Questions
A complex algorithmic problem in Infosys placement requires analyzing a graph with weighted edges. What would be the optimal approach for finding the shortest path?
A Depth-first search (DFS)
B Breadth-first search (BFS)
C Dijkstra's algorithm for weighted graphs
D Linear search
Correct Answer:  C. Dijkstra's algorithm for weighted graphs
EXPLANATION

Dijkstra's algorithm is the optimal choice for finding shortest paths in weighted graphs with non-negative weights, with O(E log V) 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