Skip to content

Jio Placement Papers 2025

Overview

This page collects Jio placement papers from 2025 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 Jio patterns and recent shifts.

Jio 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

Jio exam pattern 2025

Section What shows up Prep focus
Technical / domain Syllabus aligned to the notification Topic checklist
Aptitude Quant + reasoning Speed with accuracy
Interview Subject depth + projects Clear fundamentals

First round: Jio Online Assessment
Skills emphasized: Aptitude, coding, telecom/CS basics
Languages: Java, Python, C++

Sample Jio questions with solutions

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

Quantitative aptitude (2025)

Q1: Simple interest

Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.

Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.

Answer: ₹1600

Q2: Percentage recover

Problem: If 30% of a number is 150, what is the number?

Solution: 0.3x = 150 → x = 150 / 0.3 = 500.

Answer: 500

Q3: Average after replace

Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?

Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.

Answer: 16

Q4: Series n(n+1)

Problem: Find the next term: 2, 6, 12, 20, 30, ?

Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.

Answer: 42

Q5: Deck probability

Problem: What is the probability of drawing an ace from a standard 52-card deck?

Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.

Answer: 1/13

Q6: Net percent change

Problem: A number is increased by 20% and then decreased by 20%. What is the net percentage change?

Solution: Start with 100 → 120 → 96. Net change = 4% decrease. Formula: successive +a then −a gives −(a²/100)% = −4%.

Answer: 4% decrease

Q7: Consumption cut

Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?

Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.

Answer: 20%

Q8: 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%

Logical reasoning (2025)

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 (2025)

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

Jio 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: Move zeros

Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.

Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.

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

Jio 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: Rotate array

Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].

Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.

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

Jio 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: First unique character

Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.

Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.

Complexity: O(n) time

Jio 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: Stack with min

Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.

Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.

Complexity: O(1) per operation amortized

Jio 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: Maximum subarray sum (Kadane)

Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).

Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.

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

Jio 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: Reverse a string in place

Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.

Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.

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

Jio 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: Check prime

Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.

Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.

Complexity: O(√n) time

Jio 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 Jio

How the Jio Online Assessment usually feels

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

Topic weight hints

Area Why it matters at Jio
Aptitude What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Telecom, Digital Services 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 2025 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

Reliance · Airtel · Amazon · Paytm