Infosys Power Programmer Preparation Guide
Data Structures & Algorithms (DSA)
1. Arrays - Contiguous memory collection. Eg: Kadane's Algorithm to find max subarray sum.
2. Strings - Character sequences. Eg: Anagram check using Counter.
3. Linked List - Node-based structure. Eg: Reverse a list.
4. Trees - Hierarchical data. Eg: Inorder traversal.
5. Graphs - Nodes + Edges. Eg: BFS traversal.
6. Dynamic Programming - Overlapping subproblems. Eg: Fibonacci with memoization.
Database Management Systems (DBMS)
1. Normalization - Reduce redundancy: 1NF, 2NF, 3NF.
2. Joins - INNER, LEFT, RIGHT, FULL joins.
3. ACID Properties - Atomicity, Consistency, Isolation, Durability.
4. Indexes - Speeds up retrieval.
Operating Systems
1. Process vs Thread - Independent vs shared memory execution.
2. Scheduling - FCFS, Round Robin, SJF.
3. Deadlock - Waiting loop, prevent using lock ordering.
4. Paging vs Segmentation - Memory division methods.
Computer Networks
1. OSI Model - 7 layers from Physical to Application.
2. TCP vs UDP - Reliable vs fast delivery.
3. IP Addressing & Subnetting - Address allocation.
4. HTTP vs HTTPS - Secure communication.
Java
1. OOPs - Encapsulation, Inheritance, Polymorphism, Abstraction.
2. Collections - List, Set, Map.
3. Exception Handling - try-catch block.
4. Java 8 Features - Lambdas, Streams.
Python
1. Data Structures - List, Dict, Set.
2. Decorators - Wrap function behavior.
3. OOP - Class, Inheritance, Methods.
Infosys Power Programmer Preparation Guide
Coding Problems
1. Reverse String - s[::-1]
2. FizzBuzz - Condition-based print loop.
SQL Queries
1. Second Highest Salary - MAX with subquery.
2. Duplicates - GROUP BY HAVING COUNT > 1.
3. Employees without Manager - LEFT JOIN with NULL filter.