Skip to content

Canara Bank Placement Papers 2024

Overview

This page collects Canara 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 Canara Bank patterns and recent shifts.

Canara 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

Canara 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: IBPS / Canara Bank Notification Test
Skills emphasized: Aptitude, reasoning, banking awareness
Languages: Not primary for clerk/PO; tech roles separate

Sample Canara Bank questions with solutions

These are practice-style questions aligned to patterns students report for Canara 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: 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

Q2: 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

Q3: 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

Q4: CI vs SI hint

Problem: Find compound interest on ₹10,000 at 10% per annum for 2 years, compounded annually.

Solution: Amount = 10000 × (1.1)² = 10000 × 1.21 = ₹12,100. CI = 12100 − 10000 = ₹2100. (SI for same period would be ₹2000; the extra ₹100 is interest on first-year interest.)

Answer: ₹2100

Q5: Clock angle

Problem: What is the angle between the hour and minute hands at 3:00?

Solution: At 3:00 the hands are exactly 90° apart (one quarter of the circle).

Answer: 90°

Q6: Permutation basic

Problem: In how many ways can 5 different books be arranged on a shelf?

Solution: Arrangements of 5 distinct items = 5! = 120.

Answer: 120

Q7: Consecutive integers

Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?

Solution: Let the integers be x, x+1, and x+2.

x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23

So the integers are 23, 24, and 25.

Answer: 23

Q8: Train and pole

Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?

Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.

Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.

Answer: 36 km/h

Logical reasoning (2024)

Q1: Series multiply

Problem: Find the next number: 3, 9, 27, 81, ?

Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.

Answer: 243

Q2: Seating hint

Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?

Solution: Order from left to right: C, A, B, D, E. The middle seat is B.

Answer: B

Q3: Analogy

Problem: Book is to Reading as Fork is to ?

Solution: A book is used for reading; a fork is used for eating.

Answer: Eating

Q4: Odd one out

Problem: Find the odd one out: 3, 5, 7, 9, 11

Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.

Answer: 9

Coding practice (2024)

Coding Q1: 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

Canara 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: 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

Canara 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: 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

Canara 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: 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

Canara 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: 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

Canara 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: 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

Canara 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: 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)

Canara 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: Binary search

Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.

Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.

Complexity: O(log n) time

Canara 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 Canara Bank

How the ibps / Canara Bank notification 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 Canara Bank, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Not primary for clerk/PO; tech roles separate.

Topic weight hints

Area Why it matters at Canara Bank
Aptitude What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Indian Public Sector 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

SBI · Bank of Baroda · Axis Bank · HDFC Bank · ICICI Bank