Skip to content

Axis Bank Placement Papers 2024

Overview

This page collects Axis Bank placement papers from 2024 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Axis Bank patterns and recent shifts.

Axis Bank Aptitude Mock Quiz

Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.

Questions15
Time10 min

Axis Bank exam pattern 2024

Section What shows up Prep focus
Aptitude / logical Quant, reasoning, sometimes verbal Timed sectional accuracy
Coding / programming logic Easy-medium DSA or output-style MCQs Handle tricky inputs
Technical interview OOPs, DBMS, OS, projects Explain aloud
HR Fit, location, intent A few real examples ready

First round: Axis Bank Online Test
Skills emphasized: Aptitude, banking awareness, basic coding/SQL for tech
Languages: Java, Python, SQL (tech tracks)

Sample Axis Bank questions with solutions

These are practice-style questions aligned to patterns students report for Axis Bank drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.

Quantitative aptitude (2024)

Q1: Compound mark-discount

Problem: An article is marked 40% above cost and sold after a 10% discount. Find the profit percent.

Solution: SP = CP × 1.4 × 0.9 = 1.26 CP. Profit = 26%.

Answer: 26%

Q2: Loss to profit shift

Problem: An article sold at 10% loss would give 5% profit if sold for ₹60 more. Find the cost price.

Solution: 0.9P + 60 = 1.05P 60 = 0.15P P = 60 / 0.15 = ₹400.

Answer: ₹400

Q3: Worker scaling

Problem: Eight workers finish a job in 10 days. How many days will 10 workers take for the same job (same pace)?

Solution: Total man-days = 8 × 10 = 80. Days for 10 workers = 80 / 10 = 8 days.

Answer: 8 days

Q4: Distance from speed

Problem: A vehicle travels at 60 km/h for 2.5 hours. How far does it go?

Solution: Distance = speed × time = 60 × 2.5 = 150 km.

Answer: 150 km

Q5: Compound ratio

Problem: If two ratios are 3:5 and 5:7, what is the compound ratio?

Solution: Compound ratio = (3/5) × (5/7) = 3/7, written as 3:7.

Answer: 3:7

Q6: SI three years

Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.

Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.

Answer: ₹1200

Q7: Boat upstream

Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?

Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.

Answer: 3 hours

Q8: Mixture milk

Problem: A mixture has milk and water in the ratio 4:1. If 5 litres of water are added to 20 litres of mixture, what is the new milk:water ratio?

Solution: In 20 L: milk = 16 L, water = 4 L. After adding 5 L water: milk 16, water 9. Ratio = 16:9.

Answer: 16:9

Logical reasoning (2024)

Q1: Coding letter shift

Problem: If CAT is coded as DBU, how is DOG coded in the same way?

Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.

Answer: EPH

Q2: Blood relation

Problem: Pointing to a photograph, Ravi says, ‘She is the daughter of my mother’s only son.’ How is the girl related to Ravi?

Solution: Ravi’s mother’s only son is Ravi himself (assuming one son). The girl is therefore Ravi’s daughter.

Answer: Daughter

Q3: Syllogism

Problem: Statements: All engineers are graduates. Some graduates are managers. Conclusion: Some engineers are managers. Does it follow?

Solution: The ‘some graduates’ who are managers need not overlap with the engineers. The conclusion does not follow necessarily.

Answer: Does not follow

Q4: Direction turn

Problem: A person walks 5 km north, then 3 km east, then 5 km south. How far is he from the start, and in which direction?

Solution: North 5 and south 5 cancel. He is 3 km east of the start.

Answer: 3 km east

Coding practice (2024)

Coding Q1: Valid parentheses

Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.

Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.

Complexity: O(n) time, O(n) space

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q2: Two Sum

Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.

Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.

Complexity: O(n) time, O(n) space

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q3: Longest substring without repeating characters

Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).

Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.

Complexity: O(n) time

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q4: Merge overlapping intervals

Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.

Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.

Complexity: O(n log n) time from the sort

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q5: Top K frequent elements

Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.

Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.

Complexity: O(n log k) with a heap

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q6: Linked list cycle

Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.

Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.

Complexity: O(n) time, O(1) space

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q7: Binary tree level order

Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.

Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.

Complexity: O(n) time, O(n) space

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q8: Coin change (min coins)

Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.

Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.

Complexity: O(amount × coins)

Axis Bank tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Deep prep notes for Axis Bank

How the Axis Bank online test usually feels

Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Axis Bank, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, SQL (tech tracks).

Topic weight hints

Area Why it matters at Axis Bank
Aptitude What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Indian Private Banking awareness Helps in managerial / HR conversations
Communication Explain your approach clearly; keep a few real examples ready for HR

14-Day sprint

  1. Days 1-3: Learn the 2024 pattern and take two sectional mocks
  2. Days 4-7: Closed practice on weak topics from your error log
  3. Days 8-10: Full mocks every other day; review the same day
  4. Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready

Comments & Suggestions

Similar companies

HDFC Bank · ICICI Bank · SBI · Canara Bank · Bank of Baroda